An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network

References

• Abou-Sayed M., Kennington J., Nair S. Joint working and spare capacity assignment in a link restorable mesh network. (1997) . Technical Report 96-CSE-16, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TXGoogle Scholar
• Chow C., Bicknell J., McCaughey S. A fast distributed network restoration algorithm. Internat. Phoenix Conf. Comput. Comm., Tempe, Arizona (1993) 1–7Google Scholar
• Chujo T., Komine H., Miyazaki K., Ogura T., Soejima T. Distributed self-healing network and its optimum spare-capacity assignment algorithm. Electronics Comm. Japan, Part 1 (1991) 74:1–8Crossref, Google Scholar
• Chvátal V.Linear Programming (1983) (W.H. Freeman and Company, New York, NY) Google Scholar
• Doverspike R., Wilson B. Comparison of capacity efficiency of DCS network restoration routing techniques. J. Network and Systems Management (1994) 2:95–123Crossref, Google Scholar
• Dunn D., Grover W., MacGregor M. Comparison of k-shortest paths and maximum flow routing for network facility restoration. IEEE J. Selected Areas in Comm. (1994) 12:88–99Crossref, Google Scholar
• Forrest J., Goldfarb D. Steepest-edge simplex algorithms for linear programming. Math. Programming (1992) 57:341–374Crossref, Google Scholar
• Grover W. Case studies of survivable ring mesh, and mesharc hybrid networks. Proc. IEEE Global Telecomm. Conf. Orlando, Florida (1992) 1:633–638Google Scholar
• Grover W., Bilodeau T., Venables B. Near optimal spare capacity in a mesh restorable network. Proc. IEEE Global Telecomm. Conf. Phoenix, Arizona (1991) 3:2007–2012Google Scholar
• Grover W., Slevinsky J., MacGregor M. Optimized design of ring-based survivable networks. Canadian J. Electrical and Comput. Engrg. (1995) 20:139–149Google Scholar
• Helgason R., Kennington J., Ball M., Magnanti T., Monma C., Nemhauser G. Primal simplex algorithms for minimum cost network flows. Handbooks in Operations Research and Management Science 7 (1995) (Elsevier Science B.V., Amsterdam, The Netherlands) 85–133Crossref, Google Scholar
• Herzberg M., Bye S. An optimal spare-capacity assignment model for survivable networks with hop limits. Proc. GLOBECOM '94 (1994) 3:1601–1606Google Scholar
• Herzberg M., Bye S., Utano A. The hop-limit approach for spare-capacity assignment in survivable networks. IEEE/ACM Trans. Networking (1995) 3:775–784Crossref, Google Scholar
• Iraschko R., MacGregor M., Grover W. Optimal capacity placement for path restoration in mesh survivable networks. Proc. 1996 IEEE Internat. Conf. Comm. (ICC '96) (1996) 1568–1574Crossref, Google Scholar
• Kennington J., Helgason R.Algorithms for Network Programming (1980) (John Wiley and Sons, Inc., New York, NY) Google Scholar
• Kennington J., Whitler J. Simplex versus cost scaling algorithms for pure networks: An empirical analysis. (1998) . Technical Report 96-CSE-8, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TXGoogle Scholar
• Lasdon L.Optimization Theory for Large Systems (1970) (The Macmillan Company, New York, NY) Google Scholar
• Murakami K., Kim H. Joint optimization of capacity and flow assignment for self-healing ATM networks. (1995) Proc. 1995 IEEE Internat. Conf. Comm.:216–220Crossref, Google Scholar
• Press W., Flannery B., Teukolsky S., Vetterling W.Numerical Recipes: The Art of Scientific Computing (FORTRAN Version) (1989) (Cambridge University Press, Cambridge, UK) Google Scholar
• Sakauchi H., Nishimura Y., Hasegawa S. A self-healing network with an economical spare-channel assignment. Proc. IEEE Global Telecomm. Conf. San Diego, California (1990) 1:438–443Google Scholar
• Slevinsky J., Grover W., MacGregor M. An algorithm for survivable network design employing multiple self-healing rings. Proc. GLOBECOM '93 (1993) 1568–1573Crossref, Google Scholar
• Tarjan R.Data Structures and Network Algorithms (1983) (Society for Industrial and Applied Mathematics, Philadelphia, PA) Crossref, Google Scholar
• Using the CPLEX Callable Library (1994) (CPLEX optimization, Inc., Incline Village, NVM) Google Scholar
• Weiss M.Data Structures and Algorithm Analysis in C (1993) (The Benjamin/Cummings Publishing Company Inc., Redwood City, CA) Google Scholar
• Whitler J. Telecommunications network design: Optimization models and efficient algorithms. Ph.D. Research Proposal (1995) (Southern Methodist University)Google Scholar
• Whitler J. Telecommunications network design: Optimization models and efficient algorithms. (1997) (Southern Methodist University). Ph.D. dissertationGoogle Scholar
• Wu T., Kobrinski H., Ghosal D., Lakshman T. The impact of SONET digital cross-connect system architecture on distributed restoration. IEEE J. Selected Areas Comm. (1994) 12:79–87Crossref, Google Scholar