{"id":"https://openalex.org/W1968013162","doi":"https://doi.org/10.1142/s0129054105003005","title":"ROUTING IN OPTICAL MULTISTAGE NETWORKS WITH LIMITED CROSSTALK USING ANT COLONY OPTIMIZATION","display_name":"ROUTING IN OPTICAL MULTISTAGE NETWORKS WITH LIMITED CROSSTALK USING ANT COLONY OPTIMIZATION","publication_year":2005,"publication_date":"2005-04-01","ids":{"openalex":"https://openalex.org/W1968013162","doi":"https://doi.org/10.1142/s0129054105003005","mag":"1968013162"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003005","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003005","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5028711502","display_name":"Ajay Katangur","orcid":"https://orcid.org/0000-0002-7371-7403"},"institutions":[{"id":"https://openalex.org/I96749437","display_name":"Texas A&M University \u2013 Corpus Christi","ror":"https://ror.org/01mrfdz82","country_code":"US","type":"education","lineage":["https://openalex.org/I96749437"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"AJAY K. KATANGUR","raw_affiliation_strings":["Computing & Mathematical Sciences Department, Texas A&M University - Corpus Christi, Corpus Christi, Texas 78412, United States of America"],"affiliations":[{"raw_affiliation_string":"Computing & Mathematical Sciences Department, Texas A&M University - Corpus Christi, Corpus Christi, Texas 78412, United States of America","institution_ids":["https://openalex.org/I96749437"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113383306","display_name":"Somasheker Akkaladevi","orcid":null},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"SOMASHEKER AKKALADEVI","raw_affiliation_strings":["Department of Computer Science, Georgia State University, Atlanta, GA 30303, United States of America"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Georgia State University, Atlanta, GA 30303, United States of America","institution_ids":["https://openalex.org/I181565077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101465265","display_name":"Yi Pan","orcid":"https://orcid.org/0000-0002-2766-3096"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"YI PAN","raw_affiliation_strings":["Department of Computer Science, Georgia State University, Atlanta, GA 30303, United States of America"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Georgia State University, Atlanta, GA 30303, United States of America","institution_ids":["https://openalex.org/I181565077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069870747","display_name":"Martin D. Fraser","orcid":null},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MARTIN D. FRASER","raw_affiliation_strings":["Department of Computer Science, Georgia State University, Atlanta, GA 30303, United States of America"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Georgia State University, Atlanta, GA 30303, United States of America","institution_ids":["https://openalex.org/I181565077"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5028711502"],"corresponding_institution_ids":["https://openalex.org/I96749437"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.09794139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"02","first_page":"301","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9937000274658203,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7546948790550232},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.582330048084259},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5459363460540771},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.544429361820221},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5110241174697876},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4730999767780304},{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.43196558952331543},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.4102702736854553},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.40882936120033264},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29806143045425415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2938244044780731},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12792038917541504}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7546948790550232},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.582330048084259},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5459363460540771},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.544429361820221},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5110241174697876},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4730999767780304},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.43196558952331543},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.4102702736854553},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.40882936120033264},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29806143045425415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2938244044780731},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12792038917541504}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054105003005","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003005","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:bearworks.missouristate.edu:articles-cnas-3214","is_oa":false,"landing_page_url":"https://bearworks.missouristate.edu/articles-cnas/2215","pdf_url":null,"source":{"id":"https://openalex.org/S4377196450","display_name":"BearWorks (Missouri State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119942284","host_organization_name":"Missouri State University","host_organization_lineage":["https://openalex.org/I119942284"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"College of Natural and Applied Sciences","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1491440293","https://openalex.org/W2025704344","https://openalex.org/W2063358014","https://openalex.org/W2108755056","https://openalex.org/W2111153068","https://openalex.org/W2118051273","https://openalex.org/W2130656004","https://openalex.org/W2148565692","https://openalex.org/W2153236313","https://openalex.org/W2154929945"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1997193297","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2120093588","https://openalex.org/W2981400081","https://openalex.org/W2125711090","https://openalex.org/W2298522112","https://openalex.org/W46882622"],"abstract_inverted_index":{"Ant":[0],"Colony":[1],"Optimization":[2],"(ACO)":[3],"techniques":[4],"can":[5,175],"be":[6,127,176],"successfully":[7,21],"implemented":[8],"to":[9,56,110,126,136,178,190,215,242,245],"solve":[10],"many":[11],"combinatorial":[12],"optimization":[13],"problems.":[14],"After":[15],"the":[16,24,36,40,45,53,105,113,138,172,179,184,187,193,200,205,216,220,229,235,246],"traveling":[17],"salesman":[18],"problem":[19,161,181],"was":[20],"solved":[22],"using":[23,44,196,219],"ACO":[25,54,173,188,230],"technique,":[26],"other":[27,33],"researchers":[28],"have":[29,125],"concentrated":[30],"on":[31,204],"solving":[32],"problems":[34,43],"like":[35],"quadratic":[37],"assignment":[38],"and":[39,91,182,213,238],"job-shop":[41],"scheduling":[42],"same":[46,114],"technique.":[47],"In":[48,166],"this":[49,167],"paper":[50,168],"we":[51,169],"use":[52],"technique":[55,174,189,231],"route":[57],"messages":[58,78,124],"through":[59],"an":[60,153,163],"N":[61,63,98,154,156],"\u00d7":[62,155],"Optical":[64],"Multistage":[65],"Interconnection":[66],"Network":[67],"(OMIN)":[68],"allowing":[69,145],"upto":[70,146],"'":[71,73,83,85,147,149],"C":[72,84,148],"limited":[74,150],"crosstalk's":[75],"(conflicts":[76],"between":[77],"within":[79],"a":[80,87,130],"switch)":[81],"where":[82],"is":[86,92,119,135,162,211,239],"technology":[88],"driven":[89],"parameter":[90],"always":[93],"less":[94],"than":[95,234],"log":[96],"2":[97],".":[99],"Messages":[100],"with":[101],"switch":[102],"conflicts":[103],"satisfying":[104],"crosstalk":[106],"constraint":[107],"are":[108],"allowed":[109],"pass":[111],"in":[112,129,152],"group,":[115],"but":[116],"if":[117],"there":[118],"any":[120],"link":[121],"conflict,":[122],"then":[123],"routed":[128],"different":[131],"group.":[132],"The":[133,224],"focus":[134],"minimize":[137],"number":[139,207],"of":[140,186,192,208],"passes":[141,209],"required":[142,210],"for":[143],"routing":[144,160,180],"crosstalks":[151],"optical":[157],"network.":[158],"This":[159],"NP-hard":[164],"problem.":[165,247],"show":[170,227],"how":[171],"applied":[177],"compare":[183],"performance":[185],"that":[191,228],"degree-descending":[194,236],"algorithm":[195,237],"simulation":[197],"techniques.":[198],"Finally":[199],"lower":[201],"bound":[202],"estimate":[203],"minimum":[206],"calculated":[212],"compared":[214],"results":[217,225],"obtained":[218,226],"two":[221],"algorithms":[222,244],"discussed.":[223],"performs":[232],"better":[233],"quite":[240],"close":[241],"optimal":[243]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}