On path dependent loss and switch crosstalk reduction in optical networks

EMU I-REP

Show simple item record

dc.contributor.author Bashirov, Rza
dc.date.accessioned 2016-01-18T13:16:31Z
dc.date.available 2016-01-18T13:16:31Z
dc.date.issued 2010
dc.identifier.citation Bashirov, R., Karanfiller, T. (2010) On path dependent loss and switch crosstalk reduction in optical networks, Information Systems, Elsevier, 180, 1040-1050 (indexed in SCI). en_US
dc.identifier.issn 0020-0255
dc.identifier.other 10.1016/j.ins.2009.11.017
dc.identifier.uri http://dx.doi.org/10.1016/j.ins.2009.11.017
dc.identifier.uri http://hdl.handle.net/11129/1997
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 (with DOI: 10.1016/j.ins.2009.11.017) 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 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), mmin-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 en_US en_US
dc.publisher Information Sciences, Elsevier en_US
dc.subject Optical interconnection network en_US
dc.subject Path dependent loss en_US
dc.subject Switch crosstalk en_US
dc.subject Permutation admissibility en_US
dc.subject P/T-net en_US
dc.subject P-invariants en_US
dc.title On path dependent loss and switch crosstalk reduction in optical networks en_US
dc.type Article en_US
dc.description.version Publisher Version (Published Version).


Files in this item

This item appears in the following Collection(s)

Show simple item record