Value-based message multiplexing: an analytical model
James E. Baker · IEEE Military Communications Conference (MILCOM) · 2002
It has been proposed that messages be explicitly tagged with a value function that indicates the message's value to the system as a function of its delay. Also proposed, for use in a message multiplexer, was the MUST (maximum utility scheduling for transmission) protocol, which explicitly considers the value functions of messages waiting for transmission and determines a transmission schedule that maximizes the delivered value, under the assumption that no further messages arrive. The performance of the MUST protocol in a stressed environment is studied and compared to that of other protocols. Because analysis of the MUST protocol is very complex, a discrete-time, nonpreemptive version is formulated. The results indicate that the MUST protocol performs well under a wide range of conditions.>
Cited by 3 works. doi:10.1109/milcom.1990.117474
Authors
References
- Matrix-Geometric Solutions to Stochastic Models
- Multiple-access protocols and time-constrained communication
- Matrix-geometric solutions in stochastic models
- Best-effort decision-making for real-time scheduling
- A Time-Driven Scheduling Model for Real-Time Operating Systems.
- Mechanisms for Reliable Distributed Real-Time Operating Systems: The Alpha Kernel
- Implementation of a Time-Driven Scheduler for ReaI-Time Operating Systems.
- The integration of deadline and criticalness in hard real-time scheduling
- Optimal scheduling with strict deadlines
- Optimal scheduling of interactive and noninteractive traffic in telecommunication systems