{"id":"https://openalex.org/W2059797647","doi":"https://doi.org/10.1016/s0140-3664(99)00225-x","title":"TAMCRA: a tunable accuracy multiple constraints routing algorithm","display_name":"TAMCRA: a tunable accuracy multiple constraints routing algorithm","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W2059797647","doi":"https://doi.org/10.1016/s0140-3664(99)00225-x","mag":"2059797647"},"language":"en","primary_location":{"id":"doi:10.1016/s0140-3664(99)00225-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0140-3664(99)00225-x","pdf_url":null,"source":{"id":"https://openalex.org/S115004586","display_name":"Computer Communications","issn_l":"0140-3664","issn":["0140-3664","1873-703X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Communications","raw_type":"journal-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/A5083544875","display_name":"H. De Neve","orcid":null},"institutions":[{"id":"https://openalex.org/I1322087612","display_name":"Alcatel Lucent (Germany)","ror":"https://ror.org/00c5mwp75","country_code":"DE","type":"company","lineage":["https://openalex.org/I1322087612"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"H. De Neve","raw_affiliation_strings":["Alcatel Corporate Research, Francis Wellesplein 1, B-2018 Antwerp, Belgium"],"affiliations":[{"raw_affiliation_string":"Alcatel Corporate Research, Francis Wellesplein 1, B-2018 Antwerp, Belgium","institution_ids":["https://openalex.org/I1322087612"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001877366","display_name":"Piet Van Mieghem","orcid":"https://orcid.org/0000-0002-3786-7922"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"P. Van Mieghem","raw_affiliation_strings":["Delft University of Technology, Information Technology and Systems, P.O. Box 5031, 2600 GA Delft, Netherlands","Delft University of Technology, Information Technology and Systems, P.O. Box 5031, 2600 GA Delft, Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, Information Technology and Systems, P.O. Box 5031, 2600 GA Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, Information Technology and Systems, P.O. Box 5031, 2600 GA Delft, Netherlands#TAB#","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083544875"],"corresponding_institution_ids":["https://openalex.org/I1322087612"],"apc_list":{"value":2300,"currency":"USD","value_usd":2300},"apc_paid":null,"fwci":6.4676,"has_fulltext":false,"cited_by_count":140,"citation_normalized_percentile":{"value":0.96765878,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"7","first_page":"667","last_page":"679"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9868999719619751,"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.9866999983787537,"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.8068527579307556},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6565641164779663},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.6310397982597351},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6274047493934631},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5836944580078125},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5734724402427673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5367310047149658},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44921520352363586},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43910741806030273},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4226219058036804},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.4134894013404846},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.25648629665374756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.204697847366333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15328067541122437},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09185975790023804}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8068527579307556},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6565641164779663},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.6310397982597351},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6274047493934631},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5836944580078125},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5734724402427673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5367310047149658},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44921520352363586},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43910741806030273},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4226219058036804},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.4134894013404846},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.25648629665374756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.204697847366333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15328067541122437},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09185975790023804},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0140-3664(99)00225-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0140-3664(99)00225-x","pdf_url":null,"source":{"id":"https://openalex.org/S115004586","display_name":"Computer Communications","issn_l":"0140-3664","issn":["0140-3664","1873-703X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1511561428","https://openalex.org/W1538552935","https://openalex.org/W1583319624","https://openalex.org/W1971735267","https://openalex.org/W1998132337","https://openalex.org/W2011039300","https://openalex.org/W2062939617","https://openalex.org/W2096774592","https://openalex.org/W2097274267","https://openalex.org/W2098620743","https://openalex.org/W2127456145","https://openalex.org/W2130144900","https://openalex.org/W2130202407","https://openalex.org/W2130626677","https://openalex.org/W2144806816","https://openalex.org/W2152170792","https://openalex.org/W2154544029","https://openalex.org/W2161201881","https://openalex.org/W2798909945","https://openalex.org/W2905110430","https://openalex.org/W4285719527","https://openalex.org/W6632150083"],"related_works":["https://openalex.org/W2108305519","https://openalex.org/W1242343826","https://openalex.org/W1971663816","https://openalex.org/W4241849776","https://openalex.org/W2113362813","https://openalex.org/W2182195922","https://openalex.org/W1604456419","https://openalex.org/W2076807978","https://openalex.org/W2140700113","https://openalex.org/W2103359835"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}