IP网络链路带宽的测量

对网络带宽的测量是非常困难的，目前还没有一种很好的方法能对网络链路带宽进行精确的测量。本文详细讨论了现在流行的pathchar带宽测量算法，并针对其不足提出了一种改进的测量算法－－E－pathchar。最后我们通过试验仿真对两种算法进行了对比，证明E－pathchar算法比pathchar算法的测量精度更高，测量速度更快，耗费网络资源更少。     

网络瓶颈带宽的测量

分析了网络时延与网络带宽的关系,推导出了一定时间间隔的网络报文对通过网络时间间隔的变化与瓶颈带宽的数学关系,并以此设计出了一种测量网络瓶颈带宽的方法。     

IP网络时延变化参数的分析与测量

IP时延变化是一个重要的网络性能参数,分析并准确测量了时钟同步前后的IP网络时延和时延变化,讨论了时钟同步对IPDV测量的影响,并得到了选取3种不同参考时延所计算出的IPDV值。通过深入分析得知,选取前后包时延作为参考能更加准确地测量IPDV。最后,给出了一种消除IPDV的方法。     

时延约束下的等效带宽估计

本文利用流体流方法计算不实时媒体流在缓冲区中的延概率分布函数，给出了时延约束下实时媒体流的等效带宽的表达式。讨论了相关参数对等效带宽的影响。进行了仿真分析和验证。该表达式计算简单，便于实时带宽估计和控制。     

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

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

IP网带宽测量技术研究与进展

网络带宽表征网络传输信息的能力,是衡量网络服务质量的重要指标.本文在分析IP网带宽测量的重要作用及其技术分类的基础上给出了链路/路径带宽、可用带宽、批量数据传输能力等测度定义,系统总结了当前最具代表性的各种IP网带宽测量技术,剖析了它们的内在机理及各自优缺点,同时介绍了多种对应的开源带宽测量工具,并对影响带宽测量收敛速度、准确度的因素进行了讨论,最后对带宽测量的应用前景和研究趋势进行了展望.     

一种时延和时延抖动受约束的启发式多播路由算法

多播路由算法在组播应用中是至关重要的,对视频会议等交互式实时组播业务来说,不仅要考虑时延约束,而且要考虑时延抖动约束。本文提出了一种基于最短时延路径的时延和时延抖动约束的启发式算法,仿真结果表明该算法复杂度较低,而且性能也较好,在算法复杂度和性能之间达到了很好的折中。     

一种基于带宽和时延约束的分布式组播路由算法

针对已有分布式组播路由算法在寻找QoS路由时的低成功率问题,本文提出了一种新的基于带宽和时延约束的分布式组播路由算法-QDMR(QoS-based Distributed Multicast Routing).在为新组播成员搜索连接到组播树的可行路径时,QDMR算法使用RBMF(Reverse Best Metric Forwarding)转发算法代替RPF(Reverse Path Forwarding)转发算法,从而优先搜索满足带宽和时延约束要求的路径,然后才考虑代价的优化.模拟分析表明,QDMR提高了路由搜索的成功率,并且降低了协议开销.     

基于可用带宽满足时延和时延差别 约束的实时多播路由算法

实时多播路由中具有可加性的代价(Cost)不能确切反映网络本质特性,尤其不能反映路径带宽的凹性(Concave).已有基于代价的算法不能很好适应多播应用,需要新的模型和算法.本文采用可用带宽代替代价作为主要度量,并满足实时多播中二个重要约束度量:时延和时延差别.同时基于此三个度量,本文提出二种新的具有多项式复杂性的实时多播路由算法并比较其性能.新算法通过分析得到每路径时延和二约束之间的关系,有效降低涉及时延和时延差别此类问题的复杂性.新算法采用度量反映实时多播本质特性而具有实际推广性.     

网络瓶颈带宽测量的噪声分析

包对/串技术通过两个/多个背靠背发送的测量包所经历的散布间隔来估测一条路径的瓶颈带宽.本文分析了瓶颈带宽测量中的噪声特性,解释了在不同测量包长和测量包数情况下测量样点的分布.基于噪声分析的结论,文中提出了一种基于信号模式的滤波算法(MBFA,Model-Based Filtering Algorithm),它利用信号模式/特征来增强信号、过滤噪声.     

一种长时延网络中移动节点间的时间同步算法

长时延网络的同步对于提升网络传输效率,增加网络吞吐量具有重要意义。现有用于长时延网络典型时间同步协议有TSHL,Tri-Message等,这些同步协议都是针对传播时延保持稳定或者保持短时稳定的长时延网络,但在实际情况中,有时传播时延会发生变化,如节点间相对位移的变化,如何在这样的长时延网络中进行时间同步也是一个值得研究的问题,文中提出了一种运用于长时延网络中移动节点间的时间同步算法,利用节点间多次的信息交互计算出传播时延变化的速率,然后对时延变化进行估算来进行时间偏移的补偿以达到时间同步。     

LTE-A移动台自适应切换无线资源管理测量带宽的方法

考虑到LTE-A系统对于移动台无线资源管理( RRM )测量的要求,急需一种能同时考虑测量精度和能量消耗的RRM测量方案。为了满足上述需求,提出了一种新的测量带宽选择方法,即自适应切换测量带宽方法。该方法使得移动台可以根据信道质量自行在窄带和宽带测量之间进行切换。仿真结果显示提出的方法能够达到足够的测量精度,同时还考虑了移动台的能量消耗。     

Tiered bandwidth reservation scheme for multimedia wireless networks

It is important to provide quality of service (QoS) guarantees if we want to support multimedia applications over wireless networks. In this paper, considering the features of tiering in sectored cellular networks, we propose a novel scheme for bandwidth reservation to approach QoS provisioning. By predicting the movement of each connection, the reserving of bandwidth is only required in needful neighboring cells instead of in all neighboring cells. In addition, an admission control mechanism incorporated with bandwidth borrowing assists in distributing scarce wireless bandwidth in more adaptive way. Through mathematical analysis, we proof the advantages of tier‐based approach and the bound for the selection of tiered boundary. The simulation results also verify that our scheme can achieve superior performance than traditional schemes regarding no bandwidth reserving, fixed bandwidth reserving, and bandwidth borrowing in sectored cellular networks when performance metrics are measured in terms of the connection dropping probability (CDP), connection blocking probability (CBP), and bandwidth utilization (BU). Copyright © 2008 John Wiley & Sons, Ltd.     

Performance issues of bandwidth management in ATM networks

In our days, efficient management of the available network resources becomes a critical issue, both from a functional point of view (so that users can be provided with the bandwidth they need), and an economical point of view (so that carriers can satisfactorily and efficiently serve as many customers as possible and at the same time increase their revenue). In this paper we consider a bandwidth control scheme (i.e. managed bandwidth service) for an ATM network infrastructure which is applied to the Greek research and technology network (GRNET). We present some methods that we have tested (in a simulation setting) in order to increase the efficiency of the system and the utilization of the available bandwidth. More specifically, we consider a bandwidth‐resizing algorithm for virtual paths, in order to keep the allocated bandwidth very close to the bandwidth actually used. This leads to an increased number of accepted requests and better network utilization. We, also, use the simulation results in order to get an estimation of the effective bandwidth for VBR paths that can be used in call admission. Finally, we consider a semi‐offline scheme where requests are gathered and considered for acceptance in regular intervals. Simulation results show an increase in the utilization of resources. As a further improvement, we allow connections to be allocated a little before or after the time initially requested. This leads to further improvement in network utilization. All the improvement schemes were tested with the ATM‐TN simulator and the results look promising. Copyright © 2003 John Wiley & Sons, Ltd.     

A traffic control system for IEEE 802.11 networks based on available bandwidth estimation

To support Quality of service (QoS)‐sensitive applications like real‐time video streaming in IEEE 802.11 networks, a MAC layer extension for QoS, IEEE 802.11e, has been recently ratified as a standard. This MAC layer solution, however, addresses only the issue of prioritized access to the wireless medium and leaves such issues as QoS guarantee and admission control to the traffic control systems at the higher layers. This paper presents an IP‐layer traffic control system for IEEE 802.11 networks based on available bandwidth estimation. We build an analytical model for estimating the available bandwidth by extending an existing throughput computation model, and implement a traffic control system that provides QoS guarantees and admission control by utilizing the estimated available bandwidth information. We have conducted extensive performance evaluation of the proposed scheme via both simulations and measurements in the real test‐bed. The experiment results show that our estimation model and traffic control system work accurately and effectively in various network load conditions without IEEE 802.11e. The presence of IEEE 802.11e will allow even more efficient QoS provision, as the proposed scheme and the MAC layer QoS support will complement each other. Copyright © 2006 John Wiley & Sons, Ltd.     

Adaptive bandwidth management in ATM networks

A framework for adaptive bandwidth management in ATM based networks is proposed. It is based on a layered approach which includes bandwidth allocation to virtual networks. The central concept of this approach is adaptive estimation of the effective bandwidth required, by connections carried in the network. To achieve reliable results the estimation process takes into account both the traffic source declarations and the connection superposition process measurements on the network links. This is done in an optimization framework provided by estimation theory. A study, based on a linear two-state Kalman filter, shows that the proposed approach provides good adaptation to undeclared changes in traffic parameters and that the network performance is significantly improved when compared to the effective bandwidth allocation based solely on the source parameters declarations. These features allow more relaxed source parameter declarations and at the same time permit less stringent source policing. Thus the two bottlenecks influencing bandwidth management in ATM networks can be significantly widened.     

MR-MC无线传感器网络最小延迟数据聚集调度研究

单radio单信道无线传感器网络的最小延迟聚集调度是一个NPC问题,已提出许多解决方案。在多radio多信道网络中,节点可以同时接收多个不同节点传输的数据,降低延迟。基于上述特点,考虑树结构约束,时槽、信道和radio分配等约束条件,将多radio多信道无线传感器网络最小延迟聚集调度问题定义为一个优化问题,并分解为建立聚集树和节点调度2个子问题,针对这2个子问题分别提出启发式算法。实验结果表明,提出的算法具有良好的性能。     

An approximate stochastic analysis of the packet‐pair probing technique for available bandwidth estimation

The packet‐pair probing algorithm for network‐bandwidth estimation is examined and an approximate model is proposed for predicting its behaviour. The model replaces the Poisson arrival process with a Gaussian distribution and resolves the queue‐size profile into two separate components: A transient component representing the buffer‐emptying process and an equilibrium component representing the return to steady‐state behaviour. Comparison with discrete‐event simulation results shows that the model is accurate in single‐hop paths when utilization is ?70% when the cross‐traffic packets are ?½ the size of the probe packets. When extended to two‐hop paths, the model remains accurate for smaller cross‐traffic packets ($\leq\frac{1}{10}-\frac{1}{5}The packet‐pair probing algorithm for network‐bandwidth estimation is examined and an approximate model is proposed for predicting its behaviour. The model replaces the Poisson arrival process with a Gaussian distribution and resolves the queue‐size profile into two separate components: A transient component representing the buffer‐emptying process and an equilibrium component representing the return to steady‐state behaviour. Comparison with discrete‐event simulation results shows that the model is accurate in single‐hop paths when utilization is ?70% when the cross‐traffic packets are ?½ the size of the probe packets. When extended to two‐hop paths, the model remains accurate for smaller cross‐traffic packets ($\leq\frac{1}{10}-\frac{1}{5}$ the probe‐packet size). Copyright © 2008 John Wiley & Sons, Ltd.     

A system-level bandwidth design method for wormhole network-on-chip

To improve the Network-on-Chip (NoC) performance, we propose a system-level bandwidth design method customising the bandwidths of the NoC links. In details, we first built a mathematical model to catch the relationship between the NoC commutation latency and the NoC link bandwidth, and then develop a bandwidth allocation algorithm to automatically optimise the bandwidth for each NoC link. The experimental results show that our bandwidth-customising method improves the NoC performance compared to the traditional uniform bandwidth allocation method. Besides, it can also make our NoC to achieve the same communication performance level as the uniform bandwidth NoC but using fewer bandwidth resources, which is beneficial to save the NoC area and power.