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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
