dc.contributor.author |
Anagnostou, ME |
en |
dc.contributor.author |
Afrati, FN |
en |
dc.date.accessioned |
2014-03-01T02:47:38Z |
|
dc.date.available |
2014-03-01T02:47:38Z |
|
dc.date.issued |
1985 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/33298 |
|
dc.relation.uri |
http://www.scopus.com/inward/record.url?eid=2-s2.0-0022237520&partnerID=40&md5=a5b6164f2b3fe9a8046e8dadbaca27f4 |
en |
dc.subject.other |
COMPUTER PROGRAMMING - Algorithms |
en |
dc.subject.other |
DATA TRANSMISSION - Packet Switching |
en |
dc.subject.other |
PROBABILITY |
en |
dc.subject.other |
ARQ PROTOCOLS |
en |
dc.subject.other |
FEEDBACK COMMUNICATION |
en |
dc.subject.other |
GO-BACK-N |
en |
dc.subject.other |
SELECTIVE REPEAT |
en |
dc.subject.other |
STOP-AND-WAIT |
en |
dc.subject.other |
DIGITAL COMMUNICATION SYSTEMS |
en |
dc.title |
ON THE COMPLEXITY AND ACCURACY OF ALGORITHMS USED FOR THE PERFORMANCE EVALUATION OF ARQ PROTOCOLS. |
en |
heal.type |
conferenceItem |
en |
heal.publicationDate |
1985 |
en |
heal.abstract |
The authors analyze the computational complexity and the accuracy of algorithms that have been proposed for the performance evaluation of the most frequently used ARQ protocols, namely the stop-and-wait, the go-back-N, and the selective-repeat ARQ protocol. Closed-form exact solutions exist for the waiting times of the stop-and-wait and the go-back-N protocol if the arrivals in each slot are geometrically distributed. For generally distributed arrival processes, algorithms for the computation of the waiting times of arriving packets are also known. Although the probability distributions involved in the computations have an infinite number of terms, they must be represented in the computer by only a finite number of them. The number of terms used affects not only the accuracy of the solution but also the convergence speed of the algorithm. |
en |
heal.publisher |
IEEE, New York, NY, USA |
en |
heal.journalName |
[No source information available] |
en |
dc.identifier.spage |
587 |
en |
dc.identifier.epage |
590 |
en |