Distributed Asynchronous Optimal Routing in Data Networks

Abstract

We prove convergence of a distributed gradient projection method for optimal routing in a data communication network. The analysis is carried out without any synchronization assumptions and takes into account the possibility of transients caused by updates in the routing strategy being used.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1984
Accession Number
ADA458791

Entities

People

  • Dimitri P. Bertsekas
  • John N. Tsitsiklis

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computations
  • Computer Communications
  • Computer Programming
  • Computers
  • Convergence
  • Dynamic Programming
  • Electrical Engineering
  • Equations
  • Flow
  • Hypervelocity Flow
  • Inequalities
  • Mathematical Programming
  • Measurement
  • Networks
  • Optimization

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Science.
  • Plasma Physics.