{"id":"https://openalex.org/W2016403348","doi":"https://doi.org/10.1109/icc.2011.5962545","title":"Algorithm with Linear Computational Complexity for Batch Scheduling in OBS Networks","display_name":"Algorithm with Linear Computational Complexity for Batch Scheduling in OBS Networks","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2016403348","doi":"https://doi.org/10.1109/icc.2011.5962545","mag":"2016403348"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2011.5962545","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962545","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","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/A5003668568","display_name":"Gustavo B. Figueiredo","orcid":"https://orcid.org/0000-0001-9756-378X"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Gustavo B. Figueiredo","raw_affiliation_strings":["Institute of Computing, State University of Campinas-UNICAMP, Sao Paulo, Brazil","[Inst. of Comput., Univ. of Campinas, Campinas, Brazil]"],"affiliations":[{"raw_affiliation_string":"Institute of Computing, State University of Campinas-UNICAMP, Sao Paulo, Brazil","institution_ids":["https://openalex.org/I181391015"]},{"raw_affiliation_string":"[Inst. of Comput., Univ. of Campinas, Campinas, Brazil]","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039387826","display_name":"Nelson L. S. da Fonseca","orcid":"https://orcid.org/0000-0003-2046-602X"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Nelson L. S. da Fonseca","raw_affiliation_strings":["Institute of Computing, State University of Campinas-UNICAMP, Sao Paulo, Brazil","[Inst. of Comput., Univ. of Campinas, Campinas, Brazil]"],"affiliations":[{"raw_affiliation_string":"Institute of Computing, State University of Campinas-UNICAMP, Sao Paulo, Brazil","institution_ids":["https://openalex.org/I181391015"]},{"raw_affiliation_string":"[Inst. of Comput., Univ. of Campinas, Campinas, Brazil]","institution_ids":["https://openalex.org/I181391015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003668568"],"corresponding_institution_ids":["https://openalex.org/I181391015"],"apc_list":null,"apc_paid":null,"fwci":0.5299,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69280874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3843","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9975000023841858,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9973999857902527,"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/heuristics","display_name":"Heuristics","score":0.7537715435028076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.704667866230011},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.625299334526062},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.583010196685791},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5122665762901306},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.5030943751335144},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47872066497802734},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4784705340862274},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45078930258750916},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4365023970603943},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43217480182647705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22919857501983643},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13090306520462036}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7537715435028076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.704667866230011},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.625299334526062},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.583010196685791},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5122665762901306},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.5030943751335144},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47872066497802734},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4784705340862274},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45078930258750916},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4365023970603943},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43217480182647705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22919857501983643},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13090306520462036},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2011.5962545","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962545","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6600000262260437,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1564927858","https://openalex.org/W1923249064","https://openalex.org/W1991376461","https://openalex.org/W1992649763","https://openalex.org/W2015991221","https://openalex.org/W2075216558","https://openalex.org/W2091894516","https://openalex.org/W2108165177","https://openalex.org/W2109262874","https://openalex.org/W2114245635","https://openalex.org/W2141217973","https://openalex.org/W2149123157","https://openalex.org/W2152178992","https://openalex.org/W2152941024","https://openalex.org/W2165334967","https://openalex.org/W6684104512"],"related_works":["https://openalex.org/W2139982839","https://openalex.org/W1984267569","https://openalex.org/W2092966558","https://openalex.org/W1956651153","https://openalex.org/W2347561926","https://openalex.org/W2327547880","https://openalex.org/W3153517983","https://openalex.org/W961142965","https://openalex.org/W2983653348","https://openalex.org/W1547042791"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,31,54],"batch":[4],"scheduling":[5,33],"algorithm":[6,42],"for":[7],"OBS":[8],"networks":[9],"which":[10],"has":[11],"linear":[12],"computational":[13],"complexity.":[14],"A":[15],"transformation":[16],"of":[17,27,38,61],"the":[18,25,28,58,73],"problem":[19,29],"formulation":[20],"is":[21,68],"applied":[22],"to":[23,45,57],"allow":[24],"modeling":[26],"as":[30],"job":[32],"with":[34],"identical":[35],"machine":[36],"type":[37],"problem.":[39],"The":[40],"proposed":[41],"was":[43],"compared":[44],"several":[46],"other":[47],"heuristic.":[48],"Results":[49],"show":[50],"that":[51],"it":[52,67],"produces":[53],"lower":[55],"bound":[56],"blocking":[59],"probability":[60],"those":[62],"given":[63],"by":[64],"heuristics":[65],"and":[66],"only":[69],"3%":[70],"slower":[71],"than":[72],"fastest":[74],"one.":[75]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}