全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization in p-Cycle Networks

DOI: 10.1155/2012/546301

Full-Text   Cite this paper   Add to My Lib

Abstract:

p-cycle networks have attracted a considerable interest in the network survivability literature in recent years. However, most of the existing work assumes a known network topology upon which to apply p-cycle restoration. In the present work, we develop an incremental topology optimization ILP for p-cycle network design, where a known topology can be amended with new fibre links selected from a set of eligible spans. The ILP proves to be relatively easy to solve for small test case instances but becomes computationally intensive on larger networks. We then follow with a relaxation-based decomposition approach to overcome this challenge. The decomposition approach significantly reduces computational complexity of the problem, allowing the ILP to be solved in reasonable time with no statistically significant impact on solution optimality. 1. Introduction High-availability networks have become integral to our everyday lives, used for banking, financial transactions, voice and data communications, entertainment, and so forth. While much effort has been made to make them as reliable as possible, failures and, more critically, service outages still occur with alarming frequency. The vast majority of such failures are a result of fibre cuts, with most of those failures due to cable digups and similar construction accidents [1]. As the frequency of failures has increased, researchers have developed many approaches for ensuring survivability of the network even in the face of cable cuts or other equipment failures, including a number of mechanisms that allow the network to actively respond to a failure by rerouting affected traffic onto one or more backup routes. Survivability mechanisms are often thought of as being either restoration or protection [2]. Although the differences between the two are often blurred, and some mechanisms can be considered to be either type, the general idea is that restoration techniques are those in which a backup route is formed after failure, while protection techniques are those in which a backup route is formed before failure. Each individual survivability mechanism has its own advantages and disadvantages and requires differing amounts of spare capacity distributed throughout the network to accommodate backup routes. One particular protection mechanism that has received a lot of attention in recent years is -cycles [3, 4]. A p-cycle is a cyclic structure of preconfigured spare capacity, as illustrated in Figure 1, for example, where a six-span -cycle is shown in the leftmost panel. In the event of failure of an on-cycle span (a

References

[1]  W. Grover, Mesh-Based Survivable Networks, Prentice Hall, Upper Saddle River, NJ, USA, 2004.
[2]  J. Doucette, Advances on design and analysis of mesh-restorable networks [Ph.D. thesis], University of Alberta, Edmonton, Canada, December 2004.
[3]  D. Stamatelakis and W. D. Grover, “Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (“p-cycles”),” IEEE Transactions on Communications, vol. 48, no. 8, pp. 1262–1265, 2000.
[4]  D. Stamatelakis and W. D. Grover, “IP layer restoration and network planning based on virtual protection cycles,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, pp. 1938–1949, 2000.
[5]  H. Huang and J. Copeland, “Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection,” in Proceedings of the IEEE Workshop on High Performance Switching and Routing, pp. 31–35, May 2001.
[6]  H. Huang and J. A. Copeland, “A series of Hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience,” IEEE Communications Magazine, vol. 40, no. 11, pp. 46–51, 2002.
[7]  L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, and Y. Li, “Local and global hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Transactions on Communications, vol. 58, no. 3, pp. 851–859, 2010.
[8]  G. Shen and W. D. Grover, “Extending the p-cycle concept to path segment protection for span and node failure recovery,” IEEE Journal on Selected Areas in Communications, vol. 21, no. 8, pp. 1306–1319, 2003.
[9]  A. Kodian and W. D. Grover, “Failure-independent path-protecting p-cycles: efficient and simple fully preconnected optical-path protection,” IEEE Journal of Lightwave Technology, vol. 23, no. 10, pp. 3241–3259, 2005.
[10]  D. P. Onguetou and W. D. Grover, “A new approach to node-failure protection with span-protecting p-cycles,” in Proceedings of the 11th International Conference on Transparent Optical Networks (ICTON '09), July 2009.
[11]  H. Sakauchi, Y. Okanoue, and S. Hasegawa, “Spare-channel design schemes for self-healing networks,” IEICE Transactions on Communications, vol. 75, no. 7, pp. 624–633, 1992.
[12]  C. Wynants, Network Synthesis Problems, Combinatorial Optimization Series, Kluwer Academic Publishers, 2001.
[13]  R. R. Iraschko, M. H. MacGregor, and W. D. Grover, “Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks,” IEEE/ACM Transactions on Networking, vol. 6, no. 3, pp. 325–336, 1998.
[14]  J. Doucette and W. D. Grover, “Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, pp. 1912–1923, 2000.
[15]  J. Doucette, D. He, W. D. Grover, and O. Yang, “Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design,” in Proceedings of the Design of Reliable Communication Networks (DRCN '03), pp. 212–220, Banff, Canada, October 2003.
[16]  M. Herzberg and S. Bye, “An optimal spare-capacity assignment model for survivable networks with hop limits,” in IEEE Global Communications Conference (GlobeCom '94), pp. 1601–1607, San Francisco, Calif, USA, December 1994.
[17]  W. D. Grover and J. Doucette, “Topological design of span-restorable mesh transport networks,” Annals of Operations Research, vol. 106, no. 1–4, pp. 79–125, 2001.
[18]  A. Kershenbaum, Telecommunications Network Design Algorithms, McGraw-Hill, New York, NY, USA, 1993.
[19]  R. R. Boorstyn and H. Frank, “Large-scale network topological optimization,” IEEE Transactions on Communications, vol. 25, no. 1, pp. 29–47, 1977.
[20]  A. Z. Kasem and J. Doucette, “Incremental optical network topology optimization using meta-mesh span restoration,” in Proceedings of the Design of Reliable Communication Networks (DRCN '11), Krakow, Poland, October 2011.
[21]  H. Dirilten and R. W. Donaldson, “Topological design of distributed data communications networks using linear regression clustering,” IEEE Transactions on Communications, vol. 25, no. 10, pp. 1083–1092, 1977.
[22]  R. S. Cahn, Wide Area Network Design: Concepts and Tools for Optimization, Morgan Kaufman Publishers, San Francisco, Calif, USA, 1998.
[23]  D. A. Schupke, “An ILP for optimal p-cycle selection without cycle enumeration,” in Proceedings of the Optical Network Design and Modelling (ONDM '04), Ghent, Belgium, February 2004.
[24]  H. Li, B. Jaumard, and X. Fu, “Scalable design of p-cycles for node protection without candidate pre-enumeration,” in Proceedings of the International Conference on Multimedia Technology (ICMT '10), October 2010.
[25]  S. Rajagopalan, S. S. Heragu, and G. D. Taylor, “A Lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem,” Applied Mathematical Modelling, vol. 28, no. 8, pp. 735–750, 2004.
[26]  W. D. Grover and D. Stamatelakis, “Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration,” in Proceedings of the IEEE International Conference on Communications (ICC. Part 3 (of 3), pp. 537–543, June 1998.
[27]  R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, Duxbury Press, 2002.
[28]  ILOG, ILOG CPLEX 11.0 User’s Manual, ILOG, 2007.
[29]  B. Gendron, T. G. Crainic, and A. Frangioni, “Multicommodity capacitated net-work design,” in Telecommunications Network Planning, B. Sanso and P. Soriano, Eds., pp. 1–19, Kluwer Academic Publishers, 1999.
[30]  H.-J. Kim and J. N. Hooker, “Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach,” Annals of Operations Research, vol. 115, no. 1–4, pp. 95–124, 2002.
[31]  L. A. Wolsey, Integer Programming, Wiley-Interscience, Toronto, Canada, 1998.
[32]  M. Noor-E-Alam and J. Doucette, “Relax-and-fix decomposition technique for solving large scale grid-based location problems,” Computers & Industrial Engineering, vol. 63, no. 4, pp. 1062–1073, 2012.
[33]  D.-S. Chen, R. G. Baton, and Y. Dang, Applied Integer Programming, chapter 2, John Willey & Sons, 2010.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133