Designing low-capacity backup networks for fast restoration

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Banner, Ron ^a   Orda, Ariel ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Capacity assignment; Fast restoration; Network design; Preplanned span restoration

Indexed keywords

ARRIVAL PATTERNS; CAPACITY ASSIGNMENT; DESIGN REQUIREMENTS; EFFICIENT ALGORITHM; FAST RESTORATION; HOPCOUNT; NETWORK CONFIGURATION; PROPER DESIGN; SET-UP TIME; SPAN RESTORATION;

ALGORITHMS; DESIGN;

RESTORATION;

EID: 77953300333     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462007     Document Type: Conference Paper

References (19)

1. R. Banner and A. Orda, "Designing Low-Capacity Backup Networks for Fast Restoration", TR, EE Dept., Technion, Israel, July 2009. http://www.ee.technion.ac.il/Sites/People/ArielOrda/Info/Other/BO09.pdf
2. A. Charny and J. Y. LeBoudec, "Delay Bounds in a Network with Aggregate Scheduling", First International Workshop on Quality of Future Internet Services, Berlin Germany, Sept. 2000.
3. C. Charnsripinyo and D. Tipper, "Topological Design of 3G Wireless Backhaul Networks for Service Assurance", in Proc. IEEE DRCN, Oct. 2005, Ischia, Italy.
4. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On Power-law Relationships of the Internet Topology", in Proc. ACM SIGCOMM, Cambridge, MA, September 1999.
5. W. D. Grover, Mesh-based Survivable Networks: Options and Strategies for Optical , MPLS, and ATM Networking, Prentice Hall PTR, 2003.
6. W. D. Grover, and John Doucette, "Topological design of survivable mesh-based transport networks", Annals of Operations Research, vol. 106, pp. 79-125, 2001.
7. M. Herzberg, S. Bye, and A. Utano, "The Hop Limit Approach for Spare Capacity Assignment in Survivable Networks", IEEE/ACM Transactions on Networking, Vol 3., pp. 775-784, 1995.
8. S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot, "An approach to alleviate link overload as observed on an IP backbone", in Proc. IEEE INFOCOM, San Franciso, CA, USA, Mar. 2003.
9. N. Karmarkar, "A New Polynomial-Time Algorithm For Linear Programming", Combinatorica, vol. 4, pp. 373-395, 1984.
10. R. Krishnaswamy and K. N. Sivarajan, "Design of logical topologies: a linear formulation for wavelength-routed optical networks with no wavelength changers", IEEE/ACM Transactions on Networking, April 2001.
11. Y. Liu, D. Tipper and P. Siripongwutikorn, "Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing", IEEE/ACM Transactions on Networking, Feb. 2005.
12. A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C. N. Chuah and C. Diot, "Characterization of Failures in an IP Backbone", in Proc. IEEE INFOCOM, Hong-Kong, March 2004.
13. S. Nelakuditi and Zhi-Li Zhang, "On Selection of Paths for Multipath Routing", In proc. IWQoS, Karlsruhe, Germany, 2001.
14. A. Orda and A. Sprintson, "Efficient Algorithms for Computing Disjoint QoS Paths", in Proc. IEEE INFOCOM, Hong Kong, March 2004.
15. S. Orlowski and R. Wessaly, "Comparing Restoration Concepts Using Optimal Network Configurations and Integrated Hardware and Routing Decisions", Journal of Network and Systems Management, Vol. 13, No. 1,pp 99-118, March, 2005.
16. M. Pioro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks, Morgan Kauffman Publishers, San Francisco, CA, 2004
17. D. Thaler and C. Hopps, "Multipath Issues in Unicast and Multicast Next-Hop Selection", IETF RFC 2991, 2000.
18. B. M. Waxman, "Routing of Multipoint Connections", IEEE JSAC, 6:1617-1622,1988.
19. D. Xu, Y. Chen, Y. Xiong, C. Qiao, H. He, "On Finding Disjoint Paths in Single and Dual link Cost Networks", in Proc. IEEE INFOCOM, Hong-Kong, March 2004.