Academic literature on the topic 'Ford-Fulkerson algorithm'

Due to the demands of new technologies such as social networks, e-commerce and cloud computing, more energy is being consumed in order to store all the produced data. While these new technologies require high levels of availability, a reduction in the cost and environmental impact is also expected. The present paper proposes a power balancing algorithm (power load distribution algorithm-depth (PLDA-D)) to optimize the energy distribution of data center electrical infrastructures. The PLDA-D is based on the Bellman and Ford–Fulkerson flow algorithms that analyze energy-flow models (EFM). EFM computes the power efficiency, sustainability and cost metrics of data center infrastructures. To demonstrate the applicability of the proposed strategy, we present a case study that analyzes four power infrastructures. The results obtained show about a 3.8% reduction in sustainability impact and operational costs.

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.

An effort is made to develop a computer programme using C++ to explain the working of a adjacency linked-list representation of a directed graph or digraph and explain the allocation of data using C++. The program uses the concept of arranging a graph in the form of a linked list for the computer to understand the graphical form representation of any data. The graph algorithms are a significant field of interest within computer science. Typical higher level operations associated with graphs are; finding a path between two nodes, like depth-first search and breadth-first search and finding the shortest path from one node to another, like Dijkstra's algorithm. A solution to finding the shortest path from each node to every other node also exists in the form of the Floyd-Warshall algorithm. A directed graph can be seen as a flow network, where each edge has a capacity and each edge receives a flow. The Ford-Fulkerson algorithm is used to find out the maximum flow from a source to a sink in a graph. Conversion of a graph into a computer storable digital data is useful for nanodevices.