{"id":"https://openalex.org/W2038129566","doi":"https://doi.org/10.1016/s1389-1286(02)00344-4","title":"Search space reduction in QoS routing","display_name":"Search space reduction in QoS routing","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2038129566","doi":"https://doi.org/10.1016/s1389-1286(02)00344-4","mag":"2038129566"},"language":"en","primary_location":{"id":"doi:10.1016/s1389-1286(02)00344-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1389-1286(02)00344-4","pdf_url":null,"source":{"id":"https://openalex.org/S63392143","display_name":"Computer Networks","issn_l":"1389-1286","issn":["1389-1286","1872-7069"],"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 Networks","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/A5025402599","display_name":"Liang Guo","orcid":"https://orcid.org/0000-0002-1826-7999"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liang Guo","raw_affiliation_strings":["Computer Science Department, Boston University, 111 Cummington Street, Boston, MA 02215, USA","Computer Science Department, Boston University, 111 Cummington Street, Boston, MA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Boston University, 111 Cummington Street, Boston, MA 02215, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Computer Science Department, Boston University, 111 Cummington Street, Boston, MA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044678468","display_name":"Ibrahim Matta","orcid":"https://orcid.org/0000-0003-4528-0344"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ibrahim Matta","raw_affiliation_strings":["Computer Science Department, Boston University, 111 Cummington Street, Boston, MA 02215, USA","Computer Science Department, Boston University, 111 Cummington Street, Boston, MA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Boston University, 111 Cummington Street, Boston, MA 02215, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Computer Science Department, Boston University, 111 Cummington Street, Boston, MA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044678468"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":{"value":2370,"currency":"USD","value_usd":2370},"apc_paid":null,"fwci":3.725,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.93989131,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"41","issue":"1","first_page":"73","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":1.0,"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":1.0,"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.9998999834060669,"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/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/computer-science","display_name":"Computer science","score":0.7858543992042542},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7511842846870422},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6315341591835022},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5778757333755493},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5690054893493652},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5445892214775085},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.535234808921814},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5124345421791077},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5043977499008179},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5010571479797363},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4634734094142914},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.42090409994125366},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3501620292663574},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.2931259870529175},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1663130223751068},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.10459974408149719},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10035690665245056}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7858543992042542},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7511842846870422},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6315341591835022},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5778757333755493},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5690054893493652},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5445892214775085},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.535234808921814},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5124345421791077},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5043977499008179},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5010571479797363},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4634734094142914},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.42090409994125366},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3501620292663574},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.2931259870529175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1663130223751068},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.10459974408149719},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10035690665245056},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1016/s1389-1286(02)00344-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1389-1286(02)00344-4","pdf_url":null,"source":{"id":"https://openalex.org/S63392143","display_name":"Computer Networks","issn_l":"1389-1286","issn":["1389-1286","1872-7069"],"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 Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.8854","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.8854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bu.edu/faculty/matta/Papers/comnet02b.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.5935","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.5935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bu.edu/faculty/matta/Papers/icdcs99.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.1000","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.1000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bu.edu/techreports/1999-013-search-qos-routing.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.8494","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8494","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ccs.neu.edu/home/matta/Papers/SSR98-TR.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.270","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bu.edu/faculty/matta/Papers/comnet02b.pdf","raw_type":"text"},{"id":"pmh:oai:open.bu.edu:2144/1790","is_oa":false,"landing_page_url":"https://hdl.handle.net/2144/1790","pdf_url":null,"source":{"id":"https://openalex.org/S4306402183","display_name":"OpenBU/Boston University Institutional Repository (Boston University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I111088046","host_organization_name":"Boston University","host_organization_lineage":["https://openalex.org/I111088046"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1602541202","https://openalex.org/W1964443412","https://openalex.org/W1977867261","https://openalex.org/W2011039300","https://openalex.org/W2095788461","https://openalex.org/W2096774592","https://openalex.org/W2105808107","https://openalex.org/W2123740161","https://openalex.org/W2127240180","https://openalex.org/W2127456145","https://openalex.org/W2144806816","https://openalex.org/W2151688044","https://openalex.org/W2152170792","https://openalex.org/W2170358592","https://openalex.org/W2752885492","https://openalex.org/W4253826867","https://openalex.org/W4285719527","https://openalex.org/W6674847561"],"related_works":["https://openalex.org/W2386835479","https://openalex.org/W2012229304","https://openalex.org/W189149726","https://openalex.org/W1487981883","https://openalex.org/W2128634324","https://openalex.org/W2432113893","https://openalex.org/W2736751709","https://openalex.org/W818650090","https://openalex.org/W2188459345","https://openalex.org/W2111051112"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}