Skip to main content
SpringerLink
Log in

A Revision of Evolutionary Computation Techniques in Telecommunications and An Application for The Network Global Planning Problem

  • Chapter
Success in Evolutionary Computation

Part of the book series: Studies in Computational Intelligence ((SCI,volume 92))

  • 553 Accesses

This chapter consists of two parts. Firstly, a revision of the state-ofthe- art is presented for the application of EC techniques to several problems arising in telecommunications. The revision includes wired based networks, wireless networks considering both planning and operation stages. Secondly, an evolutionary computation approach is proposed to solve the very complex telecommunications network global planning problem. The model is based on a hubbing topology that considers two hierarchical levels for low and high speed telecommunication networks. EC results are compared with industry heuristic solutions showing a much better behaviour, outperforming it in all the analysed ranges.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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. Abuali FN, Schoenefeld DA, Wainwright RL (1994) Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees. In: Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994, ACM Press, Phoenix, pp. 242–246

    Chapter  Google Scholar 

  2. Alba E, Chicano F (2005) On the behavior of parallel genetic algorithms for optimal placement of antennae in telecommunications. International Journal of Foundations of Computer Science 16: 343–359

    Article  MATH  Google Scholar 

  3. Albiñana M, Escudero LF, Monge JF, Sánchez-Soriano J (2007) On the enrouting protocol problem under uncertainty. European Journal of Operational Research 181 (2): 887–902

    Article  Google Scholar 

  4. Armony M, Klincewicz JC, Luss H, Rosenwein MB (2000) Design of stacked self-healing rings using a genetic algorithm. Journal of heuristics 6: 85–105

    Article  Google Scholar 

  5. Bertsekas DP (1982) Constrained optimization and Lagrange multiplier methods, Academic Press, New York

    MATH  Google Scholar 

  6. Cardwell RH, Monma CL, Wu TH (1989) Computer aided design procedure for survivable fiber optic networks. IEEE Journal on Selected Areas in Communications 7: 1188–1197

    Article  Google Scholar 

  7. Chen L, Xu ZQ (2004) An effective genetic algorithm for multicast routing tree with degree-delay-constrained. In: Yoo SJ Ben, Chang G-K, Li G, Cheung K-W (eds.) SPIE proceedings series International Society for Optical Engineering Proceedings Series, Vol. 5626 (2), pp. 793–804

    Google Scholar 

  8. Cortés P, Guerrero F, Canca D, García JM (2001) An evolutionary algorithm for the design of hybrid fiber optic-coaxial cable networks in small urban areas. Lecture Notes in Computer Science 2084: 749–756

    Article  Google Scholar 

  9. Cortés P, Muñuzuri J, Larrañeta J, Onieva L (2002) A genetic algorithm based on cell loss for dynamic routing in ATM networks. In: Roy R, Köppen M, Ovaska S, Furuhashi T, Hoffman F (eds.) Soft Computing in Industry – Recent Applications, Spinger-Verlag, Berlin, pp. 627–640

    Google Scholar 

  10. Cortés P, Muñuzuri J, Onieva L, Larrañeta J, Vozmediano JM, Alarcón JC (2006) Andalucía assesses the investment needed to deploy a fiber-optic network. Interfaces 36 (2): 105–117

    Article  Google Scholar 

  11. Din D-R (2004) Genetic algorithms for multiple multicast on WDM ring network. Computer Communications 27 (9): 840–856

    Article  Google Scholar 

  12. Din D-R (2007) A genetic algorithm for solving virtual topology configuration transition problem in WDM network. Computer Communications 30 (4): 767–781

    Article  Google Scholar 

  13. Elbaum R, Sidi M (1995) Topological design of local area networks using genetic algorithms. In: Proceedings of IEEE Conference on Computer Communications (INFOCOM’95), Boston, MA, pp. 64–71

    Google Scholar 

  14. El-Madbouly H (2005) Design and bandwidth allocation of embedded ATM networks using genetic algorithm. Transactions on Engineering. Computing and Technology 8: 249–252

    Google Scholar 

  15. Gódor I, Magyar G (2005) Cost-optimal topology planning of hierarchical access networks. Computers & Operations Research 32: 59–86

    Article  MATH  MathSciNet  Google Scholar 

  16. Grötschel M, Monma CL, Stoer M (1995) Design of survivable networks. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds.) Network Models, North-Holland, Elsevier, pp. 617–672

    Chapter  Google Scholar 

  17. Guimarães M, Rodrigues L (2003) A genetic algorithm for multicast mapping in publish-subscribe systems. In: Proceedings of the Second IEEE International Symposium on Network Computing and Applications, pp. 67–74

    Google Scholar 

  18. Hazem MM, Sayoud H, Takahashi K (2003) Hybridizing genetic algorithms for a survivability study of broadband communication networks: solution of the MSCC. In: APCC 2003. The 9th Asia-Pacific Conference. Vol. 3 (21–24): pp. 949–953

    Google Scholar 

  19. Huang R, Ma J, Frank Hsu D (1997) A genetic algorithm for optimal 3-connected telecommunication network designs. In: Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN ’97), pp. 344–350

    Google Scholar 

  20. Karunanithi N, Carpenter T (1994) A ring loading application of genetic algorithms. In: Proceedings of the 1994 ACM symposium on applied computing, pp. 227–231

    Google Scholar 

  21. Kerner M, Lemberg HL, Simons DM (1986) An analysis of alternative architectures for the interoffice network. IEEE Journal on Selected Areas in Communications 4: 1404–1413

    Article  Google Scholar 

  22. Kim S-S, Smith AE, Lee J-H (2007) A memetic algorithm for channel assignment in wireless FDMA systems. Computers & Operations Research 34 (6): 1842–1856

    Article  MATH  Google Scholar 

  23. Lansard E, Frayssinhes E, Palmade JL (1998) Global design of satellite constellations: a multi-criteria performance comparison of classical walker patterns and new design patterns. Acta Astronautica 42 (9): 555–564

    Article  Google Scholar 

  24. Le VT, Jiang X, Ngo SH, Horiguchi S, Inoguchi Y (2006) A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion. Optical Switching and Networking 3 (3–4): 173–190

    Article  Google Scholar 

  25. Medhi D, Tipper D (2000) Some approaches to solving a multihour broadband network capacity design problem with single-path routing. Telecommunication Systems 13 (2–4): 269–291

    Article  MATH  Google Scholar 

  26. Melián B, Laguna M, Moreno-Pérez JA (2004) Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis. Computers & Operations Research 31: 461–472

    Article  MATH  Google Scholar 

  27. Monma CL, Munson, BS, Pulleyblank WR (1990) Minimum-weight two- connected spanning networks. Mathematical Programming 46: 153–171

    Article  MATH  MathSciNet  Google Scholar 

  28. Pitsillides A, Stylianou G, Pattichis CS, Sekercioglu A, Vasilakos A (2000) Bandwidth allocation for virtual paths (BAVP): investigation of performance of classical constrained and genetic algorithm based optimisation techniques. In: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM 2000 3 (26–30), pp. 1501–1510

    Google Scholar 

  29. Sexton M, Reid (1997) A Broadband Networking. ATM, SDH and SONET. Artech House

    Google Scholar 

  30. Sheng-Ling Wang, Yi-Bin Hou, Jian-Hui Huang, Zhang-Qin Huang (2006) Adaptive Call Admission Control Based on Enhanced Genetic Algorithm in Wireless/Mobile Network. 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’06) 3–9

    Google Scholar 

  31. Sherif MR, Habib IW, Naghshineh M, Kermani PA (1999) Generic bandwidth allocation scheme for multimedia substreams inadaptive networks using genetic algorithms. In: Proceedings of the Wireless Communications and Networking, Vol. 3, pp. 1243–1247

    Google Scholar 

  32. Wang S-L, Hou Y-B, Huang J-H, Huang Z-Q (2006) Adaptive call admission control based on enhanced genetic algorithm in wireless/mobile network. In: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’06), pp. 3–9

    Google Scholar 

  33. Watanabe S, Hiroyasu T, Miki M (2001) Parallel evolutionary multi-criterion optimization for mobile telecommunication networks optimization. In: Proceedings of the EUROGEN 2001 Conference, pp. 167–172

    Google Scholar 

  34. Wille CG, Mellia M, Leonardi E, Ajmone M (2005) Topological design of survivable ip networks using metaheuristic approaches. In Third International Workshop on QoS in Multiservice IP Networks, Catania (Italy)

    Google Scholar 

  35. Wille CG, Mellia M, Leonardi E, Ajmone M (2006) Algorithms for IP networks design with end-to-end QoS constraints. Computer Networks 50 (8): 1086–1103

    Article  MATH  Google Scholar 

  36. Yener A, Rose C (1997) Genetic algorithms applied to cellular call admission problem: local policies. IEEE Transactions on Vehicular Technology 46 (1): 72–79

    Article  Google Scholar 

  37. Yoon M, Baek Y, Tcha D (1998) Design of a distributed fiber transport network with hubbing topology. European Journal of Operational Research 104: 510–520

    Article  MATH  Google Scholar 

  38. Zhang O, Leung Y-W (1999) An orthogonal genetic algorithm for multimedia multicast routing. IEEE Transactions on EC 3 (1): 53–62

    Google Scholar 

  39. Zhou G, Gen M (2003) A genetic algorithm approach on tree-like telecommunication network design problem. Journal of the Operational Research Society 54: 248–254

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ingeniería de Organización. Escuela Técnica Superior de Ingenieros, University of Seville, 41092, Seville, Spain

    Pablo Cortés, Luis Onieva, Jesús Muáuzuri & Jose Guadix

Authors
  1. Pablo Cortés
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis Onieva
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jesús Muáuzuri
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jose Guadix
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CSIRO Land and Water, Clunies Ross Street, ACT 2901, Canberra, Australia

    Ang Yang

  2. Medicare Australia, ACT 2901, Canberra, Australia

    Yin Shan

  3. University of New South Wales, Northcott Drive, ACT 2600, Canberra, Australia

    Lam Thu Bui

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cortés, P., Onieva, L., Muáuzuri, J., Guadix, J. (2008). A Revision of Evolutionary Computation Techniques in Telecommunications and An Application for The Network Global Planning Problem. In: Yang, A., Shan, Y., Bui, L.T. (eds) Success in Evolutionary Computation. Studies in Computational Intelligence, vol 92. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76286-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76286-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76285-0

  • Online ISBN: 978-3-540-76286-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation