loading...
A limited path unicast QoS routing algorithm
Alexandria, Egypt June 28-July 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2004.1358650Ninth IEEE Symposium on Computers and ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
YanXing Zheng, Jing Tian, ZhiFeng Liu, WenHua Dou, "A limited path unicast QoS routing algorithm," Computers and Communications, IEEE Symposium on, vol. 2, pp. 870-875, Ninth IEEE Symposium on Computers and Communications 2004 Volume 2 (ISCC"04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISCC.2004.1358650,
author = {YanXing Zheng and Jing Tian and ZhiFeng Liu and WenHua Dou},
title = {A limited path unicast QoS routing algorithm},
journal ={Computers and Communications, IEEE Symposium on},
volume = {2},
year = {2004},
isbn = {0-7803-8623-X},
pages = {870-875},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2004.1358650},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computers and Communications, IEEE Symposium on
TI - A limited path unicast QoS routing algorithm
SN - 0-7803-8623-X
SP870
EP875
A1 - YanXing Zheng,
A1 - Jing Tian,
A1 - ZhiFeng Liu,
A1 - WenHua Dou,
PY - 2004
VL - 2
JA - Computers and Communications, IEEE Symposium on
ER -
 
YanXing Zheng, Sch. fo Comput., Nat. Univ. of Defense Technol., Changsha, China
Jing Tian, Telecommun. Res. Lab., Queen's Univ., Kingston, Ont., Canada
ZhiFeng Liu, Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
WenHua Dou, Dept. of Comput. Sci., Boston Univ., MA, USA
In this paper, we propose a novel limited path algorithm called LPUA to deal with two constrained unicast QoS routing problems, which is known as NP complete. By combining two weights linearly into a single one, Dijkstra algorithm based on the single weight can be used directly to return a least cost path between the source node and the destination node. When a routing request comes, LPUA only needs to compute a limited number of paths. If any of these paths cannot meet the routing constraints, the routing request would be refused. Extensive simulations have show that LPUA is very efficient.
Citation:
YanXing Zheng, Jing Tian, ZhiFeng Liu, WenHua Dou, "A limited path unicast QoS routing algorithm," iscc, vol. 2, pp.870-875, Ninth IEEE Symposium on Computers and Communications 2004 Volume 2 (ISCC"04), 2004
Usage of this product signifies your acceptance of the Terms of Use.