By Topic

Improving Fairness With Novel Adaptive Routing in Optical Burst-Switched Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xingbo Gao ; Sch. of Electr. Eng. & Comput. Sci., Univ. of Central Florida, Orlando, FL, USA ; Bassiouni, M.A.

In most existing studies of optical burst-switched networks, adaptive routing is based on deflection routing and/or feedback from the past intervals which often introduces excessive transmission delay and architectural complexity. Our proposed novel adaptive routing schemes, however, consider the transient link congestion at the moment when the bursts arrive and have potential to reduce the overall burst loss probability. Moreover, they can utilize the same offset times for the same node pairs implying zero additional transmission delay and simplicity. The proposed hop-by-hop routing schemes also aim to address the intrinsic unfairness defect of existing popular signaling protocols by increasing the effective link utilization. The results show that the proposed schemes generally outperform shortest path routing and depending on the routing strategy involved, the network topology and the traffic load, this improvement can be substantial. We develop analytical loss models to demonstrate the need for such an adaptive routing scheme at each hop and show its effectiveness. We also verify the analytical results by simulation.

Published in:

Lightwave Technology, Journal of  (Volume:27 ,  Issue: 20 )