Loss and Delay Accountability for the Internet

The Internet provides no information on the fate of transmitted packets, and end systems cannot determine who is responsible for dropping or delaying their traffic. As a result, they cannot verify that their ISPs are honoring their service level agreements, nor can they react to adverse network conditions appropriately. While current probing tools provide some assistance in this regard, they only give feedback on probes, not actual traffic. Moreover, service providers could, at any time, render their network opaque to such tools. We propose Audit, an explicit accountability interface, through which ISPs can pro-actively supply feedback to traffic sources on loss and delay, at administrative-domain granularity. Notably, our interface is resistant to ISP lies and can be implemented with a modest NetFlow modification. On our Click-based prototype, playback of real traces from a Tier-1 ISP reveals less than 2% bandwidth overhead. Finally, our proposal benefits not only end systems, but also ISPs, who can now control the amount and quality of information revealed about their internals.

[1]  Damien Magoni,et al.  Analysis of the autonomous system network topology , 2001, CCRV.

[2]  PROCEssIng magazInE IEEE Signal Processing Magazine , 2004 .

[3]  Larry L. Peterson,et al.  Sophia: an Information Plane for networked systems , 2004, Comput. Commun. Rev..

[4]  LaskowskiPaul,et al.  Network monitors and contracting systems , 2006 .

[5]  David R. Cheriton,et al.  TRIAD: A Scalable Deployable NAT-based Internet Architecture , 2000 .

[6]  SommersJoel,et al.  Improving accuracy in end-to-end packet loss measurement , 2005 .

[7]  Scott Shenker,et al.  Providing Packet Obituaries , 2004 .

[8]  Eddie Kohler,et al.  The Click modular router , 1999, SOSP.

[9]  Robert Nowak,et al.  Internet tomography , 2002, IEEE Signal Process. Mag..

[10]  George Varghese,et al.  Building a better NetFlow , 2004, SIGCOMM.

[11]  Randy H. Katz,et al.  An algebraic approach to practical and scalable overlay network monitoring , 2004, SIGCOMM '04.

[12]  Xin Zhang,et al.  Availability-Oriented Path Selection in Multi-Path Routing , 2007 .

[13]  Jia Wang,et al.  Towards an accurate AS-level traceroute tool , 2003, SIGCOMM '03.

[14]  Andreas Haeberlen,et al.  PeerReview: practical accountability for distributed systems , 2007, SOSP.

[15]  Xiaowei Yang,et al.  NIRA: a new Internet routing architecture , 2003, FDNA '03.

[16]  Paul Barford,et al.  Improving accuracy in end-to-end packet loss measurement , 2005, SIGCOMM '05.

[17]  Alex C. Snoeren,et al.  Hash-based IP traceback , 2001, SIGCOMM '01.

[18]  Bassam Halabi,et al.  Internet Routing Architectures , 1997 .

[19]  Nick G. Duffield,et al.  Trajectory sampling for direct traffic observation , 2001, TNET.

[20]  Jeffrey S. Chase,et al.  Strong accountability for network storage , 2007, TOS.

[21]  Alex C. Snoeren,et al.  A system for authenticated policy-compliant routing , 2004, SIGCOMM '04.

[22]  Randy H. Katz,et al.  An algebraic approach to practical and scalable overlay network monitoring , 2004, SIGCOMM 2004.

[23]  David D. Clark,et al.  A knowledge plane for the internet , 2003, SIGCOMM '03.

[24]  Jeffrey S. Chase,et al.  The role of accountability in dependable distributed systems , 2005 .

[25]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.