RESPONSE TIME IN COMMUNICATION LINKS USING THE SELECTIVE REPEAT ARQ PROTOCOL.

Anagnostou, ME; Protonotarios, EN

dc.contributor.author	Anagnostou, ME	en
dc.contributor.author	Protonotarios, EN	en
dc.date.accessioned	2014-03-01T02:47:35Z
dc.date.available	2014-03-01T02:47:35Z
dc.date.issued	1984	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33263
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0021567708&partnerID=40&md5=9c0b5f2077683623d4501c37326108db	en
dc.subject.other	COMPUTER NETWORKS - Protocols	en
dc.subject.other	PROBABILITY	en
dc.subject.other	FEEDBACK COMMUNICATION	en
dc.subject.other	INTERARRIVAL TIME DISTRIBUTION	en
dc.subject.other	TIME RESPONSES	en
dc.subject.other	COMPUTERS	en
dc.title	RESPONSE TIME IN COMMUNICATION LINKS USING THE SELECTIVE REPEAT ARQ PROTOCOL.	en
heal.type	conferenceItem	en
heal.publicationDate	1984	en
heal.abstract	An exact Markov state analysis of the Selective Repeat ARQ scheme is presented. Two useful propositions for the state transition matrix of the system are proved. These propositions are particularly powerful for specific interarrival time distributions. For example, almost closed-form expression of the state probabilities are obtained for geometrically distributed interarrival times. An approximation technique is also presented, the results of which are in excellent agreement with simulation results. The advantages of this analysis are high accuracy (relative error almost always below 1%) and independence of the round trip delay. Simple closed-form expressions are obtained for geometrically distributed arrivals.	en
heal.publisher	Peter Peregrinus Ltd, London, Engl	en
heal.journalName	[No source information available]	en
dc.identifier.spage	358	en
dc.identifier.epage	362	en