dc.creatorFigueiredo, GB
dc.creatorXavier, EC
dc.creatorda Fonseca, NLS
dc.date2012
dc.dateSEP 28
dc.date2014-08-01T18:37:37Z
dc.date2015-11-26T17:08:34Z
dc.date2014-08-01T18:37:37Z
dc.date2015-11-26T17:08:34Z
dc.date.accessioned2018-03-28T23:57:13Z
dc.date.available2018-03-28T23:57:13Z
dc.identifierComputer Networks. Elsevier Science Bv, v. 56, n. 14, n. 3274, n. 3286, 2012.
dc.identifier1389-1286
dc.identifierWOS:000308832600009
dc.identifier10.1016/j.comnet.2012.06.005
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/81602
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/81602
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1280402
dc.descriptionThis paper introduces optimal batch scheduling algorithms for the problem of scheduling batches of bursts in optical burst switching networks. The problem is modelled as a job scheduling problem with identical machines. The consideration of previously scheduled bursts in the scheduling allows such modeling. Two optimal algorithms with polynomial time complexity are derived and evaluated. Results show that the algorithm that allows re-scheduling of previously scheduled bursts leads to preferred solutions. Moreover, an extended version of the JET reservation protocol is proposed for efficient handling of batches of bursts. Results obtained via simulation prove the superior performance of the BATCHOPT algorithm. (C) 2012 Elsevier B.V. All rights reserved.
dc.description56
dc.description14
dc.description3274
dc.description3286
dc.languageen
dc.publisherElsevier Science Bv
dc.publisherAmsterdam
dc.publisherHolanda
dc.relationComputer Networks
dc.relationComput. Netw.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectOBS networks
dc.subjectChannel scheduling
dc.subjectBatch scheduling
dc.subjectBurst-switched Networks
dc.subjectPerformance
dc.subjectTimes
dc.titleOptimal algorithms for the batch scheduling problem in OBS networks
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución