Lightweight Two-dimensional Routing Mechanism Based on Agent Calculation

Single-path optimal routing is widely used on the Internet for packets transmission. It is prone to link congestion and is not conducive to improving bandwidth utilization. Although the multipath routing mechanism can solve the above problems, it is not ideal in the aspects of implementation flexibility and so on. This paper focuses on the autonomous systems with multiple exits, and proposes a Lightweight Two-dimensional Routing Mechanism Based on Agent Calculation (LTAC). LTAC is based on Two-dimensional routing (TD-routing), which can implement flexible multipath transmission according to the inherent fields of IP packets. In LTAC, the border router (BR) performs agent calculation for the access router (AR) to get the optimal path from AR to BR. Then BR sends two-dimensional routing information (TDRI) hop by hop along the reverse path of the optimal path to establish a TD transmission path. Moreover, TDRI is only released on the specific paths, which greatly reduces the resource consumption in control plane and data plane. Through experimental results, we show that the proposed approach has a lower storage consumption than existing OSPF flooding method.