{"id":"https://openalex.org/W2131513035","doi":"https://doi.org/10.1109/icon.2004.1409217","title":"Interference minimizing bandwidth guaranteed on-line routing algorithm for traffic engineering","display_name":"Interference minimizing bandwidth guaranteed on-line routing algorithm for traffic engineering","publication_year":2005,"publication_date":"2005-04-12","ids":{"openalex":"https://openalex.org/W2131513035","doi":"https://doi.org/10.1109/icon.2004.1409217","mag":"2131513035"},"language":"en","primary_location":{"id":"doi:10.1109/icon.2004.1409217","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icon.2004.1409217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955)","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/A5010799661","display_name":"K. Hendling","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"K. Hendling","raw_affiliation_strings":["Institute of Broadband Communications, University of Technology, Vienna, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Broadband Communications, University of Technology, Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046176349","display_name":"T. Losert","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"T. Losert","raw_affiliation_strings":["Institute of Broadband Communications, University of Technology, Vienna, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Broadband Communications, University of Technology, Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112217738","display_name":"Wayne C. Huber","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"W. Huber","raw_affiliation_strings":["Institute of Broadband Communications, University of Technology, Vienna, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Broadband Communications, University of Technology, Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062549456","display_name":"M. Jandl","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"M. Jandl","raw_affiliation_strings":["Institute of Broadband Communications, University of Technology, Vienna, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Broadband Communications, University of Technology, Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5010799661"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.7786,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78150014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"497","last_page":"503"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9995999932289124,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9995999932289124,"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.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"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.998199999332428,"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/computer-science","display_name":"Computer science","score":0.776300311088562},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.7677004337310791},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.7660086154937744},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6848498582839966},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6569200754165649},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.6496660709381104},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5549036860466003},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5364552140235901},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5317966341972351},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5188425779342651},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5120404362678528},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.48140859603881836},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4794115722179413},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4509279131889343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4500947594642639},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4500402510166168},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.261644572019577}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.776300311088562},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.7677004337310791},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.7660086154937744},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6848498582839966},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6569200754165649},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.6496660709381104},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5549036860466003},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5364552140235901},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5317966341972351},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5188425779342651},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5120404362678528},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.48140859603881836},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4794115722179413},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4509279131889343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4500947594642639},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4500402510166168},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.261644572019577},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icon.2004.1409217","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icon.2004.1409217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955)","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":19,"referenced_works":["https://openalex.org/W135403677","https://openalex.org/W195394769","https://openalex.org/W1492947302","https://openalex.org/W1515284104","https://openalex.org/W1520174934","https://openalex.org/W1619901298","https://openalex.org/W2024965364","https://openalex.org/W2047553334","https://openalex.org/W2063357851","https://openalex.org/W2084224084","https://openalex.org/W2096774592","https://openalex.org/W2110294867","https://openalex.org/W2112169033","https://openalex.org/W2136486222","https://openalex.org/W2156216151","https://openalex.org/W2158283087","https://openalex.org/W2162689181","https://openalex.org/W2172151912","https://openalex.org/W3106889297"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W4253436398","https://openalex.org/W2068473861","https://openalex.org/W1538003338","https://openalex.org/W2364686261","https://openalex.org/W1984835167","https://openalex.org/W2351097701","https://openalex.org/W2556128816","https://openalex.org/W2162880363","https://openalex.org/W2607223747"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,38,87],"fast":[4,77],"and":[5,65,103],"non-greedy":[6,119],"interference":[7],"minimizing":[8],"routing":[9,14,92,120],"algorithm":[10,23,53],"(IMRA)":[11],"for":[12,37,90,100,105],"dynamic":[13,110],"of":[15,41,58,61,68],"bandwidth":[16],"guaranteed":[17],"LSPs":[18],"(label":[19],"switched":[20],"paths).":[21],"The":[22,71],"operates":[24],"on-line":[25,91,106],"by":[26,32],"handling":[27],"requests":[28,113],"that":[29],"arrive":[30],"one":[31,33],"without":[34],"the":[35,45,48,76],"need":[36],"priori":[39],"knowledge":[40],"traffic":[42],"characteristics":[43],"except":[44],"information":[46],"on":[47],"ingress-egress":[49],"pairs.":[50],"Our":[51],"proposed":[52],"combines":[54],"three":[55],"criteria:":[56],"minimization":[57],"interference,":[59],"saving":[60],"residual":[62],"link":[63],"bandwidth,":[64],"optimal":[66],"usage":[67],"network":[69],"capacity.":[70],"most":[72],"important":[73],"feature":[74],"is":[75,86,96],"path":[78],"computation":[79,125],"to":[80],"achieve":[81],"short":[82],"response":[83],"time,":[84],"which":[85],"crucial":[88],"factor":[89],"algorithms.":[93],"IMRA's":[94],"complexity":[95],"low,":[97],"consequently":[98],"scalable":[99],"large":[101],"networks":[102],"suitable":[104],"routing.":[107],"Experiments":[108],"under":[109],"(short-lived)":[111],"LSP":[112],"show":[114],"better":[115],"performance":[116],"than":[117],"existing":[118],"algorithms,":[121],"while":[122],"consuming":[123],"lower":[124],"effort.":[126]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}