共查询到19条相似文献,搜索用时 62 毫秒
1.
介绍了多种BGP的路由控制工具.在eNSP仿真环境下,设计网络拓扑,部署BGP协议,采用多种路由控制技术,实现BGP路由的精确引入、路由过滤、属性选路等高级路由控制,对配置过程、配置命令进行分析,并给出明确的验证结果.实践证明,仿真实验可以用来指导实物环境下的网络设备配置,有效解决实际网络中BGP协议部署的相关问题. 相似文献
2.
3.
在分析MANET特性及应用需求的基础上,提出了一种移动感知的分区MANET路由协议MAFZP,谚协议基于到最小ID节点的距离形成分区并维护简化的全局网络拓扑,通过巧妙地利用节点的邻接点信息使得蹲由请求的时间开销和通信开销均降为O(2R),该协议还通过移动感知隔离移动异常的节点,可进一步降低路由拦制开销。仿真结果表明,该协议具有路由请求时延低,控制开销少的特点。 相似文献
4.
根据小世界网络高度集聚、特征路径较短的特点,提出了基于小世界模型的结构化对等网络构造。利用拓扑意识的peer聚类,实现了对等网络的拓扑意识特性,使得对等网络中大部分应用层链路限制在底层网络拓扑的局部区域内,从而降低了对等网络的平均路由延时。初步的理论分析和仿真实验证实了该对等网络具备了一定的拓扑意识特性。 相似文献
5.
基于QoS路由每个流动态请求的应用背景,考虑到网络状态的不确定性,为了适当地减少路由计算的频度并快速提高计算效率,提出了采用预计算方法,预先对网络分几个区间,计算满足这几个区间的约束请求的可行路径,然后根据应用请求服务模式,选择合适的转发路由。即将路由问题分成与实际请求无关的可行路径计算和与实际请求相关的路由优化选择两部分。 相似文献
6.
研究宽带卫星网络的拓扑结构和路由策略,设计了一个基于时空的分布式路由算法,其计算复杂性为O(1)。针对卫星移动性进行的仿真结果表明新算法能够有效确定最小时延传播路径。 相似文献
7.
8.
9.
10.
综合考虑结构化协议和非结构化协议的优点,提出了一种基于蚁群的对等网路由协议.分析对等网路由协议的研究现状,对结构化路由协议和非结构化路由协议进行了介绍.对等网路由协议进行了总体设计,给出了对等网路由协议的描述和总体结构图.提出了对等网路由协议算法的数据结构,并对等网路由协议算法进行了详细设计.利用仿真实验对等网路由协议进行了验证,实验结果表明该对等网路由协议是有效的. 相似文献
11.
对等网络Chord搜索路由算法的改进 总被引:1,自引:0,他引:1
张谢华 《微电子学与计算机》2009,26(12)
在对等网络中,如何高效地搜索广泛分布的网络资源一直是研究的重点.基于分布式哈希表(DHT)的资源搜索算法是目前比较流行的算法之一.介绍了其中具有代表性的Chord算法,分析其存在的缺陷,提出了一种聚类超级节点搜索路由的改进算法,继承了Chord算法简单、高效、可靠、负载平衡及开销少的优点,明显提高了搜索查询的效率. 相似文献
12.
Structured peer‐to‐peer systems based on distributed hash table (DHT) have known a great popularity and performance since their appearance. They have experienced multiple improvements to increase the efficiency, like replication mechanism with different used methods and different objectives like increasing data availability or fitting to churn. Besides their benefits, these methods suffer from the excessive generated overhead in maintenance process. On the other side, we have the interest deployment of DHT overlay on mobile ad hoc network, which benefits from the infrastructure‐less architecture, but presents some shortcomings because of the limited bandwidth and energy batteries, what require a reduced overhead. Therefore, the aim of this work is to improve the lookup efficiency of DHT‐based Chord on mobile ad hoc network underlay. For that, we propose a novel replication mechanism based on data structure to determine the replica nodes, while avoiding the excessive generated overhead in maintenance process to cope with the problem of limited energy batteries. To evaluate the proposed method, we present an extensive simulation study that compares the work to another efficient replication method and to mobile basic Chord. The results show the efficiency of our approach in decreasing the lookup path, the maintenance overhead, and the energy consumption. 相似文献
13.
14.
根据small-world的研究发现,在实际的P2P拓扑结构中存在若干度数很高的节点。传统的Chord算法假定关键字的查询请求是随机分布的,没有考虑到节点之间的"短链"效应。提出一种基于Chord在一定程度上逐步找到系统节点的"短链"的方法。该方法根据关键字检索命中率动态调整路由表中记录的排序。仿真实验表明,该算法加快了关键字的查询时间,提高了路由表的查询效率。主要创新点在于针对实际P2P网络中查询请求的分布特性提出一种改进的Chord路由算法,该算法能有效改善系统的查询性能。 相似文献
15.
ZHOU Shi-jie 《中国电子科技》2005,3(2)
By virtue of its great efficiency and graceful architecture, the Client/Server model has been prevalent for more than twenty years, but some disadvantages are also recognized. It is not so suitable for the next generation Internet (NGI), which will provide a high-speed communication platform. Especially, the service bottleneck of Client/Server model will become more and more severe in such high-speed networking environment. Some approaches have been proposed to solve such kind of disadvantages. Among these, distributed computing is considered an important candidate for Client/Server model. 相似文献
16.
针对分布式异构网络信息共享框架问题,提出了基于P2P-SIP的分层信息资源共享覆盖网络模型。该模型从7层开放式系统互联参考(OSI)模型的第5层会话层进行信息资源共享互操作过程建模,具有两层的"去中心化"的结构,采用CHORD环实现信息资源组织和路由,采用扩展的SIP协议实现网络节点维护和信息资源共享过程协商。仿真试验结果表明,该模型能够自适应、自协商地实现信息资源组织、资源发现,能够有效解决传统集中式共享系统带来的单点失效和性能瓶颈等问题。 相似文献
17.
Video data location plays a key role for Peer-to-Peer (P2P) live streaming applications. In this paper, we propose a new one-hop Distributed Hash Table (DHT) lookup framework called Streaming-DHT (SDHT) to provide efficient video data location service. By adopting an enhanced events dissemination mechanism-EDRA+ , the accuracy of routing table at peers can be guaranteed. More importantly, in order to enhance the performance of video data lookup operation without incurring extra overhead, we design a so-called Distributed Index Mapping and Management Mechanism (DIMM) for SDHT. Both analytical modeling and intensive simulation experiments are conducted to demonstrate the effectiveness of SDHT framework. Numerical results show that almost 90% requested video data can be retrieved within one second in SDHT based systems, and SDHT needs only 26% average bandwidth consumption when compared with similar one-hop DHT solutions such as D1HT. This indicates that SDHT framework is an appropriate data lookup solution for time-sensitive network applications such as P2P live streaming. 相似文献
18.
为了加快P2P网络中热点查询的速度,针对Kademlia算法在查询效率和高速缓存策略方面存在的不足,文中采用快表技术和加权设置策略对该算法进行改进,避免了在高刷新频率缓存中查询效率低下的问题,为更高的查询命中率提供了更集中的热点资源.模拟实验证明此改进算法具有更短的查询延时和更少的平均路由跳数. 相似文献
19.
P2P系统在文件共享等领域中得到了广泛的应用,但DHT(distributed hash table)网络无中心、无认证、缺乏节点身份验证机制,使得现有的基于DHT的P2P系统易受到Sybil攻击等外部攻击。提出一种基于社交网络的DHT安全增强机制,将社交网络中节点的信任关系引入DHT网络中提高对Sybil节点的识别能力。以KAD(Kademlia)算法为例进行了实验验证,基于Facebook和Twitter数据集的实验结果表明本文提出的安全机制适用于大规模动态的网络,能够有效防御Sybil攻击。 相似文献