Journal of Optical Communications and Networking
Vol. 8,
Issue 3,
pp. 162-174
(2016)
•https://doi.org/10.1364/JOCN.8.000162

Time-Shifted Multilayer Graph: A Routing Framework for Bulk Data Transfer in Optical Circuit-Switched Networks With Assistive Storage

Xiao Lin, Weiqiang Sun, Malathi Veeraraghavan, and Weisheng Hu

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Xiao Lin, Weiqiang Sun, Malathi Veeraraghavan, and Weisheng Hu, "Time-Shifted Multilayer Graph: A Routing Framework for Bulk Data Transfer in Optical Circuit-Switched Networks With Assistive Storage," J. Opt. Commun. Netw. 8, 162-174 (2016)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Check for updates

Abstract

Increasing bulk data transfers incur peak-hour bandwidth contention between bulky and short flows as well as between bulky flows. To mitigate this contention, storage is introduced into the forwarding path so that bulk data that are delay tolerant can be temporarily stored and forwarded at a later time. However, the storage introduces an additional complexity into the conventional routing process. What was a spatial resource allocation problem becomes a scheduling problem, in which both bandwidth and storage constraints must be considered and both spatial assignments and temporal arrangements must be performed. In this paper, we propose a routing framework for bulk data transfer in optical circuit-switched networks with assistive storage. This framework is based on a multilayer graph built from a set of snapshots (i.e., layers) of the dynamics in a network. By performing shortest path routing on the multilayer graph, “end-to-end” paths over time and space are found for requests, thus greatly simplifying the provisioning process. We study how the number of layers used for routing affects the network blocking performance and how traffic characteristics and link capacity affect the number of layers. We find that the majority of requests can be served with only one additional layer. A trade-off between computational complexity and blocking performance can be reached by limiting the number of layers used for routing. In our simulations, the request blocking probability is reduced from 13.5% to 0.9% by limiting routing to 11 layers. Request blocking is avoided when routing is allowed within 29 layers.

Full Article | PDF Article

More Like This

Slotted Store-and-Forward Optical Circuit-Switched Networks: A Performance Study

Xiao Lin, Weiqiang Sun, Malathi Veeraraghavan, and Weisheng Hu
J. Opt. Commun. Netw. 9(7) 563-576 (2017)

Performance Analysis of Storage-Based Routing for Circuit-Switched Networks

Chao Sun, Wei Guo, Zhe Liu, Ming Xia, and Weisheng Hu
J. Opt. Commun. Netw. 8(5) 282-289 (2016)

Routing and Scheduling for Variable Bandwidth Advance Reservation

Ankitkumar N. Patel and Jason P. Jue
J. Opt. Commun. Netw. 3(12) 912-923 (2011)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (13)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (7)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

	Goal	Major Assumptions	Impact of SnF Versus That of Other Approaches, Especially E2E^a
Assistive storage used in circuit-switched networks	Improve network throughput [3]	Time-slotted transfer, centralized schedule, perfect prior knowledge of network, limited storage	Network throughput was improved up to 18% by SnF.
	Reduce request blocking [4,5]	Time-slotted transfer, centralized schedule, perfect prior knowledge of network, unlimited storage	In [5], request blocking was reduced up to 47% by SnF.
Assistive storage used in packet switched networks	Minimize cost of bulk data transfer [10]	No routing or schedule issues, unlimited storage	40 TB data were transferred for free by SnF on a daily basis but incurred thousands of dollars of cost under E2E.
	Minimize bulk data transfer time [8]	Time-slotted transfer, centralized schedule, no prior knowledge of network, limited storage	NetStitcher carried five times more data than others but took a few hours, whereas others took days.
	Minimize cost of bulk data transfer [7,14]	Time-slotted transfer, centralized schedule, perfect/imperfect prior knowledge of network, unlimited storage	In [7], cost was reduced up to 75% by SnF.
	Maximize overall bulk data transfer utility [12]	Time-slotted transfer, centralized schedule, perfect prior knowledge of network, unlimited storage	A bulk data transfer system employing SnF was built within an SDN architecture.
	Reduce peak traffic and balance network traffic [6]	Time-slotted transfer, centralized schedule, perfect prior knowledge of network, limited storage	Temporally, peak traffic was reduced up to 13%; spatially, the traffic distribution was balanced to be up to 10% better by SnF.
	Reduce interdomain traffic [13]	Time-slotted transfer, centralized schedule, perfect prior knowledge of network, unlimited storage	Interdomain traffic was reduced up to 50%.
	Minimize incurred delay, or maximize the amount of data delivered [15]	Time-slotted transfer, centralized schedule, perfect prior knowledge of network, limited storage	Incurred delay for the delivery of a certain amount of data was avoided when the storage capacities at intermediate nodes were sufficient.

Network	Traffic Load ( $ρ$ )	Blocking Probability
OPEN	5	0.037
USNET	5	0.042
NSFNET	5	0.135

Number of SnFs	1	2	$\geq 3$
Percentage (%) in OPEN	92.13	7.71	0.16
Percentage (%) in USNET	85.9	12.64	1.46
Percentage (%) in NSFNET	78.1	19.19	2.71

Number of SnF	0	1	2	3	4
Percentage (%) in OPEN	95.11	4.42	0.46	0.01	—
Percentage (%) in USNET	93.22	5.88	0.83	0.07	—
Percentage (%) in NSFNET	72.37	24.72	2.55	0.35	0.01

$ρ$	5	5	5	5
$λ / μ$	10/2	1/0.2	0.1/0.02	0.01/0.002
Number of active requests	5.15	5.87	5.84	5.9
$L_{G}$	6.3	7.90	7.89	7.97
Time interval of updating TS-MLG	0.06	0.47	4.57	45.43

Number of Wavelengths Per Link	1	2	3	4
$ρ$	5	12	21	29
Number of active requests	5.87	12.31	21.46	28.84
Link utilization	0.37	0.37	0.37	0.37
Number of layers	29	31	33	36

	TEN	TS-MLG
Type of problem	Static	Dynamic
Goal of problem	Optimal route, schedule, and flow assignment for flow over time	Dynamic optical circuit switching with assistive storage, i.e., SnF OCS
Method	Optimization techniques	Shortest path algorithms
Time granularity	Fixed time slots (given in advance, $t$ )	Variable time intervals (vary with traffic)
Update graph	No	Yes
Graph size	Fixed (given in advance, $T / t$ )	Dynamic (varies with traffic)
Request	Given in advance and scheduled together	Arrives randomly and routed individually

Time-Shifted Multilayer Graph: A Routing Framework for Bulk Data Transfer in Optical Circuit-Switched Networks With Assistive Storage

Author Affiliations

Abstract

Cited By

Figures (13)

Tables (7)

Journal of Optical Communications and Networking