{"id":"https://openalex.org/W2022025432","doi":"https://doi.org/10.1109/iscc.2013.6755040","title":"LMD: A local minimum driven and self-organized method to obtain locators","display_name":"LMD: A local minimum driven and self-organized method to obtain locators","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2022025432","doi":"https://doi.org/10.1109/iscc.2013.6755040","mag":"2022025432"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2013.6755040","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2013.6755040","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computers and Communications (ISCC)","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/A5018488674","display_name":"Yonggong Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]},{"id":"https://openalex.org/I4210090176","display_name":"Institute of Computing Technology","ror":"https://ror.org/0090r4d87","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210090176"]},{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yonggong Wang","raw_affiliation_strings":["Institute of Computing Technology, Chinese Academy of Sciences, China","Inst. of Comput. Technol., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Technology, Chinese Academy of Sciences, China","institution_ids":["https://openalex.org/I4210090176","https://openalex.org/I19820366"]},{"raw_affiliation_string":"Inst. of Comput. Technol., Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030689390","display_name":"Gaogang Xie","orcid":"https://orcid.org/0000-0003-4964-1135"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]},{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]},{"id":"https://openalex.org/I4210090176","display_name":"Institute of Computing Technology","ror":"https://ror.org/0090r4d87","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210090176"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Gaogang Xie","raw_affiliation_strings":["Institute of Computing Technology, Chinese Academy of Sciences, China","Inst. of Comput. Technol., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Technology, Chinese Academy of Sciences, China","institution_ids":["https://openalex.org/I4210090176","https://openalex.org/I19820366"]},{"raw_affiliation_string":"Inst. of Comput. Technol., Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040251515","display_name":"Mohamed Ali K\u00e2afar","orcid":"https://orcid.org/0000-0003-2714-0276"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohamed-Ali Kaafar","raw_affiliation_strings":["Rhone-Alpes France, INRIA, Australia","INRIA Rhone-Alpes France, NICTA, Canberra, SA, Australia"],"affiliations":[{"raw_affiliation_string":"Rhone-Alpes France, INRIA, Australia","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA Rhone-Alpes France, NICTA, Canberra, SA, Australia","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024670650","display_name":"Steve Uhlig","orcid":"https://orcid.org/0000-0001-6251-6836"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Steve Uhlig","raw_affiliation_strings":["Queen Mary, University of London, London, UK","Queen Mary University of London, London, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Queen Mary, University of London, London, UK","institution_ids":["https://openalex.org/I166337079"]},{"raw_affiliation_string":"Queen Mary University of London, London, UK#TAB#","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5018488674"],"corresponding_institution_ids":["https://openalex.org/I125839683","https://openalex.org/I19820366","https://openalex.org/I4210090176"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11991763,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"000759","last_page":"000764"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9962999820709229,"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/T11478","display_name":"Caching and Content Delivery","score":0.9962999820709229,"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.9891999959945679,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9879999756813049,"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/computer-science","display_name":"Computer science","score":0.7464737296104431},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5947280526161194},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.5848235487937927},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5767240524291992},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5633803009986877},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5600458979606628},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5193384885787964},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.514426052570343},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.49419620633125305},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4557390809059143},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.45072224736213684},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.44927629828453064},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4457554817199707},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4073660969734192},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.23464426398277283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2074907422065735}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7464737296104431},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5947280526161194},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.5848235487937927},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5767240524291992},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5633803009986877},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5600458979606628},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5193384885787964},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.514426052570343},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.49419620633125305},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4557390809059143},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.45072224736213684},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.44927629828453064},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4457554817199707},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4073660969734192},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.23464426398277283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2074907422065735},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc.2013.6755040","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2013.6755040","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1494972982","https://openalex.org/W1518780012","https://openalex.org/W1527483699","https://openalex.org/W1542976050","https://openalex.org/W1572272766","https://openalex.org/W1990911977","https://openalex.org/W1995213405","https://openalex.org/W1997817455","https://openalex.org/W2008620264","https://openalex.org/W2016869317","https://openalex.org/W2027935533","https://openalex.org/W2033556475","https://openalex.org/W2043469923","https://openalex.org/W2054030867","https://openalex.org/W2057994027","https://openalex.org/W2062101567","https://openalex.org/W2083086638","https://openalex.org/W2109983959","https://openalex.org/W2118347867","https://openalex.org/W2127394171","https://openalex.org/W2131196627","https://openalex.org/W2132051999","https://openalex.org/W2144253712","https://openalex.org/W2152809170","https://openalex.org/W2152948207","https://openalex.org/W2158969254","https://openalex.org/W2164355806","https://openalex.org/W2166576909","https://openalex.org/W2964255104","https://openalex.org/W3105139986","https://openalex.org/W3142061005","https://openalex.org/W4206060609","https://openalex.org/W4230136419","https://openalex.org/W4285719527","https://openalex.org/W6631139668","https://openalex.org/W6631222323","https://openalex.org/W6649849682","https://openalex.org/W6661343344","https://openalex.org/W6664927380"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W4253436398","https://openalex.org/W1655019438","https://openalex.org/W2068473861","https://openalex.org/W2002267183","https://openalex.org/W2607223747","https://openalex.org/W2351878639","https://openalex.org/W2556128816","https://openalex.org/W2965704649","https://openalex.org/W2369989480"],"abstract_inverted_index":{"The":[0,125],"scalability":[1],"of":[2,10,98,157],"routing":[3,115,121,127],"architectures":[4],"for":[5,47],"large":[6,172],"networks":[7,173],"is":[8,25,41,136],"one":[9],"the":[11,15,64,95,99,108,119,133,140,158],"biggest":[12],"challenges":[13],"that":[14,165],"Internet":[16,160],"faces":[17],"today.":[18],"Greedy":[19],"routing,":[20],"in":[21,90,132],"which":[22,81,117],"each":[23],"node":[24],"assigned":[26],"a":[27,31,44,57,75,113,155,175],"locator":[28],"used":[29,138],"as":[30,43,151,153],"distance":[32],"metric,":[33],"recently":[34],"received":[35],"increased":[36],"attention":[37],"from":[38],"researchers":[39],"and":[40,77,130],"considered":[42],"potential":[45],"solution":[46],"scalable":[48],"routing.":[49,124],"In":[50],"this":[51],"paper,":[52],"we":[53,111,163],"propose":[54],"LMD":[55,166],"-":[56,103],"Local":[58],"Minimum":[59],"Driven":[60],"method":[61],"to":[62,69,88],"compute":[63],"topology-based":[65],"locator.":[66],"As":[67],"opposed":[68],"previous":[70],"work,":[71],"our":[72],"algorithm":[73],"employs":[74],"quasigreedy":[76],"self-organized":[78],"embedding":[79],"method,":[80],"outperforms":[82],"similar":[83],"decentralized":[84],"algorithms":[85],"by":[86,139],"up":[87],"20%":[89],"success":[91],"rate.":[92],"To":[93],"eliminate":[94],"negative":[96],"effect":[97],"\u201cquasi\u201d":[100],"greedy":[101,120,126],"property":[102],"transfer":[104],"routes":[105],"longer":[106],"than":[107],"shortest":[109],"routes,":[110],"introduce":[112],"two-stage":[114],"strategy,":[116],"combines":[118],"with":[122,174],"source":[123],"path":[128],"discovered":[129],"compressed":[131],"first":[134],"stage":[135],"then":[137],"following":[141],"source-routing":[142],"stage.":[143],"Through":[144],"extensive":[145],"evaluations,":[146],"based":[147],"on":[148,154,171],"synthetic":[149],"topologies":[150],"well":[152],"snapshot":[156],"real":[159],"AS":[161],"topology,":[162],"show":[164],"guarantees":[167],"100%":[168],"delivery":[169],"rate":[170],"very":[176],"low":[177],"stretch.":[178]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}