Performance analysis of the pi-persistent protocol in unidirectional bus networks


R. Mathar, K. Pawlikowski,


        The pi-persistent medium access protocol is an attractive solution for high-speed time-slotted unidirectional bus networks. This protocol, with its very simple flow control mechanism allowing station i to access empty slots with station-dependent probability pi, has been seen as an alternative for solving fairness problems associated with the original IEEE 802.6 standard (DQDB) for high-speed networks.

In this paper we analyze main aspects of the fairness provision mechanism employed in the pi-persistent protocol. Assuming heavy traffic load, the stations' access probabilities are determined as to allocate certain portions of the channel capacity for guaranteeing prescribed service requirements. Having determined the probability generating function of queue length as well as the two first moments of the worst-case packet delay (delay of the last packet arriving at a station within a slot time) for a single station, we investigate packet delays and fairness in a bus network with N stations. Our results show that in a network with homogeneous Poissonian arrival streams, if the bus is able to carry all offered load, protecting fairness of services by lowering the access probability at a station leads only to deterioration of that station's performance without affecting performance of other stations. This is a surprising result which however does not apply for bursty traffic, as shown by the results of our simulation studies.

BibTEX Reference Entry 

	author = {Rudolf Mathar and Krysztof Pawlikowski},
	title = "Performance analysis of the {$p\sb i$}-persistent protocol in unidirectional bus networks",
	pages = "535-543",
	journal = "Computer Communications",
	volume = "20",
	number = "7",
	doi = 10.1016/S0140-3664(97)00023-6,
	month = Aug,
	year = 1997,
	hsb = RWTH-CONV-223157,


 Download bibtex-file

Sorry, this paper is currently not available for download.