{"id":"https://openalex.org/W2122183147","doi":"https://doi.org/10.1109/jsac.2006.1613770","title":"Design of WDM networks under economy of scale pricing and shortest path routing","display_name":"Design of WDM networks under economy of scale pricing and shortest path routing","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2122183147","doi":"https://doi.org/10.1109/jsac.2006.1613770","mag":"2122183147"},"language":"en","primary_location":{"id":"doi:10.1109/jsac.2006.1613770","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsac.2006.1613770","pdf_url":null,"source":{"id":"https://openalex.org/S90422530","display_name":"IEEE Journal on Selected Areas in Communications","issn_l":"0733-8716","issn":["0733-8716","1558-0008"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Selected Areas in Communications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101535364","display_name":"Mohamed Saad","orcid":"https://orcid.org/0000-0003-2546-4453"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"M. Saad","raw_affiliation_strings":["Electrical and Computer Engineering, University of Toronto, Toronto, ONT, Canada"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of Toronto, Toronto, ONT, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109212115","display_name":"Zhi-Quan Luo","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhi-Quan Luo","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101535364"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":1.5044,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83586643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"4","first_page":"36","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10232","display_name":"Optical Network Technologies","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7346121072769165},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6329553127288818},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6120859384536743},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5974475741386414},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5953395366668701},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5621691942214966},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4884988069534302},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4581663906574249},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4571492671966553},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45176273584365845},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.44378921389579773},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.33656996488571167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27066749334335327},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.21257010102272034},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1267150640487671},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12455359101295471}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7346121072769165},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6329553127288818},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6120859384536743},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5974475741386414},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5953395366668701},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5621691942214966},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4884988069534302},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4581663906574249},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4571492671966553},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45176273584365845},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.44378921389579773},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.33656996488571167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27066749334335327},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21257010102272034},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1267150640487671},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12455359101295471},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jsac.2006.1613770","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsac.2006.1613770","pdf_url":null,"source":{"id":"https://openalex.org/S90422530","display_name":"IEEE Journal on Selected Areas in Communications","issn_l":"0733-8716","issn":["0733-8716","1558-0008"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Selected Areas in Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1524993602","https://openalex.org/W1536656161","https://openalex.org/W1933928133","https://openalex.org/W1977545325","https://openalex.org/W1992168497","https://openalex.org/W2079988509","https://openalex.org/W2089048768","https://openalex.org/W2091088588","https://openalex.org/W2091600398","https://openalex.org/W2095618098","https://openalex.org/W2097675365","https://openalex.org/W2103265235","https://openalex.org/W2108230485","https://openalex.org/W2113053352","https://openalex.org/W2113053490","https://openalex.org/W2113688176","https://openalex.org/W2119641022","https://openalex.org/W2123071102","https://openalex.org/W2123855330","https://openalex.org/W2133697273","https://openalex.org/W2135561000","https://openalex.org/W2135976029","https://openalex.org/W2137467649","https://openalex.org/W2146049426","https://openalex.org/W2148511060","https://openalex.org/W2150891346","https://openalex.org/W2155061423","https://openalex.org/W2159429851","https://openalex.org/W2160760990","https://openalex.org/W2162925987","https://openalex.org/W2163068696","https://openalex.org/W2169836777","https://openalex.org/W2336259629","https://openalex.org/W2461460068","https://openalex.org/W2547979831","https://openalex.org/W4210463984","https://openalex.org/W4213060235"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1997440971","https://openalex.org/W1972487624","https://openalex.org/W2064711473","https://openalex.org/W1515277195","https://openalex.org/W2186932829","https://openalex.org/W104942727","https://openalex.org/W2122302754","https://openalex.org/W2121598558","https://openalex.org/W1993229082"],"abstract_inverted_index":{"Given":[0],"a":[1,14,31,71,130,140,162,207,224,230],"combination":[2],"of":[3,17,24,30,65,90,129,143,166,217],"unprotected":[4,78],"and":[5,13,54,178,229],"dedicated":[6],"edge-disjoint":[7,91],"path":[8,86,119,132,156,185,203],"(1+1)":[9],"protected":[10],"connection":[11,40,82,167],"requests":[12,41],"finite":[15],"set":[16],"fiber":[18,47,104,114,236],"types,":[19],"we":[20,109,123,181,198,205],"consider":[21],"the":[22,28,84,94,102,111,126,144,152,174,176,179,212,218,234],"problem":[23],"allocating":[25],"fibers":[26],"on":[27,233],"links":[29],"WDM":[32],"network":[33],"at":[34],"minimum":[35,145],"cost,":[36,237],"such":[37],"that":[38,70,125,154,183,200,238],"all":[39],"can":[42,239,246],"be":[43,240,247],"simultaneously":[44],"realized.":[45],"Each":[46],"type,":[48],"is":[49,68,135,158,187],"characterized":[50],"by":[51,74,201],"its":[52,55],"capacity":[53],"cost":[56,115,128],"per":[57],"unit":[58],"length,":[59],"where":[60],"costs":[61],"reflect":[62],"an":[63],"economy":[64],"scale.":[66],"It":[67],"known":[69],"solution":[72,134,210],"induced":[73],"\"simply\"":[75],"routing":[76,157,186,204],"each":[77],"(respectively":[79,87],"1+1":[80],"protected)":[81],"along":[83],"shortest":[85,88,118,131,155,184,202],"pair":[89],"paths)":[92],"minimizes":[93],"total":[95,103,127,164,235],"wavelength":[96],"mileage,":[97],"but":[98],"may":[99],"not":[100],"minimize":[101],"cost.":[105,147],"In":[106,121],"this":[107],"paper,":[108],"quantify":[110],"increase":[112],"in":[113,190,242],"due":[116],"to":[117,137,151,211],"routing.":[120],"particular,":[122],"prove":[124,199],"based":[133],"guaranteed":[136],"lie":[138],"within":[139],"certain":[141],"factor":[142],"possible":[146],"This":[148],"leads":[149],"also":[150],"fact":[153],"asymptotically":[159,188],"cost-optimal":[160,189],"for":[161,170],"large":[163],"number":[165],"requests.":[168],"Furthermore,":[169],"sparse":[171],"topologies,":[172],"e.g.,":[173],"ring,":[175],"ShuffleNet":[177],"mesh(-torus),":[180],"show":[182],"large-scale":[191],"networks":[192],"supporting":[193],"all-to-all":[194],"communication.":[195],"En":[196],"route,":[197],"obtain":[206],"provably":[208,225],"optimal":[209],"linear":[213],"programming":[214],"(LP-)":[215],"relaxation":[216],"problem.":[219],"We":[220],"have":[221],"thus":[222],"presented":[223],"good":[226],"upper":[227],"bound":[228,232],"lower":[231],"computed":[241],"polynomial-time.":[243],"These":[244],"bounds":[245],"used":[248],"as":[249],"benchmarks":[250],"against":[251],"which":[252],"heuristic":[253],"approaches":[254],"are":[255],"compared.":[256]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}