首页> 外文期刊>International journal of computer science and network security >An Autonomic Distributed Algorithm for Forming Balanced Binary Trees of Nodes in a Structured P2P System in a Multicast-enabled Environment
【24h】

An Autonomic Distributed Algorithm for Forming Balanced Binary Trees of Nodes in a Structured P2P System in a Multicast-enabled Environment

机译:在支持组播的结构化P2P系统中形成节点平衡二叉树的自主分布式算法

获取原文
获取原文并翻译 | 示例
           

摘要

This paper describes an autonomic distributed algorithm which can be used to structure a group of nodes connected by TCP into a balanced binary tree, and an experimental structured P2P system which adopts this algorithm. This algorithm can be applied when nodes can be connected directly each other by TCP/IP, and IP multicast-able. When N nodes join group simultaneously, it takes O((log N)2) time for all nodes to become members of the group, provided some conditions are satisfied. When a node in the group fails, the tree will be rebalanced by restarting the algorithm at the children of the failed node.
机译:本文介绍了一种可用于将TCP连接的节点组构造成平衡二叉树的自主分布式算法,以及一种采用该算法的实验性结构化P2P系统。当节点可以通过TCP / IP直接相互连接并且可以进行IP多播时,可以应用此算法。当N个节点同时加入组时,只要满足某些条件,所有节点都将花费O((log N)2)时间成为该组的成员。当组中的某个节点发生故障时,将通过在发生故障的节点的子节点处重新启动算法来重新平衡树。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号