Some Issues in Distributed Asynchronous Routing in Virtual Circuit Data Networks

Abstract

We consider the behavior of distributed asynchronous routing algorithms for optimizing the flows in a virtual circuit data network, with respect to a given convex cost function. The algorithms operate with minimal synchronization of computations and information exchange between different processors and consist of gradient projection iterations which compute a target set of flows for each path. Then, the processors try to make the actual flows equal to the target flows, by appropriately assigning paths to incoming, new virtual circuits. We concentrate on the "many small users" case, in which there is (on the average) a very large number of virtual circuits, each one requiring a small communication rate. This note is a follow-up to our earlier paper and addresses the limiting behavior when the frequency of iteration becomes infinite relative to the frequency of information exchange between nodes.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1986
Accession Number
ADA459631

Entities

People

  • Dimitri P. Bertsekas
  • John N. Tsitsiklis
  • Wei K. Tsai

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Computer Science
  • Demographic Cohorts
  • Differential Equations
  • Electrical Engineering
  • Engineering
  • Extinction
  • Frequency
  • Inequalities
  • Information Exchange
  • Information Theory
  • Intervals
  • Probability
  • Random Variables
  • Time Intervals

Fields of Study

  • Computer science

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Calculus or Mathematical Analysis
  • Integrated Circuit Design and Technology.