DocumentCode :
1598534
Title :
Topology aggregation with multiple QoS parameters for scalable routing problem
Author :
Yongjun, Luo ; Yingcai, Bai
Author_Institution :
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., China
Volume :
1
fYear :
2003
Firstpage :
458
Abstract :
In this paper, we investigate the problem of topology aggregation in QoS-based routing. We propose new algorithms to perform full-mesh and modified-star aggregation, which are ample and effective in network with additive and concave parameters constrained. Time complexity is O(b2), where b is the number of border nodes. We extend the algorithms to topology aggregation with multi-parameters.
Keywords :
computer networks; network topology; quality of service; telecommunication network routing; QoS routing; additive constrained parameters; border nodes; concave constrained parameters; full-mesh aggregation; modified star aggregation; multiple QoS parameters; scalable routing; time complexity; topology aggregation; Aggregates; Bandwidth; Clustering algorithms; Computer science; Delay; Logic; Mesh networks; Network topology; Peer to peer computing; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Technology Proceedings, 2003. ICCT 2003. International Conference on
Print_ISBN :
7-5635-0686-1
Type :
conf
DOI :
10.1109/ICCT.2003.1209119
Filename :
1209119
Link To Document :
بازگشت