loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)
An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks
May 07-May 09
ISBN: 978-0-7695-3125-0
ASCII Text
x 
 
Eun-Sung Jung, Yan Li, Sanjay Ranka, Sartaj Sahni, "An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 133-138, The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/I-SPAN.2008.34,
author = {Eun-Sung Jung and Yan Li and Sanjay Ranka and Sartaj Sahni},
title = {An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3125-0},
pages = {133-138},
doi = {http://doi.ieeecomputersociety.org/10.1109/I-SPAN.2008.34},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks
SN - 978-0-7695-3125-0
SP133
EP138
A1 - Eun-Sung Jung,
A1 - Yan Li,
A1 - Sanjay Ranka,
A1 - Sartaj Sahni,
PY - 2008
KW - in-advance bandwidth scheduling
KW - path computation
KW - resource scheduling
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Several bandwidth management systems have been developed to reserve, in advance, dedicated connections for high-performance applications. We describe the in-advance reservation capabilities of these systems as well as the bandwidth scheduling and path computation algorithms used. An analytical and experimental evaluation of these algorithms also is provided. Our experiments indicate that for the fixed-slot problem, the minimum-hop feasible pathalgorithm proposed by us in previous research maximizes network utilization for large networks while the dynamic adaptive feasible path algorithm proposed in this paper does this for small networks.
Index Terms:
in-advance bandwidth scheduling, path computation, resource scheduling
Citation:
Eun-Sung Jung, Yan Li, Sanjay Ranka, Sartaj Sahni, "An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks," ispan, pp.133-138, The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.