Abstract
In this paper, we discuss applications of max–min fairness (MMF) in survivable networks. We focus on two specific applications intended to face failure situations and provide several computational results for each of them. The first application, called simple robust routing, generalizes the multipath routing in order to achieve acceptable levels of traffic demand satisfaction in case of single link failures while avoiding classical rerouting procedures. Such a method can be seen as a special case of dedicated resource recovery schemes. The second application is concerned with two shared resource restoration strategies and the corresponding problems of computing the MMF minimum traffic demand satisfaction ratio vectors associated with the set of single link failures. We consider the local rerouting and end-to-end rerouting without stub-release strategies. Computational results for realistic network instances provide a comparison of different routing and rerouting strategies in terms of traffic satisfaction rate. The question of estimating the bandwidth overhead, which can be required by the “simple robust routing scheme” in comparison with the classical restoration schemes, is also studied and answers based on computational results are provided. This work is in continuation of our earlier works on MMF (Nace et al., IEEE Trans Netw 14:1272–1281, 2006; Nace et al., Comput Oper Res 35:557–573, 2008).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Grover WD (2003) Mesh-based survivable networks. Prentice Hall, Englewood Cliffs
Gruber C, Wessäly R, Orlowski S, Zymolka A, Koster AMCA (2005) A computational study for demand-wise shared protection. In: Proc. of international workshop on design of reliable communication networks (DRCN), Naples, October 2005, pp 421–428
Kleinberg J, Rabani Y, Tardos E (1999) Fairness in routing and load balancing. In: Proc. of 35th annual symposium on foundations of computer science, 17–19 October 1999, New York
Bashllari A, Nace D, Gourdin E, Klopfenstein O (2007) A simple robust routing scheme. In: DRCN’2007, 7–10 October 2007, La Rochelle
Nace D, Doan LN, Gourdin E, Liau B (2006) Computing optimal max-min fair resource allocation for TCP flows. IEEE Trans Netw 14(6):1272–1281 (December)
Nace D, Doan LN, Klopfenstein O, Bashllari A (2008) Max–min fairness in multi-commodity flows. Comput Oper Res 35(2):557–573 (February)
Nilsson P, Pioro M, Dziong Z (2003) Link protection within an existing backbone network. In: Proc. of INOC 2003, Evry-Paris, October 2003, pp 435–441
Pioro M, Medhi D (2007) Routing, flow and capacity design in communication and computer networks. Morgan Kaufmann, San Mateo
Radunovic B, Le Boudec J-Y (2007) A unified framework for max-min and min-max fairness with applications. IEEE/ACM Trans Netw 15(5):1073–1083 (October)
Pickavet M, Demeester P, Vasseur JPh (2005) Network recovery. Morgan Kaufmann, San Mateo
Wessäly R, Orlowski S, Zymolka A, Koster AMCA, Gruber C (2005) Demand-wise shared protection revisited: a new model for survivable network design. In: Proc. of international network optimization conference (INOC), Lisbon, March 2005, pp 100–105
Koster AMCA, Zymolka A, Jäger M, Hülsermann R, Gerlach C (2005) Demand-wise shared protection for meshed optical networks. J Netw Syst Manag 13(1):35–55
Acknowledgements
We wish to thank the anonymous referees for several suggestions that led to improvements in the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bashllari, A., Nace, D., Gourdin, E. et al. Max–min fair survivable networks. Ann. Telecommun. 63, 511–522 (2008). https://doi.org/10.1007/s12243-008-0048-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12243-008-0048-z