Access the full text.
Sign up today, get DeepDyve free for 14 days.
Problem files are available at http://www.ee.ualberta.ca/~grover/ in association with the listing for this paper
M. Pickavet, P. Demeester (1999)
Long term planning of WDM networks: a comparison between single–period and multi–period techniquesPhotonic Network Communications, 1
장주욱 (2000)
[서평]「Wide Area Network Design : Concepts and Tools for Optimization」, 18
(1993)
Topological design of span-restorable mesh transport networks Special Issue on Topological Design of Telecommunication Networks, in press, 2001 able Networks
R. Kawamura, Ken-ichi Sato, I. Tokizawa (1994)
Self-healing ATM networks based on virtual path conceptIEEE J. Sel. Areas Commun., 12
(1978)
Designing reliable packet switched networks
R. Ahuja, T. Magnanti, J. Orlin (1993)
Network Flows: Theory, Algorithms, and Applications
B. Caenegem, W. Parys, F. Turck, P. Demeester (1998)
Dimensioning of survivable WDM networksIEEE J. Sel. Areas Commun., 16
B. Gavish (1990)
Backbone network design tools with economic tradeoffsORSA J. on Computing, 2
K. Murakami, H.S. Kim (1995)
Joint optimization of capacity and flow assignment for self-healing ATM networksProceedings IEEE International Conference on Communications ICC '95, 1
(2000)
Forcer-Clipping: A Principle for Economic Design of Ring-Mesh Hybrid Transport Networks
B. Venables, W. Grover, M. MacGregor (1993)
Two strategies for spare capacity placement in mesh restorable networksProceedings of ICC '93 - IEEE International Conference on Communications, 1
R. Iraschko, W. Grover (2000)
A highly efficient path-restoration protocol for management of optical network transport integrityIEEE Journal on Selected Areas in Communications, 18
see information on the Level(3) facilities-based network at www.Level3
W. Grover, R. Iraschko, Y. Zheng (1999)
Comparative Methods and Issues In Design of Mesh-Restorable STM and ATM Networks
B. Mukherjee (2000)
WDM optical communication networks: progress and challengesIEEE Journal on Selected Areas in Communications, 18
B. Gavish, K. Altinkemer (1990)
Backbone Network Design Tools with Economic TradeoffsINFORMS J. Comput., 2
B. Gavish (1991)
Topological design of telecommunication networks-local access design methodsAnnals of Operations Research, 33
B. Yaged (1971)
Minimum cost routing for static network modelsNetworks, 1
R.D. Doverspike, B. Wilson (1994)
Comparison of capacity efficiency of DCS network restoration routing techniquesJournal of Networks and System Management, 2
Y. Xiong, L.G. Mason (1999)
Restoration strategies and spare capacity requirements in self–healing ATM networksIEEE/ACM Transactions on Networking, 7
W. Grover, T. Bilodeau, B. Venables (1991)
Near optimal spare capacity planning in a mesh restorable networkIEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record
(2000)
Application of the dual Benders decomposition approach to the design of multilayer robust telecommunication networks
S. Aidarous, T. Plevyak (1994)
Distributed Restoration of the Transport Network
P. Soriano, Christelle Wynants, R. Séguin, M. Labbé, M. Gendreau, B. Fortz (1999)
Design and Dimensioning of Survivable SDH/Sonet Networks
F. Cruz, J. Smith, G. Mateus (1998)
Solving to optimality the uncapacitated fixed-charge network flow problemComput. Oper. Res., 25
D. Medhi, R. Khurana (1995)
Optimization and Performance of Network Restoration Schemes for Wide-Area Teletraffic NetworksJ. Netw. Syst. Manag., 3
J. Doucette, W. Grover (2000)
Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networksIEEE Journal on Selected Areas in Communications, 18
J. Doucette, W. Grover (2001)
Comparison of Mesh Protection and Restoration Schemes and the Dependency of Graph Connectivity
(2000)
Stochastic algorithms for thrifty single-failure-protected networks
M. Pickavet, P. Demeester (2000)
A Zoom-In Approach to Design SDH Mesh Restorable NetworksJournal of Heuristics, 6
D. Medhi (1994)
A unified approach to network survivability for teletraffic networks: models, algorithms and analysisIEEE Trans. Commun., 42
(1995)
A decomposition network expansion planning
(1998)
Pan-European multi-wavelength transport networks: network design, architecture, survivability and SDH networking
M. Gerla, J. Monteiro, Rodolfo Rangel (1989)
Topology design and bandwidth allocation in ATM netsIEEE J. Sel. Areas Commun., 7
J. Doucette, W.D. Grover (2000)
Influence of modularity and economy–of–scale effects on design of mesh–restorable DWDM networksIEEE JSAC Special Issue on Protocols and Architectures for Next Generation Optical WDM Networks, 18
B. Venables (1992)
Algorithms for the spare capacity design of mesh restorable networks
Y. Miyao, H. Saito (1998)
Optimal design and evaluation of survivable WDM transport networksIEEE J. Sel. Areas Commun., 16
B. Gendron, T. Crainic, A. Frangioni (1999)
Multicommodity Capacitated Network Design
M. Herzberg, S. Bye (1994)
An optimal spare-capacity assignment model for survivable networks with hop limits1994 IEEE GLOBECOM. Communications: The Global Bridge, 3
(1993)
The role of digital crossconnect systems in transport network survivability, SR-NWT-002514
W. Grover (1997)
Self-organizing broad-band transport networksProc. IEEE, 85
W. Grover, R. Martens (2000)
Optimized Design of Ring-Mesh Hybrid Networks
A. Kershenbaum (1993)
Telecommunications Network Design Algorithms
(1998)
Modelling and solving single and multiple facility restoration problems
Y. Zheng, W. Grover, M. MacGregor (1997)
BROADBAND NETWORK DESIGN WITH CONTROLLED EXPLOITATION OF FLOW CONVERGENCE OVERLOADS IN ATM VP-BASED RESTORATION
T. Chujo, H. Komine, K. Miyazaki, T. Ogura, T. Soejima (1991)
Distributed self‐healing network and its optimum spare‐capacity assignment algorithmElectronics and Communications in Japan Part I-communications, 74
W. Grover, V. Rawat, M. MacGregor (1997)
Fast heuristic principle for spare capacity placement in mesh-restorable SONET/SDH transport networksElectronics Letters, 33
Y. Xiong, L. Mason (1997)
Restoration strategies and spare capacity requirements in self-healing ATM networksProceedings of INFOCOM '97, 1
R. Iraschko, M. MacGregor, W. Grover (1998)
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networksIEEE/ACM Trans. Netw., 6
T. Robertazzi (1998)
Planning Telecommunication Networks
(1974)
A cut saturation algorithm for topological design of packet switched networks
J. Kennington, Mark Lewis (2001)
The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical AnalysisINFORMS J. Comput., 13
O. Gerstel, R. Ramaswami (2000)
Optical layer survivability-an implementation perspectiveIEEE Journal on Selected Areas in Communications, 18
H. Sakauchi, Y. Nishimura, S. Hasegawa (1990)
A self-healing network with an economical spare-channel assignment[Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition
W.D. Grover, D.Y. Li (1999)
The Forcer concept and express route planning in mesh survivable networksJournal of Network and Systems Management, 7
I. Lustig (2001)
Constraint Programming and Its Relationship to Mathematical Programming
A. Kershenbaum, P. Kermani, George Grover (1991)
MENTOR: an algorithm for mesh network topological optimization and routingIEEE Trans. Commun., 39
The advent of Sonet and DWDM mesh-restorable networks which contain explicit reservations of spare capacity for restoration presents a new problem in topological network design. On the one hand, the routing of working flows wants a sparse tree-like graph for minimization of the classic fixed charge plus routing (FCR) costs. On the other hand, restorability requires a closed (bi-connected) and preferably high-degree topology for efficient sharing of spare capacity allocations (SCA) for restoration over non-simultaneous failure scenarios. These diametrically opposed considerations underlie the determination of an optimum physical facilities graph for a broadband network provider. Standalone instances of each constituent problem are NP-hard. The full problem of simultaneously optimizing mesh-restorable topology, routing, and sparing is therefore very difficult computationally. Following a comprehensive survey of prior work on topological design problems, we provide a {1–0} MIP formulation for the complete mesh-restorable design problem and also propose a novel three-stage heuristic. The heuristic is based on the hypothesis that the union set of edges obtained from separate FCR and SCA sub-problems constitutes an effective topology space within which to solve a restricted instance of the full problem. Where fully optimal reference solutions are obtainable the heuristic shows less than 8% gaps but runs in minutes as opposed to days. In other test cases the reference problem cannot be solved to optimality and we can only report that heuristic results obtained in minutes are not improved upon by CPLEX running the full problem for 6 to 18 hours. The computational behavior we observe gives insight for further work based on an appreciation of the problem as embodying unexpectedly difficult feasibility apects, as well as optimality aspects.
Annals of Operations Research – Springer Journals
Published: Oct 19, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.