An efficient hypercube labeling schema for dynamic Peer-to-Peer networks

详细信息    查看全文

• 作者：Andi Toce<sup>asup><sup> ; sup><sup>atoce@lagcc.cuny.edusup>Author Vitae ; Abbe Mowshowitz<sup>bsup>Author Vitae ; Akira Kawaguchi<sup>bsup>Author Vitae ; Paul Stone<sup>csup>Author Vitae ; Patrick Dantressangle<sup>csup>Author Vitae ; Graham Bent<sup>csup>Author Vitae
• 关键词：P2P networks ; Hypercube networks ; Structured overlays ; Distributed algorithms
• 刊名：Journal of Parallel and Distributed Computing
• 出版年：2017
• 出版时间：April 2017
• 年：2017
• 卷：102
• 期：Complete
• 页码：186-198
• 全文大小：2182 K
• 卷排序：102

文摘

We assign labels to each node in a P2P network to facilitate and improve communication. Labels create a virtual hypercube overlay. Known hypercube algorithms are adopted in this environment. Theoretical and experimental findings prove the feasibility and efficiency of this approach.