{"id":"https://openalex.org/W1996697202","doi":"https://doi.org/10.1109/cloudcom.2012.6427603","title":"A fast estimation of shortest path distance for power-law network predominant cloud service","display_name":"A fast estimation of shortest path distance for power-law network predominant cloud service","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W1996697202","doi":"https://doi.org/10.1109/cloudcom.2012.6427603","mag":"1996697202"},"language":"en","primary_location":{"id":"doi:10.1109/cloudcom.2012.6427603","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cloudcom.2012.6427603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"4th IEEE International Conference on Cloud Computing Technology and Science Proceedings","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/A5100327013","display_name":"Jin Liu","orcid":"https://orcid.org/0000-0001-7082-2163"},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jin Liu","raw_affiliation_strings":["State Key Laboratory of Software Engineering Computer School, Wuhan University, Wuhan, China","State Key Lab. of Software Engineering, Computer School, Wuhan University Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Software Engineering Computer School, Wuhan University, Wuhan, China","institution_ids":["https://openalex.org/I37461747"]},{"raw_affiliation_string":"State Key Lab. of Software Engineering, Computer School, Wuhan University Wuhan, China","institution_ids":["https://openalex.org/I37461747"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108044249","display_name":"Chunming Rong","orcid":"https://orcid.org/0000-0002-8347-0539"},"institutions":[{"id":"https://openalex.org/I92008406","display_name":"University of Stavanger","ror":"https://ror.org/02qte9q33","country_code":"NO","type":"education","lineage":["https://openalex.org/I92008406"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Chunming Rong","raw_affiliation_strings":["CIPSI, University of Stavanger, Stavanger, Norway","CIPSI University of Stavanger Stavanger, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIPSI, University of Stavanger, Stavanger, Norway","institution_ids":["https://openalex.org/I92008406"]},{"raw_affiliation_string":"CIPSI University of Stavanger Stavanger, Norway","institution_ids":["https://openalex.org/I92008406"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033246476","display_name":"Ganseng Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I187400657","display_name":"South China Normal University","ror":"https://ror.org/01kq0pv72","country_code":"CN","type":"education","lineage":["https://openalex.org/I187400657"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ganseng Zhao","raw_affiliation_strings":["School of Computer Science, South China Normal University, Guangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, South China Normal University, Guangzhou, China","institution_ids":["https://openalex.org/I187400657"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":null,"first_page":"480","last_page":"487"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994000196456909,"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.9994000196456909,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8416520357131958},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.729880154132843},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.6783252954483032},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6438177824020386},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6373158693313599},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6168742775917053},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5903260707855225},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.535783052444458},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5155743956565857},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.48689571022987366},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4658910036087036},{"id":"https://openalex.org/keywords/distance-matrix","display_name":"Distance matrix","score":0.4543525278568268},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3882107138633728},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3638280928134918},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3336607813835144},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31043320894241333},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30805444717407227},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.22248873114585876}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8416520357131958},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.729880154132843},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.6783252954483032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6438177824020386},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6373158693313599},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6168742775917053},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5903260707855225},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.535783052444458},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5155743956565857},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.48689571022987366},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4658910036087036},{"id":"https://openalex.org/C111208986","wikidata":"https://www.wikidata.org/wiki/Q901698","display_name":"Distance matrix","level":2,"score":0.4543525278568268},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3882107138633728},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3638280928134918},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3336607813835144},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31043320894241333},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30805444717407227},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.22248873114585876}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cloudcom.2012.6427603","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cloudcom.2012.6427603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"4th IEEE International Conference on Cloud Computing Technology and Science Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5600000023841858,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1581228220","https://openalex.org/W1976969221","https://openalex.org/W1989894867","https://openalex.org/W2019854450","https://openalex.org/W2027377866","https://openalex.org/W2045446569","https://openalex.org/W2095944762","https://openalex.org/W2097147952","https://openalex.org/W2102662973","https://openalex.org/W2105098323","https://openalex.org/W2107527903","https://openalex.org/W2115118496","https://openalex.org/W2117598519","https://openalex.org/W2147045484","https://openalex.org/W2147391892","https://openalex.org/W2152306920","https://openalex.org/W2159394589","https://openalex.org/W2165621523","https://openalex.org/W2172107427","https://openalex.org/W2244611312","https://openalex.org/W2251198337","https://openalex.org/W2769133055","https://openalex.org/W2997134027","https://openalex.org/W4253303780","https://openalex.org/W6682111644"],"related_works":["https://openalex.org/W2347245430","https://openalex.org/W651485002","https://openalex.org/W4293054712","https://openalex.org/W2094515718","https://openalex.org/W2163460271","https://openalex.org/W2347831319","https://openalex.org/W2009448154","https://openalex.org/W1996697202","https://openalex.org/W2388893052","https://openalex.org/W2537573442"],"abstract_inverted_index":{"The":[0,37,198],"estimation":[1,174],"of":[2,58,69,89,107,129,140,157,165,176,222,245,258],"the":[3,21,41,46,55,59,75,84,95,105,110,126,137,141,155,163,166,177,186,192,203,210,219,223,237,252,256,259],"shortest":[4,60,72,167,178,225,239],"path":[5,73,168,179,226,240],"between":[6,86,242],"two":[7],"vertices":[8,90],"in":[9,20,54,91,109,144,161,191],"a":[10,64,80,243],"network":[11,111,142],"graphs":[12],"is":[13,104,122,205,228],"an":[14,70,99,173,215],"important":[15],"issue":[16],"for":[17,116,136,181],"many":[18,147,189],"applications":[19,194],"real":[22,193],"world,":[23],"which":[24],"may":[25],"be":[26,214],"road":[27],"networks,":[28,31],"social":[29],"collaboration":[30],"biological":[32],"networks":[33,190],"and":[34,45,66,93,132,159,218,254],"so":[35,208],"forth.":[36],"short":[38],"response":[39],"time,":[40],"less":[42],"space":[43,131,160],"cost":[44],"high":[47],"accuracy":[48,164],"are":[49,195],"three":[50],"critical":[51],"evaluation":[52],"metrics":[53],"approximate":[56,71,224],"calculation":[57,68,96,180,220],"path.":[61],"To":[62],"achieve":[63],"quick":[65],"accurate":[67],"distance,":[74],"typical":[76],"method":[77,118],"that":[78,149,188,202,209],"takes":[79],"non-trivial":[81],"approach":[82],"calculates":[83],"distance":[85,227,241],"every":[87],"pair":[88,244],"advance":[92],"records":[94],"results":[97],"with":[98],"n\u00d7n":[100],"matrix,":[101],"where":[102],"n":[103],"number":[106],"vertexes":[108],"graph.":[112],"Unfortunately,":[113],"it":[114,121],"hard":[115],"this":[117,170],"function":[119],"because":[120],"difficult":[123],"to":[124,153,185,231],"sustain":[125],"huge":[127],"amount":[128],"storage":[130],"time":[133,158,212],"consuming":[134],"preprocessing":[135],"big":[138],"size":[139],"graph":[143],"practice.":[145],"Unlike":[146],"efforts":[148],"have":[150],"been":[151],"made":[152],"minimize":[154],"costs":[156],"enhancing":[162],"calculation,":[169],"paper":[171],"proposes":[172],"scheme":[175],"power-law":[182,196],"graphs,":[183],"due":[184],"fact":[187],"networks.":[197],"theoretical":[199],"analysis":[200,253],"indicates":[201],"schema":[204],"successfully":[206],"optimized":[207],"query":[211],"can":[213],"approximation":[216],"constant":[217],"result":[221],"almost":[229],"2":[230],"3":[232],"times":[233],"as":[234,236],"long":[235],"actual":[238],"vertices.":[246],"A":[247],"simulation":[248],"experiment":[249],"also":[250],"validates":[251],"demonstrates":[255],"feasibility":[257],"proposed":[260],"scheme.":[261]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}