By Topic

Weight functions for shortest path routing of periodically scheduled burst flows

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
$33 $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)
Li Lei ; Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia B3H 1W5, Canada ; Srinivas Sampalli

We investgate weighted shortest path routing mechanisms based on Dijkstra’s algorithm to find optimal paths for periodically scheduled burst flows in optical burst switching networks. Our objective is to reduce the flow blocking rate. We propose three dynamic weight functions to estimate the path level flow blocking probability based on wavelength utilization. We evaluate the performance of these weight functions using simulation. Results show that the weight function that incorporates both wavelength utilization and the number of inbound traffic sources has the best performance.

Published in:

Broadband Communications, Networks and Systems, 2007. BROADNETS 2007. Fourth International Conference on

Date of Conference:

10-14 Sept. 2007