检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]厦门大学信息科学与技术学院,福建厦门361005 [2]俄罗斯国立包曼技术大学信息与自动化系,俄罗斯莫斯科
出 处:《计算机应用与软件》2009年第3期173-175,216,共4页Computer Applications and Software
摘 要:提出一种基于tree覆盖网络拓扑的可扩展高效应用层组播协议—HFTM(Hierarchical Fibonacci Tree Multicast)。HFTM通过分层和分群的思想将所有组播组成员构造成一个特殊的层次化结构,在进行群划分时,充分考虑了底层网络拓扑特征,尽量避免数据包在代价昂贵的链路上进行传输,从而减少组播延迟。另外,采用一种新颖的基于斐波那契序列的组播算法将群内成员构造成一棵高效的斐波那契组播树,利用此树进行群内组播。实验结果表明底层网络拓扑特点的考虑以及斐波那契组播树的构造使HFTM协议获得更好的组播延迟性能。In this paper, a scalable high efficient protocol based on tree overlay network topology -HFTM (Hierarchical Fibonacci Tree Multicast) is proposed for application layer multicastlt adopts the idea of layering and clustering to construct all muhicast group members into a special hierarchical architecture. During the clustering formation, it fully considers the underlying network topological properties and avoids all possible data packet delivering on costly links to reduce multicast delayln addition, group members are constructed to an efficient Fibonacci muhicast tree utilizing a novel multicast algorithm based on Fibonacci Series, and the tree is used to carry on the intragroup multicast. The simulation shows that the consideration of underlying network topological properties and the construction of Fibonacci muhicast tree improve the delay performance of the novel HFTM nrotocol.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15