Slotted-Ring Local Area Networks with Multiple Priority Stations
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Three new ring access protocols, including a novel preemption scheme based on priority scheduling which we call ''soft preemption'', are presented for slotted-ring networks where stations generate multiple-priority messages. The first of the two nonpreemptive protocols always empties the high-priority queue before releasing low-priority packets into the ring, whereas the second one assumes a desirable, but not strict, delay deadline on the low-priority waiting times. The preemptive ring access protocol follows preemption rules based on delay deadlines imposed on the waiting times of both priority classes. We investigate the expected delays of all the protocols via simulations and present a graphical comparison, highlighting improvements in the waiting times of high- and low-priority packets.
Abstract
Three new ring access protocols, including a novel preemption scheme based on priority scheduling which we call ''soft preemption'', are presented for slotted-ring networks where stations generate multiple-priority messages. The first of the two nonpreemptive protocols always empties the high-priority queue before releasing low-priority packets into the ring, whereas the second one assumes a desirable, but not strict, delay deadline on the low-priority waiting times. The preemptive ring access protocol follows preemption rules based on delay deadlines imposed on the waiting times of both priority classes. We investigate the expected delays of all the protocols via simulations and present a graphical comparison, highlighting improvements in the waiting times of high- and low-priority packets.