{"id":"https://openalex.org/W2531284070","doi":"https://doi.org/10.1109/broadnets.2008.4769139","title":"Routing and scheduling connections in networks that support advance reservations","display_name":"Routing and scheduling connections in networks that support advance reservations","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2531284070","doi":"https://doi.org/10.1109/broadnets.2008.4769139","mag":"2531284070"},"language":"en","primary_location":{"id":"doi:10.1109/broadnets.2008.4769139","is_oa":false,"landing_page_url":"https://doi.org/10.1109/broadnets.2008.4769139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 5th International Conference on Broadband Communications, Networks and Systems","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/A5046309517","display_name":"Emmanouel Varvarigos","orcid":"https://orcid.org/0000-0002-4942-1362"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Emmanouel Varvarigos","raw_affiliation_strings":["Department of Computer Engineering and Informatics, University of Patras, Greece","Research Academic Computer Technology Institute, Patras, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Research Academic Computer Technology Institute, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050856138","display_name":"Vasilis Sourlas","orcid":"https://orcid.org/0000-0003-2678-4002"},"institutions":[{"id":"https://openalex.org/I145722265","display_name":"University of Thessaly","ror":"https://ror.org/04v4g9h31","country_code":"GR","type":"education","lineage":["https://openalex.org/I145722265"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Vasileios Sourlas","raw_affiliation_strings":["Department of Computer and Communication Engineering, University of Thessally, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Communication Engineering, University of Thessally, Greece","institution_ids":["https://openalex.org/I145722265"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091236670","display_name":"K. Christodoulopoulos","orcid":"https://orcid.org/0000-0002-7241-366X"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Konstantinos Christodoulopoulos","raw_affiliation_strings":["Department of Computer Engineering and Informatics, University of Patras, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":1.0,"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"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9994000196456909,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9988999962806702,"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.7539979219436646},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5309901833534241},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5302469730377197},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4889427721500397},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4761783480644226},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4601946175098419},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.45428773760795593},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4407424032688141},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.403232216835022},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.374712735414505},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.37086668610572815},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35119131207466125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30746281147003174},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2356073260307312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15622693300247192}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7539979219436646},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5309901833534241},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5302469730377197},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4889427721500397},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4761783480644226},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4601946175098419},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.45428773760795593},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4407424032688141},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.403232216835022},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.374712735414505},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.37086668610572815},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35119131207466125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30746281147003174},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2356073260307312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15622693300247192}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/broadnets.2008.4769139","is_oa":false,"landing_page_url":"https://doi.org/10.1109/broadnets.2008.4769139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 5th International Conference on Broadband Communications, Networks and Systems","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":46,"referenced_works":["https://openalex.org/W1529846214","https://openalex.org/W1576730383","https://openalex.org/W1588462524","https://openalex.org/W1592064028","https://openalex.org/W1723291864","https://openalex.org/W1765857080","https://openalex.org/W1805675064","https://openalex.org/W1844461601","https://openalex.org/W1879901936","https://openalex.org/W1917789337","https://openalex.org/W2000223570","https://openalex.org/W2024099542","https://openalex.org/W2026803050","https://openalex.org/W2028495484","https://openalex.org/W2034900007","https://openalex.org/W2045214633","https://openalex.org/W2091257550","https://openalex.org/W2096774592","https://openalex.org/W2099860216","https://openalex.org/W2101234060","https://openalex.org/W2108528474","https://openalex.org/W2114686820","https://openalex.org/W2119775299","https://openalex.org/W2121610900","https://openalex.org/W2125618481","https://openalex.org/W2130580270","https://openalex.org/W2134654387","https://openalex.org/W2136449463","https://openalex.org/W2140556610","https://openalex.org/W2149123157","https://openalex.org/W2149729846","https://openalex.org/W2151841905","https://openalex.org/W2154371802","https://openalex.org/W2155989389","https://openalex.org/W2164056459","https://openalex.org/W2164339134","https://openalex.org/W2165334967","https://openalex.org/W2170358592","https://openalex.org/W2296256089","https://openalex.org/W2612926946","https://openalex.org/W2780466810","https://openalex.org/W6635433520","https://openalex.org/W6638559422","https://openalex.org/W6639216781","https://openalex.org/W6674847561","https://openalex.org/W6684104512"],"related_works":["https://openalex.org/W2555559350","https://openalex.org/W2108305519","https://openalex.org/W1242343826","https://openalex.org/W1971663816","https://openalex.org/W2081964190","https://openalex.org/W2113362813","https://openalex.org/W2607223747","https://openalex.org/W4241849776","https://openalex.org/W2182195922","https://openalex.org/W2361465121"],"abstract_inverted_index":{"A":[0],"key":[1],"problem":[2],"in":[3,146],"networks":[4],"that":[5,159,167,173],"support":[6],"advance":[7],"reservations":[8],"is":[9,169],"the":[10,34,44,46,54,58,69,72,77,80,86,89,110,119,141,144,147,160,175],"routing":[11,28,132],"and":[12,29,43,76,133],"time":[13,45,56,163],"scheduling":[14,30,134],"of":[15,68,79,96,103,121,136,143,150,174],"connections":[16],"with":[17],"flexible":[18],"starting":[19],"time.":[20],"In":[21],"this":[22],"paper":[23],"we":[24,128],"present":[25,93],"a":[26,41,94,101],"multicost":[27,131],"algorithm":[31],"for":[32],"selecting":[33],"path":[35,112,125],"to":[36,52,82,88,99,172],"be":[37,83,114],"followed":[38],"by":[39],"such":[40],"connection":[42,81],"data":[47],"should":[48],"start":[49],"so":[50],"as":[51],"minimize":[53],"reception":[55],"at":[57],"destination,":[59],"or":[60],"some":[61],"other":[62],"QoS":[63],"requirement.":[64],"The":[65],"utilization":[66],"profiles":[67],"network":[70],"links,":[71],"link":[73],"propagation":[74],"delays,":[75],"parameters":[78],"scheduled":[84],"form":[85],"inputs":[87],"algorithm.":[90,177],"We":[91,139],"initially":[92],"scheme":[95],"non-polynomial":[97],"complexity":[98],"compute":[100],"set":[102,120],"so-called":[104],"non-dominated":[105],"candidate":[106,122],"paths,":[107],"from":[108],"which":[109],"optimal":[111,176],"can":[113],"found.":[115],"By":[116],"appropriately":[117],"pruning":[118],"paths":[123],"using":[124],"pseudo-domination":[126],"relationships,":[127],"also":[129],"find":[130],"algorithms":[135,145,164],"polynomial":[137,162],"complexity.":[138],"examine":[140],"performance":[142,166],"special":[148],"case":[149],"an":[151],"Optical":[152],"Burst":[153],"Switched":[154],"network.":[155],"Our":[156],"results":[157],"indicate":[158],"proposed":[161],"have":[165],"it":[168],"very":[170],"close":[171]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}