Distributed Routing

Abstract

In distributed routing each node receives some information about the network from its adjacent nodes and uses the information to determine the manner in which it forwards its traffic. This thesis gives three examples of distributed routing in a data communication network. A routing algorithm is then given where a generalized distributed routing procedure proposes a flow change and a central node determines the optimal scale of the proposed change. Small flows on long and unwanted paths are set to zero regardless of the scaling. The thesis shows that the iterative use of this algorithm converges to the optimal network cost, e.g. it minimizes the mean delay.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1981
Accession Number
ADA095385

Entities

People

  • Art O'leary

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Ground and Sea Platforms
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Communication Channels
  • Communication Networks
  • Computational Complexity
  • Computer Communications
  • Computer Science
  • Computers
  • Electrical Engineering
  • Electronics Laboratories
  • Engineering
  • Equations
  • Inequalities
  • Information Processing
  • Linear Programming
  • Military Research
  • Numbers
  • Sequences

Fields of Study

  • Computer science

Readers

  • Approximation Theory.
  • Computer Networking