Performance Tradeoffs and Hierarchical Designs of Distributed Packet-Switching Communication Networks,
Abstract
This document considers a distributed communication system with many terminals wishing to communicate with each other. When the terminals are distributed in space we must face the following questions: What scheme can control the access to the communication resources in an effective way? What tradeoffs are basic to the design of such a communication system? What is the role of hierarchies in organizing large communication nets? How should a large network be decomposed into smaller parts? What cost versus performance gains can be achieved by such a decomposition? In attacking these questions we consider two technologies - line and broadcast - and two kinds of systems - centralized systems, in which messages originate in the distributed terminals but are directed to one common destination, and networks, in which both sources and destinations of messages are distributed. In the first paper the authors calculate optimal transmission range. When choosing this optimal range, ALOHA networks gain a self adjusting capability, which makes heavily loaded ALOHA networks far better than centralized ALOHA systems. The second paper shows that by introducing regular hierarchical structures the cost of bursty systems can be significantly reduced, and that the optimal structure must be balanced. In the third paper we show that mixed-mode systems, using ALOHA in a bottom level and dedicated channels in a top level, can be very good for medium burstiness since they can trade the amount of interference in the random access level against the number of dedicated channels in the top level.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1979
- Accession Number
- ADA157739
Entities
People
- G. Akavia
- L. Kleinrock
Organizations
- University of California, Los Angeles