OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: O. Gerstel and P. Iannone
  • Vol. 6, Iss. 8 — Aug. 1, 2014
  • pp: 705–717

Roll-out of Reliable Fiber to the Cabinet: An Interactive Planning Approach

Frank Phillipson  »View Author Affiliations

Journal of Optical Communications and Networking, Vol. 6, Issue 8, pp. 705-717 (2014)

View Full Text Article

Enhanced HTML    Acrobat PDF (991 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



In this paper a total approach is presented for interactive planning of a reliable fiber-to-the-cabinet network. Interactive means here that areas with 600 to 1000 cabinets can be planned roughly within minutes. The problem of telecom operators, when planning fiber to the cabinet, is to find the minimum number of cabinets that are equipped with active equipment such that a required number of customers are within a targeted distance from an activated cabinet. Next, these activated cabinets need to be clustered and connected with a highly reliable fiber ring, satisfying capacity constraints. A three-step approach is described: an activation problem, a cluster problem, and a routing problem, each in a heuristic approach. The paper shows that the total interactive approach is indeed possible by presenting several real life cases.

© 2014 Optical Society of America

OCIS Codes
(000.3870) General : Mathematics
(060.4254) Fiber optics and optical communications : Networks, combinatorial network design
(060.4256) Fiber optics and optical communications : Networks, network optimization

ToC Category:
Research Papers

Original Manuscript: February 11, 2014
Revised Manuscript: June 16, 2014
Manuscript Accepted: June 17, 2014
Published: July 23, 2014

Frank Phillipson, "Roll-out of Reliable Fiber to the Cabinet: An Interactive Planning Approach," J. Opt. Commun. Netw. 6, 705-717 (2014)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. F. Phillipson, “A cost effective topology migration path toward fibre,” in Proc. of the 3rd Int. Conf. on Information Communication and Management (ICICM2013), Paris, France, 2013.
  2. D. Tipper, “Resilient network design: Challenges and future directions,” Telecommun. Syst., vol.  56, no. 1, pp. 5–16, 2014.
  3. K. Vajanapoom, D. Tipper, and S. Akavipat, “Risk based resilient network design,” Telecommun. Syst., vol.  52, pp. 799–811, 2012.
  4. Y. Gong, C. Gan, C. Wu, and R. Wang, “Novel ring-based WDM-PON architecture with high-reliable remote nodes,” Telecommun. Syst., to be published. [CrossRef]
  5. G. Clarke and J. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Oper. Res., vol.  12, no. 4, pp. 568–581, 1964. [CrossRef]
  6. F. Phillipson, “Fast roll-out of fibre to the cabinet: Practical approach for activation of cabinets,” in 19th Eur. Conf. on Networks and Optical Communications (NOC 2014), Milano, Italy, 2014.
  7. F. Phillipson, “Efficient clustering of cabinets at FttCab,” in Internet of Things, Smart Spaces, and Next Generation Networking. Berlin, Germany: Springer, 2013, pp. 201–213.
  8. M. Chardy, M.-C. Costa, A. Faye, and M. Trampont, “Optimizing splitter and fiber location in a multilevel optical FttH network,” Eur. J. Oper. Res., vol.  222, no. 3, pp. 430–440, 2012.
  9. S. Gollowitzer, L. Gouveia, and I. Ljubić, “A node splitting technique for two level network design problems with transition nodes,” Lect. Notes Comput. Sci., vol.  6701, pp. 57–70, 2011.
  10. S. Gollowitzer and I. Ljubić, “MIP models for connected facility location: A theoretical and computational study,” Comput. Oper. Res., vol.  38, pp. 435–449, 2011.
  11. M. Gendreau, M. Labbé, and G. Laporte, “Efficient heuristics for the design of ring networks,” Telecommun. Syst., vol.  4, no. 1, pp. 177–188, 1995.
  12. A. Fink, G. Schneidereit, and S. Voß, “Solving general ring network design problems by meta-heuristics,” in Computing Tools for Modeling, Optimization and Simulation. Springer, 2000, pp. 91–113.
  13. G. Mateus, F. Cruz, and H. Luna, “An algorithm for hierarchical network design,” Location Sci., vol.  2, no. 3, pp. 149–164, 1994.
  14. R. Zhao, H. Liu, and R. Lehnert, “Topology design of hierarchical hybrid fiber-VDSL access networks with ACO,” in Proc. of the 4th Advanced Int. Conf. on Telecommunications, Athens, Greece, 2008.
  15. M. Kalsch, M. Koerkel, and R. Nitsch, “Embedding ring structures in large fiber networks,” in Proc. of Telecommunications Network Strategy and Planning Symp. (NETWORKS), Rome, Italy, 2012.
  16. M. Henningsson, K. Holmberg, M. Rönnqvist, and P. Värbrand, “Ring network design by Lagrangian based column generation,” Telecommun. Syst., vol.  21, no. 2–4, pp. 301–318, 2002.
  17. T. Thomadsen and T. Stidsen, “Hierarchical ring network design using branch-and-price,” Telecommun. Syst., vol.  29, no. 1, pp. 61–76, 2005.
  18. R. Baldacci, M. Dell’Amico, and J. S. González, “The capacitated m-ring-star problem,” Oper. Res., vol.  55, no. 6, pp. 1147–1162, 2007. [CrossRef]
  19. M. Labbé, G. Laporte, I. R. Martín, J. José, and J. González, “The ring star problem: Polyhedral analysis and exact algorithm,” Networks, vol.  43, pp. 177–189, 2004. [CrossRef]
  20. K. Darby-Dowman and H. Lewis, “Lagrangian relaxation and the single-source capacitated facility-location problem,” J. Oper. Res. Soc., vol.  39, no. 11, pp. 1035–1040, 1988.
  21. J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proc. of 5th Berkeley Symp. on Mathematical Statistics and Probability, 1967, pp. 281–297.
  22. A. Jain, “Data clustering: 50 years beyond K-means,” Pattern Recogn. Lett., vol.  31, pp. 651–666, 2010. [CrossRef]
  23. D. Aloise, A. Deshpande, P. Hansen, and P. Popat, “NP-hardness of Euclidean sum-of-squares clustering,” Mach. Learn., vol.  75, pp. 245–248, 2009. [CrossRef]
  24. M. Inaba, N. Katoh, and H. Imai, “Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering,” in Proc. of 10th ACM Symp. on Computational Geometry, 1994, pp. 332–339.
  25. S. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inf. Theory, vol.  IT-28, no. 2, pp. 129–137, 1982.
  26. P. Bradley, K. Bennet, and A. Demiriz, “Constrained K-means clustering,” Microsoft Research, , 2000.
  27. D. Arthur and S. Vassilvitskii, “K-means++: The advantages of careful seeding,” in Proc. of the 18th Annu. ACM-SIAM Symp. on Discrete Algorithms, 2007, pp. 1027–1035.
  28. G. Croes, “A method for solving traveling salesman problems,” Oper. Res., vol.  6, pp. 791–812, 1958. [CrossRef]
  29. J. Xu, S. Chiu, and F. Glover, “Optimizing a ring-based private line telecommunication network using tabu search,” Manage. Sci., vol.  45, no. 3, pp. 330–345, 1999.
  30. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed. Cambridge, MA: MIT, 2009.
  31. E. Dijkstra, “A note on two problems in connexion with graphs,” Numer. Math., vol.  1, no. 1, pp. 269–271, 1959. [CrossRef]
  32. R. Daamen, “Heuristic methods for the design of edge disjoint circuits,” M.Sc. thesis, Tilburg University and TNO, 2013.

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited