Article

On the feasibility and efficacy of protection routing in IP networks

Authors:

Zhi-Li ZhangAuthors Info & Claims

INFOCOM'10: Proceedings of the 29th conference on Information communications

Pages 1235 - 1243

Published: 14 March 2010 Publication History

Abstract

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options can be activated, while waiting for an update from the centralized server after the failure of an individual component (link or node). We provide analytical insight into the feasibility of such backups as a function of network structure, and quantify their computational complexity. We also develop an efficient heuristic reconciling protectability and performance, and demonstrate its effectiveness in a broad range of scenarios. The results should facilitate deployments of centralized routing solutions.

References

[1]

A. Atlas and A. Zinin, "Basic specification for IP fast reroute: Loop-free alternates," IETF RFC 5286, September 2008.

[2]

A.-L. Barab�si and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, October 1999.

[3]

R. Diestel, Graph Theory, 3rd ed. Springer, 2005.

[4]

N. Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and J. van der Merwe, "The case for separating routing from routers," in Proc. ACM SIGCOMM FDNA workshop, 2004.

Digital Library

[5]

B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. IEEE INFOCOM, 2000.

[6]

A. Greenberg, G. Hjalmtysson, D. A. Maltz, A. Myers, J. Rexford, G. Xie, H. Yan, J. Zhan, and H. Zhang, "A clean slate 4D approach to network control and management," ACM SIGCOMM Computer Communication Review, vol. 35, no. 5, October 2005.

Digital Library

[7]

A. Kvalbein, A. F. Hansen, T. Cicic, S. Gjessing, and O. Lysne, "Fast IP network recovery using multiple routing configurations," in Proc. IEEE INFOCOM, 2006.

[8]

K.-W. Kwong, R. Gu�rin, A. Shaikh, and S. Tao, "Improving service differentiation in IP networks through dual topology routing," in Proc. ACM CoNEXT, 2007.

Digital Library

[9]

K.-W. Kwong, L. Gao, R. Gu�rin, and Z.-L. Zhang, "On the feasibility and efficacy of protection routing in IP networks," University of Pennsylvania, Tech. Rep., July 2009.

[10]

K. Lakshminarayanan, M. Caesar, M. Rangan, T. Anderson, S. Shenker, and I. Stoica, "Achieving convergence-free routing using failure-carrying packets," in Proc. ACM SIGCOMM, 2007.

Digital Library

[11]

A. Nucci, S. Bhattacharyya, N. Taft, and C. Diot, "IGP link weight assignment for operational Tier-1 backbones," IEEE/ACM Transactions on Networking, vol. 15, no. 4, pp. 789-802, August 2007.

Digital Library

[12]

Y. Ohara, S. Imahori, and R. V. Meter, "MARA: Maximum alternative routing algorithm," in Proc. IEEE INFOCOM, 2009.

[13]

H. Peterson, S. Sen, J. Chandrashekar, L. Gao, R. Gu�rin, and Z.- L. Zhang, "Message-efficient dissemination for loop-free centralized routing," ACM SIGCOMM Comp. Comm. Rev., vol. 38, no. 3, July 2008.

Digital Library

[14]

S. Ray, R. Gu�rin, K.-W. Kwong, and R. Sofia, "Always acyclic distributed path computation," To appear in IEEE/ACM Transactions on Networking, 2009.

[15]

C. Reichert, Y. Glickmann, and T. Magedanz, "Two routing algorithms for failure protection in IP networks," in Proc. ISCC, 2005.

Digital Library

[16]

C. Reichert and T. Magedanz, "Topology requirements for resilient IP networks," in Proc. 12th GI/ITG Conf. on Meas., Mod. & Eval. of Comp. & Comm. Sys, 2004.

[17]

Rocketfuel project. {Online}. Available: www.cs.washington.edu/ research/networking/rocketfuel

[18]

G. Schollmeier, J. Charzinski, A. Kirst�dter, C. Reichert, K. Schrodi, Y. Glickman, and C. Winkler, "Improving the resilience in IP networks," in Proc. HPSR, 2003.

[19]

M. Shand and S. Bryant, "IP fast reroute framework," Internet Draft, June 2009, (work in progress).

[20]

M. Shand, S. Bryant, and S. Previdi, "IP fast reroute using Not-Via addresses," Internet draft, July 2009, (work in progress).

[21]

H. Yan, D. A. Maltz, T. S. E. Ng, H. Gogineni, H. Zhang, and Z. Cai, "Tesseract: A 4D network control plane," in Proc. NSDI, 2007.

Digital Library

[22]

Z. Zhong, S. Nelakuditi, Y. Yu, S. Lee, J. Wang, and C.-N. Chuah, "Failure inferencing based fast rerouting for handling transient link and node failures," in Proc. IEEE Global Internet, 2005.

Cited By

Pai KChang J(2019)Dual-CISTsIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2019.291001927:3(1112-1123)Online publication date: 15-Jul-2019
https://dl.acm.org/doi/10.1109/TNET.2019.2910019
Ramadan EMekky HDumba BZhang Z(2016)Adaptive resilient routing via preorders in SDNProceedings of the 4th Workshop on Distributed Cloud Computing10.1145/2955193.2955204(1-6)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2955193.2955204
Tseng PChung W(2012)Joint coverage and link utilization for fast IP local protectionComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2012.06.01756:15(3385-3400)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1016/j.comnet.2012.06.017
Show More Cited By

Index Terms

On the feasibility and efficacy of protection routing in IP networks
1. Networks
  1. Network protocols

Recommendations

Dynamics of hot-potato routing in IP networks

Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, ...
Dynamics of hot-potato routing in IP networks
SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems

Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, ...
On the feasibility and efficacy of protection routing in IP networks

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures and rekindled interest in centralized ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

INFOCOM'10: Proceedings of the 29th conference on Information communications

March 2010

2990 pages

ISBN:9781424458363

Publisher

IEEE Press

Publication History

Published: 14 March 2010

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Pai KChang J(2019)Dual-CISTsIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2019.291001927:3(1112-1123)Online publication date: 15-Jul-2019
https://dl.acm.org/doi/10.1109/TNET.2019.2910019
Ramadan EMekky HDumba BZhang Z(2016)Adaptive resilient routing via preorders in SDNProceedings of the 4th Workshop on Distributed Cloud Computing10.1145/2955193.2955204(1-6)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2955193.2955204
Tseng PChung W(2012)Joint coverage and link utilization for fast IP local protectionComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2012.06.01756:15(3385-3400)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1016/j.comnet.2012.06.017
Xu MYang YLi Q(2012)Selecting shorter alternate paths for tunnel-based IP Fast ReRoute in linear timeComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2011.11.00656:2(845-857)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1016/j.comnet.2011.11.006
M�rindol PDonnet BBonaventure OPansiot JAllman M(2010)On the impact of layer-2 on node degree distributionProceedings of the 10th ACM SIGCOMM conference on Internet measurement10.1145/1879141.1879164(179-191)Online publication date: 1-Nov-2010
https://dl.acm.org/doi/10.1145/1879141.1879164

View Options

View options

Get Access

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 Publication

Media

Figures

Other

Tables

View Table of Contents