Characterizing and Mitigating Inter-domain Policy Violations in Overlay Routes

  • Authors:

  • Srinivasan Seetharaman;Mostafa Ammar

  • Affiliations:

  • Networking and Telecommunications Group, College of Computing, Georgia Institute of Technology, Atlanta, Georgia 30332. srini@cc.gatech.edu;Networking and Telecommunications Group, College of Computing, Georgia Institute of Technology, Atlanta, Georgia 30332. ammar@cc.gatech.edu

  • Venue:
  • ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Internet is a complex structure arising from the interconnection of numerous autonomous systems (AS), each exercisingits own administrative policies to reflect the commercial agreements behind the interconnection. However, routing in serviceoverlay networks is quite capable of violating these policies to its advantage. To prevent these violations, we see an impendingdrive in the current Internet to detect and filter overlay traffic. In this paper, we first present results from a case studyoverlay network, constructed on top of Planetlab, that helps us gain insights into the frequency and characteristics of thedifferent inter-domain policy violations. We further investigate the impact of two types of overlay traffic filtering thataim to prevent these routing policy violations: blind filtering and policy-aware filtering. We show that such filtering canbe detrimental to the performance of overlay routing. We next consider two approaches that allow the overlay network to realizethe full advantage of overlay routing in this context. In the first approach, overlay nodes are added so that good overlaypaths do not represent inter-domain policy violations. In the second approach, the overlay acquires transit permits from certainASes that allow certain policy violations to occur. We develop a single cost-sharing framework that allows the incorporationof both approaches into a single strategy. We formulate and solve an optimization problem that aims to determine how the overlaynetwork should allocate a given budget between paying for additional overlay nodes and paying for transit permits to ASes.