{"id":"https://openalex.org/W2017953803","doi":"https://doi.org/10.1109/ants.2013.6802848","title":"Distance realization problem in Network Tomography: A heuristic approach","display_name":"Distance realization problem in Network Tomography: A heuristic approach","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2017953803","doi":"https://doi.org/10.1109/ants.2013.6802848","mag":"2017953803"},"language":"en","primary_location":{"id":"doi:10.1109/ants.2013.6802848","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ants.2013.6802848","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","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/A5089818907","display_name":"Vanniarajan Chellappan","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Vanniarajan Chellappan","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","Dept of Computer Science and Engg, Indian Institute of Technology Madras, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Dept of Computer Science and Engg, Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088534812","display_name":"Kamala Krithivasan","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kamala Krithivasan","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","Dept of Computer Science and Engg, Indian Institute of Technology Madras, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Dept of Computer Science and Engg, Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089818907"],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.07942221,"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":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11716","display_name":"Random Matrices and Applications","score":0.9832000136375427,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/distance-matrix","display_name":"Distance matrix","score":0.8082953095436096},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.5705500841140747},{"id":"https://openalex.org/keywords/network-tomography","display_name":"Network tomography","score":0.5576211214065552},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5476514101028442},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4911031723022461},{"id":"https://openalex.org/keywords/distance-matrices-in-phylogeny","display_name":"Distance matrices in phylogeny","score":0.47367626428604126},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.47058525681495667},{"id":"https://openalex.org/keywords/degree-matrix","display_name":"Degree matrix","score":0.4338943362236023},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.42861008644104004},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4252469539642334},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.41161197423934937},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4106648862361908},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.399482399225235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38889428973197937},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37990036606788635},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.36465758085250854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3571658730506897},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3412439227104187},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.29387250542640686},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2362399697303772},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22086289525032043},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20745840668678284},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16219928860664368},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.11546468734741211}],"concepts":[{"id":"https://openalex.org/C111208986","wikidata":"https://www.wikidata.org/wiki/Q901698","display_name":"Distance matrix","level":2,"score":0.8082953095436096},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.5705500841140747},{"id":"https://openalex.org/C146368544","wikidata":"https://www.wikidata.org/wiki/Q3408544","display_name":"Network tomography","level":3,"score":0.5576211214065552},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5476514101028442},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4911031723022461},{"id":"https://openalex.org/C5349765","wikidata":"https://www.wikidata.org/wiki/Q5282866","display_name":"Distance matrices in phylogeny","level":2,"score":0.47367626428604126},{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.47058525681495667},{"id":"https://openalex.org/C162199024","wikidata":"https://www.wikidata.org/wiki/Q3085391","display_name":"Degree matrix","level":5,"score":0.4338943362236023},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.42861008644104004},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4252469539642334},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41161197423934937},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4106648862361908},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.399482399225235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38889428973197937},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37990036606788635},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.36465758085250854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3571658730506897},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3412439227104187},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.29387250542640686},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2362399697303772},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22086289525032043},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20745840668678284},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16219928860664368},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11546468734741211},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ants.2013.6802848","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ants.2013.6802848","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","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":19,"referenced_works":["https://openalex.org/W174827889","https://openalex.org/W1971937094","https://openalex.org/W1981192617","https://openalex.org/W1983207019","https://openalex.org/W1988944600","https://openalex.org/W2034921015","https://openalex.org/W2063099296","https://openalex.org/W2071595766","https://openalex.org/W2076896360","https://openalex.org/W2077631231","https://openalex.org/W2096320713","https://openalex.org/W2155589809","https://openalex.org/W2167917024","https://openalex.org/W2314431644","https://openalex.org/W2604184705","https://openalex.org/W4238668657","https://openalex.org/W6669995836","https://openalex.org/W6684679186","https://openalex.org/W6735941056"],"related_works":["https://openalex.org/W2001076853","https://openalex.org/W1872375678","https://openalex.org/W4387171312","https://openalex.org/W1974398340","https://openalex.org/W2062331061","https://openalex.org/W2096686184","https://openalex.org/W2268399116","https://openalex.org/W1985806186","https://openalex.org/W4388797330","https://openalex.org/W2017953803"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,39,72,75,111,132,145],"heuristic":[4,121],"approach":[5,122],"for":[6,84,110,123],"the":[7,19,48,51,55,63,85,91,98,102,140,150,153,159,168,174,178],"distance":[8,33,45,108,124,136,156,161,179],"realization":[9,34,96,125],"problem,":[10],"which":[11],"arises":[12],"in":[13,173],"Network":[14,16],"Tomography.":[15],"Tomography":[17],"is":[18,36,105,114],"study":[20],"of":[21,66,87,93,101,107,127,170],"estimating":[22],"internal":[23],"network":[24,175],"structure":[25],"and":[26,147,158],"link-level":[27],"performance":[28],"from":[29,43,62],"end-to-end":[30],"measurements.":[31],"A":[32],"problem":[35,92],"to":[37,116,166],"reconstruct":[38],"graph":[40,103,113],"or":[41,74],"topology":[42],"its":[44],"matrix,":[46],"i.e.,":[47],"matrix":[49,109,137,157],"containing":[50],"pairwise":[52,64],"distances":[53,65],"between":[54,152],"terminal":[56,67],"nodes.":[57],"The":[58],"graph,":[59],"thus":[60],"realized":[61,104],"nodes,":[68],"can":[69],"either":[70],"be":[71,117],"tree":[73,88,134,146,154],"general":[76,112],"graph.":[77],"There":[78],"are":[79],"efficient":[80],"polynomial":[81],"algorithms":[82],"developed":[83],"case":[86],"realization.":[89],"However,":[90],"finding":[94],"optimal":[95],"(i.e.,":[97],"total":[99],"length":[100],"minimum)":[106],"shown":[115],"NP-hard.":[118],"Our":[119],"proposed":[120],"consists":[126],"three":[128],"stages:":[129],"(i)":[130],"find":[131],"closer":[133],"realizable":[135,155],"based":[138],"on":[139],"shortest":[141],"paths,":[142],"(ii)":[143],"construct":[144],"(iii)":[148],"fix":[149],"differences":[151],"original":[160],"matrix.":[162],"It":[163],"also":[164],"attempts":[165],"maximize":[167],"`entropy":[169],"betweenness-centrality'":[171],"measure":[172],"while":[176],"satisfying":[177],"constraints.":[180]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}