Sciweavers

Share
ICC
2008
IEEE

Quality-of-Service Routing with Two Concave Constraints

8 years 8 months ago
Quality-of-Service Routing with Two Concave Constraints
—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. 1
Ka-Chung Leung, King-Shan Lui, Ka-Cheong Leung, Fr
Added 30 May 2010
Updated 30 May 2010
Type Conference
Year 2008
Where ICC
Authors Ka-Chung Leung, King-Shan Lui, Ka-Cheong Leung, Fred Baker
Comments (0)
books