DocumentCode :
1636852
Title :
Quality-of-Service Routing with Two Concave Constraints
Author :
Ka-Chung Leung ; King-Shan Lui ; Ka-Cheong Leung ; Baker, Fred
Author_Institution :
Dept. of Electr. & Electron. Eng., Univ. of Hong Kong, Hong Kong
fYear :
2008
Firstpage :
5746
Lastpage :
5750
Abstract :
Routing is a process of finding a network path from a source node to a destination node. A good routing protocol should find the "best path" from a source to a destination. When there are independent constraints to be considered, the "best path" is not well-defined. In our previous work, we developed a line segment representation for Quality-of-Service routing with bandwidth and delay requirements. In this paper, we propose how to adopt the line segment when a request has two concave constraints. We have developed a series of operations for constructing routing tables under the distance-vector protocol. We evaluate the performance through extensive simulations.
Keywords :
quality of service; routing protocols; concave constraint; destination node; distance-vector protocol; quality of service routing; routing protocol; routing table; Bandwidth; Communications Society; Costs; Delay; Electronic mail; Peer to peer computing; Quality of service; Routing protocols; Telecommunication traffic; USA Councils;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2008. ICC '08. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2075-9
Electronic_ISBN :
978-1-4244-2075-9
Type :
conf
DOI :
10.1109/ICC.2008.1075
Filename :
4534111
Link To Document :
بازگشت