By Topic

A graph-coloring scheme for scheduling cell transmissions and its photonic implementation

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
$33 $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

3 Author(s)
Lakshman, T.V. ; Bellcore, Red Bank, NJ, USA ; Bagchi, A. ; Rastani, K.

The authors present a scheme for scheduling cell-transmissions in an ATM switch capable of atomic multicasts. In an atomic multicast, partial transmissions to subsets of the requested output ports are not allowed. In any transmission slot, a cell at an input port is either successfully (without output contention) transmitted to all requested destinations or it is not transmitted at all. Scheduling is needed because many cells (due to the uncoordinated nature of their arrivals at the switch input ports) can request transmission to the same switch output port at the same time even though the switch may not have the ability to simultaneously satisfy all these requests. The problem is to devise an implementable scheme for scheduling atomic multicast requests such that all requests present at the beginning of a scheduling interval are satisfied in a minimum number of cell transmission slots. However, finding this minimum transmission schedule is equivalent to finding the minimum vertex coloring of a “contention graph” derived from the input requests. Since finding the minimum vertex coloring is an NP-hard problem, it is not feasible to find the minimum schedule. They present a scheduling scheme which uses a heuristic coloring algorithm with a known upper bound on the number of transmission slots used. This scheme can also schedule a mix of request types (unicasts, atomic and non-atomic multicasts). They describe two methods for photonic implementation of the scheduler and also methods to incorporate fairness and priorities

Published in:

Communications, IEEE Transactions on  (Volume:42 ,  Issue: 234 )