Scheduling packet transmissions in a multi-hop packet switched network based on message length

Authors:
E. Modiano
Affiliations:
-
Venue:
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Year:
1997

Citing 0
Cited 1

Fairness and efficiency in web server protocols

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message that the packet belongs to. The first algorithm is preemptive and is based on the shortest-message-first principle and the second is based on the shortest-remaining-transmit-time principle. We develop simulation models for analyzing the algorithms. The simulations show that when message sizes vary widely, these algorithms can significantly reduce average end-to-end message delays compared to first-come-first-serve scheduling.