An Incentive Compatible Mechanism for Lowest-Cost Routing

Routing incentives are the basis for Internet service providers (ISP) to provide efficient, stable, and lasting routing services. Aiming at the least-cost routing model in the User-customized Multipath Inter-domain Routing (UMIR) network, this paper studies and proposes the least-cost routing mechanism (LCRM) that is compatible with incentives from the perspective of mechanism design. The mechanism is mainly composed of two parts:Routing rules are implemented using the least-cost routing algorithm; Payment rules adopt self-developed payment algorithm; Both theory and practice show that LCMP is a trusted mechanism, and it can motivate participants to adopt the “tell the truth” strategy in the inter-domain routing process based on the LCRM mechanism, and it has a low “overpayment”.

[1]  Aditya Akella,et al.  Cooperative Interdomain Traffic Engineering Using Nash Bargaining and Decomposition , 2007, IEEE/ACM Transactions on Networking.

[2]  Lei Gao,et al.  Multipath interdomain routing via deviation from primary path , 2012, The International Conference on Information Network 2012.

[3]  Subhash Suri,et al.  Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[4]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[5]  Anees Shaikh,et al.  On the Performance Benefits of Multihoming Route Control , 2008, IEEE/ACM Transactions on Networking.

[6]  Wei Zhang,et al.  AMIR: Another Multipath Interdomain Routing , 2012, 2012 IEEE 26th International Conference on Advanced Information Networking and Applications.

[7]  Michael Afergan,et al.  Using Repeated Games to Design Incentive-Based Routing Systems , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  Scott O. Bradner,et al.  The (un)Economic Internet? , 2007, IEEE Internet Computing.

[9]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.