An Optimal Control Approach to Dynamic Routing in Networks. Part II. A Maximal Flow Approach,

Abstract

This paper presents a new approach for building the feedback solution for the minimum delay dynamic message routing problem for single destination networks. The necessary and sufficient conditions for optimality derived in previous works are interpreted in terms of weighted maximal flow problems. Several properties concerning these problems are obtained and used to develop a simplified algorithm for building the feedback space. The various steps of the algorithm are presented and motivated in detail. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1981
Accession Number
ADA101609

Entities

People

  • Adrian Segall
  • Mario Jodorkovsky

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Automatic
  • Boundaries
  • Computational Complexity
  • Department Of Defense
  • Dynamic Programming
  • Electrical Engineering
  • Engineering
  • Equations
  • Feedback
  • Information Systems
  • Linear Programming
  • Military Research
  • Notation
  • Sequences
  • Three Dimensional
  • Trajectories

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • Space
  • Space - Spacecraft Maneuvers