{"id":"https://openalex.org/W1999749352","doi":"https://doi.org/10.1109/iwqos.2007.376556","title":"Efficient Algorithms For Optimizing Policy-Constrained Routing","display_name":"Efficient Algorithms For Optimizing Policy-Constrained Routing","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W1999749352","doi":"https://doi.org/10.1109/iwqos.2007.376556","mag":"1999749352"},"language":"en","primary_location":{"id":"doi:10.1109/iwqos.2007.376556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos.2007.376556","pdf_url":null,"source":{"id":"https://openalex.org/S4210234387","display_name":"International Workshop on Quality of Service","issn_l":"1548-615X","issn":["1548-615X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 Fifteenth IEEE International Workshop on Quality of Service","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/A5112063893","display_name":"Andrew R. Curtis","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew R. Curtis","raw_affiliation_strings":["Department of Computer Science, Colorado State University, Fort Collins, CO, USA","Colorado State University; Fort Collins"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]},{"raw_affiliation_string":"Colorado State University; Fort Collins","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014734580","display_name":"Ross M. McConnell","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ross M. McConnell","raw_affiliation_strings":["Department of Computer Science, Colorado State University, Fort Collins, CO, USA","Colorado State University; Fort Collins"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]},{"raw_affiliation_string":"Colorado State University; Fort Collins","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048057712","display_name":"Dan Massey","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Massey","raw_affiliation_strings":["Department of Computer Science, Colorado State University, Fort Collins, CO, USA","Colorado State University; Fort Collins"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]},{"raw_affiliation_string":"Colorado State University; Fort Collins","institution_ids":["https://openalex.org/I92446798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112063893"],"corresponding_institution_ids":["https://openalex.org/I92446798"],"apc_list":null,"apc_paid":null,"fwci":0.3366,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64905958,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"113","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9976999759674072,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9976999759674072,"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.9959999918937683,"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.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7336177825927734},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6664096117019653},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.6495785713195801},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6341391801834106},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5464093685150146},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5460387468338013},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5049570202827454},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5040911436080933},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.49401241540908813},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.46800556778907776},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.44463682174682617},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4366300106048584},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4351043999195099},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41572490334510803},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.31380653381347656},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.14209070801734924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13362523913383484}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7336177825927734},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6664096117019653},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.6495785713195801},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6341391801834106},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5464093685150146},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5460387468338013},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5049570202827454},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5040911436080933},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.49401241540908813},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.46800556778907776},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.44463682174682617},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4366300106048584},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4351043999195099},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41572490334510803},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.31380653381347656},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.14209070801734924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13362523913383484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iwqos.2007.376556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos.2007.376556","pdf_url":null,"source":{"id":"https://openalex.org/S4210234387","display_name":"International Workshop on Quality of Service","issn_l":"1548-615X","issn":["1548-615X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 Fifteenth IEEE International Workshop on Quality of Service","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.8741","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.8741","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.colostate.edu/~massey/pubs/conf/massey_iwqos07.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1479863711","https://openalex.org/W1513400187","https://openalex.org/W1522559342","https://openalex.org/W1583982697","https://openalex.org/W2151972741","https://openalex.org/W3141776272","https://openalex.org/W6631304100"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2148093630","https://openalex.org/W4253436398","https://openalex.org/W2351097701","https://openalex.org/W2607223747","https://openalex.org/W2162880363","https://openalex.org/W2351878639","https://openalex.org/W2556128816","https://openalex.org/W2154440508","https://openalex.org/W2369989480"],"abstract_inverted_index":{"Routing":[0],"policies":[1,26],"play":[2],"an":[3,60],"essential":[4],"role":[5],"in":[6],"how":[7],"traffic":[8,62],"is":[9],"forwarded":[10],"across":[11],"the":[12,35,74,83,88,95,101],"Internet.":[13],"The":[14],"network":[15,37],"would":[16],"not":[17,92],"be":[18],"commercially":[19],"viable":[20],"without":[21],"these":[22],"routing":[23,53,102,121],"policies,":[24],"but":[25],"also":[27,109],"introduce":[28],"inefficiencies":[29],"and":[30,64,80,85,90,139],"fail":[31],"to":[32,46,69,100],"fully":[33],"exploit":[34],"underlying":[36,96],"topology.":[38],"Our":[39,76],"work":[40],"assumes":[41],"routes":[42],"are":[43],"selected":[44],"according":[45],"some":[47],"policy":[48,58],"such":[49],"as":[50],"a":[51],"valley-free":[52],"policy.":[54,75,103],"However,":[55],"we":[56,108],"apply":[57],"at":[59],"aggregate":[61],"level":[63],"don't":[65],"require":[66],"individual":[67],"packets":[68],"follow":[70],"paths":[71,133],"that":[72,98],"match":[73],"approach":[77],"never":[78],"reduces,":[79],"usually":[81],"increases,":[82],"connectivity":[84],"capacity":[86,122],"of":[87,126,137,142],"network,":[89],"does":[91],"infringe":[93],"on":[94],"motivations":[97],"led":[99],"By":[104],"adopting":[105],"this":[106],"approach,":[107],"provide":[110],"polynomial":[111],"algorithms":[112],"for":[113],"otherwise":[114],"NP-hard":[115],"problems,":[116],"including":[117],"finding":[118],"maximum":[119],"policy-observing":[120,132,145],"between":[123,134],"two":[124,135],"sets":[125,136,141],"ASes,":[127,138],"minimizing":[128],"cuts":[129],"separating":[130],"all":[131],"maximizing":[140],"edge-or":[143],"vertex-disjoint":[144],"paths.":[146]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}