Packet scheduling based on message length
AssigneeThe United States of America as represented by the Secretary of the Air Force
InventorEytan Modiano
Life of this patent
Estimating the term…
Abstract
A system using 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 to which the package belongs. 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 the First-Come-First-Serve scheduling.
Claims12
A process for scheduling network layer packets based upon application message length, said process comprising the steps of:
- identifying message lengths for all messages awaiting scheduling of the transmission into a network to identify shortest messages;
- and a first prioritizing step performed by prioritizing messages for transmission by sending shortest messages first.
A system for scheduling network layer packets based upon application message length, said process comprising:
- a means for identifying message lengths for all messages awaiting scheduling of transmission into a network to identify shortest messages;
- and a first prioritizing means for prioritizing messages for transmission by sending shortest messages first.
Dependencies are inferred from the claim text.