GSM-R网络QoS对CTCS-3级列控系统车-地数据传输的影响

首先介绍了铁路整体运营服务质量(QoS)指标,提出利用自顶向下方式拆解,定义相应的GSM-R网络电路域QoS指标的具体内容,阐述了QoS指标对CTCS-3级车-地数据传输的影响。然后着重描述了QoS指标与CTCS-3级车-地数据传输的相互作用关系,并分析了在QoS指标已知合格的条件下,如何设置CTCS-3级数据传输的参数以更好地适应GSM-R网络的特性。     

高铁环境下基于QoS用户业务的公平性功率分配算法

鉴于高速铁路(HSRs)通信业务的多样性,侧重于单一类型业务的传输优化方案,已无法满足用户业务服务质量(QoS)差异性显著提升的需求。针对HSRs通信环境,将用户业务分为时延敏感业务和时延非敏感业务,以满足用户QoS需求且同时兼顾占用无线信道的公平性为优化目标,研究了基站(eNB)平均发射功率约束条件下的功率分配问题。根据eNB能否预先获知用户的期望速率,分别采用了基于用户期望和基于预分配的功率分配策略。仿真结果表明,ε-Optimal比例公平算法的eNB发射功率较高且用户满意度较低;信道反演算法只针对时延敏感用户能较好地满足其QoS(最大耐受时延映射的期望速率),并且固定功率分配算法仅能够满足时延非敏感用户的QoS,两种算法均无法保证用户间的公平性;所提算法既具有较高的用户满足度,又较好地保证了用户间的公平性。     

QoS awared power and admission controls based on non-cooperative game theory in wireless networks

In order to better accommodate heterogeneous quality of service (QoS) in wireless networks, an algorithm called QeS-aware power and admission controls (QAPAC) is proposed. The system is modeled as u non- cooperative game where the users adjust their transmit powers to maximize the utility, thus restraining the interferences. By using adaptive utility functions and tunable pricing parameters according to QoS levels, this algorithm can well meet different QoS reqniremcnts and improve system capacity compared with those that ignore the QoS differ- ences.     

Optimization models for differentiating quality of service levels in probabilistic network capacity design problems

This paper develops various chance-constrained models for optimizing the probabilistic network design problem (PNDP), where we differentiate the quality of service (QoS) and measure the related network performance under uncertain demand. The upper level problem of PNDP designs continuous/discrete link capacities shared by multi-commodity flows, and the lower level problem differentiates the corresponding QoS for demand satisfaction, to prioritize customers and/or commodities. We consider PNDP variants that have either fixed flows (formulated at the upper level) or recourse flows (at the lower level) according to different applications. We transform each probabilistic model into a mixed-integer program, and derive polynomial-time algorithms for special cases with single-row chance constraints. The paper formulates benchmark stochastic programming models by either enforcing to meet all demand or penalizing unmet demand via a linear penalty function. We compare different models and approaches by testing randomly generated network instances and an instance built on the Sioux–Falls network. Numerical results demonstrate the computational efficacy of the solution approaches and derive managerial insights.     

服务质量(QoS)在IP视频监控中的应用

QoS技术是一种有效提高IP网内视频数据传输质量的技术,文章介绍其设计思想和实现细节,给出承载视频监控的IP网络内配置QoS的具体过程,以使该技术应用于IP视频监控领域.     

MPLS技术及其应用

MPLS技术是对传统IP over ATM技术的改进，其基本思想就是边缘的路由和核心的交换。本文简要介绍了网络交换技术的历史及其演变过程。接着介绍了MPLS的体系结构、信令协议和QoS。最后，介绍了MPLS的应用。     

无线网络自适应带宽预留的准入控制技术研究

未来无线网络不仅向用户提供非实时的数据业务同时也提供实时的诸如话音、视频等多媒体业务，这就要求无线网络必需向用户提供不同要求的服务质量保证。提出一种基于自适应带宽预留的呼叫准入控制方案，该方案不仅考虑了切换呼叫优先于新呼叫，还考虑到实时业务对非实时业务的优先级，并将实时业务的掉线概率控制在预定的门限值以下，有效地保证各类业务的服务质量。     

Performance of Adaptive Web Server with QoS Pre-estimate

The heterogeneity in the communicating terminals needs to be handled through software-supported adaptation. A QoS （quality of service） pre-estimation for user admission control and system load control is proposed. In the QoS pre-estimation, the content quality and wait time characteristics are combined together. The feedback control that acts as an adjuster of the input parameters of the pre-estimate module to improve the estimate accuracy is also described in detail. Test results show that the service quality control mechanism is effective, and the system capacity can be improved.     

基于蚁群算法的多QoS约束的多播路由优化算法

蚁群算法是一种新型的随机优化算法,能有效地解决QoS受限的多播路由问题.文中基于蚂蚁具有找到蚁巢与食物之间的最短路径的工作原理,并在分析多约束QoS的多播路由的基础上,提出了一种具有全局优化能力的多播路由算法(OQMRA),仿真实验表明了该算法是合理的和有效的.     

A PARALLEL SWITCH FABRIC BASED ON CROSSBAR

With the increase of link rate, the arbitrator of centralized switch fabric becomes too complicated to implement. A parallel switch fabric based on crossbar, named as PSFBC （Parallel Switch Fabric Based on Crossbar）, has been proposed in this paper. PSFBC is composed of k switches whose rate is 1/k of link, these switches exchange cells in parallel; this increases the arbitrator＇s period and make it easy to implement. Load is evenly distributed to each switch with FCFS （First Come First Serve） rule, it can keep the order of cells in one stream. A multi-class queue scheduling policy is used in PSFBC to ensure the quality of realtime streams. Experiments show that the load on each switch in PSFBC is well balanced, its average delay of cells is little and its performance is very close to centralized switch; and with the increase of number of parallel switches, the loss of PSFBC＇s performance keeps very small, it becomes easier to implement.