Computation of the Efficiency of the Mosely-Humblet Contention Resolution Algorithm: A Simple Method

Sergio Verdu

doi:10.1109/PROC.1986.13513

Computation of the Efficiency of the Mosely-Humblet Contention Resolution Algorithm: A Simple Method

Sergio Verdu

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

Mosely and Humblet have obtained an efficient Contention Resolution Algorithm for transmission scheduling in a multi-user collision channel with ternary feedback (idle, success, collision). In this letter, a recursion for the expected value of the algorithm cycle delay is shown to reduce the computation of the efficiency and optimum partition functions to a simple optimization problem.

Original language	English (US)
Pages (from-to)	613-614
Number of pages	2
Journal	Proceedings of the IEEE
Volume	74
Issue number	4
DOIs	https://doi.org/10.1109/PROC.1986.13513
State	Published - Apr 1986

All Science Journal Classification (ASJC) codes

General Computer Science
Electrical and Electronic Engineering

Access to Document

10.1109/PROC.1986.13513

Cite this

@article{60e2f19453bf4a419208c3c6e31d6d10,

title = "Computation of the Efficiency of the Mosely-Humblet Contention Resolution Algorithm: A Simple Method",

abstract = "Mosely and Humblet have obtained an efficient Contention Resolution Algorithm for transmission scheduling in a multi-user collision channel with ternary feedback (idle, success, collision). In this letter, a recursion for the expected value of the algorithm cycle delay is shown to reduce the computation of the efficiency and optimum partition functions to a simple optimization problem.",

author = "Sergio Verdu",

year = "1986",

month = apr,

doi = "10.1109/PROC.1986.13513",

language = "English (US)",

volume = "74",

pages = "613--614",

journal = "Proceedings of the IEEE",

issn = "0018-9219",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Computation of the Efficiency of the Mosely-Humblet Contention Resolution Algorithm

T2 - A Simple Method

AU - Verdu, Sergio

PY - 1986/4

Y1 - 1986/4

N2 - Mosely and Humblet have obtained an efficient Contention Resolution Algorithm for transmission scheduling in a multi-user collision channel with ternary feedback (idle, success, collision). In this letter, a recursion for the expected value of the algorithm cycle delay is shown to reduce the computation of the efficiency and optimum partition functions to a simple optimization problem.

AB - Mosely and Humblet have obtained an efficient Contention Resolution Algorithm for transmission scheduling in a multi-user collision channel with ternary feedback (idle, success, collision). In this letter, a recursion for the expected value of the algorithm cycle delay is shown to reduce the computation of the efficiency and optimum partition functions to a simple optimization problem.

UR - https://www.scopus.com/pages/publications/0022703058

UR - https://www.scopus.com/pages/publications/0022703058#tab=citedBy

U2 - 10.1109/PROC.1986.13513

DO - 10.1109/PROC.1986.13513

M3 - Article

AN - SCOPUS:0022703058

SN - 0018-9219

VL - 74

SP - 613

EP - 614

JO - Proceedings of the IEEE

JF - Proceedings of the IEEE

IS - 4

ER -

Computation of the Efficiency of the Mosely-Humblet Contention Resolution Algorithm: A Simple Method

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this