Quality-of-Service Routing with Two Concave Constraints

K.-S. Lui, K.-C. Leung, F. Baker
2008 2008 IEEE International Conference on Communications  
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
more » ... . We have developed a series of operations for constructing routing tables under the distance-vector protocol. We evaluate the performance through extensive simulations. 1 Authorized licensed use limited to: The University of Hong Kong. Downloaded on June 2, 2009 at 23:27 from IEEE Xplore. Restrictions apply.
doi:10.1109/icc.2008.1075 dblp:conf/icc/LeungLLB08 fatcat:plerkriggba5bh35kphzrvoroe