On the Optimality of Semidynamic Routing Schemes.

Abstract

Semidynamic routing schemes perform better than stochastic schemes. Recently some semidynamic schemes based on the best stochastic schemes have been studied. In this paper, using a simple example, we show that devising semidynamic schemes from stochastic rules may not yield the best performance. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1980
Accession Number
ADA099976

Entities

People

  • Ashok Agrawala
  • Satish K. Tripathi

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Communication Networks
  • Computations
  • Computer Networks
  • Computer Science
  • Computers
  • Hierarchies
  • Maryland
  • Mathematics
  • Networks
  • Sequences
  • Universities

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Aviation Safety and Air Traffic Management
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Mathematical Modeling and Probability Theory.