DocumentCode
2732273
Title
Algorithms for Capacities and Flow Assignment Problem in Computer Networks
Author
Zantuti, Abdulhakim F.
fYear
2008
fDate
19-21 Aug. 2008
Firstpage
315
Lastpage
318
Abstract
The paper presents the algorithms for capacities and flow assignment problem in computer networks, the problem consists in traffic flow routers and channel capacities to minimize the average delay in computer networks, the capacities are given and the flow of traffic must be adjusted in an optimal way, we there fore expect that it may be necessary to provide more than one path for the traffic from source to the destination.
Keywords
channel allocation; computer networks; telecommunication network routing; telecommunication traffic; channel capacities; computer networks; flow assignment problem; traffic flow routers; Channel capacity; Communication networks; Communication switching; Computer networks; Data communication; Joining processes; Packet switching; Routing; Systems engineering and theory; Telecommunication traffic; Algorithms; Computer Networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems Engineering, 2008. ICSENG '08. 19th International Conference on
Conference_Location
Las Vegas, NV
Print_ISBN
978-0-7695-3331-5
Type
conf
DOI
10.1109/ICSEng.2008.24
Filename
4616656
Link To Document