{"id":"https://openalex.org/W2292682977","doi":"https://doi.org/10.1109/glocom.2014.7417104","title":"Practical Approach to Identifying Additive Link Metrics with Shortest Path Routing","display_name":"Practical Approach to Identifying Additive Link Metrics with Shortest Path Routing","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2292682977","doi":"https://doi.org/10.1109/glocom.2014.7417104","mag":"2292682977"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2014.7417104","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2014.7417104","pdf_url":null,"source":{"id":"https://openalex.org/S4363607712","display_name":"2015 IEEE Global Communications Conference (GLOBECOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt1qn0m60g/qt1qn0m60g.pdf?t=o17k6d","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101967555","display_name":"Xiong Wang","orcid":"https://orcid.org/0000-0002-9932-6400"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiong Wang","raw_affiliation_strings":["Key Lab of Optical Fiber Sensing & Communications School of Communication & Information Engineering University of Electronic Science & Technology of China, Chengdu, China"],"affiliations":[{"raw_affiliation_string":"Key Lab of Optical Fiber Sensing & Communications School of Communication & Information Engineering University of Electronic Science & Technology of China, Chengdu, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007416619","display_name":"Mehdi Malboubi","orcid":"https://orcid.org/0000-0001-6995-5866"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mehdi Malboubi","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of California, Davis, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of California, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100371254","display_name":"Sheng Wang","orcid":"https://orcid.org/0000-0002-1473-5206"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sheng Wang","raw_affiliation_strings":["Key Lab of Optical Fiber Sensing & Communications School of Communication & Information Engineering University of Electronic Science & Technology of China, Chengdu, China"],"affiliations":[{"raw_affiliation_string":"Key Lab of Optical Fiber Sensing & Communications School of Communication & Information Engineering University of Electronic Science & Technology of China, Chengdu, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002960198","display_name":"Shizhong Xu","orcid":"https://orcid.org/0000-0003-4942-6638"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shizhong Xu","raw_affiliation_strings":["Key Lab of Optical Fiber Sensing & Communications School of Communication & Information Engineering University of Electronic Science & Technology of China, Chengdu, China"],"affiliations":[{"raw_affiliation_string":"Key Lab of Optical Fiber Sensing & Communications School of Communication & Information Engineering University of Electronic Science & Technology of China, Chengdu, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017383502","display_name":"Chen\u2010Nee Chuah","orcid":"https://orcid.org/0000-0002-2772-387X"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chen-Nee Chuah","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of California, Davis, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of California, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5101967555"],"corresponding_institution_ids":["https://openalex.org/I150229711"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.16746411,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"1","last_page":"6"},"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.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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","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"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9959999918937683,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.7366025447845459},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.69191974401474},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6840636730194092},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.6619448661804199},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6449652910232544},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6196926832199097},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6061398983001709},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.5766953825950623},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5113627314567566},{"id":"https://openalex.org/keywords/metrics","display_name":"Metrics","score":0.45384636521339417},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4448082745075226},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.39445242285728455},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.366056889295578},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.35412219166755676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22261101007461548},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17084842920303345},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12396234273910522}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7366025447845459},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.69191974401474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6840636730194092},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.6619448661804199},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6449652910232544},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6196926832199097},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6061398983001709},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.5766953825950623},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5113627314567566},{"id":"https://openalex.org/C195780805","wikidata":"https://www.wikidata.org/wiki/Q1535986","display_name":"Metrics","level":5,"score":0.45384636521339417},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4448082745075226},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.39445242285728455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.366056889295578},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.35412219166755676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22261101007461548},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17084842920303345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12396234273910522}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/glocom.2014.7417104","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2014.7417104","pdf_url":null,"source":{"id":"https://openalex.org/S4363607712","display_name":"2015 IEEE Global Communications Conference (GLOBECOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"},{"id":"pmh:qt1qn0m60g","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/1qn0m60g","pdf_url":"https://escholarship.org/content/qt1qn0m60g/qt1qn0m60g.pdf?t=o17k6d","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wang, Xiong; Malboubi, Mehdi; Wang, Sheng; Xu, Shizhong; & Chuah, Chen-Nee. (2015). Practical Approach to Identifying Additive LinkMetrics with Shortest Path Routing. IEEE Globecom. UC Davis: Retrieved from: http://www.escholarship.org/uc/item/1qn0m60g","raw_type":"article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt1qn0m60g","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/1qn0m60g","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt95m8t1wp","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/95m8t1wp","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:qt95m8t1wp","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/95m8t1wp","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wang, X; Malboubi, M; Wang, S; Xu, S; & Chuah, CN. (2015). Practical approach to identifying additive link metrics with shortest path routing. 2015 IEEE Global Communications Conference, GLOBECOM 2015. doi: 10.1109/GLOCOM.2014.7417104. UC Davis: Retrieved from: http://www.escholarship.org/uc/item/95m8t1wp","raw_type":"article"}],"best_oa_location":{"id":"pmh:qt1qn0m60g","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/1qn0m60g","pdf_url":"https://escholarship.org/content/qt1qn0m60g/qt1qn0m60g.pdf?t=o17k6d","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wang, Xiong; Malboubi, Mehdi; Wang, Sheng; Xu, Shizhong; & Chuah, Chen-Nee. (2015). Practical Approach to Identifying Additive LinkMetrics with Shortest Path Routing. IEEE Globecom. UC Davis: Retrieved from: http://www.escholarship.org/uc/item/1qn0m60g","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2292682977.pdf"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W258472279","https://openalex.org/W1922394927","https://openalex.org/W1989886489","https://openalex.org/W2038513099","https://openalex.org/W2048966198","https://openalex.org/W2090965126","https://openalex.org/W2098865491","https://openalex.org/W2108640845","https://openalex.org/W2142802993","https://openalex.org/W2143451847","https://openalex.org/W2146934567","https://openalex.org/W2148662748","https://openalex.org/W2149647489","https://openalex.org/W2162787146","https://openalex.org/W2177058407","https://openalex.org/W2295569936","https://openalex.org/W2798909945","https://openalex.org/W4242392370","https://openalex.org/W4243349849","https://openalex.org/W6640052206","https://openalex.org/W6673132531","https://openalex.org/W6750968397"],"related_works":["https://openalex.org/W2962525871","https://openalex.org/W189149726","https://openalex.org/W2154023691","https://openalex.org/W2064711473","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W768680197","https://openalex.org/W2889457051","https://openalex.org/W1971025399","https://openalex.org/W2121598558"],"abstract_inverted_index":{"We":[0],"revisit":[1],"the":[2,22,57,66,72,85,97,113,121,134,167],"problem":[3,76,122,135],"of":[4,65,94,106],"identifying":[5],"link":[6,43,73,86],"metrics":[7],"from":[8],"end-":[9],"to-end":[10],"path":[11,19,53,79,155],"measurements":[12],"in":[13,137,173,184],"practical":[14],"IP":[15,48],"networks":[16,49,164],"where":[17],"shortest":[18,52,78,110,154],"routing":[20,29,33,54,59,80,156],"is":[21,60],"norm.":[23],"Previous":[24],"solutions":[25,172],"rely":[26],"on":[27,160],"explicit":[28,58],"techniques":[30],"(e.g.,":[31],"source":[32],"or":[34],"MPLS)":[35],"to":[36,90,132,153],"construct":[37],"independent":[38,109],"measurement":[39],"paths":[40,111],"for":[41],"efficient":[42],"metric":[44,74],"identification.":[45],"However,":[46],"most":[47,64],"still":[50],"adopt":[51],"paradigm,":[55],"while":[56],"not":[61],"supported":[62],"by":[63],"routers.":[67],"Thus,":[68],"this":[69,116],"paper":[70],"studies":[71],"identification":[75],"under":[77],"constraints.":[81,157],"To":[82],"uniquely":[83],"identify":[84],"metrics,":[87],"we":[88,118,140],"need":[89],"place":[91],"sufficient":[92],"number":[93,105],"monitors":[95],"into":[96],"network":[98],"such":[99],"that":[100,151,166],"there":[101],"exist":[102],"$m$":[103],"(the":[104],"links)":[107],"linear":[108,127],"between":[112],"monitors.":[114],"In":[115],"paper,":[117],"first":[119],"formulate":[120],"as":[123],"a":[124,142,181],"mixed":[125],"integer":[126],"programming":[128],"problem,":[129],"and":[130,145,162,176],"then":[131],"make":[133],"tractable":[136],"large":[138,185],"networks,":[139,175],"propose":[141],"Monitor":[143],"Placement":[144],"Measurement":[146],"Path":[147],"Selection":[148],"(MP-MPS)":[149],"algorithm":[150],"adheres":[152],"Extensive":[158],"simulations":[159],"random":[161],"real":[163],"show":[165],"MP-":[168,177],"MPS":[169,178],"gets":[170],"near-optimal":[171],"small":[174],"significantly":[179],"outperforms":[180],"baseline":[182],"solution":[183],"networks.":[186]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}