DocumentCode :
350931
Title :
Delay fairness in demand priority networks
Author :
Lee, Kwang Jun ; Choi, Cheon Won
Author_Institution :
Dept. of Electron. & Comput. Eng., Dankook Univ., Seoul, South Korea
Volume :
1
fYear :
1999
fDate :
1999
Firstpage :
789
Abstract :
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
Keywords :
delays; local area networks; scheduling; FCFS schemes; Round Robin schemes; analytical approximation method; delay fairness; delay levels; delay-sensitive traffic transmission; demand priority networks; fast Ethernet; high speed local area network; mean delay calculation; packet delay time; scheduling packet transmission; simulation; Approximation methods; Computer networks; Delay effects; Electronic mail; Ethernet networks; Intelligent networks; Local area networks; Media Access Protocol; Round robin; Standards development;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON 99. Proceedings of the IEEE Region 10 Conference
Conference_Location :
Cheju Island
Print_ISBN :
0-7803-5739-6
Type :
conf
DOI :
10.1109/TENCON.1999.818533
Filename :
818533
Link To Document :
بازگشت