By Topic

Algorithms for Capacities and Flow Assignment Problem in Computer Networks

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)

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.

Published in:

Systems Engineering, 2008. ICSENG '08. 19th International Conference on

Date of Conference:

19-21 Aug. 2008