Optimization in telecommunication networks

Statistica Neerlandica

Volumn 59, Issue 2, 2005, Pages 180-205

  Van Hoesel, Stan ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Grooming; Multi commodity flow; Network design; Optical network; Routing, wavelength assignment

Indexed keywords

EID: 18844368027     PISSN: 00390402     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-9574.2005.00286.x     Document Type: Article

References (73)

1. AARDAL, K. I., C. P. M. VAN HOESEL, A. M. C. A. KOSTER, C. MANNING and A. SASSANO (2003), Models and Solution Techniques for the Frequency Assignment Problem, 4OR 1, 261-317.
2. ABRACHE, J., T. G. CRAINIC and M. GENDREAU (2004), Design issues for combinatorial auctions, 40R 2, 1-33.
3. ASSAD, A. (1978), Multicommoditiy network flows - a survey, Networks 8, 37-91.
4. ATAMTURK, A. and D. RAJAN (2002a), On capacitated network design cut-set polyhedra, Mathematical Programming 92, 425-437.
5. ATAMTURK, A. and D. RAJAN (2002b), On Splittable and Unsplittable Capacitated Network Design Arc-Set Polyhedra, Mathematical Programming 92, 315-333.
6. AULETTA, V., I. CARAGIANNIS, L. GARGANO, C. KAKLAMANIS and P. PERSIANO (2001), Sparse and limited wavelength conversion in all-optical tree networks, Theoretical Computer Science 266, 887-934.
7. BATTITI, R. and M. BRUNATO (2001), Reactive Search for Traffic Grooming in WDM Networks, Lecture Notes in Computer Science 2170, 56-64.
8. BAUER, P. (1997), The circuit polytope: facets, Mathematics of Operations Research 22, 140-145.
9. BIENSTOCK, D. and O. GÜNLÜK (1996), Capacitated network design - polyhedral structure and computation, INFORMS journal on Computing 8, 243-259.
10. BOUHTOU, M., S. VAN HOESEL, A. VAN DER KRAAIJ and J. LUTTON (2002), Linear Tarification in Multi - Commodity Telecommunications Networks, Technical Report METEOR Research Memorandum 02-012, University Maastricht.
11. BRUNATO, M. and R. BATTITI (2002), A multistart randomized greedy algorithm for traffic grooming on mesh logical topologies, in: Proceedings of the 6th IFIP ON DM, Torino, Italy, February 2002.
12. BRUNETTA, L., M. CONFORTI and M. FISCHETTI (2000), A polyhedral approach to an integer multicommodity flow problem, Discrete Applied Mathematics 101, 13-36.
13. CALINESCU, G. and P.-J. WAN (2002), Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs, Journal of Combinatorial Optimization 6, 425-453.
14. CARAGIANNIS, I., C. KAKLAMANIS and P. PERSIANO (2001), Wavelength Routing in All-Optical Tree Networks: A Survey, Computers and Informatics 20, 95-120.
15. CHOW, T. and P. LIN (2004), The Ring Grooming Problem, Networks 44, 194-202.
16. COSARES, S. and I. SANIEE (1994), An optimization problem related to balancing loads on SONET rings, Telecommunications Systems 3, 165-181.
17. CROVELLA, M. E. and A. BESTAVROS (1977), Self-similarity in World Wide Web traffic: Evidence and possible cause, IEEE/ACM Transactions on Networking 6, 835-846.
18. DELL'AMICO, M., M. LABBÉ and F. MAFFIOLI (1999), Exact Solution of the SONET Ring Loading Problem, Operations Research Letters 25, 119-129.
19. DUTTA, R., S. HUANG and G. N. ROUSKAS (2003), Traffic Grooming in Path, Star and Tree Networks: Complexity, Bounds and Algorithms, in: Proceedings of ACM SIGMETRICS 2003, 298-299, June 10-14, 2003, San Diego, CA, (short paper).
20. ERLANG, A. K. (1909), The Theory of Probabilities and Telephone Conversations, Nyt Tid-sskriftfor Matematik B 20.
21. ERLANG, A. K. (1917), Solution of some Problems in the Theory of Probabilities of Significance in Automatic Telephone Exchanges, Elektrotkeknikeren 13.
22. ERLEBACH, T. and K. JANSEN (2001), The Complexity of Path Coloring and Call Scheduling, Theoretical Computer Science 255, 119-137.
23. ERLEBACH, T. and S. STEFANAKOS (2002a), On Shortest Path All-Optical Networks without Wavelength Conversion Requirements, Tik report 153, Institut für Technische Informatik und Kommunikationsnetze, ETH Zurich.
24. ERLEBACH, T. and S. STEFANAKOS (2002b), Wavelength Conversion in Networks with Bounded Treewidth, Tik report 132, Institut für Technische Informatik und Kommunikationsnetze, ETH Zurich.
25. EVEN, S., A. ITAI and A. SHAMIR (1976), On the complexity of timetable and multicommodity flow problems, SIAM Journal of Computing 5, 691-703.
26. FISCHETTI, M., G. LANCIA and P. SERAFINI (2002), Exact Algorithms for Minimum Routing Cost Trees, Networks 39, 161-173.
27. FLEISCHER, L. (2000), Approximating fractional multicommodity flows independent of the number of commodities, SIAM Journal of Discrete Mathematics 13, 505-520.
28. FORD, L. R. and D. R. FULKERSON (1956), Maximal flow through a network, Canadian Journal of Mathematics 8, 399-404.
29. FORTZ, B., P. SORIANO and C. WYNANTS (2003), A Tabu Search Algorithm for Self-Healing Ring Network Design, European Journal of Operational Research 151, 280.
30. FORTZ, B., J. REXFORD and M. THORUP (2002), Traffic engineering with traditional IP routing protocols, IEEE Communications Magazine 40, 118-124.
31. FORTZ, B. and M. THORUP (2000), Internet Traffic Engineering by Optimizing OSPF Weights, INFOCOM 2, 519-528.
32. FRANK, A. (1985), Edge disjoint paths in planar graphs, Journal on Combinatorial Theory, Series B 38, 164-178.
33. FRANK, A. (1990), Chapter Packing paths, circuits and cuts - a survey of, in: B. KORTE, L. LOVÁSZ, H. J. PRÖMEL, A. SCHRIJVER (eds), Paths, Flows and VLSI Layout, Springer Verlag, Berlin.
34. GABOW, H. N., M. X. GOEMANS and D. P. WILLIAMSON (1998), An efficient approximation algorithm for the survivable network design problem, Mathematical Programming 82, 13.
35. GARG, N. and J. KONEMANN (1998), Faster and simpler algorithms for multicommodity flow and other fractional packing problems, Symposium on Foundations of Computer Science, 300-309.
36. GOLDSCHMIDT, O., A. LAUGIER and E. V. OLINICK (2003), SONET/SDH ring assignment with capacity constraints, Discrete Applied Mathematics 129, 99-128.
37. GOMORY, R. E. and T. C. Hu (1961a), Multi-Terminal Network Flows, SIAM Journal of Applied Mathematics 9, 551-570.
38. GOMORY, R. E. and T. C. Hu (1961b), Synthesis of a communication network, SIAM Journal of Applied Mathematics 12, 348-369.
39. GRÖTSCHEL, M., C. MONMA and M. STOER (1995), Chapter 10 of Design of survivable networks, Volume 7 of Handbooks in operations research and management science, Network models, North-Holland.
40. HASSIN, R. and A. LEVIN (2002), Approximation algorithms for constructing wavelength routing problems, Networks 40, 32-37.
41. Hu, T. C. (1963), Multicommodity network flows, Operations Research 11, 344-360.
42. Hu, T. C. (1974), Optimum communication spanning trees, SIAM Journal on Computing 3, 188-195.
43. JOHNSON, D. S., J. K. LENSTRA and A. H. G. RINNOOY KAN (1978), The Complexity of the Network Design Problem, Networks 8, 279-285.
44. KARP, D. (1975), On the complexity of combinatorial problems, Networks 5, 45-68.
45. KENNINOTON, J., E. OLINICK, A. ORTYNSKI and G. SPIRIDE (2003), Wavelength routing and assignment in a survivable WDM mesh network, Operations Research 51, 67-79.
46. KHANNA, S. (1997), A polynomial time approximation scheme for the sonet ring loading problem, Bell Labs Technical Journal 2, 36-41.
47. KLEINBERG, J. M. and A. KUMAR (2001), Wavelength Conversion in Optical Networks, Journal of Algorithms 38, 25-50.
48. KOSTER, A. M. C. A. and A. ZYMOLKA (2004), Minimum Converter Wavelength Assignment in All-Optical Networks, Proceedings of ONDM 2004, Ghent, Belgium: The 8th IFIP Working Conference on Optical Network Design and Modelling, 517-535.
49. KOSTER, A. M. C. A., A. ZYMOLKA, M. JÄGER and R. HÜLSERMANN (2005), Demand-wise Shared Protection for Meshed Optical Networks, Journal of Network and Systems Management 13, 35-55.
50. KRAMER, M. R. and J. VAN LEEUWEN (1982), Wire routing is NP-complete, Technical report 'RUU-CS-82-04', Utrecht University.
51. LACUNA, M. (1994), Clustering for the Design of SONET Rings in Interoffice Telecommunications, Management Science 40, 1533-1541.
52. LEIGHTON, T., F. MAKEDON, S. PLOTKIN, C. STEIN, E. TARDOS and S. TRAGOUDAS (1995), Fast approximation algorithms for multicommodity flow problems, Journal of Computer and System Sciences 50, 228-243.
53. LELAND, W. E., M. S. TAQQU, W. WILLINGER and D. V. WILSON (1993), On the self-similar nature of Ethernet traffic, IEEE/ACM Transactions on Networking 2, 1-15.
54. MAGNANTI, T. L., P. MIRCHANDANI and R. VACHANI (1993), The convex hull of two core capacitated network design problems, Mathematical Programming 60, 233-250.
55. MAGNANTI, T. L., P. MIRCHANDANI and R. VACHANI (1995), Modelling and solving the two-facility capacitated network loading problem, Operations Research 43, 142-157.
56. MAGNANTI, T. L. and S. RAGHAVAN (1999), Strong Formulations for Network Design Problems with Connectivity Requirements, Technical Report TR1999-28, Institute for systems research.
57. MAHJOUB, A. R. (1994), Two edge connected spanning subgraphs and polyhedra, Mathematical Programming 64, 199-208.
58. MENGER, K. (1927), Zur Allgemeinen Kurventheorie, Fundamenta Mathematicae 10, 96-115.
59. MINOUX, M. (1989), 'Network design and Optimum Network Design Problems: Models, Solution Methods and Applications', Networks 19, 313-360.
60. OKAMURA, H. and P. SEYMOUR (2002), 'Muticommodity Flows in Planar Graphs', Journal of Combinatorial Theory B 31, 75-81.
61. OZDAGLAR, A. E. and D. P. BERTSEKAS (2003), Optimal Solution of Integer Multicommodity Flow Problems with Application in Optical Networks, Santorini, Greece, Proceeding of Symposium on Global Optimization.
62. SCHRIJVER, A., P. SEYMOUR and P. WINKLER (1998), The Ring Loading Problem', SIAM Journal of Discrete Mathematics 11, 1-14.
63. SEYMOUR, P. D. (1990), Chapter Sum of circuits, in: J. A. BONDY and U. S. R. MURTY (eds), Graph Theory Related Topics, 341-355, Academic Press, New York.
64. SHERALI, H. D., J. C. SMITH and Y. LEE (2000), Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting, INFORMS Journal on Computing 12, 284-298.
65. SUTTER, A., F. VANDERBECK and L. WOLSEY (1998), Optimal placement of add/drop multi-plexers: heuristic and exact algorithms, Operations Research 46, 719-728.
66. VAN DE LEENSEL, R. L. M. J. (1999), Models and Algorithms for Telecommunication Network Design, Ph.D. diss., Maastricht University.
67. VAN HOESEL, C. P. M., A. M. C. A. KOSTER, R. L. M. J. VAN DE LEENSEL and M. W. P. SAVELSBERGH (2002), Polyhedral Results for the Edge Capacity Polytope, Mathematical Programming 92, 335-358.
68. VAN HOESEL, S. and R. MÜLLER (2004), Optimization Issues in Combinatorial Auctions, Technical Report METEOR Research Memorandum, University Maastricht.
69. VAN HOESEL, S., A. F. VAN DER KRAAIJ, C. MANNING, M. BOUHTOU and G. ORIOLO (2003), Polynomial cases of the tarification problem, Technical Report METEOR Research Memorandum 03-063, University Maastricht.
70. WILFONG, G. T. and P. WINKLER (1998), Ring Routing and Wavelength Translation, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 98), 333-341.
71. WONG, R. (1980), Worst-case analysis of network design problem heuristics, SIAM Journal on Algebraic and Discrete Methods 1, 51-63.
72. Wu, B. Y., G. LANCIA, V. BAFNA, K. M. CHAD, R. RAVI and C. Y. TANG (1999), A poly-nomial-time approximation scheme for the minimum routing cost spanning trees, SIAM Journal on Computing 29, 761-778.
73. ZANG, H., J. JUE and B. MUKHERJEE (2000), A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks, Optical Networks Magazine 1, 47-60.