loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17 th International Conference on Advanced Information Networking and Applications (AINA'03)
An Efficient Optimal Algorithm for Virtual Path Bandwidth Allocation
Xi?an, China
March 27-March 29
ISBN: 0-7695-1906-7
ASCII Text
x 
 
Maosong Luo, Wu Ye, Shenye Huang, Suili Feng, Zhaonan Li, "An Efficient Optimal Algorithm for Virtual Path Bandwidth Allocation," Advanced Information Networking and Applications, International Conference on, pp. 487, 17 th International Conference on Advanced Information Networking and Applications (AINA'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/AINA.2003.1192926,
author = {Maosong Luo and Wu Ye and Shenye Huang and Suili Feng and Zhaonan Li},
title = {An Efficient Optimal Algorithm for Virtual Path Bandwidth Allocation},
journal ={Advanced Information Networking and Applications, International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-1906-7},
pages = {487},
doi = {http://doi.ieeecomputersociety.org/10.1109/AINA.2003.1192926},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Information Networking and Applications, International Conference on
TI - An Efficient Optimal Algorithm for Virtual Path Bandwidth Allocation
SN - 0-7695-1906-7
SP
EP
A1 - Maosong Luo,
A1 - Wu Ye,
A1 - Shenye Huang,
A1 - Suili Feng,
A1 - Zhaonan Li,
PY - 2003
KW - null
VL - 0
JA - Advanced Information Networking and Applications, International Conference on
ER -
 
Maosong Luo, South China University of Technology
Wu Ye, South China University of Technology
Shenye Huang, South China University of Technology
Suili Feng, South China University of Technology
Zhaonan Li, South China University of Technology
This article presents a efficient optimal algorithm for virtual path (VP) bandwidth allocation in telecom networks. Given the networks topology, link capacity, routes of VP, offered traffic and the condition that only one shortest VP could be chosen for each source-destination pair (single-VP), the algorithm is able to optimize the allocation of the bandwidth of VP in order to minimize the highest call blocking probability (CBP) of all the source-destinatio pairs. Based on the results obtained from the test-bed networks, we compare the performance of the algorithm with that of another classical optimal algorithm--"Bisection Algorithm" and conclude that the former is more efficient under the condition of single-VP.
Citation:
Maosong Luo, Wu Ye, Shenye Huang, Suili Feng, Zhaonan Li, "An Efficient Optimal Algorithm for Virtual Path Bandwidth Allocation," aina, pp.487, 17 th International Conference on Advanced Information Networking and Applications (AINA'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.