一种基于包排队方式的网络路径可用带宽探测方法

对IP网络路径带宽的探测是目前网络研究领域的一个热点。本文提出了一种针对端到端的网络、基于包排队方式的双向双步长网络路径可用带宽的探测方法。该探测方法由时延监视和UDP发送两个进程组成,基于包的排队时延来获取路径的可用带宽,并通过采用双向双步长的方法来递增或递减UDP包的发送速率。所提出的探测方法可以明显减少探测次数和运行时间,从而降低探测带来的开销。实验结果显示,所设计的方法和技术是可行的和有效的。     

A model based approach for improving router geolocation

This study outlines two novel techniques which can be used in the area of IP geolocation. First we introduce a detailed path-latency model to be able to determine the overall propagation delays along the network paths more accurately. The knowledge of accurate propagation delay values then leads to more precise geographic distance estimation between hosts and measurement nodes. Besides these distance values the evaluation process also takes into account the discovered topology between the measurement points, and end-to-end latency measurements as well. In addition to the application of the detailed path-latency model, we describe a method which utilizes high-precision one-way delay measurements to further increase the accuracy of router geolocation techniques. The precise one-way delay values are used as a “path-constraint” to limit the overall geographic distance between the measurement nodes. This approach can be used to localize all the network routers along the network path between the measurement nodes, but cannot be applied to end-host localization. The techniques introduced in this paper are validated in wide range of experiments performed in the ETOMIC measurement infrastructure and in PlanetLab.     

HMM delay prediction technique for VoIP

This paper proposes a new algorithm for predicting audio packet playout delay for voice conferencing applications that use silence suppression. The proposed algorithm uses a hidden Markov model (HMM) to predict the playout delay. Several existing algorithms are reviewed to show that the HMM technique is based on a combination of various desirable features of other algorithms. Voice over Internet protocol (VoIP) applications produce packets at a deterministic rate but various queuing delays are added to the packets by the network causing packet interarrival jitter. Playout delay prediction techniques schedule audio packets for playout and attempt to make a reasonable compromise between the number of lost packets, the one-way delay and the delay variation since these criteria cannot be optimized simultaneously. In particular, this paper will show that the proposed HMM technique makes a good compromise between the mean end-to-end delay, end-to-end delay standard deviation and average packet loss rate.     

一种端到端的有效带宽测量方法

有效带宽测量在服务器选择、覆盖网络路由选择和网络流量工程等方面有广泛的应用。通过分析发送频率与单向延时之间的关系,提出了一种基于多项式拟合的有效带宽测量方法PFAB（Polynomial Fitting for Available Bandwidth）。PFAB通过发送探测速率逐渐下降的探测包,并检测OWD的变化,推断探测速率和有效带宽之间的关系。当探测速率大于有效带宽时,OWD持续增长;在探测速率等于有效带宽时,OWD达到最大值,之后开始下降。NS-2仿真实验结果表明该方法能有效减少探测包数量,缩短探测时间,并且对网络造成的干扰小;在探测包瞬时频率变化较大时,可以快速到极值点,减少测量误差。     

BOND:一种双向的单路网络延时测量方法

用软件的方法进行单路网络延时的精确测量，需要解决两个端系统的时钟异步问题．现有的测量算法(如Ping和LPA)在测量精度和实时性方面存在着明显的不足，针对这些问题，本文提出一种双向的单路网络延时测量方法，新的延时测量算法对LPA算法进行了改进．实验结果表明，双向单路网络延时测量方法是一种十分有效的延时测量算法，特别适合于工程应用。     

网络主机时钟相对漂移模型研究

时钟同步是网络测量、管理的要求,由于时钟漂移现象的存在,难以实现精确的时钟同步。论文采用相对时钟代替绝对时钟,分析主机时钟相对漂移,建立了主机时钟相对漂移的线性模型,并由此推导出单向延迟修正模型。通过局域网范围内的主机时钟相对漂移和东南大学和瑞士之间的国际信道两端主机时钟漂移建立模型发现,相对漂移线性模型能很好地反映时钟漂移现象,并能够对两主机间的单向延迟进行修正。以相对时钟代替绝对时钟大大提高了时钟测量精度,减少了时钟同步的次数,降低了网络带宽的负担和主机资源的利用。     

End-to-end QoS guarantees for a network based on Latency-Rate Max–Min service curve

Recently, a number of studies have been made based on the concept of Route Interference to provide deterministic end-to-end quality of service (QoS) guarantees. Nonetheless, these studies tend to confine to a simple scheduling scheme and study the traffic in a single-class environment or the highest priority traffic in a multi-class environment. This is rather restrictive. In this paper, we propose a new general service scheme to service flows. This scheme is represented by a Latency-Rate Max–Min service curve (LRMMSC). Subsequently, for a network of LRMMSC, we prove the existence of tight bounds on end-to-end queuing delay and buffer size needed for loss-free packet delivery, provided that all flows obey a given source rate condition in the form of their route interference. Our approach has two salient features: (1) the general nature of the concept of service curve enables the service scheme to be implemented by many well-known scheduling disciplines, (2) the general network model adopted with no constraints on the manner of packet queuing makes the results applicable to many complex networks. In addition, we have also derived a concise expression of end-to-end delay bound that depends only on the service offered to the buffers containing the considered flow. This is very useful in practice as the expression is simple and requires minimum amount of information input. Simulation experiments are conducted to verify the LRMMSC model. The analytical and simulation results exhibit close resemblance. In addition, the advantage of LRMMSC scheme in providing maximum end-to-end delay is also demonstrated.     

无线传感网中数据传输延时优化的路由协议

针对无线传感器网络中存在的数据包丢失严重以及端到端延时较高的问题,提出了一种数据传输延时优化的路由协议（RPODTD）。首先,根据数据包传输结果对信道探测情况进行分类,引入有效探测占比与传输效率作为节点的评价指标;然后,通过实际延时以及理论延时的差值估算数据包的排队延时;最后,给定最大和最小排队延时阈值,根据排队延时所属的区间判断是否更改传输路径。在OMNeT++上进行的仿真实验中,与基于链路质量和延时的复合负载均衡路由协议（ComLoB）和拥塞避免多路径路由协议（CA-RPL）相比,RPODTD节点的平均端到端延时分别降低了78.87%和51.81%,节点丢包率分别降低了40.71%和68.43%,节点的死亡率分别降低了25.42%和44.62%。仿真结果表明,RPODTD能有效地减少端到端延时,降低丢包率,延长网络生命周期。     

Queuing network models of packet switching networks part 1: Open networks

An overview of the application of product-form queuing network models to the performance analysis of store-and-forward packet-switching networks is presented. Multiple routing chains are used to model the different routing behaviors of data packets. Queuing networks with open chains are considered in this paper. Kleinrock's formula for the mean end-to-end delay of packets is first derived. The application of this delay formula to optimal channel capacity assignment and optimal routing is discussed. Analytic results for the mean and distribution of the end-to-end delay of each chair are presented. The issue of fairness among chains is also addressed.The application of queuing networks with closed chains and population size constraints to the performance analysis of store-and-forward packet-switching networks is illustrated in a companion paper [1].     

JitterPath: Probing Noise Resilient One-Way Delay Jitter-Based Available Bandwidth Estimation

Measurement of end-to-end available bandwidth has received considerable attention due to its potential use in improving QoS. Available bandwidth enables the sending rate to adapt to network conditions, so that packet loss, caused by congestion, can be significantly reduced before error control mechanisms are finally employed. To this end, we propose a probing noise resilient available bandwidth estimation scheme, called JitterPath, which is adaptive to both the fluid and bursty traffic models. Two key factors, one-way delay jitter and accumulated queuing delay, are both exploited to predict the type of queuing region for each packet pair. Then, the bottleneck utilization information included in the joint queuing regions is estimated and used to quantify the captured traffic ratio, which indicates the relationship between the probing rate and available bandwidth. The contributions of our method are as follows: 1) JitterPath can work without being restricted to fluid traffic models; 2) since JitterPath does not directly use the bottleneck link capacity to calculate the available bandwidth, it is feasible for use in a multihop environment with a single bottleneck; and 3) JitterPath inherently reduces the impact of probing noises under the bursty cross traffic model. Extensive simulations, Internet experiments, and comparisons with other methods were conducted to verify the effectiveness of our method under both single-hop and multihop environments     

基于延时测量的端到端路径性能检测

网络路径的端到端性能直接决定了为用户提供服务的质量,网络路径性能的测量是网络运营和SLA(ServiceLevelAgreement)验证的重要组成部分。文章在描述端到端路径性能检测的一般性问题的基础上,提出了延时差平稳系数和绝对平稳系数作为测量检测网络路径性能的几个评价指标,作为已有的测量标准化工作的补充和利用网络测量进行端到端性能管理的参考方法。     

保证速率节点构成的网络中分组的传输特性研究

证明了在服务速率恒定的情况下，一个流的最长分组在任意节点都不会遭遇队列延时，随后该结论被推广到网络中更普遍的情形．并利用该结论分析了保证速率节点构成的网络中分组的端到端延时，得到了一个严格的端到端延时上限，网络仿真实验结果验证了前面得到的结论。     

Malicious node prevention and mitigation in MANETs using a hybrid security model

Mobile ad-hoc network (MANET) has got tremendous success and attention due to its self-maintenance and self-configuration properties or behavior. Based on wired and wireless networks, the network topology of MANETs changes rapidly by means of routing attacks. Hence, providing security to this infrastructure-less network is a major issue. The routing protocols for ad-hoc networks cope well with the dynamically changing topology but are not designed to accommodate defense against malicious attacker. Malicious nodes have opportunities to modify or discard routing information or advertise fake routes to attract user data to go through themselves. In this article, we discuss a hybrid technique using anonymity, one-way trapdoor protocol, hash functions, and elliptic curve cryptographic to mitigate attacks in the MANET. The simulation is carried on NS-2 and the simulation results are dissected on different system execution measurements, for example, packet send and received, packet dropped, average network throughput, end-to-end delay, and packet delivery ratio.     

Networked control with delay measurement and estimation

In research on networked control systems (NCSs), the performance of the control system is assumed to be affected by network-induced parameters such as delays, jitters, packet losses and link failures. In this paper, compensation methods are studied, in the framework of NCS while considering the protocol specifications. The aim is to propose two different methods for the control over a network, adaptive Smith predictor approach and robust control based approach, which are imposed by the accessible information about the network. First, a clock synchronization protocol is implemented in each device of the network, thereby providing the possibility of end-to-end delay measurement, and a compensation strategy based on this measurement and the adaptive Smith predictor approach is applied. Secondly, the end-to-end upper bound delay estimate is calculated on the basis of the network architecture and the traffic estimation, and then subsequently used in a robust control based compensation strategy. The switched Ethernet network is used as an example of the communication network of the NCS. The efficiency of proposed approaches is evaluated with Matlab simulation as well as in the experimental prototype.     

Hybrid one-way delay estimation for networked control system

One-way delay estimation in the forward and feedback channels is crucial for a networked control system (NCS) due to its important role in the reliability and availability design. Problems existing in current one-way delay estimation schemes are investigated in this paper. A novel hybrid one-way delay estimation scheme, utilizing the hybrid technique that contains an online monitoring mechanism and an end-to-end estimation method, is proposed to overcome the effects of network asymmetry and delay dynamics in the NCS. Therefore, accurate one-way delay values in the forward and feedback channels can be obtained. In the proposed scheme, only the delay value of the initial packet starting the control loop of the NCS is estimated by the online monitoring mechanism, all the other estimations are performed by the host using the end-to-end method. The experimental results demonstrate that the performance of the proposed novel hybrid one-way delay estimation scheme is better than the other current estimation schemes for the NCS in terms of its high accuracy in tracking delay values as well as requiring lower computation complexity of the system.     

自相似环境中端到端延迟上界

论文对网络队列系统性能定量分析新型数学工具——网络微积分学进行了归纳和总结,利用网络微积分学证明了利用分形漏桶整形器对自相似业务进行整形不会增加网络端到端延迟上界,计算了通用处理器共享下以分形漏桶包络轨迹为到达曲线和以速度等待时间函数为服务曲线的端到端延迟确定性上界。     

联合车速–队列感知的路边单元分组调度随机优化

路边单元(RSU)是车联网中为其无线覆盖范围内过往车辆提供信息服务的基础设施,路边单元间的分组传输可通过移动车辆"存储–载带–转发"的方式进行,其传输过程中分组的端到端时延由源RSU缓存中的排队时延与车辆载带过程的传播时延两部分组成.为使RSU间分组传输过程中平均端到端时延最小化,本文提出一种联合车速–队列感知的路边单元分组调度随机优化方法,该方法根据源RSU缓存队列长度和经过源RSU覆盖范围的车辆速度状态作分组调度决策.通过马尔科夫决策(MDP)框架对分组传输过程中的平均排队时延和平均传播时延进行分析,建立一个非线性平均端到端时延最小化问题并求解.仿真结果表明,所提出的RSU分组调度随机优化方法可以显著降低RSU间分组传输过程中的平均端到端时延,并提高系统中分组传输的吞吐量.     

链路带宽测量方法改进

链路带宽是网络性能分析，容量优化规划的基本指标，链路带宽测量常用的方法是VPS（variable packet size),但VPS具有误差累计和背景流量影响的缺陷，对VPS方法进行改进，提出和实现一个任意链路带宽测量方法PTVS（packet train with variable size)，消除逐跳测量造成的误差累计和背景流量影响，测量实验表明，PTVS具有精确，高效，迅速的特点，PTVS可测量的其他性能指标还包括RTT，单向延迟，丢包率，端到端瓶颈带宽以及链路利用率。     

Impact of queuing discipline on packet delivery latency in ad hoc networks

Delivering live multimedia streaming over ad hoc networks can improve coordination in battlefields, assist in disaster recovery operations, and help prevent vehicular traffic accidents. However, ad hoc networks often experience congestion faster than wired networks, leading to high end-to-end delays and jitter even for moderate traffic. This paper describes a partial remedy that applies to delay sensitive but loss tolerant applications such as live streaming. We find that under relatively high UDP traffic load, the Last-In–First-Out (LIFO) with Frontdrop queuing discipline achieves less than half the delay of the commonly used First-In–First-Out (FIFO) with Taildrop, while maintaining similar jitter. In low traffic situations, FIFO and LIFO have similar delays, but FIFO with Frontdrop has the lowest jitter. The results can be applied to an adaptive queuing mechanism that changes the queuing discipline at nodes function of the locally observed traffic load. The advantage of such an approach is that it does not require new protocols and does not incur any network overhead.     

单向延迟测量中时钟动态性检测算法

延迟是评价网络性能的重要指标,也是进行其他网络性能指标测量的基础.基于全球定位系统(GPS)的端到端(end-to-end)时钟同步是测量网络单向指标的常用方法,但是其代价昂贵且缺乏灵活性.在无端到端时钟同步机制下进行网络单向延迟指标测量的关键是消除时钟偏差效应的影响.基于对时间序列分段技术的分析,提出了一种新的时间序列分段标准与改进的分段算法,实现序列的自动聚类,其时间复杂度为O(N²).将该算法应用于检测端到端时钟的动态性,识别测量过程中时钟跳变和时钟频率调整位置,实现对网络单向延迟的测量,弱化了同类工作中对时钟动态性的严格假设.同时提出了基于滑动窗的在线实时时钟动态性检测算法.实际测试实验表明,该算法是行之有效的.