Skip to main content

Cost Optimized Layout of Fibre Optic Networks in the Access Net Domain

  • Conference paper
Operations Research Proceedings 2002

Part of the book series: Operations Research Proceedings 2002 ((ORP,volume 2002))

  • 433 Accesses

Abstract

During the last two years European network-carriers have invested 7.5 bi1lions Euro in the expansion of the core and the distribution net domain (backbones, city backbones and metropolitan area networks). However, investigations have shown that about 95% of the total costs for the implementation may be expected for the area-wide realization of the last mile (access networks). In order to achieve a return on investment, carriers wi1l be forced to link access net nodes, like corporate clients, private customers or communication nodes for modern mobile services (e.g. UMTS) to their city backbones. We present the methodology behind the planning tool NETQUEST-OPT for the computation of cost optimized and real world laying for fiber optic access networks. Bases on detailed geoinformation data, cluster strategies, exact and approximation algorithms of graph theory, combinatorial optimization and ring closure heuristics form the optimization kernel. Beside the methodology, we present results of a benchmark project which was rocessed with one of our industrial partners.

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

Access this chapter

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

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. Bertsekas, D. (1998) Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont

    Google Scholar 

  2. Blashfield, R. (1984) Cluster Analysis. Sage Publications, Santa Barbara 3. Cieslik D. (1998) Steiner Minimal Trees. Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  3. Duin, C. (2000) Preprocessing the Steiner Problem in Graphs. In Du, D.Z. et. a!. (eds.), Advances in Steiner Trees. Kluwer Acadamic Publishers, Dordrecht

    Google Scholar 

  4. Fortz, B. (2000) Design of Survivable Networks with Bounded Rings. Kluwer Academic Publishers, Dordrecht

    Google Scholar 

  5. Gilder G. (2002) Telecosm: The World after Bandwith Abundance. Touchstone Books, Charmichael

    Google Scholar 

  6. Koch, T., et.al. (2001). SteinLib: An Updated Libary on Steiner Tree Problems in Graphs. In Cheng, X., et.al. (eds.), Steiner Trees in Industry. Kluwer Acadamic Publishers, Dordrecht

    Google Scholar 

  7. Paulus, G., et al. (2002) Planning the Next Generation Network Infratructure in Urban Areas. Proc URISA Ann Conf, in print.

    Google Scholar 

  8. Stögner, H., et al. (2001) Ein Top-Down Approach für die Planung von photonischen Netzen. Telematik. 4, 4–6

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bachhiesl, P., Paulus, G., Prossegger, M., Werner, J., Stögner, H. (2003). Cost Optimized Layout of Fibre Optic Networks in the Access Net Domain. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55537-4_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00387-8

  • Online ISBN: 978-3-642-55537-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics