Tunable QoS-aware network survivability

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 944-952

  Yallouz, Jose ^a   Orda, Ariel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

END-TO-END QOS PERFORMANCE; EXTENSIVE SIMULATIONS; NETWORK DESIGN PROBLEMS; NETWORK SURVIVABILITY; OPTIMAL SOLUTIONS; QUANTITATIVE MEASURES; TRADITIONAL APPROACHES; TUNABLE SURVIVABILITY;

COMPLEX NETWORKS;

QUALITY OF SERVICE;

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

References (21)

1. C. R. and Cole, 100-gb/s and beyond transceiver technologies, Optical Fiber Technology, vol. 17, no. 5, pp. 472-479, 2011.
2. N. Sprecher and A. Farrel, MPLS Transport Profile (MPLS-TP) Survivability Framework, RFC 6372, Sep. 2011.
3. A. Askarian et al., Protection and restoration from link failures in DWDM networks: A cross-layer study, in IEEE ICC, 2008.
4. R. Banner and A. Orda, Designing low-capacity backup networks for fast restoration, in IEEE Infocom, 2010.
5. P. Heegaard and K. Trivedi, Network survivability modeling, Computer Networks, vol. 53, no. 8, pp. 1215-1234, 2009.
6. J. Tapolcai et al., On monitoring and failure localization in mesh alloptical networks, in IEEE Infocom, 2009.
7. R. Banner and A. Orda, The power of tuning: A novel approach for the efficient design of survivable networks, IEEE/ACM Trans. Networking, vol. 15, no. 4, pp. 737-749, aug. 2007.
8. A. Fumagalli and M. Tacca, Optimal design of optical ring networks with differentiated reliability (dir), in QoS-IP, 2001.
9. D. Xu et al., On the complexity of and algorithms for finding the shortest path with a disjoint counterpart, IEEE/ACM Transactions on Networking, vol. 14, no. 1, pp. 147-158, 2006.
10. C. Li et al., The complexity of finding two disjoint paths with min-max objective function, Discrete Applied Mathematics, vol. 26, no. 1, pp. 105-115, 1990.
11. J. W. Suurballe and R. E. Tarjan, A quick method for finding shortest pairs of disjoint paths, Networks, vol. 14, no. 2, pp. 325-336, 1984.
12. A. Sprintson et al., Reliable routing with qos guarantees for multidomain ip/mpls networks, in IEEE Infocom, 2007.
13. J. Yallouz and A. Orda, Tunable QoS-Aware network survivability, Comnet, Technion, Israel, Tech. Rep., 2012. [Online]. Available: http://www.ee.technion. ac.il/Sites/People/ArielOrda/Info/Other/YO12.pdf
14. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman &Co., 1979.
15. H. Joksch, The shortest route problem with constraints, Journal of Mathematical analysis and applications, vol. 14, pp. 191-197, 1966.
16. D. H. Lorenz and D. Raz, A simple efficient approximation scheme for the restricted shortest path problem, Operations Research Letters, vol. 28, no. 5, pp. 213-219, 2001.
17. M. Fredman and R. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. of the ACM, vol. 34, no. 3, pp. 596-615, 1987.
18. L. Braunstein et al., Optimal paths in disordered complex networks, Physical review letters, vol. 91, no. 16, p. 168701, 2003.
19. M. Faloutsos et al., On power-law relationships of the internet topology, in ACM SIGCOMM, 1999.
20. B. Waxman, Routing of multipoint connections, IEEE JSAC, vol. 6, no. 9, pp. 1617-1622, 1988.
21. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.