![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/12BA9068-CDCD-4C08-8F0F-A7BBE5A169E9 | ||
| Έτος | 1990 | ||
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | M. Paterakis, Y. Gong, "Performance analysis of random access multiuser algorithms for packets with different priorities," in 1990 Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE(INFOCOM ), pp. 580 - 587, doi: 10.1109/INFCOM.1990.91298 https://doi.org/10.1109/INFCOM.1990.91298 | ||
| Εμφανίζεται στις Συλλογές |
Each of the generated packets can have two different priorities (high- and low-priority packets). High-priority packets are assumed to have a more restrictive delay requirement than low priority ones. For such a system, the authors propose a class of synchronous random-access algorithms which use a small portion of the channel capacity for the announcements of the existence of high- or low-priority packets. The stability and throughput-delay performances of the algorithms are determined analytically for the cases when one or two minislots are used. Representative performance results are given and compared with a similar algorithm which does not use minislots. The algorithms give a delay advantage to the high-priority packet class without adversely affecting the delays of the low-priority packets. The algorithms use binary C-NC (collision versus noncollision) feedback, and the maximum throughput is 0.487 when two minislots are used
Copyright © DIAS 2013
