QUEUING ANALYSIS OF BUFFERED CSMA/CD PROTOCOLS

APOSTOLOPOULOS, TK; PROTONOTARIOS, EN

dc.contributor.author	APOSTOLOPOULOS, TK	en
dc.contributor.author	PROTONOTARIOS, EN	en
dc.date.accessioned	2014-03-01T01:06:39Z
dc.date.available	2014-03-01T01:06:39Z
dc.date.issued	1986	en
dc.identifier.issn	0090-6778	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9535
dc.subject	Buffer Capacity	en
dc.subject	Queueing Analysis	en
dc.subject	Queueing Model	en
dc.subject	State Space	en
dc.subject	Markov Chain	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.title	QUEUING ANALYSIS OF BUFFERED CSMA/CD PROTOCOLS	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TCOM.1986.1096647	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TCOM.1986.1096647	en
heal.language	English	en
heal.publicationDate	1986	en
heal.abstract	In this paper, we propose a new queueing model appropriate for the analysis of a buffered CSMA/CD protocol. We assume that each user has a finite buffer capacity. The system, in general, can be modeled as a multidimensional semi-Markov chain. The enormous state space for the complete description is reduced by appropriate exploitation of the features of the system, e.g.,	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE TRANSACTIONS ON COMMUNICATIONS	en
dc.identifier.doi	10.1109/TCOM.1986.1096647	en
dc.identifier.isi	ISI:A1986D630600006	en
dc.identifier.volume	34	en
dc.identifier.issue	9	en
dc.identifier.spage	898	en
dc.identifier.epage	905	en