Accession Number:

ADA162927

Title:

Packet Trains: Measurements and a New Model for Computer Network Traffic.

Descriptive Note:

Research rept. Jun 84-Aug 85,

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE

Personal Author(s):

Report Date:

1985-11-01

Pagination or Media Count:

29.0

Abstract:

Traffic measurements on a ring local area computer network at Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival processes are neither Poisson nor Compound Poisson. An alternative model called packet train is proposed. In the train model, the traffic on the network consists of a number of packet streams between various pairs of nodes on the network. Each node-pair stream or node-pair process, as we call them consists of a number of trains. Each train consists of a number of packets or cars going either direction from node A to B or from node B to A. The inter-car gap is large compared to packet transmission time and random. The inter-train time is even larger. The Poisson and the Compound Poisson arrivals are shown to be special cases of the train arrival model. Keywords Computer Communications Land transportation and Rail transportation.

Subject Categories:

  • Computer Hardware
  • Computer Systems
  • Surface Transportation and Equipment
  • Non-Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE