新一代IP QoS的实现

文章介绍了新一代IP骨干网上的IP QoS实现技术，论述了集成业务(IntServ)与差分业务(DiffServ)解决方案的特点，详细介绍了相关的队列管理与排队机制。并结合多协议标签交换（MPLS)技术的最新发展，阐述了综合多协议标签交换流量工程与DiffServ技术体系端到端IP QoS的实现。     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.     

On Burst Length Distribution and Preemption Probabilities in OBS Networks with Burst Segmentation

Recently, preemption techniques have attracted considerable attention as a means to provide differentiated quality of service in optical burst switching (OBS) networks. This paper is focused on the analysis of preemption probabilities for bursts within the same priority class. As proposed by Vokkarane and Jue ((2003)* IEEE J Select Areas Commun 21(7): 1198–1209) an incoming burst will preempt the burst in service, within the same priority class, if the residual length of the burst in service is smaller than the incoming burst length. For a general case with wavelength conversion, the preemption probability of contending bursts with a generic service distribution, not necessarily exponential, is analyzed. First, we show that the size distribution for the preempting bursts is shifted to larger values, in comparison to the original burst size distribution. Second, we obtain an upper and lower bound for the preemption probability. Finally, the asymptotic behavior of the OBS switch is analyzed showing that preemption will always occur for a very large number of wavelengths.     

小波变换分离太阳射电频谱图中的纤维结构

太阳射电爆发纤维精细结构是太阳射电爆发活动中一类重要的观测现象,利用二维小波变换对纤维精细结构动态频谱图进行处理,分离频谱图中的纤维结构。首先对原始频谱图实行多层小波变换,由低频分量重构原始图像,就可得到爆发的背景信息,令原始频谱图减去背景并经过阈值处理后,便可将原始频谱图中的纤维结构很好地分离出来。     

SDCCH信道话务量评估及最佳配置

本比较详细地阐述了SDCCH信道话务量的计算方法及在GSM网络中的配置原则，以便使网络资源达到最佳配置，发挥最大的经济效益。在论述中提出了3种方法：(1)建立SDCCH信道话务模型的方法；(2)评估SDCCH信道话务量的计算方法；(3)选择SDCCH信道最佳配置的方法。这3种方法供大家参考。     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

准移动闭塞系统的元胞自动机模型及列车延迟传播规律的研究

在NaSch模型的基础上，针对铁路交通的特点提出一种用于模拟准移动闭塞系统的元胞自动机模型.应用该模型模拟了准移动闭塞系统列车延迟传播的交通现象，分析了准移动闭塞系统中的轨道定位单元长度、发车时间间隔、初始延迟时间等因素对列车延迟传播的影响. 关键词： 元胞自动机 交通流 准移动闭塞     

2Mbit/s高速信令链路在移动通信七号信令网中的应用

通过对2Mbit/s高速信令链路原理、特点的介绍，阐明了该技术在现阶段使用的实际意义，并给出了2Mbit/s高速信令链路在移动通信七号信令网中的应用。     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

群发短消息对PHS网呼入成功率的影响分析

介绍了PHS网呼入成功率和短消息流程，依据短消息模型和性能统计结果分析了群发短信对PHS网呼入成功率的影响，并建议选择合理的时间进行短消息群发以减少对网络负荷的影响。