Samenvatting
This article studies the statistical properties of multiple-access contention tree-algorithms with ternary feedback for an arbitrary degree of node. Accurate analytical approximations are given for the expectation value of the number of levels required for a random contender to have successful access, as well as of the number of levels and of the number of contention frames required to provide access for all contenders.
Originele taal-2 | Engels |
---|---|
Titel | 1998 Information Theory Workshop, ITW 1998 |
Plaats van productie | Piscataway |
Uitgeverij | Institute of Electrical and Electronics Engineers |
Pagina's | 128-129 |
Aantal pagina's | 2 |
ISBN van geprinte versie | 0780344081, 9780780344082 |
DOI's | |
Status | Gepubliceerd - 1 jan. 1998 |
Extern gepubliceerd | Ja |
Evenement | 1998 IEEE Information Theory Workshop (ITW 1998) - Killarney, Ierland Duur: 22 jun. 1998 → 26 jun. 1998 |
Congres
Congres | 1998 IEEE Information Theory Workshop (ITW 1998) |
---|---|
Verkorte titel | ITW 1998 |
Land/Regio | Ierland |
Stad | Killarney |
Periode | 22/06/98 → 26/06/98 |