Analysis of the Auction Approach and the Dual Ascent Approach in Computer Network

Network designs, which are now used in many areas, bring many problems. These problems arise in many applications, including transportation, distribution, communication, computer and energy systems. In such problems, there is some communication density between the selected nodes and this traffic moves along roads with limited capacity. What paths should be used in network design is an important question. Because resources such as bandwidth and power in networks are often limited. There are various decision-making algorithms such as weighted decision making and shortest path tree to divide these resources in a fair way and to be directed to roads. In this study, we use auctions and two climbing algorithms, two of the algorithms made to minimize network costs from decision making mechanisms. Finally, we compare these two algorithms for the same network structure and give us an idea of which can be more efficient.