Performance Analysis of Finite Nonhomogeneous Population Tree Conflict Resolution Algorithms Using Constant Size Window Access

Multiple-access protocols control access to a broadcast communication channel. Tree conflict resolution algorithms are the heart of some distributed multiple-access protocols with nice properties like stability, high capacity, and low delay under light load. We consider a random access protocol base...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on communications Ročník 35; číslo 11; s. 1124 - 1138
Hlavní autoři: Polyzos, G., Molle, M., Venetsanopoulos, A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.11.1987
Institute of Electrical and Electronics Engineers
Témata:
Access protocols
Applied sciences
Broadcasting
Broadcasting. Videocommunications. Audiovisual
Communication channels
Communication system control
Delay
Exact sciences and technology
Heart
Performance analysis
Stability
Steady-state
Telecommunications
Telecommunications and information theory
Throughput
Videocommunications (networks and services)
Performance evaluation
Broadcasting
Multiple access
Homogeneous model
Algorithm
Transmission protocol
ISSN:0090-6778
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Multiple-access protocols control access to a broadcast communication channel. Tree conflict resolution algorithms are the heart of some distributed multiple-access protocols with nice properties like stability, high capacity, and low delay under light load. We consider a random access protocol based on a tree conflict resolution algorithm similar to one first proposed by Capetanakis, but in which constant size windows on the arrival time axis are used to admit packets into the algorithm instead of the more common "free" or "blocked" access methods. We obtain exact recursive relationships for the (steady-state) distribution of packet delay, and thus, the exact throughput-delay curve for any finite (in general, nonhomogeneous) configuration under a Bernoulli-per-window arrival model. Then, we consider the address assignment problem. We show that by choosing an appropriate addressing scheme, we can improve the performance of the algorithm with respect to both mean delay and maximum throughput.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
DOI:10.1109/TCOM.1987.1096710