More Web Proxy on the site http://driver.im/

survey

Unveiling the Mystery of Internet Packet Forwarding: A Survey of Network Path Validation

Authors:

Kui RenAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 53, Issue 5

Article No.: 104, Pages 1 - 34

https://doi.org/10.1145/3409796

Published: 28 September 2020 Publication History

Abstract

Validating the network paths taken by packets is critical in constructing a secure Internet architecture. Any feasible solution must both enforce packet forwarding along end-host specified paths and verify whether packets have taken those paths. However, the current Internet supports neither enforcement nor verification. Likely due to the radical changes to the Internet architecture and a long-standing confusion between routing and forwarding, only limited solutions for path validation exist in the literature. This survey article aims to reinvigorate research on the essential topic of path validation by crystallizing not only how path validation works but also where seemingly qualified solutions fall short. The analyses explore future research directions in path validation aimed at improving security, privacy, and efficiency.

References

[1]

Coq. 2017. The Coq Proof Assistant. Retrieved July 28, 2020 from https://coq.inria.fr/.

[2]

Wikipedia. 2019. Default/ Route. Retrieved July 28, 2020 from https://en.wikipedia.org/wiki/Default_route.

[3]

IRTF. 2019. Path Aware Networking Research Group PANRG. Retrieved July 28, 2020 from https://irtf.org/panrg.

[4]

IETF. 2019. Path Aware Networking RG (panrg). Retrieved July 28, 2020 from https://datatracker.ietf.org/rg/panrg/about/.

[5]

Bahaa Al-Musawi, Philip Branch, and Grenville Armitage. 2017. BGP anomaly detection techniques: A survey. IEEE Communications Surveys 8 Tutorials 19, 1 (2017), 377--396.

[6]

David G. Andersen, Hari Balakrishnan, Nick Feamster, Teemu Koponen, Daekyeong Moon, and Scott Shenker. 2008. Accountable Internet Protocol (AIP). ACM SIGCOMM Computer Communication Review 38, 4 (2008), 339--350.

Digital Library

[7]

Tom Anderson, Ken Birman, Robert Broberg, Matthew Caesar, Douglas Comer, Chase Cotton, Michael J. Freedman, et al. 2014. A brief overview of the NEBULA future Internet architecture. ACM SIGCOMM Computer Communication Review 44, 3 (2014), 81--86.

Digital Library

[8]

Katerina Argyraki and David R. Cheriton. 2004. Loose source routing as a mechanism for traffic policies. In Proceedings of ACM FDNA 2004. 57--64.

[9]

Katerina Argyraki, Petros Maniatis, Olga Irzak, Subramanian Ashish, and Scott Shenker. 2007. Loss and delay accountability for the Internet. In Proceedings of IEEE ICNP 2007. 194--205.

[10]

Edvard F. Assmus and Jennifer D. Key. 1994. Designs and Their Codes. Vol. 103. Cambridge University Press.

[11]

Ioannis Avramopoulos, Hisashi Kobayashi, Randy Wang, and Arvind Krishnamurthy. 2004. Highly secure and efficient routing. In Proceedings of IEEE INFOCOM 2004. 197--208.

[12]

Ioannis C. Avramopoulos and Jennifer Rexford. 2006. Stealth probing: Efficient data-plane security for IP routing. In Proceedings of USENIX ATC 2006. 267--272.

[13]

David Barrera, Laurent Chuat, Adrian Perrig, Raphael M. Reischuk, and Pawel Szalachowski. 2017. The SCION Internet architecture. Communications of the ACM 60, 6 (2017), 56--65.

Digital Library

[14]

Bobby Bhattacharjee, Ken Calvert, Jim Griffioen, Neil Spring, and James P. G. Sterbenz. 2006. Postmodern Internetwork Architecture. Technical Report. University of Kansas.

[15]

George Dean Bissias, Marc Liberatore, David Jensen, and Brian Neil Levine. 2005. Privacy vulnerabilities in encrypted HTTP streams. In Privacy Enhancing Technologies. Lecture Notes in Computer Science, Vol. 3856. Springer, 1--11.

[16]

Ilker Nadi Bozkurt, Anthony Aguirre, Balakrishnan Chandrasekaran, P. Brighten Godfrey, Gregory Laughlin, Bruce Maggs, and Ankit Singla. 2017. Why is the Internet so slow?! In Proceedings of PAM 2017. 173--187.

[17]

Andrei Broder and Michael Mitzenmacher. 2004. Network applications of Bloom filters: A survey. Internet Mathematics 1, 4 (2004), 485--509.

[18]

Kai Bu, Yutian Yang, Zixuan Guo, Yuanyuan Yang, Xing Li, and Shigeng Zhang. 2018. FlowCloak: Defeating middlebox-bypass attacks in software-defined networking. In Proceedings of IEEE INFOCOM 2018. 396--404.

[19]

Kai Bu, Yutian Yang, Avery Laird, Jiaqing Luo, Yingjiu Li, and Kui Ren. 2018. What’s (not) validating network paths: A survey. arXiv:1804.03385 [cs.NI].

[20]

Kevin Butler, Toni R. Farley, Patrick McDaniel, and Jennifer Rexford. 2010. A survey of BGP security issues and solutions. Proceedings of the IEEE 98, 1 (2010), 100--122.

[21]

Hao Cai and Tilman Wolf. 2015. Source authentication and path validation with orthogonal network capabilities. In Proceedings of IEEE INFOCOM Workshops 2015. 111--112.

[22]

Hao Cai and Tilman Wolf. 2016. Source authentication and path validation in networks using orthogonal sequences. In Proceedings of IEEE ICCCN 2016. 1--10.

[23]

Kenneth L. Calvert, James Griffioen, and Leonid Poutievski. 2007. Separating routing and forwarding: A clean-slate network layer design. In Proceedingsof IEEE BROADNETS 2007. 261--270.

[24]

Martin Casado, Michael J. Freedman, Justin Pettit, Jianying Luo, Nick McKeown, and Scott Shenker. 2007. Ethane: Taking control of the enterprise. ACM SIGCOMM Computer Communication Review 37, 4 (2007), 1--12.

Digital Library

[25]

André Castelucio, Antônio Tadeu A. Gomes, Artur Ziviani, and Ronaldo M. Salles. 2012. Intra-domain IP traceback using OSPF. Computer Communications 35, 5 (2012), 554--564.

Digital Library

[26]

Ang Chen, Andreas Haeberlen, Wenchao Zhou, and Boon Thau Loo. 2017. One primitive to diagnose them all: Architectural support for Internet diagnostics. In Proceedings of EuroSys 2017.

Digital Library

[27]

Chen Chen, Daniele E. Asoni, David Barrera, George Danezis, and Adrain Perrig. 2015. HORNET: High-speed onion routing at the network layer. In Proceedings of ACM CCS 2015. 1441--1454.

Digital Library

[28]

K. H. Choi and H. K. Dai. 2004. A marking scheme using Huffman codes for IP traceback. In Proceedings of IEEE ISPAN 2004. 421--428.

[29]

Luca Cittadini, Giuseppe Di Battista, and Massimo Rimondini. 2012. On the stability of interdomain routing. ACM Computing Surveys 44, 4 (2012), 26.

Digital Library

[30]

Anupam Datta, Ante Derek, John C. Mitchell, and Arnab Roy. 2007. Protocol composition logic (PCL). Electronic Notes in Theoretical Computer Science 172 (2007), 311--358.

Digital Library

[31]

Anupam Datta, Jason Franklin, Deepak Garg, and Dilsun Kaynar. 2009. A logic of secure systems and its application to trusted computing. In Proceedings of IEEE S8P 2009. 221--236.

Digital Library

[32]

Wenxiu Ding, Zheng Yan, and Robert H. Deng. 2016. A survey on future Internet security architectures. IEEE Access 4 (2016), 4374--4393.

[33]

Deepak Garg, Jason Franklin, Dilsun Kaynar, and Anupam Datta. 2010. Compositional system security in the presence of interface-confined adversaries. Electronic Notes in Theoretical Computer Science 265 (2010), 49--71.

Digital Library

[34]

P. Godfrey, Igor Ganichev, Scott Shenker, and Ion Stoica. 2009. Pathlet routing. ACM SIGCOMM Computer Communication Review 39, 4 (2009), 111--122.

Digital Library

[35]

Sharon Goldberg, David Xiao, Boaz Barak, and Jennifer Rexford. 2007. Measuring Path Quality in the Presence of Adversaries: The Role of Cryptography in Network Accountability. Technical Report. Department of Computer Science, Princeton University, Princeton, NJ.

[36]

Michael T. Goodrich. 2002. Efficient packet marking for large-scale IP traceback. In Proceedings of ACM CCS 2002. 117--126.

Digital Library

[37]

Saikat Guha and Paul Francis. 2007. An end-middle-end approach to connection establishment. ACM SIGCOMM Computer Communication Review 37 (2007), 193--204.

Digital Library

[38]

P. Krishna Gummadi, Harsha V. Madhyastha, Steven D. Gribble, Henry M. Levy, and David Wetherall. 2004. Improving the reliability of Internet paths with one-hop source routing. In Proceedings of USENIX OSDI 2004, Vol. 4. 13.

[39]

Andreas Haeberlen, Petr Kouznetsov, and Peter Druschel. 2007. PeerReview: Practical accountability for distributed systems. In Proceedings of ACM SOSP 2007, Vol. 41. 175--188.

Digital Library

[40]

Nikhil Handigol, Brandon Heller, Vimalkumar Jeyakumar, David Mazières, and Nick McKeown. 2014. I know what your packet did last hop: Using packet histories to troubleshoot networks. In Proceedings of USENIX NSDI 2014. 71--85.

[41]

Matthias Hollick, Cristina Nita-Rotaru, Panagiotis Papadimitratos, Adrian Perrig, and Stefan Schmid. 2017. Toward a taxonomy and attacker model for secure routing protocols. ACM SIGCOMM Computer Communication Review 47, 1 (2017), 43--48.

Digital Library

[42]

Yih-Chun Hu, Adrian Perrig, and Marvin Sirbu. 2004. SPV: Secure path vector routing for securing BGP. In Proceedings of ACM SIGCOMM 2004. 179--192.

Digital Library

[43]

Geoff Huston, Mattia Rossi, and Grenville Armitage. 2011. Securing BGP—A literature survey. IEEE Communications Surveys 8 Tutorials 13, 2 (2011), 199--222.

[44]

Junchen Jiang, Rajdeep Das, Ganesh Ananthanarayanan, Philip A. Chou, Venkata Padmanabhan, Vyas Sekar, Esbjorn Dominique, et al. 2016. Via: Improving Internet telephony call quality using predictive relay selection. In Proceedings of ACM SIGCOMM 2016. 286--299.

Digital Library

[45]

Jian Jiang, Wei Li, Junzhou Luo, and Jing Tan. 2013. A network accountability based verification mechanism for detecting inter-domain routing path inconsistency. Journal of Network and Computer Applications 36, 6 (2013), 1671--1683.

Digital Library

[46]

Naga Katta, Aditi Ghag, Mukesh Hira, Isaac Keslassy, Aran Bergman, Changhoon Kim, and Jennifer Rexford. 2017. Clove: Congestion-aware load balancing at the virtual edge. In Proceedings of ACM CoNEXT 2017. 323--335.

Digital Library

[47]

Jonathan Katz and Andrew Lindell. 2008. Aggregate message authentication codes. In Topics in Cryptology—CT-RSA 2008. Lecture Notes in Computer Science, Vol. 4964. Springer, 155--169.

[48]

H. Tahilramani Kaur, Shivkumar Kalyanaraman, Andreas Weiss, Shifalika Kanwar, and Ayesha Gandhi. 2003. BANANAS: An evolutionary framework for explicit and multipath routing in the Internet. ACM SIGCOMM Computer Communication Review 33, 4 (2003), 277--288.

Digital Library

[49]

Stephen Kent, Charles Lynn, and Karen Seo. 2000. Secure border gateway protocol (S-BGP). IEEE Journal on Selected Areas in Communications 18, 4 (2000), 582--592.

Digital Library

[50]

Tiffany Hyun-Jin Kim, Cristina Basescu, Limin Jia, Soo Bum Lee, Yih-Chun Hu, and Adrian Perrig. 2014. Lightweight source authentication and path validation. In Proceedings of ACM SIGCOMM 2014, Vol. 44. 271--282.

[51]

Taeho Lee, Christos Pappas, Adrian Perrig, Virgil Gligor, and Yih-Chun Hu. 2017. The case for in-network replay suppression. In Proceedings of ASIACCS 2017. 862--873.

Digital Library

[52]

Dave Levin, Youndo Lee, Luke Valenta, Zhihao Li, Victoria Lai, Cristian Lumezanu, Neil Spring, and Bobby Bhattacharjee. 2015. Alibi routing. In Proceedings of ACM SIGCOMM 2015, Vol. 45. 611--624.

Digital Library

[53]

Marc Liberatore and Brian Neil Levine. 2006. Inferring the source of encrypted HTTP connections. In Proceedings of ACM CCS 2006. 255--263.

Digital Library

[54]

Robert Lychev, Michael Schapira, and Sharon Goldberg. 2016. Rethinking security for Internet routing. Communications of the ACM 59, 10 (2016), 48--57.

Digital Library

[55]

S. Malliga and A. Tamilarasi. 2008. A proposal for new marking scheme with its performance evaluation for IP traceback. WSEAS Transactions on Computer Research 3, 4 (2008), 259--272.

[56]

S. Malliga and A. Tamilarasi. 2010. A hybrid scheme using packet marking and logging for IP traceback. International Journal of Internet Protocol Technology 5, 1--2 (2010), 81--91.

Digital Library

[57]

David A. Maltz, Geoffrey Xie, Jibin Zhan, Hui Zhang, Gísli Hjálmtỳsson, and Albert Greenberg. 2004. Routing design in operational networks: A look from the inside. ACM SIGCOMM Computer Communication Review 34, 4 (2004), 27--40.

Digital Library

[58]

David Mazieres, Michael Kaminsky, M. Frans Kaashoek, and Emmett Witchel. 1999. Separating key management from file system security. In Proceedings of ACM SOSP 1999. 124--139.

Digital Library

[59]

Murtaza Motiwala, Megan Elmore, Nick Feamster, and Santosh Vempala. 2008. Path splicing. In Proceedings of ACM SIGCOMM 2008. 27--38.

Digital Library

[60]

John Moy. 1998. OSPF Version 2. Retrieved July 28, 2020 from https://tools.ietf.org/html/rfc2328.

Digital Library

[61]

John T Moy. 1998. OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley Professional.

Digital Library

[62]

Jad Naous, Michael Walfish, Antonio Nicolosi, David Mazières, Michael Miller, and Arun Seehra. 2011. Verifying and enforcing network paths with icing. In Proceedings of ACM CoNEXT 2011. 30.

Digital Library

[63]

Martin O. Nicholes and Biswanath Mukherjee. 2009. A survey of security techniques for the border gateway protocol (BGP). IEEE Communications Surveys 8 Tutorials 11, 1 (2009), 52--65.

[64]

David Oran. 1990. OSI IS-IS Intra-Domain Routing Protocol. Retrieved July 28, 2020 from https://tools.ietf.org/html/rfc1142.

Digital Library

[65]

Venkata N. Padmanabhan and Daniel R. Simon. 2003. Secure traceroute to detect faulty or malicious routing. ACM SIGCOMM Computer Communication Review 33, 1 (2003), 77--82.

Digital Library

[66]

Adrian Perrig, Pawel Szalachowski, Raphael M. Reischuk, and Laurent Chuat. 2017. Scion: A Secure Internet Architecture. Springer.

[67]

Simon Peter, Umar Javed, Qiao Zhang, Doug Woos, Thomas Anderson, and Arvind Krishnamurthy. 2014. One tunnel is (often) enough. ACM SIGCOMM Computer Communication Review 44, 4 (2014), 99--110.

Digital Library

[68]

Lucian Popa, Norbert Egi, Sylvia Ratnasamy, and Ion Stoica. 2010. Building extensible networks with rule-based forwarding. In Proceedings of USENIX OSDI 2010. 379--392.

[69]

Barath Raghavan and Alex C. Snoeren. 2004. A system for authenticated policy-compliant routing. ACM SIGCOMM Computer Communication Review 34 (2004), 167--178.

Digital Library

[70]

Yakov Rekhter, Tony Li, and Susan Hares. 2005. A Border Gateway Protocol 4 (BGP-4). Technical Report. T. J. Watson Research Center, IBM Corp.

[71]

Gábor Rétvári, János Tapolcai, Attila Kőrösi, András Majdán, and Zalán Heszberger. 2013. Compressing IP forwarding tables: Towards entropy bounds and beyond. In Proceedings of ACM SIGCOMM 2013. 111--122.

[72]

Jennifer Rexford and Constantine Dovrolis. 2010. Future Internet architecture: Clean-slate versus evolutionary research. Communications of the ACM 53, 9 (2010), 36--40.

Digital Library

[73]

Leonid Reyzin and Natan Reyzin. 2002. Better than BiBa: Short one-time signatures with fast signing and verifying. In Information Security and Privacy. Lecture Notes in Computer Science, Vol. 2384. Springer, 144--153.

[74]

Stefan Savage, David Wetherall, Anna Karlin, and Tom Anderson. 2000. Practical network support for IP traceback. ACM SIGCOMM Computer Communication Review 30 (2000), 295--306.

Digital Library

[75]

Alex C. Snoeren, Craig Partridge, Luis A. Sanchez, Christine E. Jones, Fabrice Tchakountio, Stephen T. Kent, and W. Timothy Strayer. 2001. Hash-based IP traceback. In Proceedings of ACM SIGCOMM 2001. 3--14.

[76]

Christian Sommer. 2014. Shortest-path queries in static networks. ACM Computing Surveys 46, 4 (2014), 45.

Digital Library

[77]

Dawn Xiaodong Song and Adrian Perrig. 2001. Advanced and authenticated marking schemes for IP traceback. In Proceedings of IEEE INFOCOM 2001, Vol. 2. IEEE, Los Alamitos, CA, 878--886.

[78]

Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, and Sonesh Surana. 2002. Internet indirection infrastructure. In Proceedings of ACM SIGCOMM 2002. 73--86.

Digital Library

[79]

Qixiang Sun, Daniel R. Simon, Yi-Min Wang, Wilf Russell, Venkata N. Padmanabhan, and Lili Qiu. 2002. Statistical identification of encrypted web browsing traffic. In Proceedings of IEEE S8P 2002. 19--30.

[80]

Paul Syverson, R. Dingledine, and N. Mathewson. 2004. Tor: the second-generation onion router. In Proceedings of USENIX Security 2004.

[81]

Paul F. Syverson, David M. Goldschlag, and Michael G. Reed. 1997. Anonymous connections and onion routing. In Proceedings of IEEE S8P 1997. 44--54.

[82]

Praveen Tammana, Rachit Agarwal, and Myungjin Lee. 2015. Cherrypick: Tracing packet trajectory in software-defined datacenter networks. In Proceedings of ACM SOSR 2015. 1--7.

Digital Library

[83]

Brian Trammell, Jean-Pierre Smith, and Adrian Perrig. 2018. Adding path awareness to the Internet architecture. IEEE Internet Computing 22, 2 (2018), 96--102.

[84]

Michael Walfish, Jeremy Stribling, Maxwell N. Krohn, Hari Balakrishnan, Robert Morris, and Scott Shenker. 2004. Middleboxes no longer considered harmful. In Proceedings of USENIX OSDI 2004, Vol. 4. 15.

[85]

Dan Wendlandt, Ioannis Avramopoulos, David G. Andersen, and Jennifer Rexford. 2006. Don’t secure routing protocols, secure data delivery. In Proceedings of ACM HotNets 2006. 7--12.

[86]

Edmund L. Wong, Praveen Balasubramanian, Lorenzo Alvisi, Mohamed G. Gouda, and Vitaly Shmatikov. 2007. Truth in advertising: Lightweight verification of route integrity. In Proceedings of ACM PODC 2007. 147--156.

Digital Library

[87]

Bo Wu, Ke Xu, Qi Li, Zhuotao Liu, Yih-Chun Hu, Martin J. Reed, Meng Shen, and Fan Yang. 2018. Enabling efficient source and path verification via probabilistic packet marking. In Proceedings of IEEE/ACM IWQoS 2018. 1--10.

[88]

Wen Xu and Jennifer Rexford. 2006. MIRO: Multi-path interdomain routing. In Proceedings of ACM SIGCOMM 2006. 171--182.

Digital Library

[89]

Abraham Yaar, Adrian Perrig, and Dawn Song. 2005. FIT: Fast Internet traceback. In Proceedings of IEEE INFOCOM 2005, Vol. 2. 1395--1406.

[90]

Ming-Hour Yang and Ming-Chien Yang. 2012. RIHT: A novel hybrid IP traceback scheme. IEEE Transactions on Information Forensics and Security 7, 2 (2012), 789--797.

Digital Library

[91]

Xiaowei Yang, David Clark, and Arthur W. Berger. 2007. NIRA: A new inter-domain routing architecture. IEEE/ACM Transactions on Networking 15, 4 (2007), 775--788.

Digital Library

[92]

Xiaowei Yang and David Wetherall. 2006. Source selectable path diversity via routing deflections. ACM SIGCOMM Computer Communication Review 36 (2006), 159--170.

Digital Library

[93]

Wen Yao, Chao-Hsien Chu, and Zang Li. 2011. Leveraging complex event processing for smart hospitals using RFID. Journal of Network and Computer Applications 34, 3 (2011), 799--810.

Digital Library

[94]

Minlan Yu, Jennifer Rexford, Michael J. Freedman, and Jia Wang. 2011. Scalable flow-based networking with DIFANE. In Proceedings of ACM SIGCOMM 2011. 351--362.

[95]

Shui Yu, Wanlei Zhou, Robin Doss, and Weijia Jia. 2011. Traceback of DDoS attacks using entropy variations. IEEE Transactions on Parallel and Distributed Systems 22, 3 (2011), 412--425.

Digital Library

[96]

Pamela Zave, Ronaldo A. Ferreira, X. Kelvin Zou, Masaharu Morimoto, and Jennifer Rexford. 2017. Dynamic service chaining with Dysco. In Proceedings of ACM SIGCOMM 2017. 57--70.

Digital Library

[97]

Fuyuan Zhang, Limin Jia, Cristina Basescu, Tiffany Hyun-Jin Kim, Yih-Chun Hu, and Adrian Perrig. 2014. Mechanized network origin and path authenticity proofs. In Proceedings of ACM CCS 2014. 346--357.

Digital Library

[98]

Xin Zhang, Hsu-Chun Hsiao, Geoffrey Hasker, Haowen Chan, Adrian Perrig, and David G. Andersen. 2011. SCION: Scalability, control, and isolation on next-generation networks. In Proceedings of IEEE S8P 2011. 212--227.

[99]

Xin Zhang, Zongwei Zhou, Hsu-Chun Hsiao, Tiffany Hyun-Jin Kim, Adrian Perrig, and Patrick Tague. 2012. ShortMAC: Efficient data-plane fault localization. In Proceedings of NDSS 2012.

[100]

Wenchao Zhou, Qiong Fei, Arjun Narayan, Andreas Haeberlen, Boon Thau Loo, and Micah Sherr. 2011. Secure network provenance. In Proceedings of ACM SOSP 2011. 295--310.

Digital Library

[101]

Dapeng Zhu, Mark Gritter, and David R. Cheriton. 2003. Feedback based routing. ACM SIGCOMM Computer Communication Review 33, 1 (2003), 71--76.

Digital Library

[102]

Earl Zmijewski. 2008. You Can’t Get There from Here. Retrieved July 28, 2020 from https://blogs.oracle.com/internetintelligence/you-cant-get-there-from-here?.

Cited By

Borges EMartinello MBonella Vdos Santos AGomes RDominicini CGuimarães RMenegueti GBarcellos MRuffini M(2024)PoT-PolKA: Let the Edge Control the Proof-of-Transit in Path-Aware NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2024.338945721:4(3681-3691)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.1109/TNSM.2024.3389457
He ABu KHuang JPang YGu QRen K(2024)SwiftParade: Anti-Burst Multipath ValidationIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.331545721:4(2720-2734)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1109/TDSC.2023.3315457
Hu BBi YWu KFu RHuang Z(2024)A Lightweight Path Validation Scheme in Software-Defined NetworksIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621099(731-740)Online publication date: 20-May-2024
https://doi.org/10.1109/INFOCOM52122.2024.10621099
Show More Cited By

Index Terms

Unveiling the Mystery of Internet Packet Forwarding: A Survey of Network Path Validation
1. Networks
2. Security and privacy
  1. Cryptography
  2. Network security

Recommendations

Packet Forwarding with Swaps
Structural Information and Communication Complexity
Abstract
We consider packet forwarding in the adversarial queueing theory (AQT) model introduced by Borodin et al. In this context, a series of recent works have established optimal bounds for buffer space usage of for simple network topologies, where n ...
Comparative packet-forwarding measurement of three popular operating systems

This papers measures and compares the network performance (with respect to packet forwarding) of three popular operating systems when used in today's Gigabit Ethernet networks. Specifically, the paper compares the performance in terms of packet ...
A packet forwarding controller for mobile IP-based networks with packet buffering

Performance of TCP can be severely degraded in Mobile IP-based wireless networks where packet losses not related to network congestion occur frequently during inter-subnetwork handoffs by user mobility. To solve such a problem in the networks using ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 53, Issue 5

September 2021

782 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/3426973

Editor:
Albert Zomaya
University of Sydney, Austraila

Issue’s Table of Contents

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 September 2020

Accepted: 01 June 2020

Revised: 01 May 2020

Received: 01 July 2019

Published in CSUR Volume 53, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Survey
Research
Refereed

Funding Sources

Zhejiang Key R&D Plan
Leading Innovative and Entrepreneur Team Introduction Program of Zhejiang
Alibaba-Zhejiang University Joint Institute of Frontier Technologies
Research Institute of Cyberspace Governance in Zhejiang University
National Science Foundation of China
Natural Science Foundation of Zhejiang Province
National Natural Science Foundation of China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
716
Total Downloads

Downloads (Last 12 months)113
Downloads (Last 6 weeks)8

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Borges EMartinello MBonella Vdos Santos AGomes RDominicini CGuimarães RMenegueti GBarcellos MRuffini M(2024)PoT-PolKA: Let the Edge Control the Proof-of-Transit in Path-Aware NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2024.338945721:4(3681-3691)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.1109/TNSM.2024.3389457
He ABu KHuang JPang YGu QRen K(2024)SwiftParade: Anti-Burst Multipath ValidationIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.331545721:4(2720-2734)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1109/TDSC.2023.3315457
Hu BBi YWu KFu RHuang Z(2024)A Lightweight Path Validation Scheme in Software-Defined NetworksIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621099(731-740)Online publication date: 20-May-2024
https://doi.org/10.1109/INFOCOM52122.2024.10621099
Klenze TSprenger CBasin D(2023)IsaNetJournal of Computer Security10.3233/JCS-22002131:3(217-259)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.3233/JCS-220021
He ALi XFu JHu HBu KMiao CRen K(2023)Hummingbird: Dynamic Path Validation With Hidden Equal-Probability SamplingIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.323680618(1268-1282)Online publication date: 2023
https://doi.org/10.1109/TIFS.2023.3236806
Borges EBonella VSantos AMenegueti GDominicini CMartinello M(2023)In-situ Proof-of-Transit for Path-Aware Programmable Networks2023 IEEE 9th International Conference on Network Softwarization (NetSoft)10.1109/NetSoft57336.2023.10175482(170-177)Online publication date: 19-Jun-2023
https://doi.org/10.1109/NetSoft57336.2023.10175482
Jin WRavi SKline E(2022)Decentralized Privacy-Preserving Path Validation for Multi-Slicing-Authority 5G Networks2022 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC51071.2022.9771906(31-36)Online publication date: 10-Apr-2022
https://dl.acm.org/doi/10.1109/WCNC51071.2022.9771906
Xi SBu KMao WZhang XRen KRen X(2022)RuleOut Forwarding Anomalies for SDNIEEE/ACM Transactions on Networking10.1109/TNET.2022.3194970(1-13)Online publication date: 2022
https://doi.org/10.1109/TNET.2022.3194970
Chen WWang XWang XXu KGuo S(2022)LRVP: Lightweight Real-Time Verification of Intradomain Forwarding PathsIEEE Systems Journal10.1109/JSYST.2022.316582616:4(6309-6320)Online publication date: Dec-2022
https://doi.org/10.1109/JSYST.2022.3165826
Sengupta B(2022)VALNET: Privacy-preserving multi-path validationComputer Networks10.1016/j.comnet.2021.108695(108695)Online publication date: Jan-2022
https://doi.org/10.1016/j.comnet.2021.108695
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View Issue’s Table of Contents