QUEUEING ANALYSIS OF SOME BUFFERED RANDOM MULTIPLE ACCESS SCHEMES.

Sykas Efstathios, D; Karvelas Dionysios, E; Protonotarios Emmanuel, N

dc.contributor.author	Sykas Efstathios, D	en
dc.contributor.author	Karvelas Dionysios, E	en
dc.contributor.author	Protonotarios Emmanuel, N	en
dc.date.accessioned	2014-03-01T01:06:38Z
dc.date.available	2014-03-01T01:06:38Z
dc.date.issued	1986	en
dc.identifier.issn	00961965	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9534
dc.subject	Approximate Solution	en
dc.subject	Buffer Capacity	en
dc.subject	Multiple Access	en
dc.subject	Numerical Analysis	en
dc.subject	Queue Length	en
dc.subject	Queueing Analysis	en
dc.subject	Queueing Model	en
dc.subject	State Space	en
dc.subject	Markov Chain	en
dc.subject.other	DATA TRANSMISSION - Packet Switching	en
dc.subject.other	INFORMATION THEORY - Communication Channels	en
dc.subject.other	PROBABILITY - Queueing Theory	en
dc.subject.other	MARKOV CHAIN	en
dc.subject.other	MULTIPLE ACCESS SCHEMES	en
dc.subject.other	QUEUEING MODEL	en
dc.subject.other	COMPUTER NETWORKS	en
dc.title	QUEUEING ANALYSIS OF SOME BUFFERED RANDOM MULTIPLE ACCESS SCHEMES.	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TCOM.1986.1096622	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TCOM.1986.1096622	en
heal.publicationDate	1986	en
heal.abstract	A queueing model is proposed that is appropriate for the analysis of multiple-access schemes with finite user buffer capacity. This model can be applied to several slotted random multiple-access schemes such as the URN, ALOHA, and the random TDMA channels. The examined system, in general, can be modeled as a multidimensional Markov chain. The enormous state-space for its complete description makes numerical analysis intractable. Nevertheless, the symmetry properties of the system can be exploited so that the state space will be reduced. In particular, the queue length at one station and the number of busy stations are used to characterize the behavior of the system. In this way, a two-dimensional Markov chain can be constructed and an approximate solution is obtained which is in agreement with simulation results.	en
heal.journalName	IEEE Transactions on Communications	en
dc.identifier.doi	10.1109/TCOM.1986.1096622	en
dc.identifier.volume	COM-34	en
dc.identifier.issue	8	en
dc.identifier.spage	790	en
dc.identifier.epage	798	en