{"id":"https://openalex.org/W1982452580","doi":"https://doi.org/10.1109/comsnets.2011.5716481","title":"Reaching approximate Wardrop equilibrium at reduced costs of link state updates","display_name":"Reaching approximate Wardrop equilibrium at reduced costs of link state updates","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1982452580","doi":"https://doi.org/10.1109/comsnets.2011.5716481","mag":"1982452580"},"language":"en","primary_location":{"id":"doi:10.1109/comsnets.2011.5716481","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2011.5716481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","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/A5033484092","display_name":"Yong Oh Lee","orcid":"https://orcid.org/0000-0003-3817-3620"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yong Oh Lee","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A and M University, USA","Department of Electrical and Computer Engineering, Texas A & M, University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A and M University, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A & M, University, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070501243","display_name":"B Rengarajany","orcid":null},"institutions":[{"id":"https://openalex.org/I2802499160","display_name":"IMDEA Networks","ror":"https://ror.org/04mm9fg30","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I2802499160"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"B Rengarajany","raw_affiliation_strings":["IMDEA Networks","[IMDEA Networks, Spain]"],"affiliations":[{"raw_affiliation_string":"IMDEA Networks","institution_ids":["https://openalex.org/I2802499160"]},{"raw_affiliation_string":"[IMDEA Networks, Spain]","institution_ids":["https://openalex.org/I2802499160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101890763","display_name":"A. L. Narasimha Reddy","orcid":"https://orcid.org/0009-0008-2217-2563"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A L Narasimha Reddy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A and M University, USA","Department of Electrical and Computer Engineering, Texas A & M, University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A and M University, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A & M, University, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033484092"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.3654,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62117305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.9997000098228455,"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.9997000098228455,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9955000281333923,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9948999881744385,"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/computer-science","display_name":"Computer science","score":0.7554234862327576},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.6008817553520203},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5981895923614502},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5872461199760437},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5775135159492493},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.558999240398407},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5585002899169922},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4563291072845459},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.4242340326309204},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4181120991706848},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4105575680732727},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.372260719537735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1493479609489441}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7554234862327576},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.6008817553520203},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5981895923614502},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5872461199760437},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5775135159492493},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.558999240398407},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5585002899169922},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4563291072845459},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.4242340326309204},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4181120991706848},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4105575680732727},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.372260719537735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1493479609489441},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/comsnets.2011.5716481","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2011.5716481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.7420","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ee.tamu.edu/~reddy/papers/comsnets11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W110329357","https://openalex.org/W1748611583","https://openalex.org/W1969910155","https://openalex.org/W1971164686","https://openalex.org/W2071111131","https://openalex.org/W2096655151","https://openalex.org/W2096704096","https://openalex.org/W2097906305","https://openalex.org/W2100908985","https://openalex.org/W2103440894","https://openalex.org/W2103655097","https://openalex.org/W2103805977","https://openalex.org/W2111010037","https://openalex.org/W2113154285","https://openalex.org/W2114484470","https://openalex.org/W2119813346","https://openalex.org/W2120219653","https://openalex.org/W2121288348","https://openalex.org/W2121959042","https://openalex.org/W2133646105","https://openalex.org/W2135249558","https://openalex.org/W2143506299","https://openalex.org/W2143508387","https://openalex.org/W2150257312","https://openalex.org/W2154689747","https://openalex.org/W2161630099","https://openalex.org/W2162689181","https://openalex.org/W2167339049","https://openalex.org/W2168653634","https://openalex.org/W3014841294","https://openalex.org/W3161295396","https://openalex.org/W3162917905","https://openalex.org/W4249355801","https://openalex.org/W4253388873","https://openalex.org/W6604449229","https://openalex.org/W6637837523","https://openalex.org/W6674709125","https://openalex.org/W6675158476","https://openalex.org/W6677916633","https://openalex.org/W6679968482","https://openalex.org/W6682898382"],"related_works":["https://openalex.org/W1997091564","https://openalex.org/W2108305519","https://openalex.org/W2081964190","https://openalex.org/W2607223747","https://openalex.org/W2102655743","https://openalex.org/W2138640781","https://openalex.org/W2594015745","https://openalex.org/W2170921015","https://openalex.org/W2117123509","https://openalex.org/W2381844443"],"abstract_inverted_index":{"Several":[0],"routing":[1,27,32],"protocols":[2,37,48],"have":[3,49],"been":[4,51],"proposed":[5],"to":[6,41,121,156],"take":[7],"advantage":[8],"of":[9,57,62,76,85,89,98,103,110,133,151],"the":[10,47,64,72,83,87,96,131,135,149],"dynamic":[11,91,136],"metrics":[12,66,93],"on":[13,125],"links":[14],"such":[15,30],"as":[16],"link":[17,23,65,92,137,152],"delays,":[18],"queueing":[19],"lengths,":[20],"and":[21,119],"available":[22],"bandwidths.Wardrop":[24],"routing,":[25],"QOS":[26],"are":[28],"few":[29],"example":[31],"protocols.":[33],"Even":[34],"when":[35],"these":[36],"can":[38,147],"be":[39],"shown":[40],"offer":[42,122],"convergence":[43],"properties":[44],"without":[45],"oscillations,":[46],"not":[50],"widely":[52],"adopted":[53],"for":[54],"a":[55,101,107],"number":[56,150],"reasons.":[58],"The":[59],"expected":[60],"cost":[61,88,132],"keeping":[63,95],"updated":[67],"at":[68],"various":[69],"nodes":[70],"in":[71,158],"network":[73],"being":[74],"one":[75],"them.":[77],"In":[78],"this":[79],"paper,":[80],"we":[81],"study":[82],"problem":[84],"reducing":[86,130],"propagating":[90,134],"while":[94,128],"quality":[97,127],"paths":[99],"within":[100],"margin":[102],"error.":[104],"We":[105],"propose":[106],"simple":[108],"technique":[109],"threshold-based":[111],"metric":[112,138],"propagation":[113],"that":[114,143],"is":[115],"shown,":[116],"through":[117],"analysis":[118],"simulations,":[120],"bounded":[123],"guarantees":[124],"path":[126],"significantly":[129],"information.":[139],"Our":[140],"results":[141],"indicate":[142],"threshold":[144],"based":[145],"updates":[146,153],"reduce":[148],"by":[154],"up":[155],"90\u201395%":[157],"some":[159],"cases.":[160]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}