Bryan Parno
Adrian Perrig
Dave Andersen
ABSTRACT
This paper examines a new building block for next-generation networks: SNAPP, or Stateless Network-Authenticated Path Pinning. SNAPP-enabled routers securely embed their routing decisions in the packet headers of a stream of traffic, effectively pinning a flow's path between sender and receiver. A sender can use the pinned path (even if routes subsequently change) by including the path embedding in later packet headers. This architectural building block decouples routing from forwarding, which greatly enhances the availability of a path in the face of routing misconfigurations or malicious attacks. To demonstrate the extreme flexibility of SNAPP, we show how it can support a wide range of applications, including sender-controlled paths, expensive route lookups, sender anonymity, and sender accountability. Our analysis shows that SNAPP's overhead is low, and the system is easily implemented in hardware. We believe that SNAPP is a worthy addition to the network architect's toolbox, enabling a variety of new designs and trade-offs.
- W. Adjie-Winoto, E. Schwartz, H. Balakrishnan, and J. Lilley. The design and implementation of an intentional naming system. In Proc. ACM SOSP, 1999. Google Scholar
Digital Library
- D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient Overlay Networks. In Proc. ACM SOSP, 2001. Google ScholarDigital Library
- T. Anderson, T. Roscoe, and D. Wetherall. Preventing Internet denial-of-service with capabilities. In Proceedings of Hotnets-II, Nov. 2003.Google Scholar
- K. Argyraki and D. R. Cheriton. Loose source routing as a mechanism for traffic policies. In ACM SIGCOMM Workshop on Future Directions in Network Architecture, Sept. 2004. Google ScholarDigital Library
- D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow. RSVP-TE: Extensions to RSVP for LSP Tunnels. Internet Engineering Task Force, Dec. 2001. RFC 3209. Google ScholarDigital Library
- M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. Proceedings of AsiaCrypt, 2000. Google ScholarDigital Library
- J. Black and P. Rogaway. A block-cipher mode of operation for parallelizable message authentication. In Advances in Cryptology - EUROCRYPT. Springer-Verlag, 2002. Google ScholarDigital Library
- V. J. Bono. 7007 explanation and apology. http://www.merit.edu/mail.archives/anog/1997-04/msg00444.html, Apr. 1997.Google Scholar
- R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin. Resource ReSerVation Protocol (RSVP). IETF, 1997. RFC 2205. Google ScholarDigital Library
- G. P. Chandranmenon and G. Varghese. Trading packet headers for packet processing. IEEE/ACM Trans. Netw., 4(2):141--152, 1996. Google ScholarDigital Library
- D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Jrnl of Cryptology, I(1), 1998. Google ScholarDigital Library
- B. Fortz and M. Thorup. Optimizing OSPF/IS-IS weights in a changing world. IEEE J-SAC, 20(4):756--767, May 2002. Google ScholarDigital Library
- Helion Technology Limited. High performance AES (Rijndael) cores for ASIC. Cambridge, England. Available at http://www.heliontech.com/. March 2007.Google Scholar
- J. Jannotti. Network layer support for overlay networks. In Proc. 5th International Conference on Open Architectures and Network Programming (OPENARCH), New York, NY, June 2002.Google ScholarCross Ref
- S. Kandula, D. Katabi, B. Davie, and A. Charny. Walking the tightrope: Responsive yet stable traffic engineering. In Proc. ACM SIGCOMM, Philadelphia, PA, Aug. 2005. Google ScholarDigital Library
- L. Li, D. Alderson, W. Willinger, J. Doyle, R. Tanaka, and S. Low. A first principles approach to understanding the Internet's router technology. In Proceedings of ACM SIGCOMM, 2004. Google ScholarDigital Library
- S. Machiraju, M. Seshadri, and I. Stoica. A scalable and robust solution for bandwidth allocation. Technical Report UCB//CSD02-1176, University of California at Berkeley, 2002.Google ScholarCross Ref
- NSF workshop report. Overcoming barriers to disruptive innovation in networking, Jan. 2005.Google Scholar
- B. Parno, D. Wendlandt, E. Shi, A. Perrig, B. Maggs, and Y.-C. Hu. Portcullis: Protecting connection setup from denial-of-capability attacks. In Proceedings of the ACM SIGCOMM, Aug. 2007. Google ScholarDigital Library
- B. Raghavan and A. C. Snoeren. A system for authenticated policy-compliant routing. In Proc. of ACM SIGCOMM, 2004. Google ScholarDigital Library
- M. Reiter and A. Rubin. Crowds: Anonymity for web transactions. ACM TISSEC, 1:66--92, Nov. 1998. Google ScholarDigital Library
- E. Rosen, A. Viswanathan, and R. Callon. Multiprotocol label switching architecture. RFC 3031, Jan. 2001. Google ScholarDigital Library
- S. Sinha, S. Kandula, and D. Katabi. Harnessing TCP's burstiness with flowlet switching. In Proc. 3rd ACM Workshop on Hot Topics in Networks (Hotnets-III), San Diego, CA, Nov. 2004.Google Scholar
- I. Stoica, D. Adkins, S. Zhaung, S. Shenker, and S. Surana. Internet indirection infrastructure. In Proc. ACM SIGCOMM, Aug. 2002. Google ScholarDigital Library
- I. Stoica and H. Zhang. Lira: An approach for service differentiation in the internet. In Proceedings of NOSSDAV, June 1998.Google Scholar
- P. F. Syverson, D. M. Goldschlag, and M. G. Reed. Anonymous connections and onion routing. In Proc. IEEE Symposium on Security and Privacy, Oakland, CA, 1997. Google ScholarDigital Library
- J. Touch and S. Hotz. The X-Bone. In Proc. 3rd Global Internet Mini-Conference in conjunction with IEEE Globecom, 1998.Google Scholar
- A. Yaar, A. Perrig, and D. Song. SIFF: An endhost capability mechanism to mitigate DDoS flooding attacks. In Proceedings of IEEE Symposium on Security and Privacy, May 2004.Google Scholar
- X. Yang. NIRA: A New Internet Routing Architecture. PhD thesis, MIT, Sept. 2004. Google ScholarDigital Library
- X. Yang, D. Wetherall, and T. Anderson. A DoS-limiting network architecture. In Proceedings of ACM SIGCOMM, Aug. 2005. Google ScholarDigital Library
- M. Zhang, B. Karp, S. Floyd, and L. Peterson. A reordering-robust TCP with DSACK. In IEEE ICNP, 2003. Google ScholarDigital Library
- X. Zhao, D. Pei, L. Wang, D. Massey, A. Mankin, S. F. Wu, and L. Zhang. An analysis of BGP Multiple Origin AS (MOAS) conflicts. In Proc. of Internet Measurement Workshop, 2001. Google ScholarDigital Library
Index Terms
- SNAPP: stateless network-authenticated path pinning
Recommendations
Cluster-based energy-efficient routing protocol in next generation sensor networks
This paper focuses on optimising energy consumption within Next-Generation Networks (NGNs) during cluster formation, cluster head selection, and routing processes. NGNs, composed of diverse intelligent nodes with varying battery power and computational ...
Evaluating TCP-friendliness in light of Concurrent Multipath Transfer
In prior work, a CMT protocol using SCTP multihoming (termed SCTP-based CMT) was proposed and investigated for improving application throughput. SCTP-based CMT was studied in (bottleneck-independent) wired networking scenarios with ns-2 simulations. ...
TCP CERL: congestion control enhancement over wireless networks
In this paper, we propose and verify a modified version of TCP Reno that we call TCP Congestion Control Enhancement for Random Loss (CERL). We compare the performance of TCP CERL, using simulations conducted in ns-2, to the following other TCP variants: ...
Comments