Topology aggregation and routing in bandwidth-delay sensitive networks

Large networks are often structured hierarchically by grouping nodes into different domains in order to deal with the scaling problem. The internal topologies of the domains are aggregated before broadcasted and this process is called topology aggregation. We propose a new method of aggregating networks that are delay-bandwidth sensitive. Traditional approaches represent each logical link as a delay-bandwidth pair which is basically a point on a delay-bandwidth plane. We introduce a new QoS parameter representation and present an aggregation algorithm with corresponding routing protocol. Our simulation results show that the algorithm has very good performance in terms of success ratio and crankback ratio.