Internet的访问时间分析

通过CAIDA组织提供的海量样本数据,首先对Internet访问时间进行分析,发现访问时间服从多峰重尾分布。在此基础上对Internet的访问直径与访问时间之间的关系从整体和局部样本进行研究,认为链路延迟是导致相近的访问直径其访问时间相差较大的主要原因,并提出修正算法从样本数据得到链路延迟。对链路延迟样本数据的统计结果表明,超过90%以上的路径其最大的链路延迟占访问时间的1/4以上,并以此定义了支配延迟。最后得出访问时间主要受支配延迟影响,正是由于支配延迟本身导致了相近的访问直径其访问时间存在较大差异的结论。     

无线传感器网络中基于链路质量的路径延时分析

基于链路质量给出了路径满足实时性概率的上界,并证明了计算其上界的时间复杂度为指数级。另外在考虑链路质量的基础上,提出了一种在给定的延迟阈值下最大化端到端数据分组发送成功概率的贪心算法(RROP)。根据给定的延迟阈值和链路质量,RROP算法通过设置每跳链路的最大重传次数来优化端到端数据分组发送成功的概率。证明该算法能够在多项式时间内找到最优解并且通过该最优解获得路径满足实时性概率的一个近似最优的下界。实验结果表明给出的路径延迟分析上界和下界是准确的,并且提出的RROP算法在节省能量和满足实时性上比传统的方法能够获得高出10%以上的性能。     

基于AODV路由协议和EPI路由协议的TCP性能分析

0引言 传统无线网络中的代表性路由协议是AODV（ad hoc on—demand distance vector routing）路由协议,在延迟容忍网络中的代表性路由协议是EPI路由协议。传统的AODV路由协议网络主要是首先建立一条完整的链路,然后进行可靠的传输;EPI路由协议主要是通过传染把建立TCP连接的3次握手消息发送到目的节点,然后进行可靠的传输。在通常端到端延迟较大的延迟容忍网络中,     

基于能量探测的WSN节点调度算法研究

针对无线传感器网络在节点传输过程中的延迟与链路质量问题,设计一种基于能量探测的节点休眠调度算法EAS,通过对节点插入苏醒时隙来减小端到端之间的延迟,并根据每个节点的剩余能量值进行能量探测,使整个网络中各节点的能量相对均衡地消耗,在保证传输质量的基础上达到延长网络的生命周期的目的。实验结果表明,对比现有算法,EAS算法能够在保证使WSN网络在延迟一定的情况下明显降低能耗,延长整个网络的工作寿命。     

多信道广播组总延误端到端延迟化路由问题

在高速分组交换环境中,提出了构造多信道广播树,且满足实时交互性应用端到端变化要求的总延误问题。多信道广播路由将寻找从源到包括所有多信道广播终端的一棵有根树。在多媒体应用中,关于路由问题有两种要求：最小总延误和延迟变化。在实践中链路延迟和终端延迟的概念是有区别的。重新定义延迟的概念,也就是端到端的路径延迟定义为截止延迟或界定延迟,延误成员数的延迟定义为松弛延迟。终端的松驰延迟具有的特征是沿着一棵树从     

传输延迟感知的多路径并发差异化路径数据分配算法

针对多路径并发传输模型的整体性能在部分通信路径性能突变时会急剧下降的多种原因进行分析,选取对性能影响最大的因素(传输延迟)进行了优化,提出了一种针对多路径并发传输模型的传输延迟感知的路径数据分配算法。通过结合各条通信路径的实际传输延迟来分配多条通信链路的数据发送量,以及各条路径上发送的数据分组序号,减少路径性能恶化对多路径并发传输模型整体性能带来的影响。分析和实验结果表明,本算法能够相对默认的轮询数据分配算法取得较好的运行性能。     

多路径并行传输中传输路径选择策略

该文首先在实验分析的基础上,发现在互联网端到端传输层多路径并行传输(CMT)中,当端到端关联中路径间的特性参数如丢包率和延迟存在较大差异时,部分路径并行传输的吞吐量优于全部并行传输的吞吐量,从而论证了多路径并行传输情况下传输路径选择的必要性及对传输性能的影响。其次,建立了路径吞吐量与不同丢包率和延迟的拟合关系,并以路径吞吐量为路径权值,提出了一种基于路径权值的传输路径选择策略CMT-PW(Path Weight),给出了该策略的算法实现和相应的伪代码实现。仿真实验表明,CMT-PW策略优于传统CMT策略。     

基于路径稳定性的MAODV路由协议的改进

在Ad Hoc网络中,节点随意快速的移动通常会造成网络拓扑结构的剧烈变化,可能导致传输链路断裂和路径的不稳定。针对这种情况,在分析现有MAODV路由改进技术的基础上,提出了一种改进的、基于路径稳定性的路由协议(RS-MAODV)。新协议与MAODV不同的地方在于:考虑构成路径的链路间的相关性,选择最稳定的路由进行数据传输,以此改善网络性能。利用NS2仿真工具对改进前后网络的丢包率及端到端延迟参数做比较,实验数据表明,改进后协议的网络丢包率及端到端延迟均得到改善。     

多信道广播组总延误端到端延迟变化路由问题

在高速分组交换环境中,提出了构造多信道广播树,且满足实时交互性应用端到端变化要求的总延误问题.多信道广播路由将寻找从源到包括所有多信道广播终端的一棵有根树.在多媒体应用中,关于路由问题有两种要求:最小总延误和延迟变化.在实践中链路延迟和终端延迟的概念是有区别的.重新定义延迟的概念,也就是端到端的路径延迟定义为截止延迟或界定延迟,延误成员数的延迟定义为松驰延迟.终端的松驰延迟具有的特征是沿着一棵树从源到任何一个终端的累积延迟可以超过松驰延迟的值.确定这样一棵约束树的问题是NP-完全的.由时间的复杂性和动态成员的灵活性,提出了一个有效的启发式算法.     

互联网网络时延特征研究

互联网宏观拓扑结构下时延特征的研究对互联网结构与性能的理解具有重要作用。择取CAIDA Ark项目下分别位于4个不同地区的探测数据,提取网络时延与通信直径,发现网络时延与通信直径关系很小且超过70%的有效路径中存在支配时延。经分析,正是支配时延的存在影响了网络时延与通信直径的关系。对支配时延链路两端进行地理映射,发现支配时延以较高概率出现在同一国家同一城市某一链路传输之间。在此基础上,得出链路两端距离小于5 000 km的支配时延主要由排队时延组成,而链路两端距离大于5 000 km的支配时延主要由传播时延组成的结论。     

基于链路重构—解构的端到端网络链路时延推测研究简

基于网络时延推测的2个假设、时延推测模型和路径时延数据采集方法,提出了一种基于链路重构—解构的端到端网络链路时延推测方法,应用伪似然估计将原整体问题分解为若干独立子问题分别求解,利用链路重构—解构确定可求解的推测单元,控制平均采样精度和减少推测单元链路数,从而显著降低计算复杂度。通过基于模型的计算和基于NS2的仿真实验研究,验证了推测方法的准确性和有效性。     

非时钟同步的单向排队时延测量估计方法

提出了一种测量和估计网络端到端单向排队时延的新方法。与消除时钟偏差和时钟频差的现有方法相比,新方法完全不需要测量端之间的时钟同步。探测分组之间的发送和到达时间间隔在两端分别测量,然后利用傅立叶域-时间域的迭代重构算法估计端到端单向排队时延的分布特性。仿真和分析结果表明新方法具有很好的实时性、准确性和顽健性。     

Multicast-based inference of network-internal delay distributions

Packet delay greatly influences the overall performance of network applications. It is therefore important to identify causes and locations of delay performance degradation within a network. Existing techniques, largely based on end-to-end delay measurements of unicast traffic, are well suited to monitor and characterize the behavior of particular end-to-end paths. Within these approaches, however, it is not clear how to apportion the variable component of end-to-end delay as queueing delay at each link along a path. Moreover, there are issues of scalability for large networks. In this paper, we show how end-to-end measurements of multicast traffic can be used to infer the packet delay distribution and utilization on each link of a logical multicast tree. The idea, recently introduced in Caceres et al. (1999), is to exploit the inherent correlation between multicast observations to infer performance of paths between branch points in a tree spanning a multicast source and its receivers. The method does not depend on cooperation from intervening network elements; because of the bandwidth efficiency of multicast traffic, it is suitable for large-scale measurements of both end-to-end and internal network dynamics. We establish desirable statistical properties of the estimator, namely consistency and asymptotic normality. We evaluate the estimator through simulation and observe that it is robust with respect to moderate violations of the underlying model.     

基于线性规划的Internet端到端时延的估计

测量Internet端到端时延特征是研究Internet端到端分组行为的重要内容之一,它能够应用于QoS(Quality of Service),SLA(Service Level Agreement)的管理、拥塞控制算法研究等许多方面.常用的端到端时延测量方法大多依赖于GPS接收机或采用NTP协议来实现收发端时钟的同步,但由于GPS接收机价格较高不可能每台主机都能配备, NTP协议的精度不能满足要求。该文基于线性规划的方法估计收发时钟的频差、相对时钟偏差等参数,以获得端到端时延的估计。作者在几条不同的链路上进行了测试,结果表明该方法能有效消除收发时钟不同步的影响。     

Virtual network function deployment strategy based on improved genetic simulated annealing algorithm in MEC

In order to effectively improve the end-to-end service delay of the flow in multi-clusters coexisting mobile edge computing (MEC) network,a virtual network function deployment strategy based on improved genetic simulated annealing algorithm was proposed.The delay of mobile service flow was mathematically modeled through the open Jackson queuing network.After proving the NP attribute of this problem,a solution combining genetic algorithm and simulated annealing algorithm was proposed.In this strategy,the advance mapping mechanism avoids the possibility of network congestion,and the occurrence of local optima was avoided through using the methods of individual judgment and corrective genetic.Extensive simulation was set up to evaluate the effectiveness of the proposed strategy under different parameter settings,such as different volume of requests,different scale of service nodes,different number of MEC clusters,and logical link relationships between virtual network functions.Results show that this strategy can provide lower end-to-end services delay and better service experience for latency-sensitive mobile application.     

Tandem Queue Models with Applications to QoS Routing in Multihop Wireless Networks

We consider the problem of quality of service (QoS) routing in multi-hop wireless networks where data are transmitted from a source node to a destination node via multiple hops. The routing component of a QoS-routing algorithm essentially involves the link and path metric calculation which depends on many factors such as the physical and link layer designs of the underlying wireless network, transmission errors due to channel fading and interference, etc. The task of link metric calculation basically requires us to solve a tandem queueing problem which is the focus of this paper. We present a unified tandem queue framework which is applicable for many different physical layer designs. We present both exact and approximated decomposition approaches. Using the queueing framework, we can derive different performance measures, namely, end-to-end loss rate, end-to-end average delay, and end-to-end delay distribution. The proposed decomposition approach is validated and some interesting insights into the system performance are highlighted. We then present how to use the decomposition queueing approach to calculate the link metric and incorporate this into the route discovery process of the QoS routing algorithm. The extension of the queueing and QoS routing framework to wireless networks with class-based queueing for QoS differentiation is also presented.     

Dynamic cache allocation routing strategy of Internet of things satellite node based on traffic prediction

Aiming at the routing problem of low earth orbit (LEO) Internet of things (IoT) satellite systems,a dynamic cache allocation routing strategy based on traffic prediction for IoT satellite nodes was proposed.Firstly,the space-time characteristics of traffic distribution in the LEO coverage area were analyzed,and an end-to-end traffic prediction model was proposed.Then,according to the traffic prediction result,a dynamic cache allocation routing strategy was proposed.The satellite node periodically monitored the traffic load of the inter-satellite link,dynamically allocated the cache resources of each inter-satellite link between the neighboring nodes.The cache allocation process was divided into two phases,initialization and system operation.At the same time,the traffic offload and packet forwarding strategy when the node was congested was proposed.By comparing the queuing delay and the forwarding delay,it was determined whether the data packet needs to be rerouted.The simulation results show that the proposed routing strategy effectively reduces the packet loss rate and average end-to-end delay,and improves the traffic distribution in the whole network.