By Topic

The capacity and non-simultaneously multicommodity flow problem in wide area network and data flow management

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Zantuti, A.F. ; Res. Center of Informatics, National Bur. for R&D, Tripoli, Libya

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.

Published in:

Systems Engineering, 2005. ICSEng 2005. 18th International Conference on

Date of Conference:

16-18 Aug. 2005