区分服务网络的一种基于聚集状态的动态资源管理方案

提出了一种适用于区分服务网络的确保服务的动态资源提供方案:基于聚集状态的分布式动态资源管理。该方案在网络节点基于聚集状态进行接纳控制和动态资源预留,不需要核心节点保存单个流的状态,因此,该方案是可扩展的。方案包括一种轻量级动态资源预留协议和网络节点动态资源管理的相关算法,如状态建立、管理和接纳控制决策算法。该方案中,网络节点聚集状态的建立使用了基于实时流量测量的方法,在提供服务质量(QualityofService,QoS)保证的同时,得到了统计复用的增益,提高了资源的利用率,简化了信令协议,也使该方案具有很好的健壮性。     

区分服务网络基于测量的接纳控制方案的设计与应用

提出了一种分布式可扩展的接纳控制方案，其目的是为区分服务网络提供端到端服务质量（Quality of Services,QoS)保证，该方案主要由以下部分构成：（1）连接接纳控制协议，主要负责主机和网络节点以及网络节点和带宽代理之间的信息传送，实现对连接请求的串行操作；（2）位于网络核心节点的可用带宽估计算法；（3）位于网络边缘节点的接纳控制算法；给出了该方案在视频传输方面的应用实例；利用多种网络拓扑结构和QoS指标评价该方案的性能，实验结果表明该方案能准确地控制可接纳区域和提高网络资源的利用率。     

层次型WSN中基于博弈论的能耗优化与接纳控制机制

针对层次型无线传感器网络中簇首节点的能量受限问题,提出了一种基于非合作博弈模型的节点接纳控制机制。该机制依据簇首节点的效用函数,引入定价因子,优化了簇首数目和功率水平,并得到簇首发射功率的纳什均衡。仿真实验模拟该博弈的均衡过程,将簇首节点设为非合作博弈的参与者,对各簇首节点发射功率的决策过程进行验证。     

基于信任和服务预测的无线接入服务博弈控制方案

自私的移动节点不仅不会无偿为其他节点转发分组,而且有多占系统资源的动机.为此,提出了一种移动节点与无线接入点之间的接入服务博弈控制方案.方案基于已有移动节点的行为信任等级、请求服务所需的资源要求,预测其未来一定属性组合条件下各个信任和请求服务等级的概率,并结合博弈分析给出了无线接入点接纳移动节点的概率和接纳控制的决策条件.一旦收到某移动节点的接入服务请求,并根据接纳概率,若无线接入点决定处理它,则基于贝叶斯网络模型预测其信任和请求服务等级的未来值.基于预测值、接纳概率、移动节点的欺骗概率,无线接入点判断是否响应其接入服务请求.应用示例与仿真分析表明,方案对移动节点具有良好的激励作用和较强的服务响应能力,而且博弈消息代价比现有相关方案小.     

一种改进的基于探测的接纳控制机制

接纳控制作为一种预防性的流量控制手段是实现网络服务质量（QoS）保障的重要手段。本文在研究基于测量的接纳控制技术原理的基础上，着重分析了基于探测的接纳控制方法存在的问题，并对其中的“链路带宽重复评测”问题的解决方法进行了改进，提出了基于资源预留标签探测机制并给出了探测流程，最后通过仿真验证了该探测机制的有效性。     

传染病在多层星型耦合网络上的资源控制

针对已有传染病传播模型没有考虑到具体的特殊网络结构与资源因素对控制疫情爆发的影响与作用机制,结合双层星型耦合网络与传染病SIS模型,建立了一个离散动态传播模型。该模型利用星型网络的结构特性与平均度概念推导各层感染人口比例关于资源及各种参数的离散方程。理论分析和仿真实验结果表明,多层星型耦合传染病传播网络中存在资源阈值,当节点为叶子节点时,网络存在两个资源阈值,增加资源量投入以抑制传染病传播只在两个资源阈值间有效,此时传染病感染人口比例随着投入资源的增加而减少;当节点为中心节点时,网络中的资源阈值随其他层感染人口比例的增大由两个减少至一个。此外,层间中心节点耦合强度、层间叶子节点耦合强度对疫情的控制效果随着节点所处位置的不同而不同。     

天基综合信息网的容延计算仿真方法

容延网络DTN(delay tolerant network) 具有拓扑结构随时变化、通信脆弱、路由选择复杂、延时控制困难等特征,造成网络性能的不稳定,特别是网络的时延无法计算.以典型的容延网络--天基综合信息网--为例,运用组网仿真和链路仿真,较好地解决了网络连通性中的间歇时间问题,并为路由节点提供了可行的静态路由表.还创造性地运用了网络接纳实时任务机制,体现实时可执行概率这一新概念,它为动态选择路由节点提供了科学依据.     

Ad Hoc网络中SWAN模型改进及其仿真研究

SWAN是AdHoc网络中的一种无状态网络协议,利用分布式控制算法来传递分类服务。这种QoS模型把数据业务分为两类进行不同处理,即对尽力而为的UDP和TCP业务采用速率控制的策略而对实时的UDP业务采用基于源节点的接纳控制策略。然而现有模型在路由模块采用普通的路由协议,导致了路由和对整个路径资源探测两个过程分离开来;在接纳控制模块仅仅区分了节点间的业务而没有区分相同节点间的不同业务。该文针对这一问题对现有模型的修改主要体现在两个方面:(1)在路由模块用QoS路由替换了原有普通路由协议,路由和整个路径资源探测由QoS路由完成,从而减少了实时业务等待发送时间;(2)针对SWAN首次提出了基于数据流的服务,并且在接纳控制模块进行了相应修改。最后的仿真中表明了该文的修改是有效的,提高了模型的性能。     

WiMAX网络中信噪比与带宽结合的接纳控制算法

呼叫接纳控制（CAC）是宽带无线接入网络无线资源管理中一个重要的组成部分,其中策略设计的好坏直接影响着网络的性能和资源利用率。针对现有基于WiMAX的接纳控制算法仅考虑了带宽作为接纳控制的标准,提出一种结合带宽和信噪比的接纳控制算法,在考虑小区带宽因素的同时能兼顾考虑接纳后业务的信噪比情况。仿真结果表明,结合带宽和信噪比的接纳控制算法可以有效的降低系统中呼叫的掉线率,提高系统性能。     

P2P网络应用动态规划算法控制搭便车行为的研究

针对P2P网络中节点共享存储资源时存在的“搭便车”问题,在节点存储资源分配时引入控制机制,节点根据请求者的贡献值分配其存储资源,以使贡献值小的节点获取资源少,从而抑制搭便车行为。仿真实验表明,该控制机制的动态规划算法能有效地实现P2P网络中存储资源分配的公平性,达到控制节点搭便车行为的目的。     

无线自组网络QoS流的准入控制和流量控制

作者曾提出一个QoS路由和准入控制机制－QDSR,并且在小规模实时视频传输实验床上实现了这些方案。虽然QDSR的准入控制只保证每个节点有足够的可用带宽给准入的所有流使用,但并不保证每个流在较小的时间尺度上得到请求的带宽。为此,作者对QDSR的准入控制机制进行了改进并增加了流量控制机制,以满足实时应用的QoS需求。在NS2仿真环境中实现了QDSR以及对QDSR的改进。仿真结果表明,改进机制改善了QDSR的视频流的传输质量,较好地提高了视频流的吞吐率和投递率,减小了数据包的端到端延迟,并且能很好地满足包括视频传输在内的多种业务的传输需要。     

Scalable services via egress admission control

Allocating resources for multimedia traffic flows with real-time performance requirements is an important challenge for future packet networks. However, in large-scale networks, individually managing each traffic flow on each of its traversed routers has fundamental scalability limitations, in both the control plane's requirements for signaling, state management, and admission control, and the data plane's requirements for per-flow scheduling mechanisms. In this paper, we develop a scalable architecture and algorithm for quality-of-service management termed egress admission control. In our approach, resource management and admission control are performed only at egress routers, without any coordination among backbone nodes or per-flow management. Our key technique is to develop a framework for admission control under a general “black box” model, which allows for cross traffic that cannot be directly measured, and scheduling policies that may be ill-described across many network nodes. By monitoring and controlling egress routers' class-based arrival and service envelopes, we show how network services can be provisioned via scalable control at the network edge. We illustrate the performance of our approach with a set of simulation experiments using highly bursty traffic flows and find that despite our use of distributed admission control, our approach is able to accurately control the system's admissible region under a wide range of conditions     

Threshold configuration and routing optimization for PCN-based resilient admission control

Pre-Congestion Notification (PCN) in IP networks uses packet metering and marking within a PCN domain to notify its egress nodes whether link-specific admissible or supportable rate thresholds have been exceeded by high-priority traffic. Based on this information simple admission control and flow termination is implemented. The latter is a new flow control function and useful in case of overload through high priority traffic which can occur in spite of admission control, e.g., when traffic is rerouted in failure cases. Resilient admission control admits only so much traffic that admitted traffic can be rerouted without causing congestion on backup paths in case of a likely failures, e.g., single link failures.We propose algorithms to configure the link-specific PCN rate thresholds such that resources are utilized efficiently and fairly by competing traffic aggregates while meeting resilience constraints. This is done for the single and dual marking PCN architecture whereby the single marking case is more demanding since it requires that the supportable rate is a fixed multiple of the admissible rate on all links within a single PCN domain. Furthermore, we derive objective functions to optimize the underlying routing system for both cases. Our performance results for various network types show that the dual marking PCN architecture leads to significantly better resource efficiency than the single marking PCN architecture.     

Probe-based admission control for a differentiated-services internet

End-point admission control solutions have been proposed to meet quality requirements of audio-visual applications with little support from routers. These proposals decentralize the admission decision by requiring each host or access gateway to probe the network before sending data. In this paper we describe a probe-based admission control scheme that offers a reliable upper bound on packet loss, as well as small end-to-end delay and delay jitter. The admission control supports host mobility and multicast communications without adding any complexity to the network nodes. We present a mathematical analysis which relates system performance to design parameters and which can be used as a dimensioning aid for the system. Finally, we describe performance results from an experimental prototype as well as simulations that prove that the scheme provides a reliable and efficient solution for QoS provisioning for delay and loss sensitive applications.     

EasiCC:一种保证带宽公平性的传感器网络拥塞控制机制

实用的传感器网络拥塞控制方案不仅需要满足多项网络性能指标,而且必须控制开销很小,提出了一种满足上述要求的拥塞控制机制EasiCC(EasiNet congestion control mechanism).在EasiCC中,数据流源节点将数据报文按比例划分到各优先等级中,各网络节点根据网络拥塞程度动态地、同步地调整报文过滤标准,结合报文过滤标准和报文优先级来调节网络流量,保证了无线信道带宽分配上的公平性;将网络准入控制和队列丢包手段相结合来调整网络流量,保证了网络综合性能指标.EasiCC控制开销很少,已在实际传感器网络平台中实现.模拟验证和实验测试结果显示,EasiCC能够公平地为各数据流分配发报速度和网络带宽,并且在报文传输成功率、传输延迟等性能指标上均有良好的表现.     

一种自适应的主动网络拥塞控制机制研究

传统的端到端的拥塞控制机制不适应主动网络,针对主动网络面临的拥塞问题,提出了一种自适应的主动网络拥塞控制解决方案.在中间节点为转发到相邻节点的主动信包建立缓冲队列,以缓冲区中队列长度来表明节点的拥塞程度,通过对前向节点计算单元进行控制来改变当前节点拥塞状况,网络中相关节点通过协作对网络进行拥塞控制.理论分析和模拟试验结果表明,不管网络初始状态如何,该方案均能使各节点迅速达到动态平衡,快速消除主动网络拥塞.     

Packet-level traffic control for the Internet: a framework and its experimental validation

This paper presents a theoretical framework, which can be the basis for traffic control and resource management mechanisms, that provide QoS with quantitative guarantees in the Internet. The starting point is a fairly general traffic shaping algorithm for effective rate enforcement which is based on a packet spacing law. Multiplexing several independent shaped streams results in a tight upper bound to the queue-length distribution at the multiplexer. The algorithm effectively works with any kind of input traffic (non-stationary, non-Markovian, heterogeneous, long-range dependent (LRD), etc.). Based on the definition of shaped streams, we devise mechanisms for aggregating, splitting and policing such streams without affecting the queuing performance at subsequent network nodes. Also, a calculus for end-to-end QoS in this framework is presented. The theoretical statements are supported by simulation and experimental results on a network testbed. Since the enforced effective rate features the convenient additivity property , it can be handily used for many traffic control and accounting functions, like policing, admission control, bandwidth allocation and charging.     

PCN Based Admission Control for Autonomic Video Quality Differentiation: Design and Evaluation

The popularity of multimedia services has introduced important new challenges for broadband access network management. As these services are very prone to network anomalies such as packet loss and jitter, accurate admission control mechanisms are needed to avoid congestion. Traditionally, centralized admission control mechanisms often underperform in combination with multimedia services, as they fail to effectively characterize the amount of needed resources. Recently, measurement based admission control mechanisms have been proposed such as the IETF Pre-Congestion Notification (PCN) mechanism, where the network load is measured at each intermediate node and signaled to the edge, where the admittance decision takes place. In this article, we design a PCN based admission control mechanism, optimized for protecting bursty traffic such as video services, which is currently not studied in the PCN working group. We evaluated and identified the effect of PCN’s configuration in protecting bursty traffic. The proposed admission control mechanism features three main improvements to the original PCN mechanism: first, it uses a new measurement algorithm, which is easier to configure for bursty traffic. Second, it allows to automatically adapt PCN’s configuration based on the traffic characteristics of the current sessions. Third, it introduces the differentiation between video quality levels to achieve an admission decision per video quality level of each request. The mechanism has been extensively evaluated in a packet switched simulation environment, which shows that the novel admission control mechanism is able to protect video traffic while maximizing the link utilization and avoiding packet loss.     

基于干扰模型的无线网状网QoS路由策略

为支持无线网状网中多媒体业务,提出了基于干扰模型的QoS路由策略WQRI。首先对网络进行分层,然后提出新的可用带宽和端到端延时估计方法,在协议中实现可靠的接入控制和端到端资源预留。仿真表明,WQRI策略能以较低的控制报文开销为实时业务提供QoS支持。     

Object extraction scheme and protocol for energy efficient image communication over wireless sensor networks

To date, wireless sensor networks lack the most powerful human sense – vision. This is largely due to two main problems: (1) available wireless sensor nodes lack the processing capability and energy resource required to efficiently process and communicate large volume of image data and (2) the available protocols do not provide the queue control and error detection capabilities required to reduce packet error rate and retransmissions to a level suitable for wireless sensor networks. This paper presents an innovative architecture for object extraction and a robust application-layer protocol for energy efficient image communication over wireless sensor networks. The protocol incorporates packet queue control mechanism with built-in CRC to reduce packet error rate and thereby increase data throughput. Unlike other image transmission protocols, the proposed protocol offers flexibility to adjust the image packet size based on link conditions. The proposed processing architecture achieves high speed object extraction with minimum hardware requirement and low power consumption. The system was successfully designed and implemented on FPGA. Experimental results obtained from a network of sensor nodes utilizing the proposed architecture and the application-layer protocol reveal that this novel approach is suitable for effectively communicating multimedia data over wireless sensor networks.