Models for planning capacity expansion in local access telecommunication networks

Balakrishnan, Anantaram; Magnanti, Thomas L.; Shulman, Alexander; Wong, Richard T.

doi:10.1007/bf02071976

Cited by 98 publications

(63 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Distribution points can depend on the definition of the network and these might be junction points of highways or entrances of private areas. The network from distribution points to the end-customers is referred as the allocation area [5]. The main difference of a backbone network is the high transmission rate over it.…”

Section: Telecommunication History and Basicsmentioning

confidence: 99%

“…Several heuristics have been developed for the problem by Goldstein [20], Hansler [21], Chandy and Russell [22]. The main characteristics of the problem are explained in [16,5,23]. In [5], local access network expansion problem is discussed.…”

Section: Local Access Network Design Problemmentioning

confidence: 99%

“…The main characteristics of the problem are explained in [16,5,23]. In [5], local access network expansion problem is discussed. The paper is mainly about the capacity expansion of the network and the problem is formulated as a minimum cost multicommodity network flow problem.…”

Section: Local Access Network Design Problemmentioning

confidence: 99%

See 2 more Smart Citations

Fiber optical network design problems: A case for Turkey

Yazar

Arslan

Karaşan

et al. 2016

Omega

View full text Add to dashboard Cite

Section: Telecommunication History and Basicsmentioning

confidence: 99%

Section: Local Access Network Design Problemmentioning

confidence: 99%

See 1 more Smart Citation

Fiber optical network design problems: A case for Turkey

Yazar

Arslan

Karaşan

et al. 2016

Omega

View full text Add to dashboard Cite

“…In practice, these problems are generally solved independently for each network level. For more details on these aspects of network planning, we refer the reader to the following survey articles: Gavish [15] and Balakrishnan et al [2] for design of local-access télécommunication networks; Grôtschel et al [25] for backbone network design when demand routings are done independently; Magnanti and Wong [40] and the chapter by Gendron et al [16] for simultaneous backbone net work design and demand routing; and, finally, Klincewicz [34] for simultaneous backbone/local-access network design.…”

Section: Télécommunication Networkmentioning

confidence: 99%

Network Synthesis Problems

Wynants¹

2001

Combinatorial Optimization

View full text Add to dashboard Cite

Cette thèse de doctorat a été numérisée par l'Université libre de Bruxelles. L'auteur qui s'opposerait à sa mise en ligne dans DI-fusion est invité à prendre contact avec l'Université (di-fusion@ulb.ac.be).Dans le cas où une version électronique native de la thèse existe, l'Université ne peut garantir que la présente version numérisée soit identique à la version électronique native, ni qu'elle soit la version officielle définitive de la thèse.DI-fusion, le Dépôt Institutionnel de l'Université libre de Bruxelles, recueille la production scientifique de l'Université, mise à disposition en libre accès autant que possible. Les oeuvres accessibles dans DI-fusion sont protégées par la législation belge relative aux droits d'auteur et aux droits voisins. Toute personne peut, sans avoir à demander l'autorisation de l'auteur ou de l'ayant-droit, à des fins d'usage privé ou à des fins d'illustration de l'enseignement ou de recherche scientifique, dans la mesure justifiée par le but non lucratif poursuivi, lire, télécharger ou reproduire sur papier ou sur tout autre support, les articles ou des fragments d'autres oeuvres, disponibles dans DI-fusion, pour autant que :Le nom des auteurs, le titre et la référence bibliographique complète soient cités; L'identifiant unique attribué aux métadonnées dans DI-fusion (permalink) soit indiqué;Le contenu ne soit pas modifié.

show abstract

“…Concentrators are electronic devices that combine incoming signals (e.g., analog signals) on several lines into a single composite signal (e.g., high frequency digital or optical signal) that requires only one outgoing line. In practice, a variety of devices such as electronic multiplexers, remote switches, and fiber optic terminals can perform traffic compression (see Balakrishnan et al [1991]). We collectively refer to all these different technologies as concentrators.…”

Section: Problem Descriptionmentioning

confidence: 99%

A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning

Balakrishnan

Magnanti

Wong

1995

Operations Research

View full text Add to dashboard Cite

Growing demand, increasing diversity of services, and advances in transmission and switching technologies are prompting telecommunication companies to rapidly expand and modernize their networks. This paper develops and tests a decomposition methodology to generate cost-effective expansion plans, with performance guarantees, for one major component of the network hierarchy-the local access network connecting customers to the local switching center. The model captures economies of scale in facility costs, and addresses the central tradeoff between installing concentrators and expanding cables to accommodate demand growth. By exploiting the special tree and routing structure of the expansion planning problem, our solution method integrates two major algorithmic strategies from mathematical programming-the use of valid inequalities, obtained by studying a problem's polyhedral structure, and dynamic programming, which can be used to solve an uncapacitated version of the local access network expansion planning problem. The computational results for three actual test networks demonstrate that this enhanced dynamic programming algorithm, when embedded in a Lagrangian relaxation scheme (with problem preprocessing and local improvement), is very effective in generating good upper and lower bounds: implemented on a personal computer, the method was able to generate solutions that are within 1.2 to 7.0% of optimality. In addition to developing a successful solution methodology for a practical problem, this paper illustrates the possibility of effectively combining decomposition methods and polyhedral approaches.

show abstract

Models for planning capacity expansion in local access telecommunication networks

Cited by 98 publications

References 56 publications

Fiber optical network design problems: A case for Turkey

Fiber optical network design problems: A case for Turkey

Network Synthesis Problems

A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning

Contact Info

Product

Resources

About