A New Upper Bound to the Throughput of a Multi-Access Broadcast Channel

Rene Cruz, Bruce Hajek

Research output: Contribution to journalArticle

Abstract

A new upper bound of 0.6126 packets/slot is established for the through-put of a time-slotted multi-access broadcast channel subject to an infinite population of user stations (whose transmissions are modeled by a Poisson process) using (0)-, (1)-, (e)-feedback to denote a slot with none, one, or at least two packets, respectively.

Original languageEnglish (US)
Pages (from-to)402-405
Number of pages4
JournalIEEE Transactions on Information Theory
Volume28
Issue number3
DOIs
StatePublished - May 1982

Fingerprint

broadcast
Throughput
Feedback
time

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

A New Upper Bound to the Throughput of a Multi-Access Broadcast Channel. / Cruz, Rene; Hajek, Bruce.

In: IEEE Transactions on Information Theory, Vol. 28, No. 3, 05.1982, p. 402-405.

Research output: Contribution to journalArticle

@article{c9b936d10f0a48e0b74b219f0fb54fa4,
title = "A New Upper Bound to the Throughput of a Multi-Access Broadcast Channel",
abstract = "A new upper bound of 0.6126 packets/slot is established for the through-put of a time-slotted multi-access broadcast channel subject to an infinite population of user stations (whose transmissions are modeled by a Poisson process) using (0)-, (1)-, (e)-feedback to denote a slot with none, one, or at least two packets, respectively.",
author = "Rene Cruz and Bruce Hajek",
year = "1982",
month = "5",
doi = "10.1109/TIT.1982.1056510",
language = "English (US)",
volume = "28",
pages = "402--405",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - A New Upper Bound to the Throughput of a Multi-Access Broadcast Channel

AU - Cruz, Rene

AU - Hajek, Bruce

PY - 1982/5

Y1 - 1982/5

N2 - A new upper bound of 0.6126 packets/slot is established for the through-put of a time-slotted multi-access broadcast channel subject to an infinite population of user stations (whose transmissions are modeled by a Poisson process) using (0)-, (1)-, (e)-feedback to denote a slot with none, one, or at least two packets, respectively.

AB - A new upper bound of 0.6126 packets/slot is established for the through-put of a time-slotted multi-access broadcast channel subject to an infinite population of user stations (whose transmissions are modeled by a Poisson process) using (0)-, (1)-, (e)-feedback to denote a slot with none, one, or at least two packets, respectively.

UR - http://www.scopus.com/inward/record.url?scp=0020128168&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020128168&partnerID=8YFLogxK

U2 - 10.1109/TIT.1982.1056510

DO - 10.1109/TIT.1982.1056510

M3 - Article

AN - SCOPUS:0020128168

VL - 28

SP - 402

EP - 405

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 3

ER -