{"id":"https://openalex.org/W1497088646","doi":"https://doi.org/10.1109/iccnc.2015.7069420","title":"Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms","display_name":"Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms","publication_year":2015,"publication_date":"2015-02-01","ids":{"openalex":"https://openalex.org/W1497088646","doi":"https://doi.org/10.1109/iccnc.2015.7069420","mag":"1497088646"},"language":"en","primary_location":{"id":"doi:10.1109/iccnc.2015.7069420","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccnc.2015.7069420","pdf_url":null,"source":{"id":"https://openalex.org/S4306497949","display_name":"2015 International Conference on Computing, Networking and Communications (ICNC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Computing, Networking and Communications (ICNC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5080960805","display_name":"Sahar Talebi","orcid":null},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sahar Talebi","raw_affiliation_strings":["Operations Research and Department of Computer Science, North Carolina State University, Raleigh, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research and Department of Computer Science, North Carolina State University, Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005355282","display_name":"Furqan Alam","orcid":"https://orcid.org/0000-0002-8621-4880"},"institutions":[{"id":"https://openalex.org/I185163786","display_name":"King Abdulaziz University","ror":"https://ror.org/02ma4wv74","country_code":"SA","type":"education","lineage":["https://openalex.org/I185163786"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Furqan Alam","raw_affiliation_strings":["King Abdulaziz University, Jeddah, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King Abdulaziz University, Jeddah, Saudi Arabia","institution_ids":["https://openalex.org/I185163786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022780651","display_name":"Iyad Katib","orcid":"https://orcid.org/0000-0003-3376-3218"},"institutions":[{"id":"https://openalex.org/I185163786","display_name":"King Abdulaziz University","ror":"https://ror.org/02ma4wv74","country_code":"SA","type":"education","lineage":["https://openalex.org/I185163786"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Iyad Katib","raw_affiliation_strings":["King Abdulaziz University, Jeddah, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King Abdulaziz University, Jeddah, Saudi Arabia","institution_ids":["https://openalex.org/I185163786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069999271","display_name":"George N. Rouskas","orcid":"https://orcid.org/0000-0001-8250-8913"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]},{"id":"https://openalex.org/I185163786","display_name":"King Abdulaziz University","ror":"https://ror.org/02ma4wv74","country_code":"SA","type":"education","lineage":["https://openalex.org/I185163786"]}],"countries":["SA","US"],"is_corresponding":false,"raw_author_name":"George N. Rouskas","raw_affiliation_strings":["King Abdulaziz University, Jeddah, Saudi Arabia","Operations Research and Department of Computer Science, North Carolina State University, Raleigh, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King Abdulaziz University, Jeddah, Saudi Arabia","institution_ids":["https://openalex.org/I185163786"]},{"raw_affiliation_string":"Operations Research and Department of Computer Science, North Carolina State University, Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0588,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84695305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"642","last_page":"647"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":1.0,"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/T10232","display_name":"Optical Network Technologies","score":0.9983000159263611,"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/T10767","display_name":"Advanced Photonic Communication Systems","score":0.9944999814033508,"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/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7247856259346008},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6563554406166077},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6104815602302551},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5551066994667053},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4817659854888916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4781945049762726},{"id":"https://openalex.org/keywords/synchronous-optical-networking","display_name":"Synchronous optical networking","score":0.4763505756855011},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4495967626571655},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4313722550868988},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.43132591247558594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4219262897968292},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40657249093055725},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29784998297691345},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.18531715869903564},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1539669930934906}],"concepts":[{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7247856259346008},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6563554406166077},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6104815602302551},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5551066994667053},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4817659854888916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4781945049762726},{"id":"https://openalex.org/C198306430","wikidata":"https://www.wikidata.org/wiki/Q51823","display_name":"Synchronous optical networking","level":2,"score":0.4763505756855011},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4495967626571655},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4313722550868988},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.43132591247558594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4219262897968292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40657249093055725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29784998297691345},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.18531715869903564},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1539669930934906},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iccnc.2015.7069420","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccnc.2015.7069420","pdf_url":null,"source":{"id":"https://openalex.org/S4306497949","display_name":"2015 International Conference on Computing, Networking and Communications (ICNC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Computing, Networking and Communications (ICNC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.434.5143","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.434.5143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.ncsu.edu/faculty/rouskas//Publications/Conferences/ICNC-Ring-2015.pdf","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":18,"referenced_works":["https://openalex.org/W1542912957","https://openalex.org/W1587328365","https://openalex.org/W1903050471","https://openalex.org/W1985941410","https://openalex.org/W1998287892","https://openalex.org/W2000215674","https://openalex.org/W2024385238","https://openalex.org/W2037530672","https://openalex.org/W2038158504","https://openalex.org/W2084815086","https://openalex.org/W2117406994","https://openalex.org/W2133768407","https://openalex.org/W2135507920","https://openalex.org/W2135703768","https://openalex.org/W2148523205","https://openalex.org/W2149190525","https://openalex.org/W2151384116","https://openalex.org/W6635039058"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W2121598558","https://openalex.org/W2204759952","https://openalex.org/W1515277195","https://openalex.org/W1972487624","https://openalex.org/W1698965822","https://openalex.org/W2237860883","https://openalex.org/W2064711473","https://openalex.org/W2186932829","https://openalex.org/W3094029073"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,38,56,60,96,106],"spectrum":[3],"assignment":[4],"(SA)":[5],"problem":[6,40,62],"in":[7,66,69],"ring":[8],"networks":[9],"with":[10],"shortest":[11,57],"path":[12,27,58],"(or,":[13],"more":[14],"generally,":[15],"fixed)":[16],"routing.":[17],"With":[18],"fixed":[19],"routing,":[20],"each":[21],"traffic":[22],"demand":[23],"follows":[24],"a":[25,45,93],"predetermined":[26],"to":[28,86,110],"its":[29],"destination.":[30],"In":[31],"earlier":[32],"work,":[33],"we":[34,52,73],"have":[35],"shown":[36],"that":[37],"SA":[39,61],"can":[41,63],"be":[42,64],"viewed":[43],"as":[44],"multiprocessor":[46],"problem.":[47],"Based":[48],"on":[49],"this":[50],"insight,":[51],"prove":[53],"that,":[54],"under":[55],"assumption,":[59],"solved":[65],"polynomial":[67],"time":[68],"small":[70],"rings,":[71],"and":[72],"develop":[74],"constant-ratio":[75],"approximation":[76,97],"algorithms":[77,101],"for":[78],"large":[79],"rings.":[80],"For":[81],"rings":[82],"of":[83,92,99],"size":[84,91],"up":[85],"16":[87],"nodes":[88],"(the":[89],"maximum":[90],"SONET/SDH":[94],"ring),":[95],"ratios":[98],"our":[100],"are":[102],"strictly":[103],"smaller":[104],"than":[105],"best":[107],"known":[108],"ratio":[109],"date.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}