{"id":"https://openalex.org/W2126764137","doi":"https://doi.org/10.1109/mascot.2002.1167082","title":"Network level capacity planning with efficiently computable global optimum","display_name":"Network level capacity planning with efficiently computable global optimum","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2126764137","doi":"https://doi.org/10.1109/mascot.2002.1167082","mag":"2126764137"},"language":"en","primary_location":{"id":"doi:10.1109/mascot.2002.1167082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascot.2002.1167082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5009539372","display_name":"Andr\u00e1s Farag\u00f3","orcid":"https://orcid.org/0000-0001-8952-6946"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Farago","raw_affiliation_strings":["Department of Computer Science, Erik Jonsson School of Engineering and Computer Science, University of Texas, Dallas, Richardson, TX, USA","Dept. of Comput. Sci., Texas Univ., Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Erik Jonsson School of Engineering and Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Texas Univ., Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009539372"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"229","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994999766349792,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6315268278121948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6231305599212646},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.5026752948760986},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4669448137283325},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4652130901813507},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4610547125339508},{"id":"https://openalex.org/keywords/capacity-planning","display_name":"Capacity planning","score":0.4560442566871643},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.34636402130126953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26893150806427},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1877741515636444}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6315268278121948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6231305599212646},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.5026752948760986},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4669448137283325},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4652130901813507},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4610547125339508},{"id":"https://openalex.org/C2781007418","wikidata":"https://www.wikidata.org/wiki/Q1456934","display_name":"Capacity planning","level":2,"score":0.4560442566871643},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.34636402130126953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26893150806427},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1877741515636444},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mascot.2002.1167082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascot.2002.1167082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1512866443","https://openalex.org/W1537469409","https://openalex.org/W2100440346","https://openalex.org/W2107498141","https://openalex.org/W2135096662","https://openalex.org/W2146327817","https://openalex.org/W2148275477","https://openalex.org/W2159079944","https://openalex.org/W2163032969","https://openalex.org/W2164364303","https://openalex.org/W2170219906","https://openalex.org/W4285719527","https://openalex.org/W6632182631"],"related_works":["https://openalex.org/W3190412567","https://openalex.org/W2769342879","https://openalex.org/W3153752017","https://openalex.org/W4321636663","https://openalex.org/W3022945273","https://openalex.org/W2362399017","https://openalex.org/W2135620794","https://openalex.org/W2899701084","https://openalex.org/W3142081536","https://openalex.org/W2059732327"],"abstract_inverted_index":{"A":[0],"novel,":[1],"network":[2,64],"level":[3,17],"capacity":[4,118],"planning":[5],"model":[6,21,105],"is":[7,22,72,88],"presented":[8],"with":[9],"the":[10,30,63,66,70,81,100,104,113,117],"following":[11],"key":[12],"properties.":[13],"(1)":[14],"The":[15,40],"link":[16,83],"traffic":[18,28],"and":[19,29],"blocking":[20,122],"very":[23,101],"general.":[24],"It":[25],"allows":[26],"multiclass":[27],"individual":[31],"bandwidth":[32],"demands":[33],"may":[34],"aggregate":[35],"in":[36,90,111],"complex,":[37],"nonlinear":[38],"ways.":[39],"conventional":[41],"assumptions,":[42],"such":[43],"as":[44],"Poisson":[45],"arrivals":[46],"or":[47],"exponential":[48],"holding":[49],"times,":[50],"are":[51],"not":[52,73],"required,":[53],"thus":[54],"allowing":[55],"non-standard":[56],"behaviour":[57],"patterns,":[58],"including":[59],"self-similarity.":[60],"(2)":[61],"On":[62],"level,":[65],"stochastic":[67],"behavior":[68],"of":[69,93,116],"links":[71],"required":[74],"to":[75],"be":[76,125],"independent.":[77],"Thus,":[78],"we":[79],"drop":[80],"traditional":[82],"independence":[84],"assumption,":[85],"because":[86],"it":[87],"questionable":[89],"a":[91,107],"number":[92],"modern":[94],"networking":[95],"situations.":[96],"(3)":[97],"Surprisingly,":[98],"despite":[99],"general":[102],"setting,":[103],"yields":[106],"convex":[108],"optimization":[109],"problem,":[110],"which":[112],"global":[114],"optimum":[115],"assignment":[119],"under":[120],"end-to-end":[121],"constraints":[123],"can":[124],"found":[126],"efficiently":[127],"(in":[128],"polynomial":[129],"time).":[130]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}