Resolving inter-domain policy disputes

Full Text:

PDF SIGN IN to get this Article

Authors:	Cheng Tien Ee	UC Berkeley, Berkeley, CA
	Vijay Ramachandran	Colgate University, Hamilton, NY
	Byung-Gon Chun	UC Berkeley, Berkeley, CA
	Kaushik Lakshminarayanan	Indian Institute of Technology: Madras, Madras, India
	Scott Shenker	UC Berkeley, Berkeley, CA

	2007 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 30 · Downloads (cumulative): 382 · Citation Count: 3

Published in:

	· Proceeding
	SIGCOMM '07 Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
	Pages 157-168 ACM New York, NY, USA ©2007 table of contents ISBN: 978-1-59593-713-1 doi>10.1145/1282380.1282399
	· Newsletter
	ACM SIGCOMM Computer Communication Review
	Volume 37 Issue 4, October 2007 Pages 157-168 ACM New York, NY, USA table of contents doi>10.1145/1282427.1282399

Tools and Resources

Tags: algorithms bgp convergence design inter-domain routing internetworking policy disputes theory