Climate Change Data Portal
| DOI | 10.1007/978-3-030-02683-7_43 |
| An Incentive Compatible Mechanism for Lowest-Cost Routing | |
| Qin, Donghong; Lv, Ting; Yang, Jiahai; Ge, Lina; Lu, Zhenkun | |
| 发表日期 | 2019 |
| ISSN | 2194-5357 |
| 起始页码 | 608 |
| 结束页码 | 622 |
| 卷号 | 881 |
| 英文摘要 | 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. |
| 英文关键词 | UMIR; Routing incentive; Mechanism design; LCRM |
| WOS研究方向 | Computer Science |
| WOS类目 | Computer Science, Artificial Intelligence |
| 来源期刊 | PROCEEDINGS OF THE FUTURE TECHNOLOGIES CONFERENCE (FTC) 2018, VOL 2
![]() |
| 文献类型 | 期刊论文 |
| 条目标识符 | http://gcip.llas.ac.cn/handle/2XKMVOVA/158809 |
| 作者单位 | Qin, DH (corresponding author), Guangxi Univ Nationalities, Sch Informat Sci & Engn, Nanning, Peoples R China. |
| 推荐引用方式 GB/T 7714 | Qin, Donghong,Lv, Ting,Yang, Jiahai,et al. An Incentive Compatible Mechanism for Lowest-Cost Routing[J],2019,881. |
| APA | Qin, Donghong,Lv, Ting,Yang, Jiahai,Ge, Lina,&Lu, Zhenkun.(2019).An Incentive Compatible Mechanism for Lowest-Cost Routing.PROCEEDINGS OF THE FUTURE TECHNOLOGIES CONFERENCE (FTC) 2018, VOL 2,881. |
| MLA | Qin, Donghong,et al."An Incentive Compatible Mechanism for Lowest-Cost Routing".PROCEEDINGS OF THE FUTURE TECHNOLOGIES CONFERENCE (FTC) 2018, VOL 2 881(2019). |
| 条目包含的文件 | 条目无相关文件。 | |||||
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。