Delay fairness in demand priority networks

A demand priority network is a high speed local area network. Compared with a fast Ethernet, it is known to have advantages in transmission of delay-sensitive traffic. However, in a demand priority network, the packet delay time is unbounded and the delay levels experienced at stations are unfair. In this paper, we consider Round Robin and FCFS schemes for scheduling packet transmission. Under each scheme, we develop an analytical approximation method for mean delay calculation, and investigate the mean and standard deviation of the packet delay time by the approximation and simulation methods. By introducing a degree of delay fairness, the Round Robin and FCFS schemes are evaluated in delay fairness.