Accession Number:

ADA101609

Title:

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

Descriptive Note:

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS

Personal Author(s):

• Jodorkovsky,Mario
• Segall,Adrian

Report Date:

1981-06-01

Pagination or Media Count:

27.0

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

Descriptors:

• *COMMUNICATIONS NETWORKS
• *ROUTING
• *CONTROL THEORY
• ALGORITHMS
• OPTIMIZATION
• DATA TRANSMISSION SYSTEMS
• MATRICES(MATHEMATICS)
• LINEAR PROGRAMMING
• NUMERICAL ANALYSIS
• NODES
• FEEDBACK
• DYNAMIC PROGRAMMING
• MESSAGE PROCESSING
• NETWORK FLOWS
• SWITCHING CIRCUITS

Subject Categories:

• Theoretical Mathematics
• Non-Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE