A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback

DOI10.1016/0020-0255(89)90038-8zbMath0673.68009OpenAlexW2024160062MaRDI QIDQ1120993

Jie-Yong Juang, Benjamin W.-S. Wah

Publication date: 1989

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(89)90038-8

zbMATH Keywords

adaptive-tree-polling protocolsarrival-time-window protocolsmultiaccess networkspriority-access protocolsunified minimum-search methodurn protocolsvirtual-window protocolwindow protocol

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Theory of software (68N99)

Cites Work

• Unnamed Item
• Randomized and nonrandomized algorithms of random multiple access
• Tree algorithms for packet broadcast channels
• On Adaptive Tree Polling Algorithms
• A perspective on multiaccess channels
• Survey of USSR contributions to random multiple-access communications
• Bounds on the performance of protocols for a multiple-access broadcast channel
• On Partitioning a Sample With Binary-Type Questions in Lieu of Collecting Observations
• Carrier Sense Multiple Access with Message-Based Priority Functions
• Information of partitions with applications to random access communications
• Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics
• Stability and Optimal Control of the Packet Switching Broadcast Channel
• An efficient collision-free protocol for prioritized access-control of cable or radio channels

This page was built for publication: A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback