Study of multiplexing for group-based quality of service delivery

In this work, the problem of scheduling packets with a group as opposed to an individual deadline is considered. Packets of the same group are supposed to belong in the same application data unit for which a deadline is set, and they are assumed to arrive over xed time intervals frames. The Frame-based Shortest Time to Extinction FSTE scheduling policy is considered at a multiplexer fed by multiple streams withgroup deadlines; expired packets are dropped not served. The performance of the F-STE policy is evaluated in terms of the induced packet loss deadline violation probabilities. It is established that the F-STE policy outperforms the similarly simple First In First Out FIFO policy, as wellas the potentiallymore complex FIFO policy which identi es and drops expired packets.

• Type: Conference
• Year: 1996
• Where: ATMN
• Authors: Xin Wang, Ioannis Stavrakakis
• Keywords: ATMN 1996, ATMN 1997, Complex Fifo Policy, F-STE Policy, FIFO Policy