Collision resolution algorithms for a time-constrained multiaccess channel

Shivendra Panwar, Don Towsley, Yehuda Armoni

Research output: Contribution to journalArticle

Abstract

Collision resolution algorithms (CRA's) for the ternary feedback multiple access channel with time constraints are considered. We wish to maximize the number of packets successfully transmitted within a fixed deadline K after their arrival for transmission. Packet arrivals are assumed to be Poisson. A non-nested CRA is described and its performance is compared with a nested CRA for values of K ≤ 4.

Original languageEnglish (US)
Pages (from-to)1023-1026
Number of pages4
JournalIEEE Transactions on Communications
Volume41
Issue number7
DOIs
StatePublished - Jul 1993

Fingerprint

Feedback

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Collision resolution algorithms for a time-constrained multiaccess channel. / Panwar, Shivendra; Towsley, Don; Armoni, Yehuda.

In: IEEE Transactions on Communications, Vol. 41, No. 7, 07.1993, p. 1023-1026.

Research output: Contribution to journalArticle

@article{175dad2ace6041e68bcb5ad8ca520040,
title = "Collision resolution algorithms for a time-constrained multiaccess channel",
abstract = "Collision resolution algorithms (CRA's) for the ternary feedback multiple access channel with time constraints are considered. We wish to maximize the number of packets successfully transmitted within a fixed deadline K after their arrival for transmission. Packet arrivals are assumed to be Poisson. A non-nested CRA is described and its performance is compared with a nested CRA for values of K ≤ 4.",
author = "Shivendra Panwar and Don Towsley and Yehuda Armoni",
year = "1993",
month = "7",
doi = "10.1109/26.231930",
language = "English (US)",
volume = "41",
pages = "1023--1026",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Collision resolution algorithms for a time-constrained multiaccess channel

AU - Panwar, Shivendra

AU - Towsley, Don

AU - Armoni, Yehuda

PY - 1993/7

Y1 - 1993/7

N2 - Collision resolution algorithms (CRA's) for the ternary feedback multiple access channel with time constraints are considered. We wish to maximize the number of packets successfully transmitted within a fixed deadline K after their arrival for transmission. Packet arrivals are assumed to be Poisson. A non-nested CRA is described and its performance is compared with a nested CRA for values of K ≤ 4.

AB - Collision resolution algorithms (CRA's) for the ternary feedback multiple access channel with time constraints are considered. We wish to maximize the number of packets successfully transmitted within a fixed deadline K after their arrival for transmission. Packet arrivals are assumed to be Poisson. A non-nested CRA is described and its performance is compared with a nested CRA for values of K ≤ 4.

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

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

U2 - 10.1109/26.231930

DO - 10.1109/26.231930

M3 - Article

VL - 41

SP - 1023

EP - 1026

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 7

ER -