Scheduling Packet Transmissions in a Multi-hop Packet Switched Network Based on Message Length

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 30, 1997
Accession Number
ADA327324

Entities

People

  • E. Modiano

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Computer Networks
  • Electronic Mail
  • Intervals
  • Massachusetts
  • Network Protocols
  • Network Simulation
  • Networks
  • Scheduling (Production)
  • Sequences
  • Simulations
  • Standards
  • Time Intervals

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Operations Research