Skip to main content
SpringerLink
Log in

FttX Deployment Using Available Networks and Existing Infrastructures

  • Conference paper
  • First Online:
Innovations for Community Services (I4CS 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1404))

Included in the following conference series:

  • 408 Accesses

Abstract

In Fibre-to-the-X, fibre is used to connect new active optic equipment at a certain location. In most cases, a connection to an existing network is required. Costs can be saved by using existing infrastructure, like empty ducts and spare fibres. Often, restrictions are given by municipalities to only use certain tracks or to only follow street patterns. This means that planners have to work with the combination of several networks to design the new network. In this article we propose a new algorithm that finds a low cost-path between two points, using multiple available networks. The given points do not have to be connected to one of the networks from the start. We split the problem in three sub-problems: connecting the points with the network, find the transition points between the networks, and finally find the low cost-path between the given points. For each sub-problems an algorithm is proposed and the combination of those is tuned for optimal performance. The algorithm is applied to a problem in telecommunication: it quickly finds low-cost paths in complex urban environments.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    Note that two networks intersect if the networks intersect when projected on the two dimensional plane.

References

  1. Agarwal, P., Sharir, M.: Red-blue intersection detection algorithms, with applications to motion planning and collision detection. Association for Computing Machinery, New York, NY, USA (1988). https://doi.org/10.1145/73393.73401. ISBN 0897912705

  2. Arge, L., Mølhave, T., Zeh, N.: Cache-oblivious red-blue line segment intersection. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 88–99. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87744-8_8

    Chapter  Google Scholar 

  3. Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958). http://www.jstor.org/stable/43634538. ISSN 0033569X

    Article  Google Scholar 

  4. Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C–28(9), 643–647 (1979). https://doi.org/10.1109/tc.1979.1675432

    Article  MATH  Google Scholar 

  5. Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959). https://doi.org/10.1007/BF01386390

    Article  MathSciNet  MATH  Google Scholar 

  6. Ford, L.R.: Network Flow Theory. RAND Corporation, Santa Monica (1956)

    Google Scholar 

  7. Khan, M., Babar, M., Ahmed, S.H., Shah, S.C., Han, K.: Smart city designing and planning based on big data analytics. Sustain. Cities Soc. 35, 271–279 (2017). https://doi.org/10.1016/j.scs.2017.07.012

    Article  Google Scholar 

  8. Mantler, A.: Intersecting red and blue line segments in optimal time and precision (2001). https://doi.org/10.14288/1.0051494

  9. Neumann, N., Phillipson, F.: Finding the intersection points of networks. In: Eichler, G., Erfurth, C., Fahrnberger, G. (eds.) I4CS 2017. CCIS, vol. 717, pp. 104–118. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-60447-3_8

    Chapter  Google Scholar 

  10. Phillipson, F.: Efficient algorithms for infrastructure networks: Planning issues and economic impact (2014). https://doi.org/10.13140/2.1.3025.1844

  11. Phillipson, F.: Planning of fibre to the curb using G. Fast in multiple roll-out scenarios. In: LNIT, vol. 2, issue 1, pp. 42–49 (2014). https://doi.org/10.12720/lnit.2.1.42-49

  12. Phillipson, F.: Roll-out of reliable fiber to the cabinet: an interactive planning approach. J. Opt. Commun. Netw. 6(8), 705 (2014). https://doi.org/10.1364/jocn.6.000705

  13. Phillipson, F., Vos, T.: Dense multi-service planning in smart cities. In: 2018 Proceedings of International Conference on Information Society and Smart Cities, p. 11 (2018)

    Google Scholar 

  14. Shamos, M.I., Hoey, D.: Closest-point problems. In: Proceedings of the 16th Annual Symposium on Foundations of Computer Science, USA (1975). IEEE Computer Society. https://doi.org/10.1109/SFCS.1975.8

  15. Shamos, M.I., Hoey, D.: Geometric intersection problems. In: Proceedings of the 17th Annual Symposium on Foundations of Computer Science, SFCS 1976, pp. 208–215, USA. IEEE Computer Society (1976). https://doi.org/10.1109/SFCS.1976.16

Download references

Author information

Authors and Affiliations

  1. The Netherlands Organisation for Applied Scientific Research, The Hague, The Netherlands

    Niels M. P. Neumann & Frank Phillipson

  2. Radboud University, Nijmegen, The Netherlands

    Niels M. P. Neumann

Authors
  1. Niels M. P. Neumann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Phillipson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Niels M. P. Neumann .

Editor information

Editors and Affiliations

  1. University of Bamberg, Bamberg, Germany

    Udo R. Krieger

  2. Deutsche Telekom Technology & Innovation, Darmstadt, Germany

    Gerald Eichler

  3. University of Applied Sciences Jena, Jena, Germany

    Christian Erfurth

  4. University of Hagen, Hagen, Germany

    Günter Fahrnberger

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Neumann, N.M.P., Phillipson, F. (2021). FttX Deployment Using Available Networks and Existing Infrastructures. In: Krieger, U.R., Eichler, G., Erfurth, C., Fahrnberger, G. (eds) Innovations for Community Services. I4CS 2021. Communications in Computer and Information Science, vol 1404. Springer, Cham. https://doi.org/10.1007/978-3-030-75004-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-75004-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-75003-9

  • Online ISBN: 978-3-030-75004-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation