2-Line Segment Topology Aggregation Mechanism for QoS Routing

In the distance-vector routing protocols, a node advertises only the best or the most representative path information to its neighbors. Unfortunately, the best path may not be well-defined in a network with two or more constraints. Previous studies have shown that in order not to have any QoS information loss, information of several paths should be advertised. This is not scalable and a line segment representation is developed to aggregate information of several paths. The mechanism solves the scalability problem at the expense of some information accuracy loss. In this paper, we study a variation of the line segment representation aiming at reducing information loss without much increase in advertisement overhead. The performance of our mechanism is justified by extensive simulations