Abstract
Providing fully distributed, fault tolerant, hop-by-hop routing is one of the key challenges for intra-domain IP networks. This can be achieved by storing two next-hops for each destination node in the forwarding table of the routers, and the packets are forwarded to primary next-hop (PNH), unless PNH is unreachable and secondary next-hop (SNH) is used instead. We follow the architecture by Kwong et al. in On the feasibility and efficacy of protection routing in IP networks, University of Pennsylvania (2010), where the routing tables are configured in a centralized way, while the forwarding and failure recovery is in a fully distributed way without relying on any encapsulation and signaling mechanisms for failure notification, to meet the standard IP forwarding paradigm. A network is protected if no single link of node failure results in forwarding loops. Kwong et al. (On the feasibility and efficacy of protection routing in IP networks, University of Pennsylvania 2010) conjectured that network node connectivity is not sufficient for a network to be protectable. In this paper we show that this conjecture is in contradiction with a conjuncture by Hasunuma (Discrete Math 234(1-3):149-157, 2001; in Graph-Theoretic Concepts in Computer Science, Springer, Berlin, pp. 235-245, 2002), and show that every four connected maximal planar graph and every underlying graph of a 2-connected line digraph has feasible protection routing.
| Original language | English |
|---|---|
| Pages (from-to) | 723-730 |
| Number of pages | 8 |
| Journal | Optimization Letters |
| Volume | 7 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2013 |
Fingerprint
Keywords
- IP Fast ReRoute (IPFRR)
- Node-connectivity
ASJC Scopus subject areas
- Control and Optimization
Cite this
Sufficient conditions for protection routing in IP networks. / Tapolcai, J.
In: Optimization Letters, Vol. 7, No. 4, 2013, p. 723-730.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Sufficient conditions for protection routing in IP networks
AU - Tapolcai, J.
PY - 2013
Y1 - 2013
N2 - Providing fully distributed, fault tolerant, hop-by-hop routing is one of the key challenges for intra-domain IP networks. This can be achieved by storing two next-hops for each destination node in the forwarding table of the routers, and the packets are forwarded to primary next-hop (PNH), unless PNH is unreachable and secondary next-hop (SNH) is used instead. We follow the architecture by Kwong et al. in On the feasibility and efficacy of protection routing in IP networks, University of Pennsylvania (2010), where the routing tables are configured in a centralized way, while the forwarding and failure recovery is in a fully distributed way without relying on any encapsulation and signaling mechanisms for failure notification, to meet the standard IP forwarding paradigm. A network is protected if no single link of node failure results in forwarding loops. Kwong et al. (On the feasibility and efficacy of protection routing in IP networks, University of Pennsylvania 2010) conjectured that network node connectivity is not sufficient for a network to be protectable. In this paper we show that this conjecture is in contradiction with a conjuncture by Hasunuma (Discrete Math 234(1-3):149-157, 2001; in Graph-Theoretic Concepts in Computer Science, Springer, Berlin, pp. 235-245, 2002), and show that every four connected maximal planar graph and every underlying graph of a 2-connected line digraph has feasible protection routing.
AB - Providing fully distributed, fault tolerant, hop-by-hop routing is one of the key challenges for intra-domain IP networks. This can be achieved by storing two next-hops for each destination node in the forwarding table of the routers, and the packets are forwarded to primary next-hop (PNH), unless PNH is unreachable and secondary next-hop (SNH) is used instead. We follow the architecture by Kwong et al. in On the feasibility and efficacy of protection routing in IP networks, University of Pennsylvania (2010), where the routing tables are configured in a centralized way, while the forwarding and failure recovery is in a fully distributed way without relying on any encapsulation and signaling mechanisms for failure notification, to meet the standard IP forwarding paradigm. A network is protected if no single link of node failure results in forwarding loops. Kwong et al. (On the feasibility and efficacy of protection routing in IP networks, University of Pennsylvania 2010) conjectured that network node connectivity is not sufficient for a network to be protectable. In this paper we show that this conjecture is in contradiction with a conjuncture by Hasunuma (Discrete Math 234(1-3):149-157, 2001; in Graph-Theoretic Concepts in Computer Science, Springer, Berlin, pp. 235-245, 2002), and show that every four connected maximal planar graph and every underlying graph of a 2-connected line digraph has feasible protection routing.
KW - IP Fast ReRoute (IPFRR)
KW - Node-connectivity
UR - http://www.scopus.com/inward/record.url?scp=84875426201&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875426201&partnerID=8YFLogxK
U2 - 10.1007/s11590-012-0455-y
DO - 10.1007/s11590-012-0455-y
M3 - Article
AN - SCOPUS:84875426201
VL - 7
SP - 723
EP - 730
JO - Optimization Letters
JF - Optimization Letters
SN - 1862-4472
IS - 4
ER -