The Capacity and Non-Simultaneously Multicommodity Flow Problem in Wide Area Network and Data Flow Management
Abdulhakim F. Zantuti · 2006
The paper presents a formulation of the capacity and non-simultaneously multicommodity flow assignment problem in a wide area computer network and dataflow management. The problem consists of selection of non-simultaneously multicommodity flow routes and channel capacities in order to minimize the average delay per packet subject to a budget constraint.