Node placement and sizing for copper broadband access networks
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 desir...
Gespeichert in:
| Veröffentlicht in: | Annals of operations research 2001-01, Vol.106 (1), p.199 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 1 |
| container_start_page | 199 |
| container_title | Annals of operations research |
| container_volume | 106 |
| creator | Carpenter, Tamra Eiger, Martin Shallcross, David Seymour, Paul |
| description | 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. [PUBLICATION ABSTRACT] |
| doi_str_mv | 10.1023/A:1014565826357 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_214507404</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>404218341</sourcerecordid><originalsourceid>FETCH-LOGICAL-c226t-ae73124aca2dd8eb232a0f835ed2fd4ef0979cf1f7d794207a945d9ce9a7c23d3</originalsourceid><addsrcrecordid>eNotj01LAzEURYMoOFbXboP70Zf3ksnEhVCKX1B0o-uSSV6ktU7GyRTBX29FV3dx4ByuEOcKLhUgXc2vFShtGtNiQ8YeiEoZi7Ujag9FBWh0bYjgWJyUsgEApVpTiZunHFkOWx_4g_tJ-j7Ksv5e928y5VGGPAw8ym7MPna_zIfApciep688vpdTcZT8tvDZ_87E693ty-KhXj7fPy7myzogNlPt2ZJC7YPHGFvukNBDaslwxBQ1J3DWhaSSjdZpBOudNtEFdt4GpEgzcfHnHcb8ueMyrTZ5N_b75Ar3p8Fq0PQD6SFKuw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>214507404</pqid></control><display><type>article</type><title>Node placement and sizing for copper broadband access networks</title><source>SpringerLink (Online service)</source><source>EBSCOhost Business Source Complete</source><creator>Carpenter, Tamra ; Eiger, Martin ; Shallcross, David ; Seymour, Paul</creator><creatorcontrib>Carpenter, Tamra ; Eiger, Martin ; Shallcross, David ; Seymour, Paul</creatorcontrib><description>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. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1023/A:1014565826357</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Algorithms ; Bandwidths ; Broadband ; Copper ; Customers ; Dynamic programming ; Integer programming ; Operations research ; Planning ; Studies ; Subscribers ; Technology</subject><ispartof>Annals of operations research, 2001-01, Vol.106 (1), p.199</ispartof><rights>Copyright Kluwer Academic Publishers Sep 2001</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c226t-ae73124aca2dd8eb232a0f835ed2fd4ef0979cf1f7d794207a945d9ce9a7c23d3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Carpenter, Tamra</creatorcontrib><creatorcontrib>Eiger, Martin</creatorcontrib><creatorcontrib>Shallcross, David</creatorcontrib><creatorcontrib>Seymour, Paul</creatorcontrib><title>Node placement and sizing for copper broadband access networks</title><title>Annals of operations research</title><description>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. [PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Bandwidths</subject><subject>Broadband</subject><subject>Copper</subject><subject>Customers</subject><subject>Dynamic programming</subject><subject>Integer programming</subject><subject>Operations research</subject><subject>Planning</subject><subject>Studies</subject><subject>Subscribers</subject><subject>Technology</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNotj01LAzEURYMoOFbXboP70Zf3ksnEhVCKX1B0o-uSSV6ktU7GyRTBX29FV3dx4ByuEOcKLhUgXc2vFShtGtNiQ8YeiEoZi7Ujag9FBWh0bYjgWJyUsgEApVpTiZunHFkOWx_4g_tJ-j7Ksv5e928y5VGGPAw8ym7MPna_zIfApciep688vpdTcZT8tvDZ_87E693ty-KhXj7fPy7myzogNlPt2ZJC7YPHGFvukNBDaslwxBQ1J3DWhaSSjdZpBOudNtEFdt4GpEgzcfHnHcb8ueMyrTZ5N_b75Ar3p8Fq0PQD6SFKuw</recordid><startdate>20010101</startdate><enddate>20010101</enddate><creator>Carpenter, Tamra</creator><creator>Eiger, Martin</creator><creator>Shallcross, David</creator><creator>Seymour, Paul</creator><general>Springer Nature B.V</general><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20010101</creationdate><title>Node placement and sizing for copper broadband access networks</title><author>Carpenter, Tamra ; Eiger, Martin ; Shallcross, David ; Seymour, Paul</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c226t-ae73124aca2dd8eb232a0f835ed2fd4ef0979cf1f7d794207a945d9ce9a7c23d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Algorithms</topic><topic>Bandwidths</topic><topic>Broadband</topic><topic>Copper</topic><topic>Customers</topic><topic>Dynamic programming</topic><topic>Integer programming</topic><topic>Operations research</topic><topic>Planning</topic><topic>Studies</topic><topic>Subscribers</topic><topic>Technology</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Carpenter, Tamra</creatorcontrib><creatorcontrib>Eiger, Martin</creatorcontrib><creatorcontrib>Shallcross, David</creatorcontrib><creatorcontrib>Seymour, Paul</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer science database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>ProQuest Science Journals</collection><collection>Engineering Database</collection><collection>ProQuest advanced technologies & aerospace journals</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering collection</collection><collection>ProQuest Central Basic</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Carpenter, Tamra</au><au>Eiger, Martin</au><au>Shallcross, David</au><au>Seymour, Paul</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Node placement and sizing for copper broadband access networks</atitle><jtitle>Annals of operations research</jtitle><date>2001-01-01</date><risdate>2001</risdate><volume>106</volume><issue>1</issue><spage>199</spage><pages>199-</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><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. [PUBLICATION ABSTRACT]</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1023/A:1014565826357</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0254-5330 |
| ispartof | Annals of operations research, 2001-01, Vol.106 (1), p.199 |
| issn | 0254-5330 1572-9338 |
| language | eng |
| recordid | cdi_proquest_journals_214507404 |
| source | SpringerLink (Online service); EBSCOhost Business Source Complete |
| subjects | Algorithms Bandwidths Broadband Copper Customers Dynamic programming Integer programming Operations research Planning Studies Subscribers Technology |
| title | Node placement and sizing for copper broadband access networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T11%3A36%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Node%20placement%20and%20sizing%20for%20copper%20broadband%20access%20networks&rft.jtitle=Annals%20of%20operations%20research&rft.au=Carpenter,%20Tamra&rft.date=2001-01-01&rft.volume=106&rft.issue=1&rft.spage=199&rft.pages=199-&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1023/A:1014565826357&rft_dat=%3Cproquest%3E404218341%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=214507404&rft_id=info:pmid/&rfr_iscdi=true |