Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

基于ATM的网络互连方式

ＡＴＭ技术能否在数据通信网中广泛采用取决于其是否能高效地支持现有业务，其中主要为非连接业务。本文介绍了几种基于ＡＴＭ 的非连接业务支持方式和协议体系结构，对其进行了评述并对ＩＰ分组到ＡＴＭ信元的封装效率进行了分析。     

单小区模型的掉话率分析

掉话率是无线通信网络中最重要的关键性能指标(KPI)之一,本文分析了中国移动在讨论网络性能评估方法时提出的3个不同的掉话率计算公式,通过建立一个单小区的模型,使用一些合理的假设和分析,从理论上确定了一个最为准确的计算公式.     

基于数字CATV的超宽带技术研究

如何利用现有的数字CATV系统开展各种增值业务已成为一个重要课题.首先简要介绍了数字CATV和超宽带技术,然后给出了两种超宽带技术在现有数字CATV系统中的应用方案,利用这些方案可以有效地开展各项增值业务.     

《无线电频率划分规定》学习心得

主要介绍学习新的《无线电频率划分规定》的目的，《无线电频率划分规定》的特点，作了哪些重要修改和划分表的主要内容及如何贯彻执行《无线电频率划分规定》。     

固定式宽带无线接入技术--LMDS

本地多点分配业务(LMDS)是近年来在国际上兴起的固定式宽带无线接入技术,具有传输容量大、起始费用低的优点,受到了国内外电信业务经营者的普遍关注.文章介绍了LMDS提供的业务类型、工作频率、系统结构和标准化情况,并将LMDS与有线电视网络、ADSL、MMDS等现有的接入技术进行了比较.文章认为LMDS的商业推广尚需解决信号质量、服务区尺寸、费用等制约因素.     

Quality-of-Service Based Protection in MPLS Control WDM Mesh Networks

Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization.     

竞争环境下电信行业的普遍服务

以引入竞争为标志的电信领域改革以来，在竞争环境下如何实现作为原有垄断经营者政治使用命的普遍服务，成了世界各国政府，企业，学术界及国际电信机构共同关注的重大问题，我国是个发展中国家，电信的普通服务远没有完成。因此在借鉴国外经验的基础上，研究和探讨竞争环境下实现普遍服务的政策和策略具有十分现实的意义。     

与国际综合业务数字网连接的京,沪,穗国际交换机工程

本文介绍了在新建的北京、上海、广州、国际交换机工程中采用新一代程控交换技术接通国际综合业务数字网，以及本工程采用的中继方式。