# US H2,103 H1 · Packet scheduling based on message length

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US H2,103 H1
- Document ID: USH2103H1
- Status: Granted
- Kind: H1
- Application number: 09/389,744
- Filed: 1999-09-07
- Granted: 2004-05-04
- Earliest claimed: 1999-09-07
- Assignees: The United States of America as represented by the Secretary of the Air Force
- Inventors: Eytan Modiano
- Web page: https://patentgrep.com/patent/USH2103H1

## 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.

## Claims

### Claim 1

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.

### Claim 2 (depends on 1)

A process, as defined in claim 1, wherein the identifying step is performed by noting each length field in each message packet header.

### Claim 3 (depends on 2)

A process as defined in claim 2, wherein said first prioritizing step is performed by establishing a priority for a message packet equaling an inverse length of the length field in each message packet header.

### Claim 4 (depends on 3)

A process, as defined in claim 3, in which the first prioritizing step further comprises using a server which serves message packets in accordance with their priority and in which new message packets are inserted into the priority queue according to their priority.

### Claim 5 (depends on 1)

A process as defined in claim 1, further comprises a second prioritizing step of prioritizing messages in accordance with the remaining transmission time.

### Claim 6 (depends on 5)

A process as defined in claim 5, wherein said second prioritizing step comprises giving all messages preemptive priority if they possess a shortest remaining transmission time.

### Claim 7 (depends on 4)

A process, as defined in claim 4, further comprises a second prioritizing step of prioritizing messages in accordance with a remaining transmission time.

### Claim 8 (depends on 7)

A process as defined in claim 7, wherein said second prioritizing step comprises giving all messages preemptive priority if they possess a shortest remaining transmission time.

### Claim 9

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.

### Claim 10 (depends on 9)

A system, as defined in claim 9, wherein the identifying means is performed by a network noting each length field in each message packet header.

### Claim 11 (depends on 10)

A system as defined in claim 10, wherein said first prioritizing means is performed by a server establishing a priority queue for all messages with a priority for a message packet equaling an inverse length of the length field in each message packet header.

### Claim 12 (depends on 11)

A system, as defined in claim 11, in which the first prioritizing means further comprises using a server which serves message packets in accordance with their priority and in which new message packets are inserted into the priority queue according to their priority.
