ACM Home Page
Please provide us with feedback. Feedback
Decoupling policy from mechanism in Internet routing
Full text PdfPdf (153 KB)
Source ACM SIGCOMM Computer Communication Review archive
Volume 34 ,  Issue 1  (January 2004) table of contents
COLUMN: Papers from Hotnets-II table of contents
Pages: 81 - 86  
Year of Publication: 2004
ISSN:0146-4833
Authors
Alex C. Snoeren  University of California, San Diego
Barath Raghavan  University of California, San Diego
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 33,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/972374.972389
What is a DOI?

ABSTRACT

Routing is a black art in today's Internet. End users and ISPs alike have little control over how their packets are handled outside of their networks, stemming in part from limitations of the current wide-area routing protocol, BGP. We believe that many of these constraints are due to policy-based restrictions on route-exportation. Separating forwarding policy from route discovery would allow users to select among the possibly many inter-AS paths available to them and enable ISPs to more effectively manage the end-to-end behavior of their customers' traffic.As a concrete mechanism for enforcing forwarding policy, we purpose the concept of a network capability that binds together a path request, an accountable resource principal, and an authorizing agent. Network capabilities are central to Platypus, a loose source routing protocol we are designing, which composes network capabilities authorized by multiple ISPs to construct alternative inter-AS routes that can be independently validated and accounted for on the fly.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
AGARWAL, S., CHUAH, C.-N., AND KATZ. R. H. OPCA: Robust interdomain policy routing and traffic control. In Proc. IEEE OPENARCH (New York, New York, June 2002).
 
2
3
4
5
 
6
FEAMSTER, N., AND REXFORD, J. Network-wide BGP route prediction for traffic engineering. In Proc. ITCOM (Boston, Massachusetts, July 2002).
 
7
FERGUSON, P., AND SENIE, D. Network ingress filtering: Defeating denial of service attacks which employ IP source address spoofing. RFC 2267, Internet Engineering Task Force, Jan. 1998.
 
8
9
 
10
HUSTON, G. Commentary on inter-domain routing in the Internet. RFC 3221, Internet Engineering Task Force, Dec. 2001.
 
11
JANNOTTI, J. Network layer support for overlay networks. In Proc. IEEE OPENMARCH (New York, New York, June 2002), pp. 3--13.
 
12
13
14
 
15
NORTON, W. B. Internet service providers and peering. In Proceedings of NANOG 19 (Albuquerque, New Mexico, June 2000).
 
16
POSTEL, J. Internet Protocol. RFC 791, Internet Engineering Task Force, Sept. 1981.
17
18
 
19
 
20
 
21
STEENSTRUP, M. An architecture for inter-domain policy routing. RFC 1478, Internet Engineering Task Force, June 1993.
22
 
23
STOICA, I., AND ZHANG, H. LIRA: An approach for service differentiation in the Internet. In Proc. NOSSDAV (June 1998), pp. 115--128.
24
25
 
26
ZHU, D., GRITTER, M., AND CHERITON, D. R. Feedback based routing. In Proc. Workshop on Hot Topics in Networks (Princeton, New Jersey, Oct. 2002), pp. 71--76.

Collaborative Colleagues:
Alex C. Snoeren: colleagues
Barath Raghavan: colleagues

Peer to Peer - Readers of this Article have also read: