{"id":"https://openalex.org/W1820568913","doi":"https://doi.org/10.1109/infcom.2005.1497897","title":"A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm","display_name":"A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm","publication_year":2005,"publication_date":"2005-08-24","ids":{"openalex":"https://openalex.org/W1820568913","doi":"https://doi.org/10.1109/infcom.2005.1497897","mag":"1820568913"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2005.1497897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2005.1497897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","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/A5014559047","display_name":"G\u00e1bor R\u00e9tv\u00e1ri","orcid":"https://orcid.org/0000-0002-5958-7817"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G. Retvari","raw_affiliation_strings":["Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081387612","display_name":"J\u00f3zsef B\u0131\u0301r\u00f3","orcid":"https://orcid.org/0000-0002-9729-2702"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"J.J. Biro","raw_affiliation_strings":["Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU","Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023288330","display_name":"Tibor Cinkler","orcid":"https://orcid.org/0000-0003-3605-445X"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"T. Cinkler","raw_affiliation_strings":["Dept. of Telecommun. & Media Inf., Budapest Univ. of Technol. & Econ., Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Telecommun. & Media Inf., Budapest Univ. of Technol. & Econ., Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035951865","display_name":"T. Henk","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"T. Henk","raw_affiliation_strings":["Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1909,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.89135347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"1","issue":null,"first_page":"260","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10138","display_name":"Network Traffic and Congestion Control","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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9987000226974487,"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/precomputation","display_name":"Precomputation","score":0.9101069569587708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7998870611190796},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6423014402389526},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5897887945175171},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5754989981651306},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5621236562728882},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5367715358734131},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.52388995885849},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5165247321128845},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4383658170700073},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.421691358089447},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4152244031429291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4041842818260193},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.25292643904685974},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.07200366258621216}],"concepts":[{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.9101069569587708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7998870611190796},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6423014402389526},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5897887945175171},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5754989981651306},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5621236562728882},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5367715358734131},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.52388995885849},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5165247321128845},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4383658170700073},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.421691358089447},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4152244031429291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4041842818260193},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.25292643904685974},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.07200366258621216},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2005.1497897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2005.1497897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.6729","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.6729","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://qosip.tmit.bme.hu/~retvari/publications/infocom2005.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1494160116","https://openalex.org/W1638480507","https://openalex.org/W1737589985","https://openalex.org/W1977545325","https://openalex.org/W2003968982","https://openalex.org/W2010997912","https://openalex.org/W2021987987","https://openalex.org/W2024965364","https://openalex.org/W2092480587","https://openalex.org/W2096774592","https://openalex.org/W2110294867","https://openalex.org/W2120608001","https://openalex.org/W2144926463","https://openalex.org/W2151907640","https://openalex.org/W2162689181","https://openalex.org/W2243986870","https://openalex.org/W2920966226","https://openalex.org/W3014841294","https://openalex.org/W4213060235","https://openalex.org/W6629466543","https://openalex.org/W6636751010","https://openalex.org/W6677853904"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2136173851","https://openalex.org/W2555559350","https://openalex.org/W2607223747","https://openalex.org/W2361465121"],"abstract_inverted_index":{"This":[0,42],"paper":[1,56],"focuses":[2],"on":[3,33,79],"the":[4,29,34,55,64,92,111],"selection":[5],"of":[6,38,54,61,75,100],"bandwidth-guaranteed":[7],"channels":[8],"for":[9,72,88],"communication":[10],"sessions":[11],"that":[12,27,103],"require":[13],"it.":[14],"The":[15,51],"basic":[16],"idea":[17],"comes":[18],"from":[19],"minimum":[20,89],"interference":[21,90],"routing:":[22],"select":[23],"a":[24,58,84],"feasible":[25],"path":[26],"puts":[28],"least":[30],"possible":[31,108],"restriction":[32],"available":[35],"transmission":[36],"capacity":[37],"other":[39],"communicating":[40],"parties.":[41],"is":[43,57,107,118],"achieved":[44],"by":[45,98],"circumventing":[46],"some":[47],"critical":[48],"bottleneck":[49],"links.":[50],"main":[52],"contribution":[53],"novel":[59],"characterization":[60],"link":[62],"criticality,":[63],"criticality":[65],"threshold,":[66],"which":[67],"can":[68],"be":[69],"readily":[70],"precompiled":[71],"routing":[73,94],"dozens":[74],"subsequent":[76],"calls.":[77],"Based":[78],"this":[80],"finding":[81],"we":[82],"define":[83],"generic":[85],"precomputation":[86,106],"framework":[87],"routing,":[91],"least-critical-path-first":[93],"algorithm.":[95],"We":[96],"show":[97],"means":[99],"extensive":[101],"simulations":[102],"efficient":[104],"route":[105],"even":[109],"in":[110],"case,":[112],"when":[113],"accurate":[114],"resource":[115],"availability":[116],"information":[117],"not":[119],"immediately":[120],"available.":[121]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}