Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach

— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior of providers on a specific scenario mainly by considering the simple but not simplistic case of one source and one destination. The analysis of the centralized transit price negotiation problem shows that the only one non cooperative equilibrium is when the lowest cost provider takes all the market. The perspective of the game being repeated make cooperation possible while maintaining higher prices. We consider then the system under a distributed framework. Indeed, in reality the nodes have only a local view of the game including the topology and thus the nature and the length of the possible routes. We simulate the behavior of the distributed system under a simple price adjustment strategy and analyze whether it matches the theoretical results.

• Type: Conference
• Year: 2007
• Where: NETCOOP
• Authors: Dominique Barth, Johanne Cohen, Loubna Echabbi, Chahinez Hamlaoui
• Keywords: Computer Networks, Interdomain Routing Framework, NETCOOP 2007, Price Negotiation Problem, Transit Price Negotiation