Decentralized Maximum Flow Algorithms,

Abstract

This paper presents three algorithms for obtaining maximum flow in a network using distributed computation. Each node in the network has memory and processing capabilities and coordinates the algorithm with its neighbors using control messages. Each of the last two versions requires more sophistication at the nodes than the previous one, but on the other hand employs less communication. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1979
Accession Number
ADA069991

Entities

People

  • Adrian Segall

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Continents
  • Contracts
  • Department Of Defense
  • Electrical Engineering
  • Engineering
  • Geographic Regions
  • Governments
  • Information Systems
  • Massachusetts
  • Military Research
  • National Governments
  • North America
  • Notation
  • Transitions

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Parallel and Distributed Computing.
  • Systems Analysis and Design