Efficient clustering of cabinets at FttCab

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

At this moment consumers want an internet connection with 20-50 Mb/s speed and around 100 Mb/s in the near future. Rolling out Fibre to the Curb networks quickly will be the only way for telecom operators in some countries to compete with cable tv operators. This requires a fibre connection to the cabinets. When the telecom operator wants to connect the cabinets in a ring structure, he has to decide how to divide cabinets over a number of circuits, taking into account a maximum number of customers per circuit. This we call the cabinet clustering problem. In this paper we formulate this problem, present the heuristic approch we developed and show the results of our extensive testing that shows the method is accurate and fast. Finally we demonstrate the method on a real life case. © 2013 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Phillipson, F. (2013). Efficient clustering of cabinets at FttCab. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8121 LNCS, pp. 201–213). https://doi.org/10.1007/978-3-642-40316-3_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free