{"id":"https://openalex.org/W2067572008","doi":"https://doi.org/10.1109/icc.2014.6883497","title":"An efficient solution to locate sparsely congested links by network tomography","display_name":"An efficient solution to locate sparsely congested links by network tomography","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2067572008","doi":"https://doi.org/10.1109/icc.2014.6883497","mag":"2067572008"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2014.6883497","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2014.6883497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communications (ICC)","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/A5101681256","display_name":"Jinbiao Chen","orcid":"https://orcid.org/0009-0002-5295-8969"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jinbiao Chen","raw_affiliation_strings":["Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China","Inst. for Interdiscipl. Inf. Sci., Tsinghua Univ., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Inst. for Interdiscipl. Inf. Sci., Tsinghua Univ., Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003371684","display_name":"Xiaogang Qi","orcid":"https://orcid.org/0000-0003-2208-0200"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiao Qi","raw_affiliation_strings":["Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China","Inst. for Interdiscipl. Inf. Sci., Tsinghua Univ., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Inst. for Interdiscipl. Inf. Sci., Tsinghua Univ., Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053362548","display_name":"Yongcai Wang","orcid":"https://orcid.org/0000-0002-4197-2258"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yongcai Wang","raw_affiliation_strings":["Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China","Inst. for Interdiscipl. Inf. Sci., Tsinghua Univ., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Inst. for Interdiscipl. Inf. Sci., Tsinghua Univ., Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101681256"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.6308,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.69648206,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"53","issue":null,"first_page":"1278","last_page":"1283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11739","display_name":"Microwave Imaging and Scattering Analysis","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9927999973297119,"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.8010173439979553},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6710323691368103},{"id":"https://openalex.org/keywords/snapshot","display_name":"Snapshot (computer storage)","score":0.5343170762062073},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.5018875598907471},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.49808669090270996},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48783138394355774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47363510727882385},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4677714705467224},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.4562590718269348},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39696526527404785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2431468665599823},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10754156112670898},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.10582256317138672}],"concepts":[{"id":"https://openalex.org/C146368544","wikidata":"https://www.wikidata.org/wiki/Q3408544","display_name":"Network tomography","level":3,"score":0.8010173439979553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6710323691368103},{"id":"https://openalex.org/C55282118","wikidata":"https://www.wikidata.org/wiki/Q252683","display_name":"Snapshot (computer storage)","level":2,"score":0.5343170762062073},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.5018875598907471},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.49808669090270996},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48783138394355774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47363510727882385},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4677714705467224},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.4562590718269348},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39696526527404785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2431468665599823},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10754156112670898},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.10582256317138672},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2014.6883497","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2014.6883497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communications (ICC)","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":15,"referenced_works":["https://openalex.org/W1511923017","https://openalex.org/W1994815284","https://openalex.org/W2002677656","https://openalex.org/W2038513099","https://openalex.org/W2098865491","https://openalex.org/W2116289073","https://openalex.org/W2127271355","https://openalex.org/W2130945399","https://openalex.org/W2170587003","https://openalex.org/W2963213854","https://openalex.org/W3103022139","https://openalex.org/W4238668657","https://openalex.org/W4242392370","https://openalex.org/W4250955649","https://openalex.org/W6785600539"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2810458795","https://openalex.org/W4225277450","https://openalex.org/W4221166565"],"abstract_inverted_index":{"Locating":[0],"individual":[1,142],"congested":[2,80,116,171],"links":[3,81,143,172],"in":[4,46,53],"large":[5],"scale":[6],"networks":[7],"is":[8,56,74,151,166],"an":[9],"important":[10],"but":[11,84],"difficult":[12],"problem,":[13],"because":[14],"of":[15,26,43,70,109,122,140,176,185],"the":[16,21,32,57,68,79,114,120,124,137,141,146,157,170,177,183,190,195],"hardness":[17],"to":[18,30,59,90,104,112,135,168],"directly":[19],"measure":[20],"massive":[22],"links.":[23,72,117],"Current":[24],"advantages":[25],"network":[27],"tomography":[28],"propose":[29,130],"infer":[31],"link":[33],"congestion":[34,138,158],"states":[35,69],"by":[36,173],"end-to-end":[37],"measurements":[38,64,89,111,148],"via":[39],"solving":[40,123],"a":[41,92,131,161],"set":[42],"linear":[44],"equations":[45],"Boolean":[47],"algebra.":[48],"But":[49],"one":[50],"challenging":[51],"problem":[52],"such":[54],"approaches":[55],"requirement":[58],"construct":[60],"n":[61,71,88],"linearly":[62],"independent":[63],"for":[65],"uniquely":[66],"identifying":[67],"It":[73],"especially":[75],"cost":[76],"inefficient":[77],"when":[78],"are":[82],"sparse,":[83],"requiring":[85],"larger":[86],"than":[87],"form":[91],"full-rank":[93],"observation":[94],"matrix.":[95],"In":[96],"this":[97],"paper,":[98],"we":[99,129],"focus":[100],"on":[101,145,156],"efficient":[102],"methods":[103,187],"take":[105],"only":[106],"limited":[107],"number":[108],"path":[110],"locate":[113,169],"sparsely":[115],"To":[118],"avoid":[119],"ambiguity":[121],"boolean":[125],"equations,":[126],"at":[127],"first,":[128],"compressive":[132],"sensing":[133],"method":[134],"estimate":[136],"probabilities":[139],"based":[144],"deficient":[147,178],"(routing":[149],"matrix":[150],"not":[152],"full":[153],"rank).":[154],"Based":[155],"probability":[159],"estimation,":[160],"greedy":[162],"iterative":[163],"estimation":[164],"algorithm":[165],"developed":[167],"online":[174],"snapshot":[175],"measurements.":[179],"Extensive":[180],"simulations":[181],"shows":[182],"effectiveness":[184],"proposed":[186],"which":[188],"reduce":[189],"measurement":[191],"costs":[192],"while":[193],"preserving":[194],"detection":[196],"accuracy.":[197]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
