Queueing analysis of buffered slotted multiple access protocols

Apostolopoulos, T; Protonotarios, E

dc.contributor.author	Apostolopoulos, T	en
dc.contributor.author	Protonotarios, E	en
dc.date.accessioned	2014-03-01T01:06:28Z
dc.date.available	2014-03-01T01:06:28Z
dc.date.issued	1985	en
dc.identifier.issn	0140-3664	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9400
dc.subject	buffer capacity	en
dc.subject	multiple access protocols	en
dc.subject	performance evaluation	en
dc.subject	queueing theory	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.title	Queueing analysis of buffered slotted multiple access protocols	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0140-3664(85)90126-4	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0140-3664(85)90126-4	en
heal.language	English	en
heal.publicationDate	1985	en
heal.abstract	Much of the literature on the performance evaluation of multiple access protocols has assumed a buffer capacity of one unit. This assumption is not realistic. In practice the buffer capacities used are larger than one unit in order to reduce the probability of packet rejection. This is more crucial for multiple access protocols, which allow moderate to high values of the expected throughput (URN, Random TDMA etc.). In this paper, a model appropriate for the analysis of buffered slotted multiple access schemes is proposed. The method can be applied to several multiple access protocols such as the URN protocol, the ALOHA protocol, Random TDMA etc. The cases of infinite and finite buffer capacity are examined separately but under the same basic assumptions. The analysis is based on the assumption that each user process can be modelled as an M/G/1 queueing system. The proposed method requires a small amount of computation and is characterized by a high speed, a fact that simplifies the buffer's design as well. The solution obtained is extremely accurate and exhibits excellent agreement with simulation results, which corroborate the accuracy of the model. The special case when the buffer capacity is equal to 1 is examined. In that case, the present approach also allows for computation of the packet delay distribution. © 1985.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Communications	en
dc.identifier.doi	10.1016/0140-3664(85)90126-4	en
dc.identifier.isi	ISI:A1985ABZ7000002	en
dc.identifier.volume	8	en
dc.identifier.issue	1	en
dc.identifier.spage	9	en
dc.identifier.epage	21	en