Controlling window protocols for time-constrained communication in a multiple access environment

Authors:
James F. Kurose;Mischa Schwartz;Yechiam Yemini
Affiliations:
Department of Computer Science, Columbia University, New York, New York;Department of Electrical Engineering and Department of Computer Science, Columbia University, New York, New York;Department of Computer Science, Columbia University, New York, New York
Venue:
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Year:
1983

Citing 5
Cited 8

Computer networks

Computer networks
Computer Communications Network Design and Analysis

Computer Communications Network Design and Analysis
Issues in transnet packetized voice communication

SIGCOMM '77 Proceedings of the fifth symposium on Data communications
Asynchronous multiple access tree algorithms

SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Multiple-access protocols and time-constrained communication

ACM Computing Surveys (CSUR)
A Window Protocol for Transmission of Time-Constrained Messages

IEEE Transactions on Computers
Design, implementation, and evaluation of a software-based real-time Ethernet protocol

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Integrating Priority with Share in the Priority-Based Weighted Fair Queuing Scheduler for Real-Time Networks

Real-Time Systems - Flexible Scheduling on Real-Time Systems
Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol

IEEE Transactions on Computers
Group Allocation Multiple Access with Collision Detection

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
History of communications: an early history of the internet

IEEE Communications Magazine
Robustness of real-time local area network protocols

Computer Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

For many time-constrained communication applications, such as packetized voice, a critical performance measure is the percentage of messages which are transmitted within a given amount of time after their arrival at a sending station. We examine the use of a group random access protocol based on time windows for achieving time-constrained communication in a multiple access environment. First, we formulate a policy for controlling protocol operation in order to minimize the percentage of messages with waiting times greater than some given bound. A semi-Markov decision model is then developed for protocol operation and three of the four optimal control elements of this policy are then determined. Although the semi-Markov decision model can also be used to obtain performance results, the procedure is too computationally expensive to be of practical use. Thus, an alternate performance model based on a centralized queueing system with impatient customers is developed. Protocol performance under the optimal elements of the control policy shows significant improvements over cases in which the protocol is not controlled in this manner. Simulation results are also presented to corroborate the analytic results.