基于拓扑简化的自相似网络相关参数分析

本文基于简单串联网络拓扑结构的简化,对拓扑简化后的自相似网络的相关参数(节点缓存、节点排队负载)进行分析.通过分析简化前后的网络的性能(平均排队延迟、平均丢包率),提出简化后网络的节点缓存模型和节点负载模型.模型分析的结果分别说明了简化后的节点缓存大小与简化前节点缓存及负载、网络自相似程度之间的变化关系以及简化后节点负载与简化前节点负载、简化前后节点缓存大小比、网络自相似程度之间的变化关系.     

加权无标度网络的级联失效模型

在加权的无标度网络中,为了抵抗网络的级联失效,增强网络的鲁棒性,提出了一种参数可调的级联失效模型.该模型从全局和局域的角度,将节点介数、节点度、节点权重和邻居节点权重相结合构建节点的初始负载,并建立节点容量与初始负载的比例关系,当节点失效后,通过结合失效节点邻居的容量来制定负载重分配规则,进而通过对网络级联失效的分析,推导负载参数的演化过程,得出模型中的参数对网络鲁棒性的影响.最后,通过实验验证了所提方法的有效性.     

时间同步网的可生存性增强

研究大规模时间同步网的可生存性问题．时间同步网通过各节点的自主配置，拓扑结构不再是静态的、层次型的，而成为动态的网络结构，增强网络的可生存性．提出搜索世界的概念，针对时间同步网络建立了基于搜索世界的BA模型，并对模型进行优化，使时间同步网络的可生存性更高．动态的网络拓扑在部分节点失效以后受影响的节点能够自愈，给出了节点自愈算法，使节点自愈时对网络负载的影响比较小．     

考虑级联失效的复杂负载网络节点重要度评估

首先提出了一个基于负载重分配的复杂负载网络级联失效模型,与现有模型的区别在于:(1)针对每个节点定义了一个“过载函数”;(2)用节点权值演化代替网络拓扑结构的演化.在级联失效模型基础上,提出了考虑级联失效的复杂负载网络节点重要度评估方法,给出了节点重要度的新定义.该方法有助于发现网络中一些潜在的“关键节点”.最后的实验分析验证了该方法的有效性和可行性.     

基于OPNET的AdHoc网络建模与仿真

利用OPNET软件自带的支持IEEE802．11标准的节点模型构建AdHoc网络模型。合理配置输入输出接口的参数,使网络达到最佳性能,并对网络的性能进行比较分析。仿真结果表明,网络参数之间存在关联性,网络最优化参数具有唯一性,通过网络负载与标准负载的比较,可选择出网络性能最优化状态。     

大规模传感器网络随机睡眠调度节能机制

调度冗余节点轮流工作能有效延长网络寿命，然而现有的调度协议需要地理位置信息，引入了额外负载．研究随机睡眠的节点调度机制，给出了4种基于不同信息的随机调度模式并分析比较其性能．结果表明，根据邻居节点信息合理设置节点睡眠概率可以不同程度地减少工作节点个数和保证较高的网络覆盖率。     

DHT网络中一种基于树型结构的负载均衡方案

负载均衡是P2P系统在设计时需要考虑的公平性问题之一,本文针对DHT网络中文件在节点问分布不均匀的问题,提出了一种基于树型结构的负载均衡方案，针对P2P网络中节点的性能差异和相同节点上文件的差异提出对于文件的负载度量准则，并根据此准则对一些热门文件按照树型结构复制方案进行分块复制，该复制方案具有维护简单、扩展性好、负载更分散的特点．仿真结果表明本方案大大改善了网络的性能，有效地进行了负载均衡．     

考虑节点负载的多社团网络级联失效问题研究

为研究多社团网络级联失效问题,设计一种社团规模和结构可调的网络模型.在经典的线性负载-容量模型基础上,提出一种初始负载、容忍负载、临界负载三个阶段节点失效模型.采取蓄意攻击和随机攻击方式对网络进行攻击,通过评估指标的变化分析网络的鲁棒性.仿真结果表明:随机攻击时多社团网络鲁棒,蓄意攻击时多社团网络脆弱;节点初始负载越低...     

双向路径重选的自组网负载均衡路由协议

基于跨层负载感知和双向路径重选的自纽网负载均衡路由协议（CLBLR）在路由发现阶段和路由维护阶段，将整个路径中各节点MAC层的总平均估计时延和路径总业务流负载结合起来，共同作为路由选择和路由调整的重要依据，通过双向路径重选方法实现最优路径选择和网络业务流的均衡分布和均衡传输．协议通过禁止中间节点对路由请求进行应答和阻止不必要的路由请求分组，经由重负载中间节点转发，以保证路由发现时能够利用最新负载信息，并避免了节点在重负载情况下成为新建路由的中间节点，使协议具有一定的拥塞控制功能，以间接的方式实现了请求接纳控制．上述措施使分组传输路由很好地避免了拥塞节点，减少了网络瓶颈对网络性能的影响．仿真表明，CLBLR在分组丢失率、平均端到端时延和路由附加开销等方面具有良好性能，其优良的分布式控制特征能适应自组网的动态环境．     

一类基于速率的PD拥塞控制方法

运用现代控制理论和方法，针对计算机高速互联网中最大努力服务交通流(即能控交通流)的调节问题，提出了一种基于速率的、具有比例加微分(PD)控制器结构的拥塞控制理论和方法。在多个信源节点、单个信终端节点、交通流的模型基础上，运用控制理论中系统稳定性分析方法，讨论如何利用信终端节点缓冲占有量的比例加微分的反馈形式，来调节信源节点的能控交通流(ABR)的输入速率，从而使被控网络节点的缓冲占有量趋于稳定。仿真结果显示，在所设计的PD控制方案下，网络的有关性能较好。     

路网分区的树生长算法*

分析和定义了面向城市交通控制系统交通控制方案制订的路网分区需要解决的问题,设计了动态路网分区概念模型。针对路网交通小区根生节点问题的解决,设计了路网节点重要度判断算法;以根生节点为中心,采用逐层扫描技术对节点交通流作用路径进行搜索,形成路网小区的拓扑结构图。以一个实际城市交通网络为例,利用提出的模型及算法进行分区,结果表明了算法的有效性和可行性。     

短波地空网中一种动态TDMA协议设计与仿真*

针对传统TDMA网络节点间业务量不均匀时,会造成信道资源严重浪费的问题,设计了一种基于邻居时隙调动的短波地空网动态TDMA协议(TDMA protocol based on neighbour timeslot remove,NTR-TDMA),以可靠性较高的地面节点作为控制中心,实现时隙分配可控下的动态利用。提出了邻居时隙调动算法(neighbour timeslot remove algorithm,NTR-ALG),地面节点根据时隙估计过程后生成的节点时隙请求数,调动相邻业务时隙节点间的空闲时隙,重新划分节点业务时隙界限。利用OPNET平台进行性能仿真,并与HFTP协议和TDMA协议作了对比分析。仿真结果表明,NTR-TDMA相比HFTP协议和TDMA协议,在消息投递率、平均时延和吞吐量方面具有更优异的性能。     

Analysis of artificial neural network models for freeway ramp metering control

Traffic along a freeway varies not only with time but also with space. It is thus essential to model dynamic traffic patterns on the freeway in order to derive appropriate metering control strategies. Existing methods cannot fulfill this task effectively. Due to the learning capability, artificial neural network models are developed to simulate typical time series traffic data and then expanded to capture the inherent time–space interrelations. The augmented-type network is proposed that includes several basic modules intelligently affiliated according to traffic characteristics on the freeway. Inputs to neural network models are traffic states in each time period on the freeway segments while outputs correspond to the desired metering rate at each entrance ramp. The simulation outcomes indicate very encouraging achievements when the proposed neural network model is employed to govern the freeway traffic operations. Also discussed are feasible directions for further improvements.     

区域交通信号系统节点分析及优化策略研究

SCOOT、SCATS等区域交通信号控制系统的关键路口通常根据交叉口交通流量、道路联接数等指标来确定,很难保证“蓄意”交通事件下区域网络运行的有效性。鉴于城市交通网络的无标度特性,以路段阻抗为权重将城市交通网络抽象为复杂加权网络,提出以网络凝聚度为指标的加权节点收缩方法,评估交叉口节点的重要性,解决区域交通网络hub点的选择问题,并用实例说明该方法的有效性,进而以SCATS系统为对象提出基于hub点选择的系统优化策略。     

一种改进的源节点位置隐私保护方法

当传感器网络中存在一个全局监听者的情况下,为了保护源节点的位置安全,文中提出了一种周期性发送干扰数据的算法。网络中的节点周期性地发送干扰数据包,将真实数据混淆在其中,攻击者无法判断真实数据的流向,从而保护了源节点的安全。同时,文中提出在每个节点中设立数据门限的思想,当节点中的数据超过一定门限值,将根据一定策略暂缓发送干扰数据,从而防止网络拥塞等状况的出现,同时能平衡网络的流量状况,节省资源带宽。从网络流量分析结果可知,该算法有效地保护了源节点的安全。     

无线传感器网络中一种避免节点拥塞的算法

无线传感器网络节点拥塞导致节点丢弃大量的数据包,这不仅影响了网络服务质量,还浪费了节点宝贵的能量,进而缩短了网络生命周期.提出了一种避免传感器网络节点拥塞的算法.该算法包含了基于发送窗口分配的拥塞避免和基于优先级的数据包调度策略.网络节点首先根据一定策略为上一跳节点分配发送窗口来预防本地发生拥塞,获得发送窗口的上一跳节点每次选择优先级最高的数据包发送以改善网络服务质量.模拟实验表明,提出的算法具有良好的能量有效性,有效地避免了由节点缓冲区溢出造成的网络丢包,同时改善了网络传输的公平性并降低了网络的平均延迟.     

Enhanced Internet security by a distributed traffic control service based on traffic ownership

The frequency and intensity of Internet attacks are rising at an alarming pace. Several technologies and concepts were proposed for fighting distributed denial of service (DDoS) attacks: traceback, pushback, i3, SOS and Mayday. This paper shows that in the case of DDoS reflector attacks they are either ineffective or even counterproductive. We then propose the novel concept of traffic ownership and describe a system that extends control over network traffic by network users to the Internet using adaptive traffic processing devices. We safely delegate partial network management capabilities from network operators to network users. All network packets with a source or destination address “owned” by a network user can now also be controlled within the Internet instead of only at the network user's Internet uplink. By limiting the traffic control features and by restricting the realm of control to the “owner” of the traffic, we can rule out misuse of this system. Applications of our system are manifold: prevention of source address spoofing, DDoS attack mitigation, distributed firewall-like filtering, new ways of collecting traffic statistics, service-level agreement validation, traceback, distributed network debugging, support for forensic analyses and many more. A use case illustrates how our system enables network users to prevent and react to DDoS attacks.     

Strategic Pricing in Next-Hop Routing with Elastic Demands

We consider a model of next-hop routing by self-interested agents. In this model, nodes in a graph (representing ISPs, Autonomous Systems, etc.) make pricing decisions of how much to charge for forwarding traffic from each of their upstream neighbors, and routing decisions of which downstream neighbors to forward traffic to (i.e., choosing the next hop). Traffic originates at a subset of these nodes that derive a utility when the traffic is routed to its destination node; the traffic demand is elastic and the utility derived from it can be different for different source nodes. Our next-hop routing and pricing model is in sharp contrast with the more common source routing and pricing models, in which the source of traffic determines the entire route from source to destination. For our model, we begin by showing sufficient conditions for prices to result in a Nash equilibrium, and in fact give an efficient algorithm to compute a Nash equilibrium which is as good as the centralized optimum, thus proving that the price of stability is 1. When only a single source node exists, then the price of anarchy is 1 as well, as long as some minor assumptions on player behavior is made. The above results hold for arbitrary convex pricing functions, but with the assumption that the utilities derived from getting traffic to its destination are linear. When utilities can be non-linear functions, we show that Nash equilibrium may not exist, even with simple discrete pricing models.     

Performance of ad hoc networks with two-hop relay routing and limited packet lifetime (extended version)

We consider a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing. This type of routing takes advantage of the mobility and the storage capacity of the nodes, called the relay nodes, in order to route packets between a source and a destination. Packets at relay nodes are assumed to have a limited lifetime in the network. Nodes are moving inside a bounded region according to some random mobility model. Closed-form expressions and asymptotic results when the number of nodes is large are provided for the packet delivery delay and for the energy needed to transmit a packet from the source to its destination. We also introduce and evaluate a variant of the two-hop relay protocol that limits the number of generated copies in the network. Our model is validated through simulations for two mobility models (random waypoint and random direction mobility models), and the performance of the two-hop routing and of the epidemic routing protocols are compared.