This paper explores scheduling multiclass periodic tra c with deadlines in a time slotted system through an N N switch Di erent tra c streams may have di erent periods and di erent rates Each packet must depart before the next packet in its stream arrives An algorithm is given to schedule all tra c if each period evenly divides all longer pe riods and if the utilization at each link is no larger than one Furthermore this algorithm can schedule all tra c with no restrictions on the periods if the link utilization does not exceed A simple greedy algorithm is presented and is shown to schedule all tra c with no restrictions on the periods if the link utilization does not exceed These two algorithms can also be applied to more general deterministically constrained tra c when the link utilization is at most and respectively James Giles and Bruce Hajek are with the Coordinated Science Laboratory and the Department of Electrical and Computer Engineering at the University of Illinois at Urbana Champaign Address of Corresponding Author Prof Bruce Hajek Coordinated Science Laboratory West Main Street Urbana IL USA Tel e mail b hajek uiuc edu
[1]
Aura Ganz,et al.
Efficient algorithms for SS/TDMA scheduling
,
1992,
IEEE Trans. Commun..
[2]
R. Jain,et al.
Scheduling data transfers in preemptive hierarchical switching systems with applications to packet radio networks
,
1992,
[Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[3]
T. Inukai,et al.
An Efficient SS/TDMA Time Slot Assignment Algorithm
,
1979,
IEEE Trans. Commun..
[4]
Aura Ganz,et al.
Time-wavelength assignment algorithms for high performance WDM star based systems
,
1994,
IEEE Trans. Commun..
[5]
Chung Laung Liu,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.