基于网络行为偏好分类的DTBF+算法

针对Best-effect机制下DTBF动态令牌分配算法应用层流量分配不合理的问题,提出一种基于网络链路应用行为偏好分类机制的DTBF改进算法DTBF+。利用用户传输内容分类策略,将空闲用户链路中多余的令牌动态地分配到非对等(P2P)应用的繁忙用户链路中。应用结果表明,该算法可有效提高带宽的使用率和非P2P应用链路的瞬时带宽,降低资源分配的盲目性。     

Mean-Shift目标跟踪算法的带宽选取策略

分析不同带宽策略对Mean-Shift目标跟踪算法的影响,提出一种新的带宽策略。构造一个与目标窗口内接椭圆相似的椭圆,利用其长轴和短轴确定带宽,将此带宽策略纳入Mean-Shift算法中进行目标跟踪。实验结果表明,该策略具有良好的跟踪效果,能够有效降低时间复杂度。     

光纤Bragg光栅折射率调制特性研究

在光纤Bragg光栅(FBG)中两个正反向模式之间会发生耦合,要了解光纤光栅的物理特性,提高反射率的精度,就需要深入研究光纤光栅的耦合模理论.通过光纤Bragg光栅的耦合方程,研究在不同的折射率调制深度的情况之下光纤反射谱变化,并用Matlab做仿真实验,结果发现光栅长度取2,5,10 mm,弱光栅、中度光栅、强光栅在折射率变化0.000 1时的反射谱带宽最大值分别是2.015 0×10-11,5.276 7×10-11,9.2143 ×10-11.计算表明:在固定光栅长度情况下,每0.000 1折射率变化所导致的反射谱带宽变化值在任意反射带中都相对稳定,其中,弱光栅反射谱最小,中度光栅反射谱次之,强光栅反射谱最大.     

Effective-capacity-based stochastic delay guarantees for systems with time-varying servers, with an application to IEEE 802.11 WLANs

Many network applications rely on stochastic QoS guarantees. With respect to loss-related performance, the effective bandwidth/capacity theory has proved useful for calculating loss probabilities in queues with complex input and server processes and for formulating simple admission control tests to ensure associated QoS guarantees. This success has motivated the application of the theory for delay-related QoS too. However, up until now this application has been justified only heuristically for queues with variable service rate. The paper fills this gap by establishing rigorously that the effective bandwidth/capacity theory may be used for the asymptotically correct calculation and enforcement of delay tail-probabilities in systems with variable rate servers too. Subsequently, the paper applies the general results to IEEE 802.11 WLANs, by representing each IEEE 802.11 station as an On/Off server and employing the effective capacity function for this model. Comparison of analytical results with simulation validates the effectiveness of the On/Off IEEE 802.11 model for delay-related QoS, complementing earlier results on loss-related performance.     

基于动态规划的网络带宽分配机制

传统分组网络承载时分复用业务存在延时、抖动、报文到达次序不一致等问题。利用城域以太网面向连接的特性,提出了一种由用户为具体业务提出带宽申请,运营商根据共享带宽的大小和用户的优先级,利用动态规划的方法在以太网隧道中预留带宽的机制。提高了带宽利用率的同时,兼顾用户之间的公平性。实验结果表明,这种机制可以充分利用带宽资源,并且将带宽公平地分配给各用户。     

基于消融包列的瓶颈带宽测量和定位方法

分析了现有的瓶颈带宽的测量技术和定位方法,对它们的优缺点进行了比较,提出一种基于消融包列法的瓶颈带宽测量和定位方法。消融包列由测量包和定位包组成,它可以在测量瓶颈带宽的同时定位瓶颈带宽,有效地减少了测量的次数并降低了测量负载。对该方法的正确性进行了理论证明和模拟实验验证,并与其他方法进行了比较,结果表明该方法具有测量负载低、定位准确等特点。     

并行计算机模型的层次分析及性能评价

1.引言如何分析、评价并行程序的性能是并行计算的一个重要研究问题。RAM模型为串行算法分析提供了理论基础。据此,我们可以用big-O模型来分析其算法的复杂性。但是,在并行环境下,由于处理机之间增加了通信,使得并行程序及算法分析问题更加复杂。如何在并行程序和计算机结构之间建立一种联系?许多人     

基于网络报文对的网络瓶颈带宽测试技术的研究

本文讨论了一种基于网络报文对的网络瓶颈带宽测度技术的原理及实现时一些问题的解决方案,给出了各种典型网络环境下的测试结果,并分析了这种测试方法的潜在误差。     

Revisiting free riding and the Tit-for-Tat in BitTorrent: A measurement study

In this paper we report new results of our continuous effort on analyzing the impact of incentive mechanisms on user behavior in BitTorrent. In this second measurement and analysis study we find that free riders’ population has significantly increased comparing to our previous measurement study. We relate this increase to the advance in end-users’ connection speeds and to users’ increased knowledge in BitTorrent. We also categorize free riders based on the behavior they exhibit in multiple-torrent system into three types: cheaters, strategic and lucky peers. Furthermore, refuting the findings of other studies, we show that peers who exploit the system in BitTorrent are both high bandwidth capacity peers and low bandwidth capacity peers. Moreover, we argue that the Tit-for-Tat mechanism does not discriminate peers based on their bandwidth capacities and that it reacts successfully against inter-class bandwidth capacity strategic peers. Finally, we propose a memory-backoff approach to the optimistic unchoke policy that reduces the volume of free riding in BitTorrent.

Access Time Minimization for Distributed Multimedia Applications

The problem of minimizing the access time of a requested multimedia (MM) document on a network based environment is addressed. A generalized version of this problem is formulated and retrieval strategies that minimize the access time of the user-requested MM document from a pool of MM servers are proposed. To this end, we design single-installment and multi-installment MM document retrieval strategies, through which the minimization of access time can be carried out. The main idea is to utilize more than one MM server in downloading the requested document. Each server assumes the responsibility of uploading a predetermined portion of the entire document in a particular order. Single- and multi-installment strategies differ in the number of disjoint document pieces each server sends to the client. We first introduce a directed flow graph (DFG) model to represent the retrieval process and generate a set of recursive equations using this DFG. Then, we derive closed-form solutions for the portions of the MM document downloaded from the various servers and the corresponding access time. We present rigorous analysis for these two strategies and show their performance under MPEG-I and MPEG-II video streams playback rates. Their behavior under different network bandwidths is also examined, revealing in-depth information about their expected performance. We also show that in the case of a multi-installment strategy, the access time can be completely controlled by fine tuning the number of installments. Since the number of installments is software tunable, the adaptive nature of the strategies to different channel bandwidths is also demonstrated. Important trade-off studies with respect to the number of servers involved in the retrieval process and the number of installments are presented. In the case of a heterogeneous network employing a single-installment strategy, we prove that the access time is independent of the server sequence used. Illustrative examples are provided for ease of understanding.