{"id":"https://openalex.org/W2028214880","doi":"https://doi.org/10.1109/wiopt.2008.4586097","title":"Using stochastic approximation to design OSPF routing areas that satisfy multiple and diverse end-to-end performance requirements","display_name":"Using stochastic approximation to design OSPF routing areas that satisfy multiple and diverse end-to-end performance requirements","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W2028214880","doi":"https://doi.org/10.1109/wiopt.2008.4586097","mag":"2028214880"},"language":"en","primary_location":{"id":"doi:10.1109/wiopt.2008.4586097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wiopt.2008.4586097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops","raw_type":"proceedings-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/A5050244619","display_name":"Kyriakos Manousakis","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kyriakos Manousakis","raw_affiliation_strings":["Applied Research Telcordia Technologies, Piscataway, NJ, USA","Appl. Res., Telcordia Technol., Piscataway, NJ"],"affiliations":[{"raw_affiliation_string":"Applied Research Telcordia Technologies, Piscataway, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Appl. Res., Telcordia Technol., Piscataway, NJ","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051379055","display_name":"A. McAuley","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anthony J. McAuley","raw_affiliation_strings":["Applied Research Telcordia Technologies, Piscataway, NJ, USA","Appl. Res., Telcordia Technol., Piscataway, NJ"],"affiliations":[{"raw_affiliation_string":"Applied Research Telcordia Technologies, Piscataway, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Appl. Res., Telcordia Technol., Piscataway, NJ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050244619"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.10230466,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"394","last_page":"402"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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/T10246","display_name":"Mobile Ad Hoc Networks","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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9995999932289124,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9993000030517578,"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/computer-science","display_name":"Computer science","score":0.7861852049827576},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.6711283922195435},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6116660833358765},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5679892301559448},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.49939608573913574},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.497592955827713},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.4840885400772095},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.46839213371276855},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4551238715648651},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.44037148356437683},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4172712564468384},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.40401387214660645},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3397867679595947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10443779826164246}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7861852049827576},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.6711283922195435},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6116660833358765},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5679892301559448},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.49939608573913574},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.497592955827713},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.4840885400772095},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.46839213371276855},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4551238715648651},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.44037148356437683},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4172712564468384},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.40401387214660645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3397867679595947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10443779826164246},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wiopt.2008.4586097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wiopt.2008.4586097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W29439688","https://openalex.org/W167812517","https://openalex.org/W1557418999","https://openalex.org/W1584330117","https://openalex.org/W1634220135","https://openalex.org/W1960957503","https://openalex.org/W1970406421","https://openalex.org/W1977545325","https://openalex.org/W1989972720","https://openalex.org/W2001707586","https://openalex.org/W2014411916","https://openalex.org/W2030087828","https://openalex.org/W2035041833","https://openalex.org/W2092480587","https://openalex.org/W2096655151","https://openalex.org/W2101678493","https://openalex.org/W2105601787","https://openalex.org/W2105756046","https://openalex.org/W2106143220","https://openalex.org/W2112398851","https://openalex.org/W2113197410","https://openalex.org/W2145721479","https://openalex.org/W2152483463","https://openalex.org/W2155427143","https://openalex.org/W2161835730","https://openalex.org/W2248064281","https://openalex.org/W2251592994","https://openalex.org/W2981939759","https://openalex.org/W4302094287","https://openalex.org/W6601212548","https://openalex.org/W6606819349","https://openalex.org/W6636837573","https://openalex.org/W6640952003","https://openalex.org/W6691190440"],"related_works":["https://openalex.org/W2122827966","https://openalex.org/W4288781972","https://openalex.org/W3110081158","https://openalex.org/W2104041436","https://openalex.org/W2035841327","https://openalex.org/W2485298353","https://openalex.org/W2188727730","https://openalex.org/W1528650883","https://openalex.org/W43799986","https://openalex.org/W4205676746"],"abstract_inverted_index":{"Dividing":[0],"an":[1,148],"open":[2,130],"shortest":[3,131],"path":[4,45,132],"first":[5,133],"(OSPF)":[6,134],"autonomous":[7],"system":[8],"(AS)":[9],"into":[10,109],"independent":[11],"routing":[12,32,44,78,135,225],"areas":[13,37,56,136,217],"allows":[14],"area":[15],"topology":[16],"abstraction,":[17],"reducing":[18],"route":[19],"overhead,":[20],"table":[21],"size,":[22],"and":[23,47,121,168,198,236,250,273],"convergence":[24],"time,":[25],"while":[26,40,231],"providing":[27],"some":[28,68],"isolation":[29],"from":[30,180],"bad":[31],"data.":[33],"On":[34],"the":[35,111,127,215,233,264,266,270],"contrary,":[36],"reduce":[38],"connectivity,":[39],"increasing":[41],"configuration":[42],"complexity,":[43],"length,":[46],"traffic":[48],"concentration.":[49],"The":[50,143,173],"formation":[51],"of":[52,91,113,129,151,164,224],"performance":[53,105,141,271],"efficient":[54],"OSPF":[55,190,206,216],"subject":[57],"to":[58,63,74,87,137,196,227,275],"multiple":[59],"requirements":[60,106,170,272],"is":[61,145,157],"known":[62,193],"be":[64,85],"NP-complete":[65],"problem;":[66],"however,":[67],"simple":[69],"heuristics":[70],"have":[71],"been":[72],"used":[73,86],"optimize":[75,100],"for":[76,101,184],"particular":[77],"metrics.":[79],"For":[80,239],"example,":[81],"a":[82,119,158,220],"min-cut":[83],"can":[84,99,178,268],"ensure":[88],"balanced":[89],"number":[90],"nodes":[92],"per":[93],"area.":[94],"However,":[95],"no":[96],"existing":[97],"tools":[98],"actual":[102],"end-to-":[103],"end":[104],"or":[107],"take":[108],"account":[110],"characteristics":[112],"network":[114,185,277],"topology.":[115],"This":[116,212],"paper":[117,213],"describes":[118],"fast":[120],"flexible":[122],"optimization":[123,223],"tool":[124,144,177,267],"that":[125,260],"automates":[126],"design":[128,218],"meet":[138],"heterogeneous":[139,276],"end-to-end":[140],"requirements.":[142],"based":[146,176],"on":[147],"enhanced":[149],"version":[150],"simulated":[152,174],"annealing":[153,175],"(SA)":[154],"algorithm,":[155],"which":[156],"general":[159],"stochastic":[160],"approximation":[161],"method":[162],"capable":[163],"handling":[165],"multiple,":[166],"diverse":[167,240],"conflicting":[169],"(multi-objective":[171],"optimization).":[172],"provide":[179],"highly":[181],"optimized":[182],"solutions":[183,200],"planners":[186],"designing":[187],"conventional":[188],"wired":[189],"networks":[191,203],"with":[192,208],"application":[194,210],"flows":[195],"scalability":[197],"robust":[199],"in":[201],"wireless":[202],"using":[204],"MANET":[205],"extensions":[207],"changing":[209],"needs.":[211],"formulates":[214],"as":[219],"weighted-sum":[221],"multi-objective":[222],"metrics":[226],"maximize":[228],"user":[229,246],"capacity,":[230],"minimizing":[232],"increased":[234,251],"delay":[235,247],"lost":[237],"connectivity.":[238],"topologies,":[241],"we":[242,258],"show":[243,259],"significantly":[244],"reduced":[245],"(over":[248],"25%)":[249],"available":[252],"bandwidth":[253],"(by":[254],"over":[255],"400%).":[256],"Further,":[257],"by":[261],"simply":[262],"adjusting":[263],"weights,":[265],"prioritize":[269],"adapt":[274],"environments.":[278]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2014,"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"}