一种任意子路径的带宽测量方法

随着Internet用户数和网络复杂度的激增,人们对网络性能提出了更高的要求,而带宽测量已经成为一种网络性能研究的重要手段。这里提出的任意子路径的瓶颈带宽测量方法,采用包列作为探测报文,基于单端测量,可以在一条超路径的两端测量任意子路径的带宽,并且能定位出此链路,解决了在测量路径两端难以部署测量设施问题。最后用NS2仿真工具作了实验验证,在多种不同的背景流量情况下的实验结果表明此方法准确有效。     

MPEG4视频流量预测自适应算法的研究

为了保证用户的服务质量(QOS),宽带分组网在传送视频信息时需要进行动态带宽分配,而视频流量预测在动态带宽分配中发挥着重要的作用。本文从自相关性、自相似性的Hurst参数两个方面,阐明GOP时间尺度上的流量能够体现原始帧序列的流量特性,并在固定步长的LMS自适应算法(FSSA)的基础上提出的一种新的可变步长自适应算法(VSSA),在GOP的大时间尺度上预测MPEG4视频流量,通过大量的仿真实验表明,VSSA算法可以明显地改善预测性能。     

网络延迟主动测量结果的被动测量校准方法

网络延迟是提供QoS保证、监控和优化网络性能的重要指标.测量网络延迟主要采用主动测量和被动测量这两种测量方法,但是这两种方法都存在一定的缺陷.以主动测量获得的延迟作为用户数据包延迟的一个估计量,用被动测量设备检测到的用户数据包信息对主动测量数据进行校准,可以实现一种有效的网络延迟测量方法.这种方法具有与协议无关、对网络流量影响小、测量方法简单、可测量单个用户流等优点.我们综合考虑了探测包间用户数据包数量和相邻探测包延迟的变化,比以往的算法更准确地反映了网络的实际状况,特别是在网络拥塞甚至存在丢包的情况下,误差更小,测量结果更精确.     

基于延迟参数的可用带宽主动估测算法

可用带宽是重要的网络资源,但它的实际测量存在许多困难。该文基于延迟趋势模型,提出一种端到端的可用带宽估测算法SSP(SRdeg and SRdet Parameters),设计了反映网络传输性能的参数SRdeg 和SRdet ,通过端系统对参数进行计算,主动调整发送速率,从而快速估测到网络的可用带宽,达到有效利用网络资源的目的。在NS2平台进行了参数和SSP算法的性能测试实验,并与当前的带宽估测工具Pathload进行了比较。实验结果表明,SSP算法估测带宽的精度和效率都高于Pathload。     

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

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

INS/GPS紧组合系统PLL最优带宽的选取

在INS/GPS紧组合系统中,通过INS提供的多普勒辅助信息可以消除GPS跟踪环路的动态性,同时降低环路带宽来抑制热噪声的影响,从而提高GPS系统的抗干扰能力。环路带宽是跟踪环路的一个重要参数,不能任意选取,当GPS跟踪环路设置为最优带宽时,系统性能将达到最优状态。为了保持系统性能最优,首先对影响最优带宽的各个误差源进行分析,提出了易于实现的迭代最优带宽算法,最后进行了仿真实验验证,结果表明在相同动态下采用最优带宽比固定带宽的系统具有更高的抗干扰能力和更强的跟踪锁定性能。     

一个消除单向时延测量中时钟频差和 时钟重置的新方法

单向时延测量对于分析和评价网络端到端性能具有重要的意义.主机之间的相对时钟频差和时钟重置会给单向时延测量引入不容忽视的误差.本文提出了一个基于模糊聚类分析的算法来检测并消除这些误差.大量实验表明:与同类算法相比,该算法有更好的准确性和鲁棒性.而且此算法时间复杂度为O(N).     

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

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

基于成像激光雷达的地形辅助导航研究

成像激光雷达通过扫描可以测量高精度的地形数据,基于成像激光雷达的地形辅助导航系统是纠正惯导误差的有效手段.根据激光雷达测距模型提出了基于成像激光雷达的地形辅助导航系统,将激光雷达看作一个多维距离传感器阵列,利用卡尔曼滤波器迭代估计系统的状态误差,从而纠正惯导累积误差.根据激光雷达测距关系推导了系统的扩展卡尔曼滤波方程,并对成像激光雷达多维测量数据采用最小均方误差准则进行融合,融合滤波器组合了多个测量数据的信息,有效克服了测量噪声和数据丢失对单个滤波器的影响,从而提高了导航性能.然后利用局部可观测性对系统的性能进行了分析,并对提出的算法作了大量的仿真实验进行验证.     

一种超额认购虚拟数据中心的嵌入算法

多租户数据中心环境下,保证云应用性能的一个重要因素是为租户应用提供可保证的通信带宽,这可以通过为每个租户提供一个独占的虚拟数据中心(VDC)来实现.研究了在物理数据中心网络中超额认购数据中心的嵌入问题.相对于一般虚拟数据中心,超额认购虚拟数据中虚拟机之间的流量模式更加复杂,因此首先利用线性规划方程阐述了流量模型及嵌入问题.对于虚拟机嵌入问题,提出了一种具有较低时间复杂度的启发式算法——分组扰动算法.最后,通过仿真实验将分组扰动算法和先前工作中提出的算法以及著名的first-fit进行了比较,实验表明所提算法在降低算法复杂度的同时提高了嵌入成功率.     

Bandwidth estimation: metrics, measurement techniques, and tools

In a packet network, the terms bandwidth and throughput often characterize the amount of data that the network can transfer per unit of time. Bandwidth estimation is of interest to users wishing to optimize end-to-end transport performance, overlay network routing, and peer-to-peer file distribution. Techniques for accurate bandwidth estimation are also important for traffic engineering and capacity planning support. Existing bandwidth estimation tools measure one or more of three related metrics: capacity, available bandwidth, and bulk transfer capacity. Currently available bandwidth estimation tools employ a variety of strategies to measure these metrics. In this survey we review the recent bandwidth estimation literature focusing on underlying techniques and methodologies as well as open source bandwidth measurement tools.     

Throughput and resource optimization for adaptive coding‐based random access networks with correlated sources

Modern wireless communication networks frequently have lower application throughput due to higher number of collisions and subsequent retransmission of data packets. Moreover, these networks are characterized by restricted computational capacity due to limited node‐battery power. These challenges can be assessed for deploying fast, reliable network design with resource‐restrained operation by means of concurrent optimization of multiple performance parameters across different layers of the conventional protocol stack. This optimization can be efficiently accomplished via cross‐layer design with the aid of network coding technique and optimal allocation of limited resources to wireless links. In this paper, we evaluate and analyze intersession coding across several source–destination pairs in random access ad hoc networks with inherent power scarcity and variable capacity links. The proposed work addresses the problem of joint optimal coding, rate control, power control, contention, and flow control schemes for multi‐hop heterogeneous networks with correlated sources. For this, we employ cross‐layer design for multiple unicast sessions in the system with network coding and bandwidth constraints. This model is elucidated for global optimal solution using CVX software through disciplined convex programming technique to find the improved throughput and power allocation. Simulation results show that the proposed model effectively incorporates throughput and link power management while satisfying flow conservation, bit error rate, data compression, power outage, and capacity constraints of the challenged wireless networks. Finally, we compare our model with three previous algorithms to demonstrate its efficacy and superiority in terms of various performance metrics such as transmission success probability, throughput, power efficiency, and delay.     

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

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

Evaluation of segmentation techniques using region area and boundary matching information

Evaluation techniques play an important role while picking a suitable segmentation scheme out of a number of alternatives. In this paper, a novel supervised segmentation evaluation scheme is proposed that is designed by combining segment area and boundary information. Using the evaluation metric, a ranking of the popular segmentation algorithms is carried out. A comparative analysis with existing supervised metrics that are commonly used for grading segmentation schemes is performed. Experimental results indicate that the performance of the proposed measure is promising.     

Probing-based estimation of end-to-end available bandwidth

A new mechanism to estimate available bandwidth for multiple hop routes is proposed based on a minimally backlogging concept. Since the proposed mechanism can estimate the available bandwidth quickly and track it adaptively, a reasonable range of available bandwidth for a short time interval can be obtained using the mean and variance of the estimated available bandwidth. The performance of the proposed mechanism is verified by simulation in a multiple hop network topology.     

基于YOLOX的跳频信号检测

现有跳频信号检测算法大多针对固定参数的跳频信号检测,而面对可变参数的跳频信号检测时,其每跳时长及带宽的不确定性导致这些算法的适用性下降。为此,提出了一种基于YOLOX的跳频信号检测算法。该算法适用于固定参数跳频信号和可变参数跳频信号,判断跳频信号的存在性。首先将观测时间内的信号进行短时傅里叶变换获得灰度时频谱图;然后将时频谱图经过目标检测网络YOLOX,获得各个信号的预测框;最后根据跳频信号各跳点的时间连续性,筛选出跳频信号各个跳点,根据连续跳点个数判断跳频信号的存在性。对算法的检测流程进行了仿真,以验证算法的可行性。实验结果表明,该算法可以较好地完成盲检测任务,且能够通过增加较少的先验信息以提高检测性能。     

A Queueing-Theoretic Foundation of Available Bandwidth Estimation: Single-Hop Analysis

Most existing available-bandwidth measurement techniques are justified using a constant-rate fluid cross-traffic model. To achieve a better understanding of the performance of current bandwidth measurement techniques in general traffic conditions, this paper presents a queueing-theoretic foundation of single-hop packet-train bandwidth estimation under bursty arrivals of discrete cross-traffic packets. We analyze the statistical mean of the packet-train output dispersion and its mathematical relationship to the input dispersion, which we call the probing-response curve. This analysis allows us to prove that the single-hop response curve in bursty cross-traffic deviates from that obtained under fluid cross traffic of the same average intensity and to demonstrate that this may lead to significant measurement bias in certain estimation techniques based on fluid models. We conclude the paper by showing, both analytically and experimentally, that the response-curve deviation vanishes as the packet-train length or probing packet size increases, where the vanishing rate is decided by the burstiness of cross-traffic.     

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.     

检测前跟踪算法性能评估指标体系

针对传统性能评估指标难以有效评估检测前跟踪(TBD)算法性能的问题,构建了TBD算法性能评估通用流程,并从单帧检测和虚警、航迹检测和虚警及计算资源3个方面,建立了一套基于单目标模型的性能评估指标体系。在此基础上,比较了Hough变换和递推贝叶斯滤波2种典型TBD算法的性能,仿真结果验证了该指标体系的有效性。     

Cluster‐based mobility management algorithms for wireless mesh networks

Wireless mesh networks (WMNs) have been the recent advancements and attracting more academicians and industrialists for their seamless connectivity to the internet. Radio resource is one among the prime resources in wireless networks, which is expected to use in an efficient way especially when the mobile nodes are on move. However, providing guaranteed quality of service to the mobile nodes in the network is a challenging issue. To accomplish this, we propose 2 clustering algorithms, namely, static clustering algorithm for WMNs and dynamic clustering algorithm for WMNs. In these algorithms, we propose a new weight‐based cluster head and cluster member selection process for the formation of clusters. The weight of the nodes in WMN is computed considering the parameters include the bandwidth of the node, the degree of node connectivity, and node cooperation factor. Further, we also propose enhanced quality of service enabled routing protocol for WMNs considering the delay, bandwidth, hopcount, and expected transmission count are the routing metrics. The performance of the proposed clustering algorithms and routing protocol are analyzed, and results show high throughput, high packet delivery ratio, and low communication cost compared with the existing baseline mobility management algorithms and routing protocols.