Dynamic multicommodity flow schedules
By:  Adam Feit
Publisher: Naval Postgraduate School
Published: 1981
Place of publication: Monterey, California
Language: eng
Number of pages: 258
Description: 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.
Notes: "December 1981".

Dissertation advisor(s): Wozencraft, J. M.

DTIC Descriptors: Communications networks, Data management, Scheduling, Multiple operation, Dynamic response, Timeliness, Minimax technique, Delivery, Delay, Sequences(Mathematics), Linear programming, Transportation, Stochastic processes, Poisson density functions, Theses

Author(s) subject terms:  Dynamic routing, Data communication network, Minimum time problem, Min-Max Criterion, Transportation problem, Linear programming

Issued as Naval Postgraduate School Technical Report (NPS-62-81-039)

Thesis (Ph.D.)--Naval Postgraduate School, 1981.

Includes bibliographical references ( p. 253-255).

Also available online.

Mode of access: World Wide Web.

System requirement: Adobe Acrobat Reader.

Israeli Defense Forces author.