{"id":"https://openalex.org/W1831174789","doi":"https://doi.org/10.1109/itcc.2003.1197557","title":"Alternate path routing algorithm for traffic engineering in the Internet","display_name":"Alternate path routing algorithm for traffic engineering in the Internet","publication_year":2004,"publication_date":"2004-05-13","ids":{"openalex":"https://openalex.org/W1831174789","doi":"https://doi.org/10.1109/itcc.2003.1197557","mag":"1831174789"},"language":"en","primary_location":{"id":"doi:10.1109/itcc.2003.1197557","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itcc.2003.1197557","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing","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/A5014741317","display_name":"Sasi Kumar Subramanian","orcid":null},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Subramanian","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Las Vegas, NV, USA","Dept. of Electr. & Comput. Eng.,, Nevada Univ., Las Vegas, NV, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Las Vegas, NV, USA","institution_ids":["https://openalex.org/I133999245"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng.,, Nevada Univ., Las Vegas, NV, USA","institution_ids":["https://openalex.org/I133999245"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069307987","display_name":"Venkatesan Muthukumar","orcid":"https://orcid.org/0000-0001-5357-5500"},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. Muthukumar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Las Vegas, NV, USA","Dept. of Electr. & Comput. Eng.,, Nevada Univ., Las Vegas, NV, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Las Vegas, NV, USA","institution_ids":["https://openalex.org/I133999245"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng.,, Nevada Univ., Las Vegas, NV, USA","institution_ids":["https://openalex.org/I133999245"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014741317"],"corresponding_institution_ids":["https://openalex.org/I133999245"],"apc_list":null,"apc_paid":null,"fwci":2.2416,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.89619274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"367","last_page":"372"},"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.9998999834060669,"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.9998999834060669,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8216646909713745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7806159257888794},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6250803470611572},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.606615424156189},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5950123071670532},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5786923170089722},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.552842915058136},{"id":"https://openalex.org/keywords/internet-traffic-engineering","display_name":"Internet traffic engineering","score":0.49432873725891113},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4799254536628723},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4797288477420807},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.47726553678512573},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4733816683292389},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4597949683666229},{"id":"https://openalex.org/keywords/traffic-engineering","display_name":"Traffic engineering","score":0.45473557710647583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4534958302974701},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3988895118236542},{"id":"https://openalex.org/keywords/network-traffic-control","display_name":"Network traffic control","score":0.3770858347415924},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.31753087043762207},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2887921631336212},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11536014080047607},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10823491215705872},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.06519237160682678}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8216646909713745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7806159257888794},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6250803470611572},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.606615424156189},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5950123071670532},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5786923170089722},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.552842915058136},{"id":"https://openalex.org/C133264484","wikidata":"https://www.wikidata.org/wiki/Q6056085","display_name":"Internet traffic engineering","level":4,"score":0.49432873725891113},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4799254536628723},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4797288477420807},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.47726553678512573},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4733816683292389},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4597949683666229},{"id":"https://openalex.org/C16160715","wikidata":"https://www.wikidata.org/wiki/Q1640676","display_name":"Traffic engineering","level":2,"score":0.45473557710647583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4534958302974701},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3988895118236542},{"id":"https://openalex.org/C201100257","wikidata":"https://www.wikidata.org/wiki/Q393287","display_name":"Network traffic control","level":3,"score":0.3770858347415924},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.31753087043762207},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2887921631336212},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11536014080047607},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10823491215705872},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.06519237160682678},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itcc.2003.1197557","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itcc.2003.1197557","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:digitalscholarship.unlv.edu:rtds-2443","is_oa":false,"landing_page_url":"https://digitalscholarship.unlv.edu/rtds/1444","pdf_url":null,"source":{"id":"https://openalex.org/S4377196371","display_name":"Digital Scholarship - UNLV (University of Nevada Reno)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I134113660","host_organization_name":"University of Nevada, Reno","host_organization_lineage":["https://openalex.org/I134113660"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"UNLV Retrospective Theses & Dissertations","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1619901298","https://openalex.org/W1651117873","https://openalex.org/W2111281748","https://openalex.org/W2114525688","https://openalex.org/W2172151912","https://openalex.org/W2248064281","https://openalex.org/W6636597293","https://openalex.org/W6636807470","https://openalex.org/W6676912968","https://openalex.org/W6677240351","https://openalex.org/W6691190440"],"related_works":["https://openalex.org/W1940868862","https://openalex.org/W2368964068","https://openalex.org/W1506649542","https://openalex.org/W2170980056","https://openalex.org/W2278664088","https://openalex.org/W2380764023","https://openalex.org/W2226180094","https://openalex.org/W177682317","https://openalex.org/W2755818550","https://openalex.org/W4285183212"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3],"new":[4],"algorithm":[5,14,71],"to":[6,18],"route":[7],"traffic":[8,35],"efficiently":[9],"is":[10,39,72],"proposed.":[11],"The":[12,34,67],"proposed":[13],"finds":[15],"additional":[16],"routes":[17],"the":[19,23,27,37,42,57,62,65,70,75],"destination":[20],"and":[21,60],"identifies":[22],"critical":[24,51,58],"links":[25,59],"in":[26,36,56],"network":[28,38],"that":[29,44],"are":[30],"responsible":[31],"for":[32],"congestion.":[33],"routed":[40],"through":[41],"paths":[43],"have":[45],"no":[46],"or":[47],"least":[48],"number":[49],"of":[50,64,69],"links.":[52],"This":[53],"avoids":[54],"congestion":[55],"increases":[61],"performance":[63,68],"network.":[66],"compared":[73],"with":[74],"shortest":[76],"path":[77],"(Dijkstra's)":[78],"algorithm.":[79]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}