A Recoverable Protocol for Loop-Free Distributed Routing

Abstract

An algorithm for adaptive routing in data-communication networks is presented. The algorithm uses distributed computation, provides loop-free routing for each destination in the network, adapts to changes in network flows and is completely failsafe. The latter means that after arbitrary failures and additions of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. Proofs of all these properties are provided in a separate paper.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1978
Accession Number
ADA061668

Entities

People

  • A. Segall
  • P. M. Merlin
  • R. G. Gallager

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Advanced Electronics
  • C4I
  • Ground and Sea Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Digital Communications
  • Electrical Engineering
  • Electronics Laboratories
  • Engineering
  • Information Processing
  • Information Systems
  • Military Research
  • Naval Operations
  • Networks
  • New York
  • Notation
  • Packet Switching
  • Recovery
  • Reliability
  • Transitions

Fields of Study

  • Computer science

Readers

  • Computer Networking