基于DPI技术的NB-IoT端到端质量分析

NB-IoT(窄带物联网)业务在移动互联网上的应用越来越丰富,这也使得通信网络面临着业务流量端到端质量分析的考验。文章主要基于DPI (深度报文检测)技术对NB-IoT业务流量进行研究,通过建立端到端的指标体系,围绕四个阶段、六个关键指标、八个维度,实现定段定界的质量分析流程,将问题定界到点进行优化处理,确保用户业务使用感知。     

一种基于端到端多路径的最优化流量控制算法

 随着网络技术的发展,端到端多路径传输正在成为一个热点研究问题.本文研究了基于端到端多路径的最优化流量控制,提出了一种进行最优网络资源分配的分布式算法.该算法充分利用端到端多路径的路径多样性,达到有效的带宽利用和带宽聚合.通过证明,该算法在无时延条件下是全局渐进稳定的.仿真结果证明了该算法的快速收敛性和实用性.     

网络端端可靠度的上下界计算研究

考虑精确计算较大规模网络的端端可靠度属于NP—hard问题,提出一种计算网络端端可靠度的近似方法,算法分别基于最小路集和不交最短路集来计算网络端端可靠度的上下界,并在此基础上给出了示例来阐明算法的有效性,该计算方法的算法实现简单,能快速计算出网络的端端相对可靠度。     

大颗粒专线业务端到端造价评估

随着专线业务带宽的不断提升,大颗粒专线业务端到端造价评估变得愈发重要。以大颗粒专线业务端到端承载方式和经济评价理论为依据,提出了一种造价评估模型,并辅以案例分析。该模型全面考虑了主设备、管道、光缆和机房等成本,可以准确评估大颗粒专线业务的年均总成本费用,并对运营商定价进行指导。     

移动互联网端到端流量管控策略研究

本文通过对无线网络新技术和新架构的分析,针对2G/3G/LTE/WLAN多网络环境下,研究如何对不同的用户类型、业务类型、时间段、累积量进行QoS控制,以提升业务体验和用户满意度。基于PCC承载架构和ANDSF多连接管理机制,通过端到端的流量管控技术提升互联网带宽的使用率。借鉴都江堰水利工程原理,通过实施网络流量控制、均匀网络流量、降低并有效控制流量峰值,提出了移动互联网网络协同的融合策略控制方案,实现了合理配置网络资源、合理有效控制网络投资,为移动互联网业务发展创造条件,为移动互联网时代应对数字洪水做好充分的技术储备。     

一种运营商物联网端到端业务质量分析方法

【】：物联网业务承载于无线网络之上,在提供丰富的行业应用的同时也面临着端到端业务流质量分析和监控的考验,本文通过建立物联网端到端指标体系、端到端问题分析定界方法、工单闭环管理等环节,实现对物联网主流业务客户感知问题的发现、处理、考核评估的闭环管理,确保用户业务感知。     

随机移动模型下移动自组网无序传输端到端延迟闭解分析

针对移动自组网端到端延迟在封闭形式分析方面的局限性,该文提出一种有效的针对无序传输,单副本两跳中继算法的网络延迟建模方案,并给出其严格的理论延迟上界。首先针对多种随机移动模型,证明了移动节点的相遇间隔时间可归纳为统一表达式。然后,综合分析了媒介竞争、流量竞争、排队延迟等问题,合理划分并精确求解出了各延迟关键时间段,从而构造了数据包排队服务模型。最后推导出移动自组网端到端延迟的封闭形式理论上界。仿真结果表明,该理论延迟与实验数据紧密吻合。     

IP城域网端到端QoS部署与优化研究

当前IP城域网负责的新业务给原本的网络传送方式带来了挑战,若想提升IP城域网负责业务的综合承载能力,则需要优化QoS技术。通过分析IP城域网端到端的QoS部署原则,围绕服务模式、分类、流量调整、网络拥塞解决等方面探究QoS部署和优化策略,为运营商解决QoS部署存在的问题并提供指导,总结QoS部署与优化策略的关键点。     

上海贝尔端到端LTE解决方案

本文介绍了上海贝尔的LTE端到端解决方案,包含eUTRAN,ePC,移动网络演进传送构架(META)和业务分发环境(SDE)。阐明了上海贝尔基于统一通用平台、融合演进的eNode B对2G/3G网络的向下兼容能力;提供高效QoS保障和业务流量管理的分组演进核心;提出全新的传送网络构架来支持2G/3G和LTE网络混合传输;开放的业务开发平台支持SP快速推出业务;站在产业链的角度,协助电信运营商构建整个LTE生态系统。     

基于业务特征的TDD-LTE端到端QoS参数研究

针对移动互联网快速发展对无线接入网的高带宽和业务质量需求,首先进行了常用的移动互联网业务研究分析;其次,依据业务特性、3GPP网络协议规范和本地已部署的TDD-LTE网络结构,提出了端到端QoS设置模型;最后,在商用网络上进行QoS 参数部署验证。研究结果表明：在典型高速率业务环境下,TDD-LTE单小区峰值调度用户数增加253.92%;在现网混合业务拥塞环境下,TDD-LTE 单小区峰值调度用户数增加81.80%。研究结果具备良好的行业应用性和推广性。     

A compressive sensing‐based network tomography approach to estimating origin–destination flow traffic in large‐scale backbone networks

A traffic matrix can exhibit the volume of network traffic from origin nodes to destination nodes. It is a critical input parameter to network management and traffic engineering, and thus it is necessary to obtain accurate traffic matrix estimates. Network tomography method is widely used to reconstruct end‐to‐end network traffic from link loads and routing matrix in a large‐scale Internet protocol backbone networks. However, it is a significant challenge because solving network tomography model is an ill‐posed and under‐constrained inverse problem. Compressive sensing reconstruction algorithms have been well known as efficient and precise approaches to deal with the under‐constrained inference problem. Hence, in this paper, we propose a compressive sensing‐based network traffic reconstruction algorithm. Taking into account the constraints in compressive sensing theory, we propose an approach for constructing a novel network tomography model that obeys the constraints of compressive sensing. In the proposed network tomography model, a framework of measurement matrix according to routing matrix is proposed. To obtain optimal traffic matrix estimates, we propose an iteration algorithm to solve the proposed model. Numerical results demonstrate that our method is able to pursuit the trace of each origin–destination flow faithfully. Copyright © 2014 John Wiley & Sons, Ltd.     

一种基于控制平面测量的光突发交换网络动态偏置时间算法

该文提出一种基于控制平面背景流量测量方法的动态偏置时间算法。该算法以控制平面的探测突发丢失率为依据,估计瓶颈核心节点的背景流量,并据此动态设置偏置时间。理论分析和仿真表明:该算法能够在满足目标早到丢弃率的前提下,得到较适中的偏置时间,从而实现时延与早到丢弃率的较好折中。     

实时WDM网络的全光流量疏导算法

为解决波分复用(Wavelength Division Multiplexing,WDM)网络中实时性业务流疏导问题,提出一种考虑了网络端对端延迟的疏导算法.建立了WDM网络模型和实时消息模型,用网络演算理论分析了有连续时隙和没有连续时隙分配下实时消息的端对端的最大延迟,并推导出了算法的延迟关键性参数时隙距离.提出的实...     

基于AODV的自组网QoS路由协议

该文在AODV协议的基础上,设计了保证实时业务服务质量的路由协议Q-AODV。该协议针对无线环境的共享媒体特性,定义了节点的共享频率集,以节点周围的剩余可预约带宽作为路由度量的主要参数,回避可能发生拥塞的链路,同时提高了网络的整体效率。仿真结果表明:该算法保证了实时业务的服务质量,在数据包的传输时延和网络的分组递交率方面优于原有协议。     

An all hops optimal algorithm for dynamic routing of sliding scheduled traffic demands

We consider dynamic routing of holding-time aware demands under a sliding scheduled traffic model to satisfy demands' bandwidth and timing requirements. We propose an all hops optimal routing algorithm that iteratively finds all feasible paths of at most h hops at the end of h-th iteration. We prove the correctness and analyze the time complexity of the algorithm.     

Adaptive Input Traffic Prediction Scheme for Absolute and Proportional Delay Differentiated Services in Broadband Convergence Network

In this paper, an algorithm that provides absolute and proportional differentiation of packet delays is proposed with the objective of enhancing quality of service in future packet networks. It features an adaptive scheme that adjusts the target delay for every time slot to compensate the deviation from the target delay, which is caused by prediction error on the traffic to arrive at the next time slot. It predicts the traffic to arrive at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized by the delay control operation for the next time slot to offset it. Because the proposed algorithm compensates the prediction error continuously, it shows superior adaptability to bursty traffic and exponential traffic. Through simulations we demonstrate that the algorithm meets the quantitative delay bounds and is robust to traffic fluctuation in comparison with the conventional non‐adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA, and the performance is verified under the test board based on the XPC860P CPU.     

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

In the context of multi‐protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraint‐based shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint‐based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end‐to‐end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end‐to‐end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end‐to‐end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.     

支持向量机在交通量预测中的应用

交通量预测对于区域交通规划有重要意义。提出一种基于支持向量机理论的交通量预测方法。该方法以统计学习理论为基础，通过和BP神经网络进行比较的实验，证明其在交通量预测中的有效性。     

An Optimum Traffic Loading to Intersatellite Links

An algorithm has been developed to evaluate the benefits of intersatellite links (ISL's) quantitatively in satellite communications networks. The developed algorithm derives the minimum satellite capacity, under the condition that the same type of satellites are located onto the geostationary orbit, by assigning traffic among earth stations to the satellites effectively. Some example calculations are presented, based on a current INTELSAT database. The calculated results indicate that the benefits of ISL depend strongly on the distribution pattern of traffic in the network. They demonstrate, furthermore, that ISL's over long distances have significant potential advantages in the Atlantic and Pacific Ocean regions for accommodating a large volume of traffic, and enabling the effective utilization of satellite resources at high elevation angles.     

话务承载能力评估比较算法应用与拓展

在相关文献对蜂窝无线网络话务承载能力比较评估算法,以及基于测量统计的小区区权重向量算法、统计时分话务峰值算法等无线网络频率分配优化算法研究的基础上,对应不同干扰矩阵优化算法方案,给出了计算无线网络话务承载能力增益中测量统计干扰概率总量的具体算法过程。同时,为了对蜂窝无线网络的实时性能进行更有效、更准确的监测,作为算法理论的提升,对蜂窝无线网络话务承载能力比较评估算法进行了连续性拓展。