A throughput-dependent priority discipline for a multi-class traffic packet switch-A simulation study

A novel random access algorithm is proposed for a packet switch serving more input channels than it has output channels which supports different classes of critically delay-sensitive traffic on each of the input channels. The algorithm ensures that a certain service level is met dynamically for each of the traffic channels, consistent with the predetermined requirements of each class of traffic. In this case, traffic throughput is chosen as the primary service requirement and packet dropping is used for contention resolution. No queuing or packet retransmission is used and traffic throughput is the criterion used to adjust the relative priorities of the traffic channels dynamically at a sub-packet level so that each transmitted packet experiences zero queuing delay. The algorithm provides flexible traffic control, efficient resource sharing and acceptable packet loss levels, provided that fundamental `load-levels´ are not exceeded