The Experts below are selected from a list of 1602 Experts worldwide ranked by ideXlab platform

Koray Kökten - One of the best experts on this subject based on the ideXlab platform.

  • INFOCOM - On diagnosis of Forwarding Plane via static Forwarding rules in Software Defined Networks
    IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, 2014
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    Software Defined Networks (SDN) decouple the Forwarding and control Planes from each other. The control Plane is assumed to have a global knowledge of the underlying physical and/or logical network topology so that it can monitor, abstract and control the Forwarding Plane. In our paper, we present solutions that install an optimal or near-optimal (i.e., within 14% of the optimal) number of static Forwarding rules on switches/routers so that any controller can verify the topology connectivity and detect/locate link failures at data Plane speeds without relying on state updates from other controllers. Our upper bounds on performance indicate that sub-second link failure localization is possible even at data-center scale networks. For networks with hundreds or few thousand links, tens of milliseconds of latency is achievable.

  • On diagnosis of Forwarding Plane via static Forwarding rules in Software Defined Networks
    IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, 2014
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    Software Defined Networks (SDN) decouple the Forwarding and control Planes from each other. The control Plane is assumed to have a global knowledge of the underlying physical and/or logical network topology so that it can monitor, abstract and control the Forwarding Plane. When parts of the control Plane become unavailable or unreliable, individual controllers should still be able to monitor the Forwarding Plane and run diagnostics to take the correct routing actions. In our paper, we present solutions that install an optimal or near-optimal number of static Forwarding rules on switches/routers for any controller to be able to verify the topology connectivity and detect/locate link failures at data Plane speeds without relying on state updates from Forwarding Plane nodes and other controllers while requiring reachability to only one (arbitrary) Forwarding node. Our upper bounds on performance indicate that sub-second link failure localization is possible even at data-center scale networks. For networks with hundreds or few thousand links, tens of milliseconds of latency is achievable.

  • on diagnosis of Forwarding Plane via static Forwarding rules in software defined networks
    arXiv: Networking and Internet Architecture, 2013
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    Software Defined Networks (SDN) decouple the Forwarding and control Planes from each other. The control Plane is assumed to have a global knowledge of the underlying physical and/or logical network topology so that it can monitor, abstract and control the Forwarding Plane. In our paper, we present solutions that install an optimal or near-optimal (i.e., within 14% of the optimal) number of static Forwarding rules on switches/routers so that any controller can verify the topology connectivity and detect/locate link failures at data Plane speeds without relying on state updates from other controllers. Our upper bounds on performance indicate that sub-second link failure localization is possible even at data-center scale networks. For networks with hundreds or few thousand links, tens of milliseconds of latency is achievable.

  • verifying Forwarding Plane connectivity and locating link failures using static rules in software defined networks
    ACM Special Interest Group on Data Communication, 2013
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    We present efficient solutions that install static rules on the Forwarding elements such that network controllers use these rules to verify topology connectivity and locate link failures. For a Forwarding Plane with |E| links, we verify topology connectivity using ≤ 2|E| static rules and one control message. We guarantee locating at least one link failure using ≤ 6|E| static rules and ϴ(log(|E|)) control messages. We can also detect multiple link failures in a probabilistic sense.

  • HotSDN - Verifying Forwarding Plane connectivity and locating link failures using static rules in software defined networks
    Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking - HotSDN '13, 2013
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    We present efficient solutions that install static rules on the Forwarding elements such that network controllers use these rules to verify topology connectivity and locate link failures. For a Forwarding Plane with |E| links, we verify topology connectivity using ≤ 2|E| static rules and one control message. We guarantee locating at least one link failure using ≤ 6|E| static rules and ϴ(log(|E|)) control messages. We can also detect multiple link failures in a probabilistic sense.

Zhuo Li - One of the best experts on this subject based on the ideXlab platform.

  • learning tree neural network based index for ndn Forwarding Plane
    ACM Special Interest Group on Data Communication, 2019
    Co-Authors: Zhuo Li
    Abstract:

    Named Data Networking (NDN) is a recent promising future Internet architecture, which forwards packets based on the named data. To realize this paradigm, a quick enough index with high capacity for Forwarding processes has to be utilized in NDN Forwarding Plane. Unfortunately, all indexes proposed are based on the traditional data structures, which have to make a trade-off between the memory consumption and the lookup speed. In view of this, a neural network-based index, called Learning Tree, is proposed in NDN Forwarding Plane. Preliminary evaluations indicate that Learning Tree can minimize the memory consumption to 20% compared with traditional hash table and has a practicable high name lookup speed.

  • SIGCOMM Posters and Demos - Learning Tree: Neural Network-based Index for NDN Forwarding Plane
    Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos on - SIGCOMM Posters and Demos '19, 2019
    Co-Authors: Zhuo Li
    Abstract:

    Named Data Networking (NDN) is a recent promising future Internet architecture, which forwards packets based on the named data. To realize this paradigm, a quick enough index with high capacity for Forwarding processes has to be utilized in NDN Forwarding Plane. Unfortunately, all indexes proposed are based on the traditional data structures, which have to make a trade-off between the memory consumption and the lookup speed. In view of this, a neural network-based index, called Learning Tree, is proposed in NDN Forwarding Plane. Preliminary evaluations indicate that Learning Tree can minimize the memory consumption to 20% compared with traditional hash table and has a practicable high name lookup speed.

  • Packet Forwarding in Named Data Networking Requirements and Survey of Solutions
    IEEE Communications Surveys & Tutorials, 2019
    Co-Authors: Zhuo Li, Yaping Xu, Beichuan Zhang
    Abstract:

    Named Data Networking (NDN) is the most promising paradigm recently conceived for future Internet architectures, where communications are driven by content instead of host addresses. To realize this novel paradigm, three novel tables, namely Content Store, Pending Interest Table, and Forwarding Information Base, are utilized in NDN Forwarding Plane. Designing and evaluating the quick enough Forwarding Plane with high capacity is a major challenge within the overall NDN research area. Since NDN was proposed in 2010, there have been many efforts focusing on this challenge and a rich literature has been developed. Unfortunately, there is a lack of the comprehensive sketch about the requirements of NDN Forwarding Plane and the study on various schemes proposed. Focusing on the above insufficiency, this survey gives the complete requirements and compares all the schemes proposed for NDN Forwarding Plane based on the data structure utilized. In addition, the survey also discusses some issues, challenges, and directions in future research. It is considered that designing a novel data structure to meet all requirements of the Forwarding Plane and studying on a better structure of content store play important roles, while discussing the necessity of a unified index, combining with other contents in NDN research and implementing a unified benchmark are also required in this domain.

  • Hybrid wireless networks with FIB-based Named Data Networking
    Eurasip Journal on Wireless Communications and Networking, 2017
    Co-Authors: Zhuo Li, Yutong Chen
    Abstract:

    In Named Data Networking (NDN) architecture, packets carry data names rather than source or destination addresses. To realize this paradigm, each NDN router maintains three data structures CS, PIT, FIB in the Forwarding Plane. Designing a quick enough Forwarding Plane with high capacity is a major challenge within the overall NDN research area. In this paper, we present a novel implementation of FIB called MaFIB. The evaluations indicate that the excellent data structure and the efficient lookup algorithm of MaFIB can effectively reduce the memory cost and can accelerate the lookup process. Its outstanding performance in probability of false positive also makes MaFIB meet current network requirements.

Ulas¸ C. Kozat - One of the best experts on this subject based on the ideXlab platform.

  • INFOCOM - On diagnosis of Forwarding Plane via static Forwarding rules in Software Defined Networks
    IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, 2014
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    Software Defined Networks (SDN) decouple the Forwarding and control Planes from each other. The control Plane is assumed to have a global knowledge of the underlying physical and/or logical network topology so that it can monitor, abstract and control the Forwarding Plane. In our paper, we present solutions that install an optimal or near-optimal (i.e., within 14% of the optimal) number of static Forwarding rules on switches/routers so that any controller can verify the topology connectivity and detect/locate link failures at data Plane speeds without relying on state updates from other controllers. Our upper bounds on performance indicate that sub-second link failure localization is possible even at data-center scale networks. For networks with hundreds or few thousand links, tens of milliseconds of latency is achievable.

  • On diagnosis of Forwarding Plane via static Forwarding rules in Software Defined Networks
    IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, 2014
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    Software Defined Networks (SDN) decouple the Forwarding and control Planes from each other. The control Plane is assumed to have a global knowledge of the underlying physical and/or logical network topology so that it can monitor, abstract and control the Forwarding Plane. When parts of the control Plane become unavailable or unreliable, individual controllers should still be able to monitor the Forwarding Plane and run diagnostics to take the correct routing actions. In our paper, we present solutions that install an optimal or near-optimal number of static Forwarding rules on switches/routers for any controller to be able to verify the topology connectivity and detect/locate link failures at data Plane speeds without relying on state updates from Forwarding Plane nodes and other controllers while requiring reachability to only one (arbitrary) Forwarding node. Our upper bounds on performance indicate that sub-second link failure localization is possible even at data-center scale networks. For networks with hundreds or few thousand links, tens of milliseconds of latency is achievable.

  • on diagnosis of Forwarding Plane via static Forwarding rules in software defined networks
    arXiv: Networking and Internet Architecture, 2013
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    Software Defined Networks (SDN) decouple the Forwarding and control Planes from each other. The control Plane is assumed to have a global knowledge of the underlying physical and/or logical network topology so that it can monitor, abstract and control the Forwarding Plane. In our paper, we present solutions that install an optimal or near-optimal (i.e., within 14% of the optimal) number of static Forwarding rules on switches/routers so that any controller can verify the topology connectivity and detect/locate link failures at data Plane speeds without relying on state updates from other controllers. Our upper bounds on performance indicate that sub-second link failure localization is possible even at data-center scale networks. For networks with hundreds or few thousand links, tens of milliseconds of latency is achievable.

  • verifying Forwarding Plane connectivity and locating link failures using static rules in software defined networks
    ACM Special Interest Group on Data Communication, 2013
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    We present efficient solutions that install static rules on the Forwarding elements such that network controllers use these rules to verify topology connectivity and locate link failures. For a Forwarding Plane with |E| links, we verify topology connectivity using ≤ 2|E| static rules and one control message. We guarantee locating at least one link failure using ≤ 6|E| static rules and ϴ(log(|E|)) control messages. We can also detect multiple link failures in a probabilistic sense.

  • HotSDN - Verifying Forwarding Plane connectivity and locating link failures using static rules in software defined networks
    Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking - HotSDN '13, 2013
    Co-Authors: Ulas¸ C. Kozat, Guanfeng Liang, Koray Kökten
    Abstract:

    We present efficient solutions that install static rules on the Forwarding elements such that network controllers use these rules to verify topology connectivity and locate link failures. For a Forwarding Plane with |E| links, we verify topology connectivity using ≤ 2|E| static rules and one control message. We guarantee locating at least one link failure using ≤ 6|E| static rules and ϴ(log(|E|)) control messages. We can also detect multiple link failures in a probabilistic sense.

Beichuan Zhang - One of the best experts on this subject based on the ideXlab platform.

  • Packet Forwarding in Named Data Networking Requirements and Survey of Solutions
    IEEE Communications Surveys & Tutorials, 2019
    Co-Authors: Zhuo Li, Yaping Xu, Beichuan Zhang
    Abstract:

    Named Data Networking (NDN) is the most promising paradigm recently conceived for future Internet architectures, where communications are driven by content instead of host addresses. To realize this novel paradigm, three novel tables, namely Content Store, Pending Interest Table, and Forwarding Information Base, are utilized in NDN Forwarding Plane. Designing and evaluating the quick enough Forwarding Plane with high capacity is a major challenge within the overall NDN research area. Since NDN was proposed in 2010, there have been many efforts focusing on this challenge and a rich literature has been developed. Unfortunately, there is a lack of the comprehensive sketch about the requirements of NDN Forwarding Plane and the study on various schemes proposed. Focusing on the above insufficiency, this survey gives the complete requirements and compares all the schemes proposed for NDN Forwarding Plane based on the data structure utilized. In addition, the survey also discusses some issues, challenges, and directions in future research. It is considered that designing a novel data structure to meet all requirements of the Forwarding Plane and studying on a better structure of content store play important roles, while discussing the necessity of a unified index, combining with other contents in NDN research and implementing a unified benchmark are also required in this domain.

  • An experimental investigation of hyperbolic routing with a smart Forwarding Plane in NDN
    2016 IEEE ACM 24th International Symposium on Quality of Service (IWQoS), 2016
    Co-Authors: Vince Lehman, Beichuan Zhang, Lixia Zhang, Ashlesh Gawande, Rodrigo Aldecoa, Dmitri Krioukov, Lan Wang
    Abstract:

    Routing in NDN networks must scale in terms of Forwarding table size and routing protocol overhead. Hyperbolic routing (HR) presents a potential solution to address the routing scalability problem, because it does not use traditional Forwarding tables or exchange routing updates upon changes in network topologies. Although HR has the drawbacks of producing sub-optimal routes or local minima for some destinations, these issues can be mitigated by NDN's intelligent data Forwarding Plane. However, HR's viability still depends on both the quality of the routes HR provides and the overhead incurred at the Forwarding Plane due to HR's sub-optimal behavior. We designed a new Forwarding strategy called Adaptive Smoothed RTT-based Forwarding (ASF) to mitigate HR's sub-optimal path selection. This paper describes our experimental investigation into the packet delivery delay and overhead under HR as compared with Named-Data Link State Routing (NLSR), which calculates shortest paths. We run emulation experiments using various topologies with different failure scenarios, probing intervals, and maximum number of next hops for a name prefix. Our results show that HR's delay stretch has a median close to 1 and a 95th-percentile around or below 2, which does not grow with the network size. HR's message overhead in dynamic topologies is nearly independent of the network size, while NLSR's overhead grows polynomially at least. These results suggest that HR offers a more scalable routing solution with little impact on the optimality of routing paths.

  • IWQoS - An experimental investigation of hyperbolic routing with a smart Forwarding Plane in NDN
    2016 IEEE ACM 24th International Symposium on Quality of Service (IWQoS), 2016
    Co-Authors: Vince Lehman, Beichuan Zhang, Lixia Zhang, Ashlesh Gawande, Rodrigo Aldecoa, Dmitri Krioukov, Lan Wang
    Abstract:

    Routing in NDN networks must scale in terms of Forwarding table size and routing protocol overhead. Hyperbolic routing (HR) presents a potential solution to address the routing scalability problem, because it does not use traditional Forwarding tables or exchange routing updates upon changes in network topologies. Although HR has the drawbacks of producing sub-optimal routes or local minima for some destinations, these issues can be mitigated by NDN's intelligent data Forwarding Plane. However, HR's viability still depends on both the quality of the routes HR provides and the overhead incurred at the Forwarding Plane due to HR's sub-optimal behavior. We designed a new Forwarding strategy called Adaptive Smoothed RTT-based Forwarding (ASF) to mitigate HR's sub-optimal path selection. This paper describes our experimental investigation into the packet delivery delay and overhead under HR as compared with Named-Data Link State Routing (NLSR), which calculates shortest paths. We run emulation experiments using various topologies with different failure scenarios, probing intervals, and maximum number of next hops for a name prefix. Our results show that HR's delay stretch has a median close to 1 and a 95th-percentile around or below 2, which does not grow with the network size. HR's message overhead in dynamic topologies is nearly independent of the network size, while NLSR's overhead grows polynomially at least. These results suggest that HR offers a more scalable routing solution with little impact on the optimality of routing paths.

  • ICN - On the role of routing in named data networking
    Proceedings of the 1st international conference on Information-centric networking - INC '14, 2014
    Co-Authors: Cheng Yi, Beichuan Zhang, Alexander Afanasyev, Lan Wang, Jerald Paul Abraham, Lixia Zhang
    Abstract:

    A unique feature of Named Data Networking (NDN) is that its Forwarding Plane can detect and recover from network faults on its own, enabling each NDN router to handle network failures locally without relying on global routing convergence. This new feature prompts us to re-examine the role of routing in an NDN network: does it still need a routing protocol? If so, what impact may an intelligent Forwarding Plane have on the design and operation of NDN routing protocols? Through analysis and extensive simulations, we show that routing protocols remain highly beneficial in an NDN network. Routing disseminates initial topology and policy information as well as long-term changes in them, and computes the routing table to guide the Forwarding process. However, because the Forwarding Plane is capable of detecting and recovering from failures quickly, routing no longer needs to handle short-term churns in the network. Freeing routing protocols from short-term churns can greatly improve their scalability and stability, enabling NDN to use routing protocols that were previously viewed as unsuitable for real networks.

  • On the role of routing in named data networking
    Proceedings of the 1st international conference on Information-centric networking - INC '14, 2014
    Co-Authors: Cheng Yi, Jerald Abraham, Beichuan Zhang, Alexander Afanasyev, Lan Wang, Lixia Zhang
    Abstract:

    A unique feature of Named Data Networking (NDN) is that its Forwarding Plane can detect and recover from network faults on its own. Consequently, NDN routers are able to handle network failures locally without relying on global routing convergence. This fundamental change prompts us to rethink the role of routing in NDN networks: does it still need a routing protocol? If so, what impact may an intelligent Forwarding Plane have on the design and operation of NDN routing protocols? Through analysis and extensive simulations, we show that a routing protocol remains necessary in NDN networks. Routing disseminates initial topology and policy information as well as long-term changes in them, and computes the routing table to guide the Forwarding process. However, since the Forwarding Plane is capable of detecting failures and recovering quickly, routing no longer needs to handle short-term churns in the network. Freeing routing protocols from short-term churns can greatly improve their scalability and stability, enabling NDN to use routing protocols that were previously viewed as unsuitable for real networks.

Lixia Zhang - One of the best experts on this subject based on the ideXlab platform.

  • kite producer mobility support in named data networking
    Conference on Information-Centric Networking, 2018
    Co-Authors: Yu Zhang, Spyridon Mastorakis, Lixia Zhang
    Abstract:

    In Named Data Networking (NDN), mobility of data consumers is natively supported by the stateful Forwarding Plane. However, additional mechanisms are needed, so that requests for data can be forwarded toward a mobile data producer. In this paper, we present KITE, a trace-based producer mobility support that further exploits the stateful Forwarding Plane of NDN. KITE takes a soft-state approach to create a hop-by-hop path between a reachable rendezvous server and a mobile producer through authenticated Interest-Data exchanges. KITE is locator-free, transparent to data retrieval and routing, and abuse-proof. We show how KITE supports various mobile communication scenarios, and name-based rendezvous at the network layer. A KITE prototype is implemented and evaluated.

  • ICN - KITE: producer mobility support in named data networking
    Proceedings of the 5th ACM Conference on Information-Centric Networking, 2018
    Co-Authors: Yu Zhang, Spyridon Mastorakis, Lixia Zhang
    Abstract:

    In Named Data Networking (NDN), mobility of data consumers is natively supported by the stateful Forwarding Plane. However, additional mechanisms are needed, so that requests for data can be forwarded toward a mobile data producer. In this paper, we present KITE, a trace-based producer mobility support that further exploits the stateful Forwarding Plane of NDN. KITE takes a soft-state approach to create a hop-by-hop path between a reachable rendezvous server and a mobile producer through authenticated Interest-Data exchanges. KITE is locator-free, transparent to data retrieval and routing, and abuse-proof. We show how KITE supports various mobile communication scenarios, and name-based rendezvous at the network layer. A KITE prototype is implemented and evaluated.

  • An experimental investigation of hyperbolic routing with a smart Forwarding Plane in NDN
    2016 IEEE ACM 24th International Symposium on Quality of Service (IWQoS), 2016
    Co-Authors: Vince Lehman, Beichuan Zhang, Lixia Zhang, Ashlesh Gawande, Rodrigo Aldecoa, Dmitri Krioukov, Lan Wang
    Abstract:

    Routing in NDN networks must scale in terms of Forwarding table size and routing protocol overhead. Hyperbolic routing (HR) presents a potential solution to address the routing scalability problem, because it does not use traditional Forwarding tables or exchange routing updates upon changes in network topologies. Although HR has the drawbacks of producing sub-optimal routes or local minima for some destinations, these issues can be mitigated by NDN's intelligent data Forwarding Plane. However, HR's viability still depends on both the quality of the routes HR provides and the overhead incurred at the Forwarding Plane due to HR's sub-optimal behavior. We designed a new Forwarding strategy called Adaptive Smoothed RTT-based Forwarding (ASF) to mitigate HR's sub-optimal path selection. This paper describes our experimental investigation into the packet delivery delay and overhead under HR as compared with Named-Data Link State Routing (NLSR), which calculates shortest paths. We run emulation experiments using various topologies with different failure scenarios, probing intervals, and maximum number of next hops for a name prefix. Our results show that HR's delay stretch has a median close to 1 and a 95th-percentile around or below 2, which does not grow with the network size. HR's message overhead in dynamic topologies is nearly independent of the network size, while NLSR's overhead grows polynomially at least. These results suggest that HR offers a more scalable routing solution with little impact on the optimality of routing paths.

  • IWQoS - An experimental investigation of hyperbolic routing with a smart Forwarding Plane in NDN
    2016 IEEE ACM 24th International Symposium on Quality of Service (IWQoS), 2016
    Co-Authors: Vince Lehman, Beichuan Zhang, Lixia Zhang, Ashlesh Gawande, Rodrigo Aldecoa, Dmitri Krioukov, Lan Wang
    Abstract:

    Routing in NDN networks must scale in terms of Forwarding table size and routing protocol overhead. Hyperbolic routing (HR) presents a potential solution to address the routing scalability problem, because it does not use traditional Forwarding tables or exchange routing updates upon changes in network topologies. Although HR has the drawbacks of producing sub-optimal routes or local minima for some destinations, these issues can be mitigated by NDN's intelligent data Forwarding Plane. However, HR's viability still depends on both the quality of the routes HR provides and the overhead incurred at the Forwarding Plane due to HR's sub-optimal behavior. We designed a new Forwarding strategy called Adaptive Smoothed RTT-based Forwarding (ASF) to mitigate HR's sub-optimal path selection. This paper describes our experimental investigation into the packet delivery delay and overhead under HR as compared with Named-Data Link State Routing (NLSR), which calculates shortest paths. We run emulation experiments using various topologies with different failure scenarios, probing intervals, and maximum number of next hops for a name prefix. Our results show that HR's delay stretch has a median close to 1 and a 95th-percentile around or below 2, which does not grow with the network size. HR's message overhead in dynamic topologies is nearly independent of the network size, while NLSR's overhead grows polynomially at least. These results suggest that HR offers a more scalable routing solution with little impact on the optimality of routing paths.

  • ICN - On the role of routing in named data networking
    Proceedings of the 1st international conference on Information-centric networking - INC '14, 2014
    Co-Authors: Cheng Yi, Beichuan Zhang, Alexander Afanasyev, Lan Wang, Jerald Paul Abraham, Lixia Zhang
    Abstract:

    A unique feature of Named Data Networking (NDN) is that its Forwarding Plane can detect and recover from network faults on its own, enabling each NDN router to handle network failures locally without relying on global routing convergence. This new feature prompts us to re-examine the role of routing in an NDN network: does it still need a routing protocol? If so, what impact may an intelligent Forwarding Plane have on the design and operation of NDN routing protocols? Through analysis and extensive simulations, we show that routing protocols remain highly beneficial in an NDN network. Routing disseminates initial topology and policy information as well as long-term changes in them, and computes the routing table to guide the Forwarding process. However, because the Forwarding Plane is capable of detecting and recovering from failures quickly, routing no longer needs to handle short-term churns in the network. Freeing routing protocols from short-term churns can greatly improve their scalability and stability, enabling NDN to use routing protocols that were previously viewed as unsuitable for real networks.