首页> 外文会议>International conference on computer and communication engineering >Linear Sure Bootstraper: Self-Stabilizing Nodes For Network Construction
【24h】

Linear Sure Bootstraper: Self-Stabilizing Nodes For Network Construction

机译:Linear Sure Bootstraper:用于网络构建的自稳定节点

获取原文

摘要

An overlay network's efficiency can be improvedby taking advantage of its network structure. However, beforea structured network can be constructed, nodes has to be topologicallysorted. One of the common form of topological sortingis linearization where nodes are arranged in a linear order withrespect to its identifiers. Linearization is not a difficult task,however, to keep nodes in a correct state where transient faultsexist can be daunting. In this paper, we introduce an algorithmto improve the performance of an overlay network by ensuringphysical proximity and the introduction of supernodes (nodesthat are homogeneous to other nodes but remain persistent).We construct a linear network from a random distributionof nodes in a 2-D geographical space and run simulations totest our algorithm. Our experiments shows that our algorithmscales linearly as the number of nodes increases and supernodesreduces the cycle time for linearization.
机译:覆盖网络的效率可以通过利用其网络结构来提高。但是,在构建结构化网络之前,必须对节点进行拓扑排序。拓扑排序的一种常见形式是线性化,其中节点相对于其标识符以线性顺序排列。但是,线性化对于将节点保持在存在瞬态故障可能会令人生畏的正确状态来说并不是一项艰巨的任务。在本文中,我们介绍了一种通过确保物理邻近性和引入超级节点(与其他节点同质但仍保持持久性的节点)来改善覆盖网络性能的算法。我们根据二维中节点的随机分布构造了一个线性网络地理空间并运行模拟以测试我们的算法。我们的实验表明,我们的算法随着节点数量的增加而线性缩放,而超节点则减少了线性化的周期时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号