Routing With Topology Aggregation in Delay-Bandwidth Sensitive Networks

Abstract

Abstract-Routing is a process of finding a network path from a source node to a destination node. The execution time and the memory requirement of a routing algorithm increase with the size of the network. In order to deal with the scalability problem, large networks are often structured hierarchically by grouping nodes into different domains. The internal topology of each domain is then aggregated into a simple topology that reflects the cost of routing across that domain. This process is called topology aggregation. For delay-bandwidth sensitive networks, traditional approaches represent the property of each link in the aggregated topology as a delay-bandwidth pair, which corresponds to a point on the delay-bandwidth plane. Since each link after aggregation may be the abstraction of many physical paths, a single delay-bandwidth pair results in significant information loss. The major contribution of this paper is a novel quality-of-service (QoS) parameter representation with a new aggregation algorithm and a QoS-aware routing protocol. Our QoS representation captures the state information about the network with much greater accuracy than the existing algorithms. Our simulation results show that the new approach achieves very good performance in terms of delay deviation, success ratio, and crankback ratio.

Research challenges in QoS routing

“…The hierarchical organization of networks allows for the aggregation of routing information between the different levels and reduces the amount of information that must be distributed and stored, while decreasing the number of routers involved in the exchange of routing information. The conception of strategies for routing information aggregation must have in consideration the degree of aggregation and the resulting routing performance [34][35][36].…”

Load Balancing Routing in Low-Cost Parallel QoS Sensitive Network Architecture

“…In the left sub-figure, LBRA outperforms Dijkstra algorithm and LSRA as in [2] in routing success ratio evaluation w.r.t bandwidth. In the right sub-figure, LBRA doesn't cause any congestion and keep the smooth trend of link utilization on the random link, while LSRA fails to obviate the outburst of unbalanced traffic load…”

Spanning Tree Aggregation Using Attribute of Service Boundary Line

“…파라미터로 갖는 경우의 집단화를 제안하였다 [2]. 이것은 다단계 토폴로지 변형을 이용한 방법으로 집단화 정보의 공 간 복잡도를 줄이기 위해 물리적 토폴로지를 풀 메쉬의 논 리적 토폴로지로 변형 후 다시 스타 토폴로지로 변형한다.…”