Skip to main content
SpringerLink
Log in

Graphs and Algorithms in Communication Networks on Seven League Boots

  • Chapter
  • First Online:
Graphs and Algorithms in Communication Networks

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

  • 1445 Accesses

Abstract

This chapter provides an introduction to the mathematical techniques used to provide insight and decision support in the design and operaton of communication networks. Techniques discussed include graph-theoretical concepts, (integer) linear programming, and complexity theory. To illustrate the importance of these techniques, classical applications in the area of communication networks are discussed. The wide variety and depth of the mathematics involved does not allow an exposition highlighting all details. References for further reading are provided. The chapter is closed with a brief description of the applications discussed in the consecutive chapters.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aardal, K. I., Hoesel, C. P. M. v.: Polyhedral techniques in combinatorial optimization I: theory. Statistica Neerlandica 50(1), 3–26 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aardal, K. I., Hoesel, C. P. M. v.: Polyhedral techniques in combinatorial optimization II: applications and computations. Statistica Neerlandica 53(2), 131–177 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Aardal, K. I., Hoesel, C. P. M. v., Koster, A. M. C. A., Mannino, C., Sassano, A.: Models and solution techniques for the frequency assignment problem. Annals of Operations Research 153, 79–129 (2007). URL http://dx.doi.org/10.1007/s10479-007-0178-0

  4. Aarts, E. H. L., Lenstra, J. K. (eds.): Local Search in Combinatorial Optimization. Wiley, Chichester (1997)

    MATH  Google Scholar 

  5. Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation 1(1), 1–41 (2009). URL http://scip.zib.de/

  6. Agrawal, A., Klein, P., Ravi, R.: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks. SIAM Journal on Computing 24, 440–456 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ahuja, R. K., Magnanti, T. L., Orlin, J. B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)

    Google Scholar 

  8. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer-Verlag (1999)

    Google Scholar 

  9. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2 edn. Springer-Verlag (2008). http://www.cs.rhul.ac.uk/books/dbook/

  10. Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree bounded directed network design. In: Proceedings of the 40th annual ACM symposium on Theory of computing, STOC 2008, pp. 769–778 (2008)

    Google Scholar 

  11. Barnhart, C., Hane, C. A., Vance, P. H.: Using branch-and-price-and-cut to origin-destination integer multi-commodity flow problems. Operations Research 48, 318–326 (2000)

    Article  Google Scholar 

  12. Bazaraa, M. S., Shetty, C. M.: Nonlinear programming: Theory and algorithms. John Wiley & Sons (1979)

    Google Scholar 

  13. Belady, L. A.: A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal 5(2), 78–101 (1966)

    Article  Google Scholar 

  14. Bellare, M., Goldreich, O., Sudan, M.: Free bits, pcps and non-approximability – towards tight results. SIAM Journal on Computing 27, 804–915 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Bermond, J. C., Delorme, C., Quisquater, J. J.: Strategies for interconnection networks: some methods from graph theory. Graphs and Combinatorics 5, 107–123 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. Bertsekas, D. P.: Nonlinear Programming, 2nd edn. Athena Scientific (1999)

    Google Scholar 

  17. Bhandari, R.: Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic Publishers (1999)

    Google Scholar 

  18. Bienstock, D., Bley, A.: Capacitated network design with mulicast commodities. In: Proceedings of 8th International Conference on Telecommunication Systems. Nashville, TN (2000). URL http://www.zib.de/Publications/abstracts/ZR-00-14/

  19. Bienstock, D., Chopra, S., Günlük, O., Tsai, C. Y.: Minimum cost capacity installation for multicommodity network flows. Mathematical Programming 81, 177–199 (1998)

    MathSciNet  Google Scholar 

  20. Bixby, R.: Solving real-world linear programs: A decade and more of progress. Operations Research 50(1), 3–15 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. Bixby, R. E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: Mixed-Integer Programming: A Progress Report. In: M. Grötschel (ed.) The Sharpest Cut: The Impact of Manfred Padberg and His Work, MPS-SIAM Series on Optimization, vol. 4, pp. 309–326. SIAM (2004)

    Google Scholar 

  22. Bondy, J. A., Murty, U. S. R.: Graph Theory with Applications. North-Holland (1976). http://www.ecp6.jussieu.fr/pageperso/bondy/books/gtwa/gtwa.html

  23. Borndörfer, R., Eisenblätter, A., Grötschel, M., Martin, A.: Frequency assignment in cellular phone networks. Annals of Operations Research 76, 73–94 (1998)

    Article  MATH  Google Scholar 

  24. Brélaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22, 251–256 (1979)

    Article  MATH  Google Scholar 

  25. Chartrand, G., Lesniak, L.: Graphs & Digraphs. Wadsworth & Brooks (1986)

    Google Scholar 

  26. Chopra, S., Gilboa, I., Sastry, S.: Source sink flows with capacity installation in batches. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 85 (1998)

    Google Scholar 

  27. Chopra, S., Rao, M. R.: The Steiner tree problem I: Formulations, compositions and extension of facets. Mathematical Programming 64, 209–229 (1994)

    Article  MathSciNet  Google Scholar 

  28. Chung, F. R. K., Coffman, E. G., Reiman, M. I., Simon, B.: On the capacity and forwarding index of communication networks. IEEE Trans. on Information Theory 33, 244–232 (1987)

    Google Scholar 

  29. Chvátal, V.: Linear Programming. W. H. Freeman and Company, New York (1983)

    MATH  Google Scholar 

  30. Clos, C.: A study of non-blocking switching networks. Bell System Technical Journal (1953)

    Google Scholar 

  31. Cook, W.: Fifty-plus years of combinatorial integer programming (2009). URL http://www2.isye.gatech.edu/ wcook/ip50/ip50.pdf

  32. Cook, W. J., Cunningham, W. H., Pulleybank, W. R., Schrijver, A.: Combinatorial Optimization. Series in Discrete Mathematics and Optimization. Wiley-Interscience (1998)

    Google Scholar 

  33. Cost action 293 – graphs and algorithms in communication networks. http://www.cost293.org/

  34. Coudert, D., Ferreira, A., Muñoz, X.: A multihop-multi-OPS optical interconnection network. IEEE/OSA Journal of Lightwave Technology 18(12), 2076–2085 (2000)

    Article  Google Scholar 

  35. Coudert, D., Muñoz, X.: Graph theory and traffic grooming in WDM rings. In: Recent Research Developments in Optics, 3, chap. 37, pp. 759–778. Research Signpost. Kerala, India (2003)

    Google Scholar 

  36. Dantzig, G. B.: Linear Programming and Extensions. Princeton University Press (1998). Originally published in 1963

    Google Scholar 

  37. Dantzig, G. B., Fulkerson, D. R.: On the max-flow min-cut theorem of networks. In: H. W. Kuhn, A. W. Tucker (eds.) Linear Inequalities and Related Systems, Annals of Mathematics Series, vol. 38, pp. 215–221. Princeton University Press, Princeton, New Jersey (1956)

    Google Scholar 

  38. Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 3 edn. Springer-Verlag, Heidelberg (2005). http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/

  39. Dijkstra, E. W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  40. Dolev, D., Halpern, J., Simons, B., Strong, H.: A new look at fault tolerant network routing. Information and Computation 72, 180–196 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  41. Eisenblätter, A.: Frequency assignment in GSM networks: Models, heuristics, and lower bounds. Ph.D. thesis, Technische Universität Berlin, Berlin, Germany (2001)

    Google Scholar 

  42. Eisenblätter, A.: The semidefinite relaxation of the k-partition polytope is strong. In: W. J. Cook, A. S. Schulz (eds.) Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO’02), Lecture Notes in Computer Science, vol. 2337, pp. 273–290. Springer-Verlag, Berlin Heidelberg (2002)

    Google Scholar 

  43. Eisenblätter, A., Grötschel, M., Koster, A. M. C. A.: Frequency planning and ramifications of coloring. Discussiones Mathematicae Graph Theory 22(1), 51–88 (2002)

    MATH  MathSciNet  Google Scholar 

  44. Eisenblätter, A., Koster, A. M. C. A.: FAP web – A website devoted to frequency assignment. URL: http://fap.zib.de (2000–2008)

  45. Fàbrega, J., Fiol, M. A.: Maximally connected digraphs. Journal of Graph Theory 13, 657–668 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  46. Ferreira, A., Pérennes, S., Richa, A. W., Rivano, H., Moses, N. S.: Models, Complexity and Algorithms for the Design of Multifiber WDM Networks. Telecommunication Systems 24, 123–138 (2003)

    Article  Google Scholar 

  47. Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., Young, N. E.: Competitive paging algorithms. Journal of Algorithms 12(4), 685–699 (1991)

    Article  MATH  Google Scholar 

  48. Fortz, B., Labbé, M.: Design of survivable networks. In: M. G. C. Resende, P. M. Pardalos (eds.) Handbook of Optimization in Telecommunications, chap. 15, pp. 367–389. Springer (2006)

    Google Scholar 

  49. Garey, M. R., Johnson, D. S.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32, 826–834 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  50. Garey, M. R., Johnson, D. S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman and Company, N. Y. (1979)

    MATH  Google Scholar 

  51. Goemans, M. X.: Minimum bounded degree spanning trees. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006, pp. 273–282 (2006)

    Google Scholar 

  52. Grötschel, M., Krumke, S. O., Rambau, J. (eds.): Online Optimization of Large Scale Systems. Springer (2001)

    Google Scholar 

  53. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  54. Grötschel, M., Lovász, L., Schrijver, A.: Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization”. Combinatorica 4, 291–295 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  55. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. No. 2 in Algorithms and Combinatorics. Springer-Verlag (1988)

    Google Scholar 

  56. Grötschel, M., Monma, C. L., Stoer, M.: Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM Journal on Optimization 2(3), 474–504 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  57. Grötschel, M., Monma, C. L., Stoer, M.: Design of Survivable Networks. In: M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser (eds.) Network Models, Handbooks in Operations Research and Management Science, vol. 7, pp. 617–672. North-Holland (1995)

    Chapter  Google Scholar 

  58. Grötschel, M., Monma, C. L., Stoer, M.: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements. Operations Research 43(6), 1012–1024 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  59. Grover, W. D.: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall (2003)

    Google Scholar 

  60. Henningsson, M., Holmberg, K., Yuan, D.: Ring network design. In: M. G. C. Resende, P. M. Pardalos (eds.) Handbook of Optimization in Telecommunications, chap. 12, pp. 291–311. Springer (2006)

    Google Scholar 

  61. Heydemann, M. C., Meyer, J. C., Sotteau, D.: On forwarding indices of networks. Discrete Applied Mathematics 23, 103–123 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  62. Holmberg, K., Rönnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research 113(3), 544–559 (1999)

    Article  MATH  Google Scholar 

  63. Hromkovic, J., Klasing, R., Monien, B., Peine, R.: Dissemination of information in interconnection networks (broadcasting and gossiping) (1996)

    Google Scholar 

  64. ILOG: CPLEX version 11.1 (2008). http://www.ilog.com/products/cplex

  65. Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373–395 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  66. Karp, R. M.: Reducibility among combinatorial problems. In: R. E. Miller, J. W. Thatcher (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Google Scholar 

  67. Klee, V., Minty, G. J.: How good is the Simplex algorithm? In: O. Shisha (ed.) Inequalities, III, pp. 159–175. Academic Press, New York, NY (1972)

    Google Scholar 

  68. Koch, T., Martin, A., Voß, S.: SteinLib: An updated library on Steiner tree problems in graphs. Tech. Rep. ZIB-Report 00-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustr. 7, Berlin (2000). URL http://elib.zib.de/steinlib

  69. Kruskal Jr., J. B.: On the shortest spanning tree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7, 48–50 (1956)

    Article  MathSciNet  Google Scholar 

  70. LEMON: A C++ Library for Efficient Modelling and Optimization in Networks. http://lemon.cs.elte.hu

  71. Lindberg, P.: Network optimisation with successive smooth approximation. In: 11th Nordic Teletraffic Seminar. Stockholm (1993)

    Google Scholar 

  72. Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers (1996)

    Google Scholar 

  73. Marsden, G., Marchand, P., Harvey, P., Esener, S.: Optical transpose interconnection system architectures. OSA Optics Letters 18(13), 1083–1085 (1993)

    Article  Google Scholar 

  74. Martello, S., Toth, P.: Knapsack Problems – Algorithms and Computer Implementations. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons (1990). URL http://www.or.deis.unibo.it/kp.html

  75. Metzger, B. H.: Spectrum management technique (Fall 1970). Presentation at 38th National ORSA meeting (Detroit, MI)

    Google Scholar 

  76. Nemhauser, G. L., Wolsey, L. A.: Integer and Combinatorial Optimization. Wiley, N. Y. (1988)

    MATH  Google Scholar 

  77. Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0–Survivable Network Design Library. In: Proceedings of International Network Optimization Conference (INOC2007) (2007). http://sndlib.zib.de

  78. Peleg, D.: Distributed Computing – A Locality-Sensitive Approach. Monographs in Discrete Mathematics and Applications. SIAM (2000)

    Google Scholar 

  79. Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann (2004)

    Google Scholar 

  80. Polzin, T.: Algorithms for the Steiner problem in networks. Ph.D. thesis, Universität des Saarlandes (2003)

    Google Scholar 

  81. Prim, R. C.: Shortest connection networks and some generalizations. The Bell System Technical Journal 36, 1389–1401 (1957)

    Google Scholar 

  82. Schrijver, A.: Theory of linear and integer programming. Wiley, New York (1986)

    MATH  Google Scholar 

  83. Schrijver, A.: Combinatorial Optimization – Polyhedra and Efficiency. No. 24 in Algorithms and Combinatorics. Springer (2003)

    Google Scholar 

  84. Sleator, D. D., Tarjan, R. E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  85. Stidsen, T., Petersen, B., Rasmussen, K. B., Spoorendonk, S., Zachariasen, M., Rambach, F., Kiese, M.: Optimal routing with single backup path protection. In: Proceedings International Network Optimization Conference (INOC 2007). Spa, Belgium (2007)

    Google Scholar 

  86. Suurballe, J. W.: Disjoint paths in a network. Networks 4(2), 125–145 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  87. Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (1994)

    Google Scholar 

  88. Vanderbei, R. J.: Linear Programming: Foundations and Extensions, International Series in Operations Research & Management Science, vol. 114, 3 edn. Springer-Verlag (2008)

    Google Scholar 

  89. Vo<s>, S.: Steiner tree problems in telecommunications. In: M. G. C. Resende, P. M. Pardalos (eds.) Handbook of Optimization in Telecommunications, chap. 18, pp. 459–515. Springer (2006)

    Google Scholar 

  90. Wessäly, R.: DImensioning Survivable Capacitated NETworks. Ph.D. thesis, Technische Universität Berlin (2000)

    Google Scholar 

  91. West, D. B.: Introduction to Graph Theory, 2 edn. Prentice Hall (2001)

    Google Scholar 

  92. Wolsey, L. A.: Integer Programming. Series in Discrete Mathematics and Optimization. Wiley-Interscience (1998)

    Google Scholar 

  93. Zymolka, A.: Design of survivable optical networks by mathematical optimization. Ph.d. thesis, TU Berlin (2007)

    Google Scholar 

  94. Zymolka, A., Koster, A. M. C. A., Wessäly, R.: Transparent optical network design with sparse wavelength conversion. In: Proceedings of ONDM 2003, pp. 61–80. The 7th IFIP Working Conference on Optical Network Design & Modelling, Budapest, Hungary (2003)

    Google Scholar 

Download references

Acknowledgements

This chapter was supported by EU COST action 293 – Graphs and Algorithms in Communication Networks. The first author was supported by the Centre for Discrete Mathematics and its Applications (DIMAP), University ofWarwick, EPSRC award EP/D063191/1.

Author information

Authors and Affiliations

  1. Lehrstuhl II für Mathematik, RWTH Aachen University, Wüllnerstr, zwischen 5 und 7, D-52062, Aachen, Germany

    Arie M. C. A. Koster

  2. Graph Theory and Combinatorics Group, Department of Applied Mathematics IV, Universitat Politècnica de Catalunya, Barcelona, Spain

    Xavier Muñoz

Authors
  1. Arie M. C. A. Koster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xavier Muñoz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Arie M. C. A. Koster or Xavier Muñoz .

Editor information

Editors and Affiliations

  1. LS II für Mathematik, RWTH Aachen, Templergraben 55, Aachen, 52056, Germany

    Arie Koster

  2. Depto. Matematica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona 1-3, Barcelona, 08034, Spain

    Xavier Muñoz

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Koster, A.M.C.A., Muñoz, X. (2009). Graphs and Algorithms in Communication Networks on Seven League Boots. In: Koster, A., Muñoz, X. (eds) Graphs and Algorithms in Communication Networks. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02250-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02250-0_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02249-4

  • Online ISBN: 978-3-642-02250-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation