P2P网络两级混合路由算法

为了提高纯分布式P2P网络的路由效率,减少因为节点频繁的加入和退出而产生的网络不稳定性,提出一种两级混合路由算法,该算法结合了非结构化Flooding路由算法和结构化的Pastry路由算法的优点,将整个网络分为两级,即虚节点网络和子节点网络,分别采用不同的路由算法,实验证明该路由算法能减少路由过程的中心热点效应和不稳定性,有效提高路由效率.     

无线Mesh网络路由协议研究

无线网状网络(WMN)的路由算法是Mesh领域的研究重点,采用何种路由协议使无线Mesh网络在需要的环境中性能达到最优,是目前WMN路由协议应用的实际问题.文中提出了设计无线网状网路由协议时需具备的特点,对目前提出WMN路由协议进行了分析研究,并比较了WMN路由协议优缺点,对WMN路由协议的选择提供了依据.     

基于元胞自动机的无线传感器网节能路由协议

节能是设计无线传感器网路由协议首先要解决的问题.针对无线传感器网拓扑演化过程所呈现的时空动力学特性,基于源自生物学的元胞自动机理论,提出无线传感器网节能路由协议(AODV-ECA).仿真结果及分析表明,该算法能有效减少传感节点能量消耗,延长无线传感器网生存时间.     

BPDSR:基于Chord算法的MANET双向路由模型

为提高移动自组织网络(mobile ad hoc network,MANET)路由查询效率,通过对P2P(peer-to-peer)网络与MANET的交叉研究,在DSR协议基础上引入Chord算法,提出双向路由模型BPDSR.BPDSR双向路由发现算法和路由资源共享算法,降低了查询复杂度,减少了路由失效和绕路问题.通过BPDSR算法性能分析和NS--2仿真实验表明,BPDSR路由模型的路由效率明显提高.     

OMNeT++环境下TopDisc路由协议仿真实现

嵌入式计算机技术、通信技术、传感器技术和自动控制技术的迅速发展,使得无线传感器网络可以应用在航空、汽车、化工、制造、运输、基础建设、能源、医疗卫生、娱乐和消费类设备装置上。文中选择了C++为开发语言,OMNeT++软件为仿真平台对网络层路由协议进行分析探讨和仿真。使用OMNeT++软件提供的物理协议加上程序实现的C++路由协议方法,仿真实现了TopDisc路由协议,为传感网路由协议实现提供了很好的借鉴。早期成簇算法中的经典算法之一的TopDisc算法,对其进行优化,并最终对仿真结果进行分析。     

基于移动自组织网络中RIP路由算法的改进

针对移动Ad Hoc网络中的点到点路由问题提出了一种路由算法--RRIP.该路由算法是对传统的RIP路由信息协议的一种改进,采用路由冗余技术,并对协议工作过程作出一些修改,算法使得传统的RIP协议能适用在网络拓扑结构频繁变化的移动Ad Hoc网络中.描述了RRIP算法的设计思想和主要内容,并进行了性能分析.     

基于路径属性变化检测路由通告不一致的算法

因特网服务提供商(ISP,Internet service provider)为了给客户提供更好的服务,经常和其他ISP协商建立一种"对等"关系,它们互相免费为对方的客户提供内部访问或过境服务.这就要求两个建立"对等"关系的ISP必须在所有的对等点上有一致的路由通告,由于路由策略的影响会引起多个对等点的路由通告被改变,所以保持这种一致性是非常困难的.对不一致的路由通告的检测进行了研究,提出了一种记录路径属性变化的方法,并进一步给出了通过路径属性变化的记录及AS的边界路由器中的路由表和配置数据检测路由不一致的算法,通过模拟仿真实验发现算法非常有效和易于实现.     

无线 Mesh 网络中多路径路由算法的研究

针对无线 Mesh 网络中传统单径路由协议的不足,提出一种基于动态源路由协议(DSR)的多路径路由算法(IDSR).该算法通过在路由发现过程引入带宽和最大转发次数等限制条件,保证了多条路由请求信息的获取;通过在节点不相交的多径选择过程中引入多 QoS 路由代价函数,有效地实现多路径的选择;通过提供多 QoS 保障,使算法具有较高的求解效率,避免了单径路由的不稳定等特点.实验结果表明,IDSR 算法在无线 Mesh 网络的路由中具有更好的 QoS 性能.     

基于WiFi的自组织网络路由协议算法研究

以基于WiFi的自组织网络为应用背景,本文利用仿真平台OPNET对四种经典自组网路由协议的性能进行了仿真比较。实验结果表明,反应式路由协议的性能总体优于先应式路由算法,而AODV协议由于其备份路由的特性,性能更优。为满足战场环境下车载自组织网的大规模组网要求,以及火控数据的时延传输要求,结合AODV算法的优势,本文提出了一种新的分层自组网路由算法CRP,其分簇结构的设计减少了网络拓扑变化对寻由过程的影响和路由发现过程中的洪泛开销,加速了路由的查找过程,仿真结果显示该算法的综合性能优于AODV算法及经典分簇路由协议ZRP算法,端到端传输时延明显减小。     

一种结构化P2P协议中的负载均衡方法

提出一种适合于路由表大小为O(logN) 的结构化P2P协议的负载均衡方法,该方法采用负载感知的被动式路由表维护算法和路由算法提高轻载结点作为路由中继结点的概率,并通过一种缓存机制来降低承载热点文件的结点的请求负载.实验结果表明,在用户查询服从Zipf分布的环境下,该负载均衡方法可使系统达到较好的负载均衡.     

移动自组网中基于声誉机制的安全路由协议设计与分析

移动自组网是一种有特殊用途的对等式网络,具有无中心、自组织、可快速展开、可移动等特点,这些特点使得它在战场、救灾等特殊场合的应用日渐受到人们的重视.由于在移动自组网络中每节点既是主机又是路由器,所以容易遭受基于路由信息的攻击,而现今的路由协议基本没有考虑到该问题.本文在分析移动自组网络安全特性的基础上,综述了该方面的研究工作,建立了基于声誉机制评价体系,并给出了具体的评价方法和计算模型.在此基础上,提出了基于声誉机制的安全路由协议S-DSR.仿真结果表明在存在攻击节点的情况下S-DSR协议比DSR协议具有更好的包传输率、包丢失率等属性.     

BALLS: A structured peer-to-peer system with integrated load balancing

Load balancing is an important problem for structured peer-to-peer systems. We are particularly interested in the consumption of network bandwidth for routing traffic and in the usage of computer resources for object storage. In this paper, we investigate the possibility to simultaneously balance these two types of load. We present a structured peer-to-peer overlay that efficiently performs such simultaneous load balancing. The overlay is constructed by partitioning the nodes of a de Bruijn graph and by allocating the partitions to the peers. Peers balance network bandwidth consumption by repartitioning the nodes. Balancing of computer resources for storage is enabled by dissociating the actual storage location of an object from the location of its search key. The paper presents and analyzes the protocols required to maintain the overlay structure and perform load balancing. We demonstrate their efficiency by simulation. We also compare our proposed overlay network with other approaches.     

AODV带宽估计和链路稳定度的QoS扩展研究

在AVAODV协议的基础上增加带宽估计选项,提出了一种基于带宽估计和链路稳定度的QVAODV路由协议。QVAODV协议在路径寻找的过程中,通过带宽估计和链路稳定度的计算,从众多备选路径中选择出一条满足带宽需求和链路稳定度最好的路径来提供QoS保证。仿真实验结果表明,在相同实验条件下QVAODV协议在数据丢包率、平均端到端分组时延和平均路由开销性能方面与AVAODV协议相比均有提高。     

Lord of the Links: A Framework for Discovering Missing Links in the Internet Topology

The topology of the Internet at the autonomous system (AS) level is not yet fully discovered despite significant research activity. The community still does not know how many links are missing, where these links are and finally, whether the missing links will change our conceptual model of the Internet topology. An accurate and complete model of the topology would be important for protocol design, performance evaluation and analyses. The goal of our work is to develop methodologies and tools to identify and validate such missing links between ASes. In this work, we develop several methods and identify a significant number of missing links, particularly of the peer-to-peer type. Interestingly, most of the missing AS links that we find exist as peer-to-peer links at the Internet exchange points (IXPs). First, in more detail, we provide a large-scale comprehensive synthesis of the available sources of information. We cross-validate and compare BGP routing tables, Internet routing registries, and traceroute data, while we extract significant new information from the less-studied Internet exchange points (IXPs). We identify 40% more edges and approximately 300% more peer-to-peer edges compared to commonly used data sets. All of these edges have been verified by either BGP tables or traceroute. Second, we identify properties of the new edges and quantify their effects on important topological properties. Given the new peer-to-peer edges, we find that for some ASes more than 50% of their paths stop going through their ISPs assuming policy-aware routing. A surprising observation is that the degree of an AS may be a poor indicator of which ASes it will peer with.     

基于对等网络的分布式存储系统的设计与实现

在基于节点分级的对等网络路由定位算法SP_Route的基础上实现一个分布式存储系统。通过采用可扩展的体系结构、稳定的通信协议、通信机制,简明的文件的组织和节点构造方式,在物理网络上叠加一个P2P网络层。将各个节点贡献的物理上分布的存储资源连接成对用户透明的文件存储系统。该系统能快速地搜索文件和进行路由定位,能为用户提供较稳定的存储服务。     

Scalable peer-to-peer resource discovering scheme for wireless self-organized networks

Peer-to-peer technologies have attracted increasing research attention with fruitful protocols and applications proposed for wired networks. As to mobile environments, there are currently no mature deployments. A novel resource managing and discovering protocol, Cheer, is proposed to realize scalable and effective peer-to-peer lookup in wireless self-organized networks. Cheer resolves the topologies mismatch problem between peer-to-peer overlay networks and actual nodes distribution, allowing for frequent nodes membership changes. With specially designed resource storage table, Cheer also supports multikey and fuzzy lookup. Its hybrid architecture and improved routing scheme based on small-world theory may realize effective lookup routing. Theoretical analysis and simulation results both prove that Cheer makes using peer-to-peer applications in large-scale self-organized mobile networks feasible and promising.     

典型航空自组网路由协议仿真与性能评估

航空自组网是自组网在航空领域的典型应用.航空自组网的关键技术在于路由协议的选取和设计.基于场景用NS2软件仿真研究了3种适用于航空自组网的路由协议及其网络性能,并定义了4个性能评估准则.仿真结果表明,单跳距离一定时,3种路由协议的网络性能随着节点密度的增加而总体变差.同等条件下,AODV路由协议路由开销高于DSVD和GRID路由协议,端到端平均延时低于DSVD和GRID路由协议,而GRID协议分组投递率和平均跳数保持最高.     

基于泛搜索路由协议的AdHoc网络设计与实现

在AdHoc网络技术的工程实现中,路由协议的选择以及硬件无线通信系统设计是要解决的两个关键环节。本文针对节点之间无等级结构的AdHoc网络,基于一种泛搜索路由协议进行AdHoc网络系统设计和实现。硬件通信设备采用单片机C8051F920控制无线数传模块的方案进行设计,按照搜索路由协议对单片机编写程序,继而组建AdHoc网络系统。通过对网络测试所得的数据结果进行分析,表明该路由协议能适应网路拓扑结构变化,准确地找到一条适合传输的路由,所设计通信系统满足AdHoc网络的基本特征。     

Building Heterogeneous Peer-to-Peer Networks: Protocol and Analysis

In this paper, we propose a simple protocol for building heterogeneous unstructured peer-to-peer (P2P) networks. The protocol consists of two parts-the joining process and the rebuilding process. The basic idea for the joining process is to use a random walk to assist new incoming peers in selecting their suitable neighbors in terms of capacity and connectivity to achieve load-balancing. The rebuilding process specifies how the nodes should react when they lose links. In particular, we examine two representative schemes, namely the probabilistic-rebuilding scheme and the adaptive-rebuilding scheme. Furthermore, we provide a detailed analysis to investigate our proposed protocol under any heterogenous P2P environment. We prove that the topology structure of the P2P network depends heavily on the node heterogeneity. The analytical results are validated by the simulations. Our framework provides a guideline to engineer and optimize a P2P network in different respects under a heterogeneous environment. The ultimate goal of this paper is to stimulate further research to explore the fundamental issues in heterogeneous P2P networks.     

HICUS：A QUASI-STRUCTURED P2P SYSTEM BASED ON HIERARCHICAL INTEREST

The key problem in unstructured P2P system is how to control "Flood".Some studies focus on constructing more efficient topology while others focus on better query algorithms.This paper presents HICUS(Hierarchical Interest-driven Community-based Unstructured System) motivated by a basic thought—whether the resources correlate with topology distinguishes structured and unstruc-tured P2P essentially.By introducing hierarchical "interest",HICUS organizes a quasi-structured topology through a pure distributed wa...