We consider the problem of cooperative distributed routing optimization in multi-domain/multi-provider networks. The main object of our investigation are ASON/G-MPLS transport networks, still the results of our investigations could be extended to any multi-domain network where particular domains have limited mutual visibility of intra-domain resources. This paper refines a distributed decomposition mechanism for reliable cooperative optimization of flow reservation levels introduced in [1], by considering the fundamental issue of fair income distribution. The proposed idea of fair income distribution mechanism has been adopted from the theory of cooperative games (Shapley value). We show the benefits of adopting the proposed income distribution scheme by numerical simulations.
展开▼
