Abstract
In this paper, a novel SCMTO heuristic algorithm of establishing survivable connections in wide-area networks, that jointly optimizes the level of resource utilization as well as the time of connection restoration, is proposed. The algorithm is dedicated to multipriority traffic. Two service classes are assumed, referred to as low and high priority, respectively. Unlike typical optimization methods, SCMTO algorithm also guarantees fast service restoration by processing the high-priority connections with the author’s a posteriori optimization, based on the Largest-First graph coloring heuristics.
The algorithm was evaluated for the US Long-Distance Network. The results show that with only little capacity utilization degradation, fast restoration can be achieved. Compared to the results of the typical a priori optimization, the obtained average values of connection restoration time were up to 20% shorter (and even up to 41% for the high-priority traffic only). They were achieved together with reduction in resource utilization ratio up to 48%.
Presented solutions are dedicated to WDM-based high-performance optical communications network architectures.
This work is partially supported by the Ministry of Education and Science, Poland, under the grant 3 T11D 001 30.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)
Ellison, R.J., Fisher, D.A., Linger, R.C., Lipson, H.F., Longstaff, T., Mead, N.R.: Survivable Network Systems: An Emerging Discipline. Technical Report CMU/SEI 97 TR 013. Carnegie Mellon University, Software Engineering Institute (1997) (Rev. 1999)
Hauser, O., Kodialam, M., Lakshman, T.V.: Capacity Design of Fast Path Restorable Optical Networks. IEEE INFOCOM 2, 817–826 (2002)
Ho, P.-H., Tapolcai, J., Cinkler, T.: Segment Shared Protection in Mesh Communications Networks With Bandwidth Guaranteed Tunnels. IEEE/ACM Transactions on Networking 12(6), 1105–1118 (2004)
Kawamura, R.: Architectures for ATM Network Survivability. IEEE Communications Surveys 1(1), 2–11 (1998)
Kodialam, M., Lakshman, T.V.: Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels Using Aggregated Link Usage Information. IEEE INFOCOM, 376–385 (2001)
Kubale, M., et al.: Models and Methods of Graph Coloring. WNT (in Polish, 2002)
Mead, N.R., Ellison, R.J., Linger, R.C., Longstaff, T., McHugh, J.: Survivable Network Analysis Method. Technical Report CMU/SEI-2000-TR-013. Carnegie Mellon University, Software Engineering Institute (2000)
Mukherjee, B.: WDM Optical Communication Networks: Progress and Challenges. IEEE Journal on Selected Areas in Communications 18(10), 1810–1823 (2000)
Molisz, W.: Survivability Issues in IP-MPLS Networks. Systems Science 31(4), 87–106 (2005)
Molisz, W., Rak, J.: Region Protection/Restoration Scheme in Survivable Networks. In: Gorodetsky, V., Kotenko, I., Skormin, V.A. (eds.) MMM-ACNS 2005. LNCS, vol. 3685, pp. 442–447. Springer, Heidelberg (2005)
Qiao, C., et al.: Novel Models for Efficient Shared Path Protection. OFC, 545–547 (2002)
Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part I - Protection. IEEE INFOCOM, 744–751 (1999)
Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part II - Restoration. In: Proc. IEEE Integrated Circuits Conference, pp. 2023–2030 (1999)
Ramamurthy, S., Sahasrabuddhe, L., Mukherjee, B.: Survivable WDM Mesh Networks. IEEE Journal of Lightwave Technology 21(4), 870–883 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rak, J. (2006). Priority-Enabled Optimization of Resource Utilization in Fault-Tolerant Optical Transport Networks. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_89
Download citation
DOI: https://doi.org/10.1007/11847366_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39368-9
Online ISBN: 978-3-540-39372-6
eBook Packages: Computer ScienceComputer Science (R0)