Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/108831
Type: Artigo de evento
Title: Algorithm With Linear Computational Complexity For Batch Scheduling In Obs Networks
Author: Figueiredo G.B.
Da Fonseca N.L.S.
Abstract: This paper introduces a batch scheduling algorithm for OBS networks which has linear computational complexity. A transformation of the problem formulation is applied to allow the modeling of the problem as a job scheduling with identical machine type of problem. The proposed algorithm was compared to several other heuristic. Results show that it produces a lower bound to the blocking probability of those given by heuristics and it is only 3% slower than the fastest one. © 2011 IEEE.
Editor: 
Rights: fechado
Identifier DOI: 10.1109/icc.2011.5962545
Address: http://www.scopus.com/inward/record.url?eid=2-s2.0-80052152945&partnerID=40&md5=a2d6d862ff7aa060e8189b80fe1bc936
Date Issue: 2011
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-80052152945.pdf339.62 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.