loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Networking (ICN'07)
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks
Sainte-Luce, Martinique, France
April 22-April 28
ISBN: 0-7695-2805-8
ASCII Text
x 
 
Sartaj Sahni, Nageshwara Rao, Sanjay Ranka, Yan Li, Eun-Sung Jung, Nara Kamath, "Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks," International Conference on Networking, pp. 47, Sixth International Conference on Networking (ICN'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ICN.2007.27,
author = {Sartaj Sahni and Nageshwara Rao and Sanjay Ranka and Yan Li and Eun-Sung Jung and Nara Kamath},
title = {Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks},
journal ={International Conference on Networking},
volume = {0},
year = {2007},
isbn = {0-7695-2805-8},
pages = {47},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICN.2007.27},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - International Conference on Networking
TI - Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks
SN - 0-7695-2805-8
SP
EP
A1 - Sartaj Sahni,
A1 - Nageshwara Rao,
A1 - Sanjay Ranka,
A1 - Yan Li,
A1 - Eun-Sung Jung,
A1 - Nara Kamath,
PY - 2007
KW - backend signaling
KW - MPLS/GMPLS distributed implementation
KW - resource scheduling
KW - multi-domain scheduling.
VL - 0
JA - International Conference on Networking
ER -
 
Sartaj Sahni, University of Florida, Gainesville, USA
Nageshwara Rao, Oak Ridge National Labs, USA
Sanjay Ranka, University of Florida, Gainesville, USA
Yan Li, University of Florida, Gainesville, USA
Eun-Sung Jung, University of Florida, Gainesville, USA
Nara Kamath, Advanced Algorithms and Systems, USA
There has been an increasing number of network deployments that provide dedicated connections through on-demand and in-advance scheduling in support of high-performance applications. We describe algorithms for scheduling and path computations needed for dedicated bandwidth connections for fixed-slot, highest available bandwidth in a given slot, first available slot, and all-available slots computations. These algorithms for bandwidth scheduling are based on extending the classical breadth-first search, Dijkstra, and Bellman-Ford algorithms. We describe a bandwidth management system for UltraScience Net that incorporates implementations of these algorithms.
Index Terms:
backend signaling, MPLS/GMPLS distributed implementation, resource scheduling, multi-domain scheduling.
Citation:
Sartaj Sahni, Nageshwara Rao, Sanjay Ranka, Yan Li, Eun-Sung Jung, Nara Kamath, "Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks," icn, pp.47, Sixth International Conference on Networking (ICN'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.