Chord协议的正确性

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI:10.1109/IIKI.2016.65

Bojan Marinkovic, Z. Ognjanovic, Paola Glavan, A. Umek

{"title":"Chord协议的正确性","authors":"Bojan Marinkovic, Z. Ognjanovic, Paola Glavan, A. Umek","doi":"10.1109/IIKI.2016.65","DOIUrl":null,"url":null,"abstract":"The Chord protocol is one of the first, simplest and most popular overlay protocol. This paper describes the Chord protocol using the logic of time and knowledge. The formalization concerns Chord actions that maintain ring topology. We consider the case when the nodes are not allowed to fail or leave and prove the correctness with respect to it.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Correctness of the Chord Protocol\",\"authors\":\"Bojan Marinkovic, Z. Ognjanovic, Paola Glavan, A. Umek\",\"doi\":\"10.1109/IIKI.2016.65\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Chord protocol is one of the first, simplest and most popular overlay protocol. This paper describes the Chord protocol using the logic of time and knowledge. The formalization concerns Chord actions that maintain ring topology. We consider the case when the nodes are not allowed to fail or leave and prove the correctness with respect to it.\",\"PeriodicalId\":371106,\"journal\":{\"name\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIKI.2016.65\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIKI.2016.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

Chord协议是最早、最简单、最流行的覆盖协议之一。本文用时间逻辑和知识逻辑来描述Chord协议。形式化涉及维护环形拓扑的Chord操作。我们考虑节点不允许故障或离开的情况，并证明其正确性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Correctness of the Chord Protocol

The Chord protocol is one of the first, simplest and most popular overlay protocol. This paper describes the Chord protocol using the logic of time and knowledge. The formalization concerns Chord actions that maintain ring topology. We consider the case when the nodes are not allowed to fail or leave and prove the correctness with respect to it.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

自引率

0.00%

发文量