Dynamic Multicommodity Flow Schedules

Abstract

Some new results in the scheduling of dynamic multicommodity flows in data communication networks are presented. A new performance measure for effective delivery of backlogged data to their destinations is defined and the solution to the resulting delivery problem is obtained through a sequential linear optimization methodology. Properties of an optimal dynamic multicommodity flow schedule are studied in detail, taking advantage where possible of the linear programming formulation. The special case of the delivery problem in a single destination network also is analyzed. Application of the results to stochastic delivery problems in which the data inputs to the network are modelled as Poisson processes is addressed, and a new dynamic data communication network analysis is presented. Finally, the delivery problem on networks with capacitated links and with traversal delays is considered and some new results obtained.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1981
Accession Number
ADA115002

Entities

People

  • Adam Feit

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computational Complexity
  • Computer Programming
  • Computer Science
  • Data Storage Systems
  • Digital Communications
  • Electrical Engineering
  • Engineering
  • Flow Network
  • Linear Programming
  • Mathematical Programming
  • Networks
  • Operations Research
  • Optimization
  • Scheduling (Production)
  • Systems Engineering

Readers

  • Computer Networking
  • Operations Research