Abstract
The article is devoted to finding the optimal network resources distribution in the network represented by anundirected complete connected planar uplifted graph. It is assumed that the weight of the edge of the graph is determined by the minimum bandwidth(traffic) of the router at its nodes. The functional is the sum of the bandwidth (maximal flow) of the routers on all nodes under the restrictions on their total cost. The complexity of the problem lies in the fact that there are two types of uncertainty in it: the first – the type of router in each network node is not initially determined, the second – the path between the nodes on which the maximum traffic is realized is not defined. The first uncertainty is solved by using the Genetic Algorithm and the second uncertainty is solved by using the Ford Fulkerson algorithm. An example of calculation for a fragment of a network of a real Internet Service Provider (ISP) is presentedin this article.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
