{"id":"https://openalex.org/W2074286471","doi":"https://doi.org/10.1109/broadnets.2007.4550404","title":"Weight functions for shortest path routing of periodically scheduled burst flows","display_name":"Weight functions for shortest path routing of periodically scheduled burst flows","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2074286471","doi":"https://doi.org/10.1109/broadnets.2007.4550404","mag":"2074286471"},"language":"en","primary_location":{"id":"doi:10.1109/broadnets.2007.4550404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/broadnets.2007.4550404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","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/A5065422134","display_name":"Lei Li","orcid":"https://orcid.org/0000-0003-1857-8233"},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Li Lei","raw_affiliation_strings":["Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada","Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia B3H 1W5, Canada"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada","institution_ids":["https://openalex.org/I129902397"]},{"raw_affiliation_string":"Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia B3H 1W5, Canada","institution_ids":["https://openalex.org/I129902397"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027403812","display_name":"Srinivas Sampalli","orcid":"https://orcid.org/0000-0002-8742-5786"},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Srinivas Sampalli","raw_affiliation_strings":["Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada","Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia B3H 1W5, Canada"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada","institution_ids":["https://openalex.org/I129902397"]},{"raw_affiliation_string":"Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia B3H 1W5, Canada","institution_ids":["https://openalex.org/I129902397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065422134"],"corresponding_institution_ids":["https://openalex.org/I129902397"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12469207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"41","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9976999759674072,"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":0.9976999759674072,"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.9969000220298767,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9925000071525574,"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/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6182873845100403},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5884662866592407},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5829225778579712},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5344699025154114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5296565890312195},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.47559747099876404},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47523120045661926},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.44787320494651794},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.27585381269454956},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.27243363857269287},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12193459272384644}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6182873845100403},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5884662866592407},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5829225778579712},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5344699025154114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5296565890312195},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.47559747099876404},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47523120045661926},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.44787320494651794},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.27585381269454956},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.27243363857269287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12193459272384644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/broadnets.2007.4550404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/broadnets.2007.4550404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","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":9,"referenced_works":["https://openalex.org/W1584788200","https://openalex.org/W1584941324","https://openalex.org/W2020599630","https://openalex.org/W2027522046","https://openalex.org/W2069465998","https://openalex.org/W2096774592","https://openalex.org/W2105281306","https://openalex.org/W2137802474","https://openalex.org/W2141217973"],"related_works":["https://openalex.org/W189149726","https://openalex.org/W2154023691","https://openalex.org/W2138676684","https://openalex.org/W2767202586","https://openalex.org/W2121598558","https://openalex.org/W2612663217","https://openalex.org/W2621038882","https://openalex.org/W1506649542","https://openalex.org/W2332549523","https://openalex.org/W3094029073"],"abstract_inverted_index":{"We":[0,34,52],"investgate":[1],"weighted":[2],"shortest":[3],"path":[4,43],"routing":[5],"mechanisms":[6],"based":[7,48],"on":[8,49],"Dijkstra\u2019s":[9],"algorithm":[10],"to":[11,28,40],"find":[12],"optimal":[13],"paths":[14],"for":[15],"periodically":[16],"scheduled":[17],"burst":[18,22],"flows":[19],"in":[20],"optical":[21],"switching":[23],"networks.":[24],"Our":[25],"objective":[26],"is":[27],"reduce":[29],"the":[30,42,54,65,74,81],"flow":[31,45],"blocking":[32,46],"rate.":[33],"propose":[35],"three":[36],"dynamic":[37],"weight":[38,58,66],"functions":[39,59],"estimate":[41],"level":[44],"probability":[47],"wavelength":[50,71],"utilization.":[51],"evaluate":[53],"performance":[55],"of":[56,76],"these":[57],"using":[60],"simulation.":[61],"Results":[62],"show":[63],"that":[64,68],"function":[67],"incorporates":[69],"both":[70],"utilization":[72],"and":[73],"number":[75],"inbound":[77],"traffic":[78],"sources":[79],"has":[80],"best":[82],"performance.":[83]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}