Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

Abstract

We propose a class of algorithms for finding an optimal quasistatic routing in a communication network. The algorithms are based on Gallager's method. Their main feature is that they utilize second derivatives of the objective function and may be viewed as approximations to a constrained version of Newton's method. The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages are of crucial importance for the practical implementation of the algorithm using distributed computation.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1981
Accession Number
ADA097623

Entities

People

  • Dimitri P. Bertsekas
  • Eli M. Gafni
  • Robert G. Gallager

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Advanced Electronics
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Automatic
  • Buildings And Structures
  • Communication Networks
  • Computations
  • Convergence
  • Electronics Laboratories
  • Equations
  • Flow
  • Guarantees
  • Hypervelocity Flow
  • Information Processing
  • Information Systems
  • Loops
  • Military Research
  • Networks
  • Two Dimensional

Readers

  • Computer Networking
  • Operations Research