By Topic

Off-line permutation embedding and scheduling in multiplexed optical networks with regular topologies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chunming Qiao ; Dept. of Comput. Sci. & Eng., State Univ. of New York, Buffalo, NY, USA ; Yousong Mei

There are two basic approaches for establishing a connection in a reconfigurable switched optical network, whose links are multipiexed with virtual channels (e.g., wavelengths or time slots). One is called path multiplexing (PM), in which the same virtual channel has to be used on each link along a path, and the other is link multiplexing (LM), in which different virtual channels may be used. We focus on the problem of off-line permutation embedding and scheduling as a part of the comparative study of the multiplexing approaches. Specifically, we determine the minimum number of virtual channels per link needed for a given network to be rearrangeably nonblocking in PM and LM, respectively. We also examine the schedule length of a permutation in PM and LM when the network is blocking as a result of having an insufficient number of virtual channels per link. We found that PM and LM are equally effective in linear arrays, and LM is slightly more effective than PM in rings, meshes (grids), tori, and hypercubes

Published in:

Networking, IEEE/ACM Transactions on  (Volume:7 ,  Issue: 2 )