DocumentCode :
3444969
Title :
An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks
Author :
Jung, Eun-Sung ; Li, Yan ; Ranka, Sanjay ; Sahni, Sartaj
Author_Institution :
Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL
fYear :
2008
fDate :
7-9 May 2008
Firstpage :
133
Lastpage :
138
Abstract :
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 path algorithm proposed by us in [8] maximizes network utilization for large networks while the dynamic adaptive feasible path algorithm proposed in this paper does this for small networks.
Keywords :
bandwidth allocation; scheduling; telecommunication network management; bandwidth management systems; connection-oriented networks; fixed-slot problem; in-advance bandwidth scheduling algorithms; minimum-hop feasible path algorithm; path computation algorithms; Algorithm design and analysis; Bandwidth; Computer networks; Concurrent computing; Continuous time systems; Information science; Multiprotocol label switching; Parallel architectures; Scheduling algorithm; Switches; in-advance bandwidth scheduling; path computation; resource scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms, and Networks, 2008. I-SPAN 2008. International Symposium on
Conference_Location :
Sydney, NSW
ISSN :
1087-4089
Print_ISBN :
978-0-7695-3125-0
Type :
conf
DOI :
10.1109/I-SPAN.2008.34
Filename :
4520206
Link To Document :
بازگشت