On path dependent loss and switch crosstalk reduction in optical networks

EMU I-REP

Show simple item record

dc.contributor.author Bashirov, Rza
dc.contributor.author Karanfiller, Tolgay
dc.date.accessioned 2016-10-11T05:36:07Z
dc.date.available 2016-10-11T05:36:07Z
dc.date.issued 2010
dc.identifier.issn 0020-0255(print)
dc.identifier.issn 1872-6291(online)
dc.identifier.uri http://dx.doi.org/10.1016/j.ins.2009.11.017
dc.identifier.uri http://hdl.handle.net/11129/3009
dc.description Due to copyright restrictions, the access to the publisher version (published version) of this article is only available via subscription. You may click URI and have access to the Publisher Version of this article through the publisher web site or online databases, if your Library or institution has subscription to the related journal or publication. en_US
dc.description.abstract Although optical multistage interconnection networks (OMINs) promise to meet the ever growing demands of communication networks and multiprocessor systems in fast communication, they suffer from challenges such as path dependent loss and switch crosstalk. In this paper, we propose an innovative approach for reducing not only the path dependent loss but also the number of switch crosstalks in OMINs. Our approach is centered upon modelling OMINs with Petri nets and using the P-invariants method to determine the minimum number of stages m that is sufficient to establish requested communication patterns in variable-stage OMINs. Being composed of the smallest number of stages and consequently directional couplers (or photonic switches), m -stage OMIN employs minimal structure and, therefore, path dependent loss and also number of switch crosstalks reach the least possible values in the realization of requested communication patterns. We prove that the size of Petri nets created in this work is in polynomial dependence on the problem size which alleviates memory consumption significantly and ascertains the fact that memory capacity and performance of modern computers are indeed sufficient to run our task. We also show that the complexity results obtained in this research improve similar results reported in our previous paper. We carry out a series of computer experiments to confirm the effectiveness of the proposed approach en_US
dc.language.iso eng en_US
dc.publisher Elsevier en_US
dc.relation.isversionof 10.1016/j.ins.2009.11.017 en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.subject Switch crosstalk, Optical interconnection network en_US
dc.subject P-invariants, Permutation admissibility, Path dependent loss en_US
dc.subject P/T-net, CAPABILITY, COMPUTER SCIENCE en_US
dc.subject INFORMATION SYSTEMS, ALGORITHM, PETRI NETS en_US
dc.subject MULTISTAGE INTERCONNECTION NETWORKS en_US
dc.title On path dependent loss and switch crosstalk reduction in optical networks en_US
dc.type article en_US
dc.relation.journal Information Sciences en_US
dc.contributor.department Eastern Mediterranean University, Faculty of Arts & Sciences, Department of Mathematics en_US
dc.identifier.volume 180 en_US
dc.identifier.issue 6 en_US
dc.identifier.startpage 1040 en_US
dc.identifier.endpage 1050 en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record