IP网可用带宽快速检测方法SSP的研究与应用

在IP网中,可用带宽是最重要的网络资源,是网络传输性能的决定因素,可用带宽的实时检测具有重要的研究和现实意义.本文对当前典型的端到端的可用带宽测量工具Pathload进行了研究,分析了Pathload工具检测算法的优点以及不足,提出了一种快速而精确的带宽测量方法--SSP,通过它可以快速检测到端到端路径的可用带宽值,为有效利用网络资源、支持QoS服务和多媒体实时业务提供了保证.     

可用带宽测量算法的改进

网络测试是及时了解网络运行状态、检测网络拥塞、提供接入控制参考依据以及保证网络服务质量的基础和必要手段。带宽测量属于网络的系统测试范畴,其相关测量算法一直是网络测试领域的研究热点和难题。文章在重点讨论可用带宽测量技术的基础上,对可用带宽测量工具Pathload进行了改进,实际测量结果表明改进算法在测量准确性等方面改善了测量效果。     

可用带宽的变时隙探测算法研究

目前基于自拥塞理论的网络可用带宽主动探测方法,一般都要发送大量的探测包串,在对网络可用带宽进行探测的同时,可能会干扰网络的正常通信。这一方面增加了网络负载,另一方面也增加了算法的复杂性。针对此问题,提出使用幂级数变时隙探测包替代等时隙探测包,期望通过新的探测方法在不失估测精度的前提下,用更少的探测流量获得更快的自拥塞集聚时间,从而提高可用带宽的探测效率。实验表明新的探测算法可以达到比传统算法更好的效率。     

无线自组织网络中基于QoS保障准则的可用带宽估计

对无线自组织网络中可用带宽估计问题进行了研究,提出了在估计过程中必须将全局服务质量（QoS）保障作为可用带宽的估计准则。建立了无线自组织网络中非饱和条件下异构的分析模型,该模型能将业务流的QoS度量映射为网络参数,在此基础上设计了能提供QoS保障的可用带宽估计算法。本文所提出的估计算法将包括时延、丢包率与吞吐量在内的QoS需求不被破坏作为可用带宽估计的约束条件,克服了现有的工作将无约束的最大可达吞吐量作为可用带宽因而导致业务的QoS可能受到影响这一缺陷,从而使得估计结果更加合理与准确。仿真实验证明了分析模型与可用带宽估计算法的准确性。      

一种基于应用需求的网络路径可用带宽测量策略

报文对间隔及报文单向延迟的变化可以反映报文发送速率与可用带宽的大小关系,根据这个规律本文提出了一种基于应用需求的网络路径可用带宽测量策略COPP.COPP发送多组发送速率不断增大的报文对序列,并从每组序列中求出所有成为转换点的报文对,然后根据这些报文对所受干扰的不同程度赋以它们不同的权重,从而得到路径可用带宽.COPP可根据具体应用不同的带宽需求动态决定测量范围,仿真实验研究了测量中探测报文大小的选择,并通过与Pathload等其它带宽测量方法的比较验证了COPP具有低开销、高精度、平稳性好且对网络状态变化敏感等优点.     

一种基于端到端测量的路径性能参数估计算法

现有的网络性能估计技术不能实现对路径容量和可用带宽的同时测量。该文通过对存在拥塞链路的路径作随机分析,得到了一种对路径可用带宽的近似估计式,并通过对Kapoor(2004)中的方法进行改进, 提出了一种基于端到端的可以同时对单拥塞路径的容量及可用带宽进行估算的算法。在较准确估算路径容量的同时,达到了用同一组样本实例同时估计路径容量和可用带宽的目的。仿真验证了算法的有效性和准确性。     

IP网络可用带宽测量技术的研究

网络测量技术是了解网络行为、进行QoS控制、提高网络性能的重要环节和前提基础,而可用带宽测量技术又是网络测量研究中的热点和难点.本文着重分析可用带宽测量的基本原理和算法,介绍现有的测量工具及其实现方法,并提出了进一步的研究方向.     

一种新的多速率多播拥塞控制策略

本文提出了一种新的多速率多播拥塞控制策略,以满足分层多播接收者的可用带宽异构性。这种接收方驱动的拥塞控制策略,能够根据网络情况变化动态地调整分层的数量及层速率,运用最优层速率分配算法来满足接收者的可用带宽异构性,接收者的可用带宽可以用根据TCP友好经验公式计算出。仿真实验表明,该算法在TCP友好性上有良好的性能,同时它可以明显提高系统的吞吐量。     

一种网络总可用带宽测量方法

可用带宽测量对于网络行为分析、网络业务质量保证、网络负载均衡、流媒体的速率控制、服务器的动态选择、覆盖网络（overlaynetwork）的路由选择、拥塞控制等网络应用有很重要的意义。现有的可用带宽测量方法主要对端到端路径进行测量。由于网络总可用带宽不能由路径的可用带宽简单相加获得,而且路径上的瓶颈链路不一定是网络的瓶颈链路,文章提出了一种网络总可用带宽测量方法,仿真实验验证了方法的有效性。     

TCP-Shape:一种改进的网络拥塞控制算法研究

网络拥塞是由于网络业务流不可预测的流量突发现象造成的.文章从考虑网络业务流突发现象产生的特点出发,采用可用带宽测量技术和流量整形技术,提出了一种针对传统网络拥塞控制算法的改进算法(TCP-Shape).改进后的拥塞控制算法能够快速地探测到网络链路中可用剩余带宽并能够有效地消除网络业务流中的突发现象.使得在网络业务流的吞吐量和数据报文段的丢失率等性能上,更加优越于传统拥塞控制算法所获得的性能.     

DIChirp: direct injection bandwidth estimation

Ideally, network bandwidth estimation algorithms should be independent of the end system performance. If end system capabilities are involved, then the measurement will be of the system throughput and will not indicate a correct assessment of network bandwidth. Packet dispersion‐based active bandwidth estimation schemes including Pathload, TOPP and pathChirp use delay correlation where the network‐induced delay on packets transmitted at certain rates is translated into bandwidth estimation. Since packet dispersion‐based active measurement schemes use delay correlation, bandwidth estimations are distorted by the host protocol stack‐induced delay variations. Studies revealed that the host protocol stack‐induced delay variations due to context switching are stovepiped in the network‐induced delay variations and impact the measurement process. This study explores the delay variations introduced by the host protocol stack in packet dispersion‐based techniques. The impact of host protocol delay variations and context switching on bandwidth estimation is analyzed and a new active bandwidth estimation tool minimizing the impact of context switching is proposed. Direct Injection Chirp (DIChirp) bypasses the TCP/IP protocol stack and directly interfaces with the network hardware. It uses the kernel for scheduling the outgoing packets, thus achieving more accurate estimation of bandwidth. Experiments revealed that the host protocol and context switching‐induced delay variations can be as high as 800µs and could result in bandwidth estimation errors near 20%. Experiments also revealed that the DIChirp is superior to the pathChirp implementation in performance estimation since the datapath utilized by DIChirp is less prone to delay variations induced by context switching. Copyright © 2007 John Wiley & Sons, Ltd.     

Resource allocation algorithm for LTE networks using fuzzy based adaptive priority and effective bandwidth estimation

In this paper, we propose a scheme to allocate resource blocks for the Long Term Evolution (LTE) downlink based on the estimation of the effective bandwidths of traffic flows, where users’ priorities are adaptively computed using fuzzy logic. The effective bandwidth of each user traffic flow that is estimated through the parameters of the adaptive β-Multifractal Wavelet Mode modeling, is used to attain their quality of service (QoS) parameters. The proposed allocation scheme aims to guarantee the QoS parameters of users respecting the constraints of modulation and code schemes (modulation and coding scheme) of the LTE downlink transmission. The proposed algorithm considers the average channel quality and the adaptive estimation of effective bandwidth to decide about the scheduling of available radio resources. The efficiency of the proposed scheme is verified through simulations and compared to other algorithms in the literature in terms of parameters such as: system throughput, required data rate not provided, fairness index, data loss rate and network delay.     

无线Mesh网络中基于链路负载估算的拥塞控制策略

针对无线Mesh网络的网络特性,提出了一种基于链路负载估算的拥塞控制策略LLECC。LLECC算法计算有效链路带宽和链路负载估算确定RED算法中的调整因子,通过调整因子调整RED算法中的参数从而实现动态的对无线网络拥塞控制。详细讨论了LLECC算法的实现过程和相关参数的计算方法,通过仿真分析验证了该算法对无线Mesh网络性能的提高。     

Dynamic resource allocation algorithm in multi-user cooperative OFDMA systems: considering QoS and fairness constraints

Wireless transmission systems are constrained by several parameters such as the available spectrum bandwidth, mobile battery energy, transmission channel impairments and users’ minimum quality-of-service. In this paper, a new strategy is investigated that aims at improving the allocation of resources in a dual hop OFDMA cooperative network consisting in multi source–destination pairs and multiple decode-and-forward relays. First, the joint optimization of three types of resources: power, sub-channel and relay nodes, is formulated as a problem of subchannel-relay assignment and power allocation, with the objective of minimizing overall transmission power under the bit-error-rate and data rate constraints. However, the optimal solution to the optimization problem is computationally complex to obtain and may be unfair. Assuming knowledge of the instantaneous channel gains for all links in the entire network, an iterative three-step resource allocation algorithm with low complexity is proposed. In order to guarantee the fairness of users, several fairness criteria are also proposed to provide attractive trade-offs between network performance (i.e. overall transmission power, average network lifetime and average outage probability) and fairness to all users. Numerical studies are conducted to evaluate the performance of the proposed algorithm in two practical scenarios. Simulation results show that the proposed allocation algorithm achieves an efficient trade-off between network performance and fairness among users.     

Bandwidth estimation schemes for TCP over wireless networks

The use of enhanced bandwidth estimation procedures within the congestion control scheme of TCP was proposed recently as a way of improving TCP performance over links affected by random loss. This paper first analyzes the problems faced by every bandwidth estimation algorithm implemented at the sender side of a TCP connection. Some proposed estimation algorithms are then reviewed, analyzing and comparing their estimation accuracy and performance. As existing algorithms are poor in bandwidth estimation, and in sharing network resources fairly, we propose TIBET (time intervals based bandwidth estimation technique). This is a new bandwidth estimation scheme that can be implemented within the TCP congestion control procedure, modifying only the sender-side of a connection. The use of TIBET enhances TCP source performance over wireless links. The performance of TIBET is analyzed and compared with other schemes. Moreover, by studying TCP behavior with an ideal bandwidth estimation, we provide an upper bound to the performance of all possible schemes based on different bandwidth estimates.     

Unified routing protocol based on passive bandwidth measurement in heterogeneous WMNs

The past few years have witnessed a surge of wireless mesh networks (WMNs)‐based applications and heterogeneous WMNs are taking advantage of multiple radio interfaces to improve network performance. Although many routing protocols have been proposed for heterogeneous WMNs, most of them mainly relied on hierarchical or cluster techniques, which result in high routing overhead and performance degradation due to low utilization of wireless links. This is because only gateway nodes are aware of all the network resources. In contrast, a unified routing protocol (e.g., optimal link state routing (OLSR)), which treats the nodes and links equally, can avoid the performance bottleneck incurred by gateway nodes. However, OLSR has to pay the price for unification, that is, OLSR introduces a great amount of routing overhead for broadcasting routing message on every interface. In this paper, we propose unified routing protocol (URP), which is based on passive bandwidth measurement for heterogeneous WMNs. Firstly, we use the available bandwidth as a metric of the unification and propose a low‐cost passive available bandwidth estimation method to calculate expected transmission time that can capture the dynamics of wireless link more accurately. Secondly, based on the estimated available bandwidth, we propose a multipoint relays selection algorithm to achieve higher transmission ability and to help accelerate the routing message diffusion. Finally, instead of broadcasting routing message on all channels, nodes running URP transmit routing message on a set of selected high bandwidth channels. Results from extensive simulations show that URP helps improve the network throughput and to reduce the routing overhead compared with OLSR and hierarchical routing. Copyright © 2016 John Wiley & Sons, Ltd.     

光纤网络中云计算资源联合最优分配方法

在云计算技术与光纤网络不断发展的今天,网络数据不断增加,网络带宽面临严峻挑战。当前应用云计算资源联合最优分配方法对网络链路资源分配的结果较为落后,导致资源分配后网络数据传输扰动量以及带宽阻塞率较高。针对此问题,本文设计光纤网络中云计算资源联合最优分配方法。以网络任务模型为蓝本,构建光纤网络传输模型。将光纤网络传输模型以有向图的形式,完成网络节点传输映射分析。结合光树生成算法,设计云计算资源最优分配算法,完成光纤网络中云计算资源联合最优分配方法设计。仿真结果表明：采用所提方法后网络数据传输扰动量以及带宽阻塞率较低,提升了云计算资源的分配方法。     

WDM网状网络中一种动态多播自适应业务疏导算法

光多播业务需要消耗大量的WDM光网络带宽资源,业务疏导是光多播网络降低业务请求阻塞率和提高带宽资源利用率的有效方法。提出了一种新型光多播疏导节点结构,研究了疏导端口优先的多播业务疏导算法(TGPFA)和新建光树优先的多播业务疏导算法(TCLFA),进而提出了一种能够适应网络资源变化的动态多播业务疏导算法(ADMGA)。结果表明,在网络资源有限的情况下,ADMGA算法能取得较低的请求阻塞率和带宽阻塞率,获得较好的网络性能。     

SR架构下的软件定义信息中心网络概率路由策略

传统的TCP/IP路由以IP地址为中心,信息传输效率低下,难以满足网络用户需求.信息中心网络(Information-Centric Network,ICN)开始成为研究热点,ICN以内容为中心,可以高效传输信息.为了利用软件定义网络(Software Defined Network,SDN)和分段路由技术的优势,提高...