{"title":"NDN synchronization: iRoundSync, an improved RoundSync","authors":"A. Hindi, M. Kieffer, C. Adjih, C. Weidmann","doi":"10.1145/3125719.3132108","DOIUrl":null,"url":null,"abstract":"The use of Named Data Networking (NDN) for distributed multi-user applications, e.g. group messaging and file sharing, requires NDN synchronization protocols to maintain the same shared dataset (and its updates) among all nodes. ChronoSync [1], RoundSync [2], and PartialSync [3] are some proposals to address this issue, see [4]. Here we focus on the state-of-the-art protocol RoundSync [2]: we study its core features, that permit participating nodes to detect, propagate, and reconcile all changes. Particular attention is given to the case of multiple changes per round. We then propose an improved variant, iRoundSync, that exchanges fewer messages in the multiple-change case and is more resilient to packet losses. We quantify the performance gain of iRoundSync on a simple topology.","PeriodicalId":394653,"journal":{"name":"Proceedings of the 4th ACM Conference on Information-Centric Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th ACM Conference on Information-Centric Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3125719.3132108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The use of Named Data Networking (NDN) for distributed multi-user applications, e.g. group messaging and file sharing, requires NDN synchronization protocols to maintain the same shared dataset (and its updates) among all nodes. ChronoSync [1], RoundSync [2], and PartialSync [3] are some proposals to address this issue, see [4]. Here we focus on the state-of-the-art protocol RoundSync [2]: we study its core features, that permit participating nodes to detect, propagate, and reconcile all changes. Particular attention is given to the case of multiple changes per round. We then propose an improved variant, iRoundSync, that exchanges fewer messages in the multiple-change case and is more resilient to packet losses. We quantify the performance gain of iRoundSync on a simple topology.