Roberto Quilez, N. Mitton, M. Amorim, Nicolas Pauvre
{"title":"原型化多根ONS","authors":"Roberto Quilez, N. Mitton, M. Amorim, Nicolas Pauvre","doi":"10.1109/WCNCW.2012.6215481","DOIUrl":null,"url":null,"abstract":"The Object Naming System (ONS) is a central lookup service used in the EPCglobal network for retrieving location information about a specific Electronic Product Code (EPC). This centralized solution lacks scalability and fault tolerance and encounters some political issues. We present the design principles of a fully-distributed multi-root solution for ONS lookup service. In distributed systems, the problem of providing a scalable location service requires a dynamic mechanism to associate identification and location. We design, prototype, and evaluate PRONS, a solution based in a distributed hash table (DHT) for the multi-root problem. We show that PRONS achieves significant performance levels while respecting a number of neutrality requirements.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Prototyping a multi-root ONS\",\"authors\":\"Roberto Quilez, N. Mitton, M. Amorim, Nicolas Pauvre\",\"doi\":\"10.1109/WCNCW.2012.6215481\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Object Naming System (ONS) is a central lookup service used in the EPCglobal network for retrieving location information about a specific Electronic Product Code (EPC). This centralized solution lacks scalability and fault tolerance and encounters some political issues. We present the design principles of a fully-distributed multi-root solution for ONS lookup service. In distributed systems, the problem of providing a scalable location service requires a dynamic mechanism to associate identification and location. We design, prototype, and evaluate PRONS, a solution based in a distributed hash table (DHT) for the multi-root problem. We show that PRONS achieves significant performance levels while respecting a number of neutrality requirements.\",\"PeriodicalId\":392329,\"journal\":{\"name\":\"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNCW.2012.6215481\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2012.6215481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Object Naming System (ONS) is a central lookup service used in the EPCglobal network for retrieving location information about a specific Electronic Product Code (EPC). This centralized solution lacks scalability and fault tolerance and encounters some political issues. We present the design principles of a fully-distributed multi-root solution for ONS lookup service. In distributed systems, the problem of providing a scalable location service requires a dynamic mechanism to associate identification and location. We design, prototype, and evaluate PRONS, a solution based in a distributed hash table (DHT) for the multi-root problem. We show that PRONS achieves significant performance levels while respecting a number of neutrality requirements.