Article ID Journal Published Year Pages File Type
452884 Computer Networks 2014 16 Pages PDF
Abstract

Internet is composed of independent autonomous systems (ASes) which are selfish by nature. In the current inter-domain routing system, for an AS, incoming traffic is harder to control than outgoing traffic because its incoming traffic routing is ultimately determined by other ASes. This problem stays the same in the leading new routing architecture proposals (such as transit edge separation protocols) when addressing scalability challenges. In this paper, we use LISP as an example to study cooperative incoming traffic engineering in a selfish multi-AS context in such proposals. First, we analyze conflicted egress tunnel routers (ETRs) selections of edge ASes, which choose ETRs that are best for their individual delay performance, but neglect incoming traffic engineering performance of other edge ASes. Then, we propose the cooperative incoming traffic engineering, where edge ASes sacrifice limited delay performance for optimizing incoming traffic engineering performance between each other. Furthermore, we measure the delay variations between different RLOCs with experiments on PlanetLab to verify the rationality of considering the impact of ETR selections on delay performance. Finally we evaluate the performance of cooperative incoming traffic engineering. The proposed method achieves Pareto optimality and can greatly improve the robustness and resiliency of ASes based on simulations.

Related Topics
Physical Sciences and Engineering Computer Science Computer Networks and Communications
Authors
, , , ,