{"id":"https://openalex.org/W2794058296","doi":"https://doi.org/10.1109/infocom.2018.8486249","title":"Robust Loss Inference in the Presence of Noisy Measurements","display_name":"Robust Loss Inference in the Presence of Noisy Measurements","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2794058296","doi":"https://doi.org/10.1109/infocom.2018.8486249","mag":"2794058296"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2018.8486249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2018.8486249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","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/A5100763035","display_name":"Yan Qiao","orcid":"https://orcid.org/0000-0002-4407-1762"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yan Qiao","raw_affiliation_strings":["State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100763035"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":1.1309,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7473025,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1","issue":null,"first_page":"738","last_page":"746"},"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.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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9994000196456909,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9983000159263611,"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/network-tomography","display_name":"Network tomography","score":0.9738200902938843},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.8027467727661133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6592273712158203},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5466625094413757},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4751836359500885},{"id":"https://openalex.org/keywords/information-loss","display_name":"Information loss","score":0.47374045848846436},{"id":"https://openalex.org/keywords/path-loss","display_name":"Path loss","score":0.4469807744026184},{"id":"https://openalex.org/keywords/tomography","display_name":"Tomography","score":0.4273635745048523},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4269316494464874},{"id":"https://openalex.org/keywords/computed-tomography","display_name":"Computed tomography","score":0.4229556620121002},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39461714029312134},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30384618043899536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23893827199935913},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07771885395050049}],"concepts":[{"id":"https://openalex.org/C146368544","wikidata":"https://www.wikidata.org/wiki/Q3408544","display_name":"Network tomography","level":3,"score":0.9738200902938843},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.8027467727661133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6592273712158203},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5466625094413757},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4751836359500885},{"id":"https://openalex.org/C2988416141","wikidata":"https://www.wikidata.org/wiki/Q6031139","display_name":"Information loss","level":2,"score":0.47374045848846436},{"id":"https://openalex.org/C194273485","wikidata":"https://www.wikidata.org/wiki/Q1478845","display_name":"Path loss","level":3,"score":0.4469807744026184},{"id":"https://openalex.org/C163716698","wikidata":"https://www.wikidata.org/wiki/Q841267","display_name":"Tomography","level":2,"score":0.4273635745048523},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4269316494464874},{"id":"https://openalex.org/C544519230","wikidata":"https://www.wikidata.org/wiki/Q32566","display_name":"Computed tomography","level":2,"score":0.4229556620121002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39461714029312134},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30384618043899536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23893827199935913},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07771885395050049},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2018.8486249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2018.8486249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","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":23,"referenced_works":["https://openalex.org/W584634945","https://openalex.org/W1994815284","https://openalex.org/W1999288870","https://openalex.org/W2019570828","https://openalex.org/W2021570109","https://openalex.org/W2028585033","https://openalex.org/W2031558773","https://openalex.org/W2038513099","https://openalex.org/W2089744762","https://openalex.org/W2110326922","https://openalex.org/W2118983471","https://openalex.org/W2134223946","https://openalex.org/W2135157979","https://openalex.org/W2146616964","https://openalex.org/W2146934567","https://openalex.org/W2164463804","https://openalex.org/W2170587003","https://openalex.org/W2528465878","https://openalex.org/W2562634129","https://openalex.org/W4242392370","https://openalex.org/W4251701311","https://openalex.org/W6678047197","https://openalex.org/W6683965097"],"related_works":["https://openalex.org/W2361733576","https://openalex.org/W1947416063","https://openalex.org/W2794058296","https://openalex.org/W2349785426","https://openalex.org/W2390624985","https://openalex.org/W2017770500","https://openalex.org/W3149522582","https://openalex.org/W2048192716","https://openalex.org/W2189202338","https://openalex.org/W2113152563"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,20,31,58,81,92,101,111,118,125,134,154,158],"problem":[4],"of":[5,60,72,96,114,161],"inferring":[6,74],"link":[7,76,116,126],"loss":[8,68,77,94,112,127,145],"rates":[9,78,95,128],"based":[10],"on":[11],"network":[12,17,21,36,82],"performance":[13,160],"tomography":[14,22],"in":[15,46],"noisy":[16],"systems.":[18],"Since":[19],"emerged,":[23],"all":[24,75,124],"existing":[25],"tomography-based":[26,61,67],"methods":[27,147],"are":[28],"limited":[29],"to":[30,99,133],"basic":[32],"condition":[33],"that":[34,129],"both":[35],"topologies":[37],"and":[38,104,149],"end-to-end":[39,93],"routes":[40],"must":[41],"be":[42],"absolutely":[43],"accurate,":[44],"which":[45],"most":[47,130],"cases":[48],"is":[49],"impractical,":[50],"especially":[51],"for":[52,110],"large-scale":[53],"heterogeneous":[54],"networks.":[55],"To":[56],"overcome":[57],"impracticability":[59],"methods,":[62],"we":[63],"propose":[64],"a":[65],"robust":[66],"inference":[69,146],"method":[70,89],"capable":[71],"accurately":[73],"even":[79],"when":[80],"system":[83],"may":[84],"change":[85],"dynamically.":[86],"The":[87],"new":[88],"first":[90],"measures":[91],"selected":[97],"paths":[98],"reduce":[100],"probing":[102],"cost,":[103],"then":[105],"calculates":[106],"an":[107],"upper":[108,139],"bound":[109],"rate":[113],"each":[115],"using":[117],"measurement":[119,135],"results.":[120],"Finally,":[121],"it":[122],"finds":[123],"closely":[131],"conform":[132],"results":[136,155],"within":[137],"their":[138],"bounds.":[140],"Compared":[141],"with":[142],"two":[143],"traditional":[144],"(with":[148],"without":[150],"path":[151],"selection,":[152],"respectively),":[153],"strongly":[156],"confirm":[157],"promising":[159],"our":[162],"proposed":[163],"approach.":[164]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
