Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Source selectable path diversity via routing deflections
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Achieving convergence-free routing using failure-carrying packets
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Pretty Good BGP: Improving BGP by Cautiously Adopting Routes
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
LIPSIN: line speed publish/subscribe inter-networking
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Dynamic route recomputation considered harmful
ACM SIGCOMM Computer Communication Review
Scalable Name Lookup in NDN Using Effective Name Component Encoding
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
INFORM: a dynamic interest forwarding mechanism for information centric networking
Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
Potential based routing as a secondary best-effort routing for Information Centric Networking (ICN)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.24 |
In Named Data Networking (NDN), packets carry data names instead of source and destination addresses. This paradigm shift leads to a new network forwarding plane: data consumers send Interest packets to request desired data, routers forward Interest packets and maintain the state of all pending Interests, which is then used to guide Data packets back to the consumers. Maintaining the pending Interest state, together with the two-way Interest and Data exchange, enables NDN routers'forwarding process to measure performance of different paths, quickly detect failures and retry alternative paths. In this paper we describe an initial design of NDN's forwarding plane and evaluate its data delivery performance under adverse conditions. Our results show that this stateful forwarding plane can successfully circumvent prefix hijackers, avoid failed links, and utilize multiple paths to mitigate congestion. We also compare NDN's performance with that of IP-based solutions to highlight the advantages of a stateful forwarding plane.