Node Placement and Sizing for Copper Broadband Access Networks

Tamra Carpenter, Martin Eiger, David Shallcross and Paul Seymour

Annals of Operations Research, 2001, vol. 106, issue 1, 199-228

Abstract: We consider a node placement and sizing problem that arises in certain types of broadband access architectures, such as ADSL and FTTC. We consider three variants of the problem that become progressively more restrictive, to capture realistic planning concerns and to produce solutions that have desirable practical attributes. A distinguishing feature of the problem is a constraint that limits the distance between each customer and the placed node that is assigned to serve it. We present a dynamic programming algorithm to solve the two most practical variants of the problem, and we provide computational results for both realistic and randomly generated test problems. Copyright Kluwer Academic Publishers 2001

Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1014565826357 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:106:y:2001:i:1:p:199-228:10.1023/a:1014565826357

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1014565826357

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().