Title :
An approximate performance fairness analysis of the pi-persistent protocol with destination release
Author :
Gong, Yu ; Paterakis, Michael
Author_Institution :
Dept. of Comput. Sci. & Eng., Auburn Univ., AL, USA
fDate :
5/1/1995 12:00:00 AM
Abstract :
Sufficient conditions are derived for achieving the two most important fairness criteria in the design of access protocols for high-speed metropolitan area networks (MAN), the delay and throughput fairness criteria, a probabilistic scheduling scheme, known as the pi-persistent protocol is considered, which has been shown to be suitable for applications requiring large bandwidth over long repeater-free distances and also amenable to an approximate analytical performance evaluation. It is found that the throughput fairness criterion is easier to achieve than its delay counterpart. The delay fairness, when achieved, induces approximate throughput fairness. The current practice in the field of protocol design for unidirectional bus MANs appears to focus almost exclusively on the throughput fairness. For example, in the DQDB protocol, although a bandwidth balancing function exists, balancing delay performance has never been dealt with
Keywords :
access protocols; approximation theory; delays; metropolitan area networks; performance evaluation; probability; scheduling; telecommunication control; DQDB protocol; MAC protocol; approximate performance fairness analysis; bandwidth balancing; delay fairness; delay performance balancing; destination release; high-speed MAN; long repeater-free distances; medium access control protocol; metropolitan area networks; pi-persistent protocol; probabilistic scheduling; protocol design; sufficient conditions; throughput fairness; unidirectional bus MAN; Access protocols; Bandwidth; Communications Society; Delay; Media Access Protocol; Metropolitan area networks; Performance analysis; Repeaters; Sufficient conditions; Throughput;
Journal_Title :
Communications, IEEE Transactions on