Dynamic multicommodity flow schedules
MetadataShow full item record
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
RightsCopyright is reserved by the Copyright owner
Showing items related by title, author, creator and subject.
Olwell, David; Johnson, Jean; Didoszak, Jarema (2007-10-24);The Navy M&S Office in conjunction with the Defense Acquisition Modeling and Simulation Working Group presented the Naval Postgraduate School with an enormous challenge in 2006: design and deliver an educational program ...
Won, David D. (Monterey, CA; Naval Postgraduate School, 2022-06);The Marine Corps seeks to develop energy-aware unmanned aerial vehicle (UAV) routing for last-mile logistics resupply. UAVs have limited range and time on station to execute their assigned mission. To optimize the delivery ...
Stigmergic Control of Dual Direction Communication Ferry Nodes for Denied Communication Environments Hietpas, Andrew (2018-04-17);All military forces rely on effective communication to gain and maintain tempo on the battlefield. With the proliferation of electronic warfare capabilities, battlefield communication will be increasingly challenged. The ...