CONFIGURING BOTH BACKBONE AND LOGICAL NETWORKS OF A RECONFIGURABLE NETWORK WITH LINK FAILURES ALLOWED

References

• Bazaraa , M. S. and Goode , J. J. ( 1979 ) A survey of various tactics for generating Lagrangean multipliers in the context of Lagrangean duality . European Journal of Operational Research , 3 , 322 – 338 .
   Google Scholar
• Bellamy , J. C. ( 1982 ) Digital Telephony . New York , Wiley .
   Google Scholar
• Camerini , P. M. Fratta , L. and Naffioli , F. ( 1975 ) On improving relaxation methods by modified gradient techniques . Mathematical Programming Study , 3 , 26 – 34 .
   Google Scholar
• Collins , A. A. and Pederson , R. D. ( 1973 ) Telecommunications A Time for Innovation . Merle collins Foundation , Dallas , Texas .
   Google Scholar
• Fleischman , J. S. and Proctor , P. E. ( 1988 ) Operations planning for infbrmatin age . IEEE Journal on Selected Areas in Communications , 6 ,( 4 ) 633 – 640 .
   Google Scholar
• Gavish , B. ( 1982 ) Topological design of centralized computer networks formulations and algorithms . Networks , 12 , 355 – 377 .
   Web of Science ®Google Scholar
• Gavish , B. and Neuman , I. ( 1992 ) Routing in a network with unreliable components . IEEE Transactions on Communications , 40 ( 7 ), 1248 – 1258 .
   Web of Science ®Google Scholar
• Gavish , B. and Pirkul , H. ( 1985 ) Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality . Mathematical Programming , 31 , 78 – 105 .
   Web of Science ®Google Scholar
• Gavish , B. , Trudeau , P. , Dror , M. , Gendreau , M. and Mason , L. ( 1989 ) Fiberoptic circuit network design under reliability constraints . IEEE Journal on Selected Areas in Communications , 7 ( 8 ), 1181 – 1187 .
   Web of Science ®Google Scholar
• Geoffrion , A. M. ( 1974 ) Lagrangian relaxation and Its uses in integer programming . Mathematical Programming Study , 2 , 82 – 114 .
   Google Scholar
• Gerla , M. Monteiro , J. A. S. and Pazos , R. ( 1989 ) Topology design and bandwidth allocation in ATM Nets , IEEE Journal on Selected Areas in Communications , 7 , 1253 – 1262 .
   Web of Science ®Google Scholar
• Ghosh , D. and Mitra , S. ( 1992 ) Configuring express pipes in emerging telecommunication networks . Working paper .
   Google Scholar
• Gopal , G. , Kim , C. K. and Weinrib , A. ( 1990 ) Dynamic network configuration management . Proceedings of IEEE ICC'90 , 250 – 301 .
   Google Scholar
• Gopal , G. , Kim , C. K. and Weinrib , A. ( 1991 ) Algorithms for reconfigurable networks . 13th International Telelraffic Congress , 341 – 347 .
   Google Scholar
• Gould , E. P. and Pack , C. D. ( 1987 ) Communications network planning in the evolving information age . IEEE Communications Magazine , 25 ( 9 ), 22 – 30 .
   Google Scholar
• Harris , R. J. ( 1994 ) Reliable design of communication networks . 14th International Telelraffic Congress , 1331 – 1340 .
   Google Scholar
• Held , M. and Karp , R. M. ( 1970 ) The travelling salesman problem and minimum spanning trees . Operations Research , 18 , 1138 – 1162 .
   Web of Science ®Google Scholar
• Held , M. , Wolfe , P. and Crowder , H. ( 1974 ) Validation of subgradient optimization . Mathematical Programming , 6 , 62 – 88 .
   Google Scholar
• Jagerman , D. L. ( 1984 ) Methods in traffic calculations . AT&T Bell Labs Technical Journal , 63 ( 7 ), 1283 – 1310 .
   Google Scholar
• Jagers , A. A. and Doom , E. A. V. ( 1986 ) On the continued Erlang loss function . Operations Research Letters , 5 , 43 – 46 .
   Web of Science ®Google Scholar
• Krishnan , K. R. ( 1990 ) The convexity of loss rate in an Erlang loss system and sojourn in an Erlang delay system with respect to arrival and service rates . IEEE Transactions on Communications , 38 , 1314 – 1316 .
   Google Scholar
• Lai , M. K. F. and Berry , P. E. ( 1992 ) Reliability of high-speed networks . Australian Telecommunications Research , 26 ,( 2 ), 39 – 54 .
   Google Scholar
• Lee , M. J. and Yee , J. R. ( 1989 ) An efficient near-optimal algorithm for the joint traffic and trunk routing problem in self-planning networks . Proceedings of IEEE INFOCOM'89 , 127 – 135 .
   Google Scholar
• Lee , M. J. and Yee , J. R. ( 1991 ) A partial branch-and-bound design algorithm for reconfigurable networks . Proceedings of IEEE ICC'91 , 682 – 686 .
   Google Scholar
• Lee , M. J. and Yee , J. R. ( 1993 ). A design algorithm for reconfigurable ATM networks . Proceedings of IEEE INFOCOM'93 , 144 – 151 .
   Google Scholar
• Li V. O. K. and Silvester , J. A. (1984) Performance analysis of network with unreliable components . IEEE Transactions on Communications , 32 ,( 10 ), 1105 – 1110 .
   Google Scholar
• Medhi , D. ( 1995 ) Multi-hour, multi-traffic class network design for VP-based wide-area dynamically reconfigurable ATM networks . Proceedings of IEEE 1NFOCOM'95 , p900–907 p.
   Google Scholar
• Mirzaian , A. ( 1985 ) Lagrangean relaxation Tor the star-star concentrator location problem approximation algorithm and bounds . Networks , 15 , p1–20 p.
   Google Scholar
• Nemhauser , G. and Wolsey , L. ( 1988 ) Integer and Combinatorial Optimization , John Wiley & Sons .
   Google Scholar
• Pazos-Rangel , R. A. and Gerla , M. ( 1982 ) Express pipe networks . Proceedings of Global Telecommunication Conference , p293–297 p.
   Google Scholar
• Sanso , B. , Gendreau , M. and Soumis , F. ( 1992 ) An algorithm for network dimensioning under reliability considerations . Annals of Operations Research , 36 , p263–274 p.
   Google Scholar
• Shinha , P. and Zoltners , A. A. ( 1979 ) The multiple choice knapsack problem . Operations Research , 3 , 503 – 515 .
   Google Scholar
• Sung , C. S. and Lee , K. B. ( 1995 ) A routing algorithm for virtual circuit data networks with unreliable links . Engineering Optimization , 24 ,( 2 ), 119 – 136 .
   Web of Science ®Google Scholar
• Sung , C. S. Park , S. K. An algorithm for configuring embedded networks in reconfigurable telecom¬munication networks . Telecommunication Systems , ( to appear ).
   Google Scholar