Subjective-Cost Policy Routing

We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requirement that all routes to a given destination must be confluent. We show that it is NP-hard to determine whether there is a set of stable routes. We also show that it is NP-hard to find a set of confluent routes that minimizes the total subjective cost; it is hard even to approximate minimum cost closely. These hardness results hold even for very restricted classes of subjective costs. We then consider a model in which the subjective costs are based on the relative importance nodes place on a small number of objective cost measures. We show that a small number of confluent routing trees is sufficient for each node to have a route that nearly minimizes its subjective cost. We show that this scheme is trivially strategyproof and that it can be computed easily with a distributed algorithm. Furthermore, we pr...

• Type: Conference
• Year: 2005
• Where: WINE
• Authors: Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami
• Keywords: Economy, Subjective Cost, Subjective Cost Assessments, Total Subjective Cost, WINE 2005