{"id":"https://openalex.org/W1976770356","doi":"https://doi.org/10.1109/fgct.2013.6767208","title":"Everything is better with sprinkles: Greedy routing with bounded stretch","display_name":"Everything is better with sprinkles: Greedy routing with bounded stretch","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W1976770356","doi":"https://doi.org/10.1109/fgct.2013.6767208","mag":"1976770356"},"language":"en","primary_location":{"id":"doi:10.1109/fgct.2013.6767208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fgct.2013.6767208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Second International Conference on Future Generation Communication Technologies (FGCT 2013)","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/A5073174267","display_name":"Christoph Werle","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christoph Werle","raw_affiliation_strings":["Institute of Telematics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany","Inst. of Telematics, Karlsruhe Inst. of Technol. (KIT), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Telematics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Inst. of Telematics, Karlsruhe Inst. of Technol. (KIT), Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076270002","display_name":"Oliver P. Waldhorst","orcid":"https://orcid.org/0000-0002-5468-2073"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Oliver P. Waldhorst","raw_affiliation_strings":["Institute of Telematics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany","Inst. of Telematics, Karlsruhe Inst. of Technol. (KIT), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Telematics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Inst. of Telematics, Karlsruhe Inst. of Technol. (KIT), Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073174267"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08925292,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"61","issue":null,"first_page":"169","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991000294685364,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991000294685364,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987000226974487,"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/T11478","display_name":"Caching and Content Delivery","score":0.9984999895095825,"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/routing","display_name":"Routing (electronic design automation)","score":0.6807629466056824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6225574612617493},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6033728122711182},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5795184373855591},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5769039988517761},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5674694776535034},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5631928443908691},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4377317428588867},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4215109050273895},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3570765256881714},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3013819456100464},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27947771549224854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.258512020111084},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13220319151878357}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6807629466056824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6225574612617493},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6033728122711182},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5795184373855591},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5769039988517761},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5674694776535034},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5631928443908691},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4377317428588867},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4215109050273895},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3570765256881714},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3013819456100464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27947771549224854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.258512020111084},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13220319151878357},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/fgct.2013.6767208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fgct.2013.6767208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Second International Conference on Future Generation Communication Technologies (FGCT 2013)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1500591628","https://openalex.org/W1527483699","https://openalex.org/W1985977780","https://openalex.org/W1997881834","https://openalex.org/W2057994027","https://openalex.org/W2067247412","https://openalex.org/W2083987695","https://openalex.org/W2114936722","https://openalex.org/W2120733215","https://openalex.org/W2127394171","https://openalex.org/W2133065816","https://openalex.org/W2135920560","https://openalex.org/W2147688841","https://openalex.org/W2162679248","https://openalex.org/W2244611312","https://openalex.org/W4252127729","https://openalex.org/W6631222323","https://openalex.org/W6664927380"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2086397253"],"abstract_inverted_index":{"Sprinkles":[0,57,89],"is":[1,16,90,118],"a":[2,19,43,53],"greedy":[3,94],"routing":[4,21,34,55,95],"protocol":[5,96],"with":[6,42],"very":[7,153],"low":[8,102,154],"average":[9],"stretch":[10,14,50,87,100,116],"and":[11,36,78,105,124,142],"bounded":[12],"additive":[13,49,86,99],"that":[15,72,114,130],"inspired":[17],"by":[18,120,126],"compact":[20,61],"scheme":[22],"for":[23],"power":[24],"law":[25],"graphs.":[26],"By":[27],"replacing":[28],"the":[29,48,85,91,115],"hitherto":[30],"centralized":[31],"computations":[32],"of":[33,145],"information":[35],"exact":[37],"distance":[38],"labels":[39],"on":[40,109,140],"trees":[41],"distributed":[44,54,93],"construction,":[45],"we":[46,69],"transfer":[47],"bound":[51,117],"into":[52],"protocol.":[56],"is,":[58],"however,":[59],"not":[60],"due":[62],"to":[63,74,147],"potentially":[64],"unbounded":[65],"address":[66,80,107,131],"sizes.":[67],"Therefore,":[68],"introduce":[70],"mechanisms":[71],"lead":[73],"reduced,":[75],"practicable":[76],"mean":[77,103,155],"maximum":[79],"sizes":[81,108,132],"while":[82,150],"still":[83,151],"preserving":[84],"bound.":[88],"first":[92],"providing":[97,152],"an":[98],"bound,":[101],"stretch,":[104],"feasible":[106],"relevant":[110],"topologies.":[111],"We":[112],"prove":[113],"maintained":[119],"our":[121],"adapted":[122],"construction":[123],"demonstrate":[125],"extensive":[127],"simulation":[128],"experiments":[129],"as":[133,135],"well":[134],"communication":[136],"overhead":[137],"are":[138],"well-behaved":[139],"synthetic":[141],"realistic":[143],"topologies":[144],"up":[146],"200k":[148],"nodes":[149],"stretch.":[156]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}