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”.
KeywordsUMIR Routing incentive Mechanism design LCRM
This work was supported by the National Natural Science Foundation of China (No. 61462009, No. 61432009, No. 61561008), the Natural Science Foundation of Guangxi (No. 2014GXNSFAA11 8358), the Prospective Research Project on Future Networks of Jiangsu Future Networks Innovation Institute (No. BY2013095115), the Specialized Research Fund for the Doctoral Program of Higher Education (No. 20130002110058), the National Basic Research Program of China (863 Program) (No. 2015AA015601), and the Guangxi University for Nationalities Science Foundation (No. 2014MDQD017, 2014MDYB031).
- 3.Qin, D., Yang, J., Wang, H.: AMIR: Another Multipath inter-domain routing via deviation from primary path. In: Proceedings of the International Conference on Information Networking, ICOIN, pp. 222–227 (2012)Google Scholar
- 4.Qin, D., Yang, J., Wang, H.: Multipath inter-domain routing. In: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications, AINA, pp. 581–588 (2012)Google Scholar
- 5.Qin, D., Yang, Y.: Research report of Multipath Inter-domain Routing System (UMIRS). http://nmgroup.tsinghua.edu.cn/ (2017)
- 9.Afergan, M.: Using repeated games to design incentive-based routing systems. In: Proceedings of 25th IEEE International Conference on Computer Communications, Barcelona, Spain, pp. 1–13 (2006)Google Scholar
- 10.Hershberger, J., Suri, S.: Vickrey prices and shortest paths: what is an edge worth? In: Proceedings of the 42nd Symposium on the Foundations of Computer Science, Los Alamitos, pp. 129–140 (2001)Google Scholar