Analytic properties of contention tree-algorithms

M.J.M. de Jong, A.J.E.M. Janssen

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)

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-2Engels
Titel1998 Information Theory Workshop, ITW 1998
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
Pagina's128-129
Aantal pagina's2
ISBN van geprinte versie0780344081, 9780780344082
DOI's
StatusGepubliceerd - 1 jan. 1998
Extern gepubliceerdJa
Evenement1998 IEEE Information Theory Workshop (ITW 1998) - Killarney, Ierland
Duur: 22 jun. 199826 jun. 1998

Congres

Congres1998 IEEE Information Theory Workshop (ITW 1998)
Verkorte titelITW 1998
Land/RegioIerland
StadKillarney
Periode22/06/9826/06/98

Vingerafdruk

Duik in de onderzoeksthema's van 'Analytic properties of contention tree-algorithms'. Samen vormen ze een unieke vingerafdruk.

Citeer dit