DocumentCode
2829887
Title
The capacity and non-simultaneously multicommodity flow problem in wide area network and data flow management
Author
Zantuti, Abdulhakim F.
Author_Institution
Res. Center of Informatics, National Bur. for R&D, Tripoli, Libya
fYear
2005
fDate
16-18 Aug. 2005
Firstpage
76
Lastpage
80
Abstract
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.
Keywords
channel capacity; delays; matrix algebra; telecommunication network routing; wide area networks; data flow management; flow assignment problem; multicommodity flow channel capacity; multicommodity flow route; nonsimultaneously multicommodity flow problem; wide area network; Channel capacity; Communication networks; Computer network management; Computer networks; Delay; Intelligent networks; Network topology; Research and development management; Telecommunication traffic; Wide area networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems Engineering, 2005. ICSEng 2005. 18th International Conference on
Print_ISBN
0-7695-2359-5
Type
conf
DOI
10.1109/ICSENG.2005.81
Filename
1562832
Link To Document