基于信令的TD-SCDMA网络数据业务时延优化

分析和优化用户使用数据业务的感知,是目前三大运营商的网络优化人员主要工作之一。业务时延作为与客户感知相关的重要指标之一,对其进行优化,可在一定程度上提高用户的数据业务感知。本文从信令角度出发,分析可能导致用户上网时延较长的原因,并结合实际的测试情况,得出降低RAB建立时长可很大程度降低用户上网时延,并给出和验证中兴设备降低RAB建立时长的方法。     

基于TCP无线侧时延关联构建客户感知体系的研究

在数据业务的使用感知上,上网速率慢是一直以来都存在的问题,最集中体现就是登陆网络、浏览网页时间较长,从无线网络专业的角度看就是时延较大.文章主要基于TCP无线侧时延分析,并利用熵权法、QoE评价体系,结合无线优化关键性能指标,关联分析研究建立客户感知体系,从而实现优化提升客户感知质量.     

WCDMA网络数据业务时延性能的提升

数据业务时延是影响用户感知的主要因素.对影响数据业务时延的情况做了深入分析,并提出服务器、核心网、无线侧三个方面的优化策略.验证表明,采取上述优化策略后,数据业务时延指标提升效果明显,对数据业务优化有较好价值.     

CDMA2000 1X数据业务呼叫时延优化研究

随着多媒体业务的快速发展,数据业务QoS正成为移动通信领域关注的焦点,而呼叫时延作为数据业务QoS中的一部分内容,成为影响用户感知度不可或缺的重要部分。如何优化接入流程,减少接入时延,提高用户感知度,成为网络优化人员的重要课题。文章针对CDMA2000 1X数据业务的接入时延相关进程进行详细分析,进而结合典型网络的测试结果,对数据业务呼叫时延的优化进行深入探讨。     

移动网络用户频繁鉴权问题的优化方案探讨

为减少移动用户上网时延,进一步改善用户上网感知,通过分析投诉用户的业务记录,发现3G网络存在频繁鉴权问题。以对比分析不同移动网络的参数设置为路径,在保证网络安全的前提下,对网络参数进行合理优化,大幅减少了不必要的鉴权流程,缩短了用户上网时延,并有效提升了用户的上网体验。     

一种“八元八阶”的4G数据业务感知提升方法A method named “ba-yuan-ba-jie”to improve the QoS of 4G 张燕 彭鹏 赵业祯

快速并准确的定位4G数据业务投诉问题,是提高用户感知的有效方法之一。本文综合考虑用户上网需要经历的端到端节点和全业务流程,提出“八元八阶”的4G数据业务感知提升方法,实现对4G数据业务问题进行逐段和分域分析,不仅能够实现对4G数据业务问题快速、准确的分析,还能够进一步进行系统开发,实现系统自动化分析。     

基于载波自动均衡的3G综合下载速率优化

提高用户的数据业务感知,是目前各大运营商的主要工作之一。综合下载速率是与客户感知相关的重要指标之一,对其进行优化可在一定程度上提高用户的数据业务的速率感知。文章从TD-SCDMA(时分同步码分多址)无线帧结构和典型无线信道配置情况出发,提出通过实施载波自动均衡技术,可以提高用户的TD-SCDMA用户的综合下载速率。     

WCDMA网络分组RAB指配失败分析与优化

文章主要介绍了WCDMA网络中分组RAB指配的各种失败原因,并针对网络中出现较多的失败分析问题所在,总结出有效的优化方法,以降低现网RAB指配失败次数,提升RAB指配成功率和3G PDP激活指标,进而有效提升用户感知。     

WCDMA网络端到端优化的GET时延分析

GET是用户进行网页浏览的重要过程之一,找出影响GET时延的原因是端到端优化的基础和提高用户感知的关键。文章首先介绍端到端数据业务流程,然后从多个方面具体阐述GET时延分析,最后得出GET时延长是造成GET速率低的主要原因,并提出相应的网络优化建议。     

重庆移动电信日正式推出首款家庭物联网业务“宜居通”

近期．重庆移动完成基于用户感知的TD数据业务优化，有效解决了用户上网不畅的问题。     

Opportunistic packet scheduling algorithm for non-real-time service with a soft QoS requirement in a mobile broadband wireless access system

In this paper, we present a packet scheduling algorithm for a non-real-time service, with soft QoS requirements, which allows for degrading the QoS level, e.g., typically the packet delay, whenever necessary, in mobile broadband wireless Internet access systems. This algorithm is designed to properly trade off system throughput and delay performance, which can improve the system capacity by relaxing the delay constraint with respect to the underlying soft QoS requirement. This is as opposed to most of the existing packet scheduling algorithms for non-real-time service which are simply designed to maximize the system throughput without a delay constraint. The proposed adaptive exponential scheduling algorithm intentionally introduces additional delay to some users, especially under bad channel conditions, opportunistically allowing for serving users only under good channel conditions, as long as the resulting QoS degradation is acceptable for non-real-time service users. The results from a system-level simulation demonstrate that the system capacity can be significantly increased over existing algorithms, by as much as 65%, using the adaptive exponential scheduling algorithm while satisfying the given QoS-level requirements.     

VoIP语音时延的分析和研究

文章介绍了VoIP(IP网络上传送语音)语音质量的测试方法,分析了影响VoIP语音质量的主要因素:延迟、抖动、丢包率和时延.利用E模型定量地分析了语音质量与端到端时延的关系,通过建立数学模型,指出了VoIP 系统中主要的时延分量,并研究了这些时延分量产生的机理和影响它们的参数.在设计实际的VoIP系统时,可以通过优化影响时延分量的主要参数,改善VoIP系统的时延.     

新型光突发自适应控制协议INIA

为了进一步改善对QoS的支持,在研究了光突发交换网络的TAW、JET、INI等信令协议的基础上,提出了一种新型光突发自适应控制协议INIA.INIA对网络中的控制信息包BCP中的BHP进行了扩充,增加了标识符Class,通过对Class值的控制,达到灵活控制INI改进节点位置的目的.仿真实验结果表明,INIA对提供满足各级业务要求的时延、丢包率等性能方面做出了改善,动态设定网络中的Class值可以更好地动态管理网络传输业务,更好地利用网络资源.     

On spatially disjoint lightpaths in optical networks

Within the communication networks, a delayed constrained data packet is the one that will be dropped if not being served before a certain deadline time, which causes data packet loss affecting the quality of service (QoS). In this paper, we study the blocking probability and the mean delay of such delay constrained packets in an asynchronous single-wavelength optical buffer in optical packet switching networks, where the packet arrival process follows the Poisson process and the packet-length distribution is assumed to be general. We obtain the integral equations of the modeled system and the exact expressions of blocking probabilities and the mean delays. Numerical examples are provided to validate the results with interesting observations being highlighted.     

Next Generation Wireless Mobile System Efficient, Fair, Class Based Packet Scheduling Algorithm

Efficient utilization of network resources is a key goal for emerging broadband wireless access systems (BWAS). This is a complex goal to achieve due to the heterogeneous service nature and diverse quality of service (QoS) requirements of various applications that BWAS support. Packet scheduling is an important activity that affects BWAS QoS outcomes. This paper proposes a novel packet scheduling mechanism that improves QoS in mobile wireless networks which exploit IP as a transport technology for data transfer between BWAS base stations and mobile users at the radio transmission layer. In order to improve BWAS QoS the new packet algorithm makes changes at both the IP and the radio layers. The new packet scheduling algorithm exploits handoff priority scheduling principles and takes into account buffer occupancy and channel conditions. The packet scheduling mechanism also incorporates the concept of fairness. Performance results were obtained by computer simulation and compared to the well known algorithms. Results show that by exploiting the new packet scheduling algorithm, the transport system is able to provide a low handoff packet drop rate, low packet forwarding rate, low packet delay and ensure fairness amongst the users of different services.     

Efficient Uplink Bandwidth Request with Delay Regulation for Real-Time Service in Mobile WiMAX Networks

The emerging broadband wireless access technology based on IEEE 802.16 is one of the most promising solutions to provide ubiquitous wireless access to the broadband service at low cost. This paper proposes an efficient uplink bandwidth request-allocation algorithm for real-time services in Mobile WiMAX networks based on IEEE 802.16e. In order to minimize bandwidth wastage without degrading quality of service (QoS), we introduce a notion of target delay and propose dual feedback architecture. The proposed algorithm calculates the amount of bandwidth request such that the delay is regulated around the desired level to minimize delay violation and delay jitter for real-time services. Also, it can increase utilization of wireless channel by making use of dual feedback, where the bandwidth request is adjusted based on the information about the backlogged amount of traffic in the queue and the rate mismatch between packet arrival and service rates. Due to the target delay and dual feedback, the proposed scheme can control delay and allocate bandwidth efficiently while satisfying QoS requirement. The stability of the proposed algorithm is analyzed from a control-theoretic viewpoint, and a simple design guideline is derived based on this analysis. By implementing the algorithm in OPNET simulator, its performance is evaluated in terms of queue regulation, optimal bandwidth allocation, delay controllability, and robustness to traffic characteristics.     

Resource allocation for multiple classes of DS-CDMA traffic

We consider a packet data direct-sequence code-division multiple-access (DS-CDMA) system which supports integrated services. The services are partitioned into different traffic classes according to information rate (bandwidth) and quality of service (QoS) requirements. Given sufficient bandwidth, QoS requirements can be satisfied by an appropriate assignment of transmitted power and processing gain to users in each class. The effect of this assignment is analyzed for both a single class of data users and two classes of voice and data users. For a single class of data users, we examine the relationship between average delay and processing gain, assuming that ARQ with forward error correction is used to guarantee reliability. The only channel impairment considered is interference, which is modeled as Gaussian noise. A fixed user population is assumed and two models for generation of data packets are considered: (1) each user generates a new packet as soon as the preceding packet is successfully delivered and (2) each user generates packets according to a Poisson process. In each case, the packets enter a buffer which is emptied at the symbol rate. For the second traffic model, lowering the processing gain below a threshold can produce multiple operating points, one of which corresponds to infinite delay. The choice of processing gain which minimizes average delay in that case is the smallest processing gain at which multiple operating points are avoided. Two classes of users (voice/data and two data classes) are then considered. Numerical examples are presented which illustrate, the increase in the two-dimensional (2-D) capacity region achievable by optimizing the assignment of powers and processing gains to each class     

Buffer-aware resource scheduling scheme for LTE-A uplink relay-assisted network

Due to the constraint of single carrier frequency division multiple access （SC-FDMA） adopted in long term evolution （LTE） uplink, subcarriers allocated to single user equipment （UE） must be contiguous. This contiguous allocation constraint limits resource allocation flexibility and makes the resource scheduling problem more complex. Most of the existing work cannot well meet UE＇s quality of service （QoS） requirement, because they just try to improve system performance mainly based on channel condition or buffer size. This paper proposes a novel resource scheduling scheme considering channel condition, buffer size and packet delay when allocating frequency resource. Firstly, optimization function is formulated, which aims to minimize sum of weight for bits still left in UE buffer after each scheduling slot. QoS is the main concern factor here. Then, to get packet delay information, this paper proposes a delay estimation algorithm. Relay node （RN） is introduced to improve overall channel condition. Specific RN selection strategy is also depicted in the scheme. Most important of all, a creative negotiation mechanism is included in the subcarrier allocation process. It can improve the overall system throughput performance in guarantee of user＇s QoS requirement. Simulation results demonstrate that the scheme can greatly enhance system performance like delay, throughput and jitter.     

Routing protocol development for quality of service optimization of video‐on‐demand system over mobile ad hoc networks

A video‐on‐demand (VoD) application system over mobile ad hoc networks typically requires particular quality of service (QoS) parameters to be achieved. In this paper, we have proposed a novel QoS‐based routing protocol called as mobile VoD protocol. This protocol has been developed for improving the QoS of the mobile VoD system (normal Mobi_VoD approach). The protocol uses customer caching scheme for storing the first fragment of the entire video in the mobile customers and thereafter broadcast them when the new mobile customers missed the portion of the already transmitted first fragment for reducing the service delay of the customer, consequently optimizing QoS parameters. Various scenarios have been studied, and the efficacy of simulation results proves that the proposed system architecture in which the mobile customers use an ad hoc network caching scheme (mobile VoD protocol) is more efficient and performs better than the existing system (ad hoc on‐demand distance vector protocol) when compared in terms of QoS parameters such as the end‐to‐end delay, energy consumption, packet delivery ratio, throughput, and overhead.     

Analysis of M-LWDF fairness and an enhanced M-LWDF packet scheduling mechanism

Modified largest weighted delay first(M-LWDF)is a typical packet scheduling algorithm for supporting hybrid real-time services over wireless networks.However,so far,there is little literature available regarding the theoretic analysis of M-LWDF fairness.This paper gives a theoretic analysis of M-LWDF fairness,which shows that M-LWDF fairness is related to channel condition,packet’s arrival process and the ratio of quality of service(QoS)requirements of different service queues.Given service QoS requirements and other parameters related to channel model and packet’s arrival process,the fairness is merely related to the ratio of the number of users in the service queues.Based on the analysis,an enhanced M-LWDF algorithm(EM-LWDF)is proposed and demonstrated in this paper.EM-LWDF is strictly designed in light of the fairness criteria of QoS requirements,so its fairness is almost not related to the ratio of the number of users in the service queues,and the theoretical value of fairness index is equal to 1.Simulation results validate the theoretic analysis and show the effectiveness of EM-LWDF in improving fairness.