虚拟世界的步行卡德米亚网络

IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI:10.1109/INFCOMW.2009.5072106

Matteo Varvello, C. Diot, E. Biersack

{"title":"虚拟世界的步行卡德米亚网络","authors":"Matteo Varvello, C. Diot, E. Biersack","doi":"10.1109/INFCOMW.2009.5072106","DOIUrl":null,"url":null,"abstract":"In this work, we design and evaluate Walkad, a P2P architecture for the management of range queries in virtual worlds. We design Walkad as an extension of Kademlia, a very popular DHT successfully adopted in eMule. Walkad organizes the Kademlia keyspace in a reverse binary trie, i.e., a tree-based data structure where nodes of each level of the tree are labeled using the Gray Code.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"A Walkable Kademlia Network for Virtual Worlds\",\"authors\":\"Matteo Varvello, C. Diot, E. Biersack\",\"doi\":\"10.1109/INFCOMW.2009.5072106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we design and evaluate Walkad, a P2P architecture for the management of range queries in virtual worlds. We design Walkad as an extension of Kademlia, a very popular DHT successfully adopted in eMule. Walkad organizes the Kademlia keyspace in a reverse binary trie, i.e., a tree-based data structure where nodes of each level of the tree are labeled using the Gray Code.\",\"PeriodicalId\":252414,\"journal\":{\"name\":\"IEEE INFOCOM Workshops 2009\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM Workshops 2009\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2009.5072106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM Workshops 2009","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2009.5072106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 17

摘要

在这项工作中，我们设计并评估了Walkad，一个用于管理虚拟世界中范围查询的P2P架构。我们将Walkad设计为Kademlia的扩展，Kademlia是一个非常受欢迎的DHT，已成功应用于eMule。Walkad将Kademlia键空间组织在一个反向二叉树中，即一个基于树的数据结构，其中树的每个级别的节点使用Gray Code进行标记。

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

查看原文本刊更多论文

A Walkable Kademlia Network for Virtual Worlds

In this work, we design and evaluate Walkad, a P2P architecture for the management of range queries in virtual worlds. We design Walkad as an extension of Kademlia, a very popular DHT successfully adopted in eMule. Walkad organizes the Kademlia keyspace in a reverse binary trie, i.e., a tree-based data structure where nodes of each level of the tree are labeled using the Gray Code.

求助全文

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

来源期刊

IEEE INFOCOM Workshops 2009

自引率

0.00%

发文量