{"id":"https://openalex.org/W2795339395","doi":"https://doi.org/10.1145/3211852.3211859","title":"Charting the Algorithmic Complexity of Waypoint Routing","display_name":"Charting the Algorithmic Complexity of Waypoint Routing","publication_year":2018,"publication_date":"2018-04-27","ids":{"openalex":"https://openalex.org/W2795339395","doi":"https://doi.org/10.1145/3211852.3211859","mag":"2795339395"},"language":"en","primary_location":{"id":"doi:10.1145/3211852.3211859","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3211852.3211859","pdf_url":null,"source":{"id":"https://openalex.org/S66039016","display_name":"ACM SIGCOMM Computer Communication Review","issn_l":"0146-4833","issn":["0146-4833","1943-5819"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGCOMM Computer Communication Review","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.itu.dk/portal/da/publications/b9648c71-598f-462e-b8bc-6c26a464490c","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101665931","display_name":"Saeed Akhoondian Amiri","orcid":"https://orcid.org/0000-0002-7402-2662"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Saeed Akhoondian Amiri","raw_affiliation_strings":["MPI Saarland, Germany"],"affiliations":[{"raw_affiliation_string":"MPI Saarland, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085843145","display_name":"Klaus-Tycho Foerster","orcid":"https://orcid.org/0000-0003-4635-4480"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Klaus-Tycho Foerster","raw_affiliation_strings":["Aalborg University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072095949","display_name":"Riko Jacob","orcid":"https://orcid.org/0000-0001-9470-1809"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Riko Jacob","raw_affiliation_strings":["IT University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":["University of Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"University of Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101665931"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7776,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.91449199,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"48","issue":"1","first_page":"42","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.994700014591217,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/waypoint","display_name":"Waypoint","score":0.8770759701728821},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5892460346221924},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5191959142684937},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.29558444023132324},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.1522306501865387}],"concepts":[{"id":"https://openalex.org/C2781271823","wikidata":"https://www.wikidata.org/wiki/Q138081","display_name":"Waypoint","level":2,"score":0.8770759701728821},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5892460346221924},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5191959142684937},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.29558444023132324},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.1522306501865387}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3211852.3211859","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3211852.3211859","pdf_url":null,"source":{"id":"https://openalex.org/S66039016","display_name":"ACM SIGCOMM Computer Communication Review","issn_l":"0146-4833","issn":["0146-4833","1943-5819"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGCOMM Computer Communication Review","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/b9648c71-598f-462e-b8bc-6c26a464490c","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/b9648c71-598f-462e-b8bc-6c26a464490c","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Akhoondian Amiri, S, F\u00f6rster, K-T, Jacob, R & Schmid, S 2018, 'Charting the Algorithmic Complexity of Waypoint Routing', Computer Communications Review, vol. 48, no. 1, pp. 42-48. https://doi.org/10.1145/3211852.3211859","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/0ae6421e-22db-4439-af71-dc257f3efeb6","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1705.00055.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Amiri , S A , Foerster , K T , Jacob , R & Schmid , S 2018 , ' Charting the algorithmic complexity of waypoint routing ' , Computer Communication Review , vol. 48 , no. 1 , pp. 42-48 . https://doi.org/10.1145/3211852.3211859","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/b9648c71-598f-462e-b8bc-6c26a464490c","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1705.00055","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Akhoondian Amiri, S, F\u00f6rster, K-T, Jacob, R & Schmid, S 2018, 'Charting the Algorithmic Complexity of Waypoint Routing', Computer Communications Review, vol. 48, no. 1, pp. 42-48. https://doi.org/10.1145/3211852.3211859","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:openaire/0ae6421e-22db-4439-af71-dc257f3efeb6","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/0ae6421e-22db-4439-af71-dc257f3efeb6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Amiri, S A, Foerster, K T, Jacob, R & Schmid, S 2018, 'Charting the algorithmic complexity of waypoint routing', Computer Communication Review, vol. 48, no. 1, pp. 42-48. https://doi.org/10.1145/3211852.3211859","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.mpg.de:item_3007467","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0002-7083-B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM SIGCOMM Computer Communication Review","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/b9648c71-598f-462e-b8bc-6c26a464490c","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/b9648c71-598f-462e-b8bc-6c26a464490c","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Akhoondian Amiri, S, F\u00f6rster, K-T, Jacob, R & Schmid, S 2018, 'Charting the Algorithmic Complexity of Waypoint Routing', Computer Communications Review, vol. 48, no. 1, pp. 42-48. https://doi.org/10.1145/3211852.3211859","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6200000047683716,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321409","display_name":"Aalborg Universitet","ror":"https://ror.org/04m5j1k67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W65356316","https://openalex.org/W1557310162","https://openalex.org/W1651984967","https://openalex.org/W1817070267","https://openalex.org/W2000733920","https://openalex.org/W2005079828","https://openalex.org/W2010748366","https://openalex.org/W2017434030","https://openalex.org/W2019637647","https://openalex.org/W2021234005","https://openalex.org/W2042697932","https://openalex.org/W2047714188","https://openalex.org/W2050570968","https://openalex.org/W2060765530","https://openalex.org/W2105785546","https://openalex.org/W2115589427","https://openalex.org/W2121752873","https://openalex.org/W2142972529","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2260686010","https://openalex.org/W2292669715","https://openalex.org/W2325918172","https://openalex.org/W2340581052","https://openalex.org/W2548462953","https://openalex.org/W2569646339","https://openalex.org/W2752747257","https://openalex.org/W2759011657","https://openalex.org/W3081740128","https://openalex.org/W3167593369","https://openalex.org/W4210246355","https://openalex.org/W6601241746"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2688471429","https://openalex.org/W4360939124","https://openalex.org/W2077345734","https://openalex.org/W2899287767","https://openalex.org/W2275928629","https://openalex.org/W4387126713","https://openalex.org/W2612848489"],"abstract_inverted_index":{"Modern":[0],"computer":[1],"networks":[2],"support":[3],"interesting":[4],"new":[5],"routing":[6,57,77,98,114],"models":[7,58],"in":[8],"which":[9],"traffic":[10,76],"flows":[11],"from":[12,135,156],"a":[13,16,24,132,136,140,153,161,166],"source":[14,137],"sto":[15],"destination":[17,141],"t":[18,142,159],"can":[19],"be":[20],"flexibly":[21],"steered":[22],"through":[23],"sequence":[25],"of":[26,54,81,93,151],"waypoints,":[27],"such":[28,56],"as":[29],"(hardware)":[30],"middleboxes":[31],"or":[32,45],"(virtualized)":[33],"network":[34,40,88],"functions":[35],"(VNFs),":[36],"to":[37,85,105,120,139,158],"create":[38],"innovative":[39],"services":[41],"like":[42],"service":[43],"chains":[44],"segment":[46],"routing.":[47],"While":[48],"the":[49,66,73,87,112,149],"benefits":[50],"and":[51,62,99],"technological":[52],"challenges":[53],"providing":[55],"have":[59],"been":[60],"articulated":[61],"studied":[63],"intensively":[64],"over":[65],"last":[67],"years,":[68],"less":[69],"is":[70,84,143],"known":[71],"about":[72,102],"underlying":[74],"algorithmic":[75,94],"problems.":[78,124],"The":[79],"goal":[80],"this":[82],"paper":[83],"provide":[86],"community":[89],"with":[90,118],"an":[91],"overview":[92],"techniques":[95],"for":[96],"waypoint":[97,113,163],"also":[100],"inform":[101],"limitations":[103],"due":[104],"computational":[106],"hardness.":[107],"In":[108],"particular,":[109],"we":[110,127],"put":[111],"problem":[115,150],"into":[116],"perspective":[117],"respect":[119],"classic":[121],"graph":[122],"theoretical":[123],"For":[125],"example,":[126],"find":[128],"that":[129],"while":[130],"computing":[131],"shortest":[133,154],"path":[134],"s":[138,157],"simple":[144],"(e.g.,":[145],"using":[146],"Dijkstra's":[147],"algorithm),":[148],"finding":[152],"route":[155],"via":[160],"single":[162],"already":[164],"features":[165],"deep":[167],"combinatorial":[168],"structure.":[169]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2018-04-06T00:00:00"}