Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

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

Not Accessible

Your library or personal account may give you access

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.

© 2016 Optical Society of America

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)

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

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved