新一代IP QoS的实现

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

TCP/IP网络的动态模型描述

拥塞现象成为TCP/IP网络发展面临的一个重要问题。因此，拥塞控制对TCP/IP网络的鲁棒性和稳定性具有重要作用。目前，网络拥塞控制策略主要包括两类：端到端的控制机制，如TCP拥塞控制算法；网络内部的主动队列管理(AQM)策略。但由于缺乏对网络系统动态特性的了解，这些拥塞控制策略大都基于专家经验，并没有建立完整的理论分析框架。为此，本文从数据流的角度出发，通过建立网络基本单元状态方程模型来实现IP网络系统的数学解析模型，然后用混杂系统来描述TCP带有拥塞控制策略的数据传输过程，建立了TCP/IP网络的动态模型，为网络系统中动态性能的分析、拥塞控制策略的设计奠定了基础。实验结果表明，该数学模型与NS仿真实验的结果相一致。     

Jitter in ATM networks and its impact on peak rate enforcement

Cells arriving to an ATM network experience random delays due to queueing in upstream multiplexing stages, notably in customer premises. This is the phenomenon of jitter and the aim of the present paper is to study its influence on peak rate enforcement. We first introduce some general characterizations of jitter and then, describe two models of jittered flows based on simple queueing systems. We discuss the objectives of peak rate enforcement and study the impact of jitter on the dimensioning of jumping window and leaky bucket mechanisms. A useful synthetic characterization of jitter appears to be a remote quantile of the cell delay distribution expressed in units of the initial inter-cell interval.     

Tandem queues with general blocking: A unified model and comparison results

We study tandem queues with finite intermediate buffers and develop a general blocking scheme that unifies and generalizes various blocking schemes previously studied in the literature, such as manufacturing blocking, communication blocking, kanban blocking and its variations. In the general blocking scheme, job movement and service at each stage are controlled by three parameters, which represent, respectively, the upper limits (at that stage) on work-in-process inventory, finished goods inventory, and buffer space. We derive a set of recursive equations that characterize the dynamics of the system, in terms of the job completion and departure processes, and establish comparison results for these processes in the settings of stochastic ordering, variability ordering and stochastic convexity. Free of distributional assumptions, the results provide characterization of system behavior with respect to the control parameters as well as to the arrival and service processes. We also compare system performance under two different modes of operation: make-to-order versus make-to-stock, and demonstrate the trade-off between improving service and reducing inventory. Numerical studies are also presented to illustrate the diversity of performance trade-off, including composition of inventory, offered by the general model.Supported in part by NSF under grant ECS-89-96201.     

Decisive arrival law parameters and a general finite capacity queueing problem

This paper addresses the problem of finding the parameters of the arrival law which most significantly influence expected occupation and loss of a finite capacity queue. The input process is supposed to be ergodic and wide sense stationary. We show that it is mostly possible to fit an MMPP(2) to the decisive parameters of observational data. Numerical examples illustrate the importance of the decisive parameters, called key parameters, and also show the accuracy of the proposed fitting procedure. Finally, in the appendix we present the solution of the finite capacity queueing problem with Special Semi Markov Process (SSMP) arrivals and a general service strategy.     

A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution

The queue of a single server is considered with independent and identically distributed interarrivai and service times and an infinite (GI/G/1) or finite (GI/G/1/N) waiting room. The queue discipline is non-preemptive and independent of the service times.

A discrete time version of the system is analyzed, using a two-component state model at the arrival and departure instants of customers. The equilibrium equations are solved by a polynomial factorization method. The steady state distribution of the queue size is then represented as a linear combination of geometrical series, whose parameters are evaluated by closed formulae depending on the roots of a characteristic polynomial.

Considering modified boundary constraints, systems with finite waiting room or with an exceptional first service in each busy period are included.     

无线传感器网络MAC协议的性能改进研究

在无线传感器网络中,MAC协议决定着网络的信道分配,对网络的性能有很重要的影响。目前已研究出多种S-MAC协议,其中S-MAC协议是一种典型的无线传感器网络MAC协议,但此协议存在一定缺陷,无法更好地适应传感器网Jj络多变的特点。针对该问题,在S-MAC协议的基础上,结合了自适应退避窗口和根据节点队列长度预测流量的思想,提出了一种新的协议-Q-MAC协议,并达到了较为理想的预测效果。经NS2仿真验证,此协议在平均延迟、吞吐量、能量消耗方面较S-MAC协议有了显著提高。     

高速分组交换网络中调度器的设计

为了满足迅猛发展的网络业务对网络服务质量提出的更高要求,使用高速分组网络交换机中的队列调度器可以有效地提供高质量的网络服务。通过采用分级式队列调度和四种队列调度算法有效地实现了队列调度器的设计。并且深入地比较和分析了队列调度器中多种队列调度算法的优缺点,尤其是对DRR调度算法进行了优化和改进。最后。对所设计的电路进行了仿真验证和电路综合,结果表明该调度器可以满足网络对服务质量的更高要求,并且能够应用到高速分组交换网络的调度器设计中。     

医院排队叫号系统应用现状综述

为了减少患者在医院的滞留量和高效服务于患者,很多医院都采用了排队叫号系统。医院排队叫号系统产品繁多,医院的实施机制也各不相同,因此分析了目前医院排队叫号系统的应用现状,以及硬、软件实施情况,以求发现系统的主要组成部分和可更新、扩展部分。结合挂号方式、就诊流程优化和物联网技术分析了医院排队叫号系统的发展趋势,这对今后其他领域排队叫号系统的研究有参考意义。     

Multi-indicator Active Queue Management Method

A considerable number of applications are running over IP networks. This increased the contention on the network resource, which ultimately results in congestion. Active queue management (AQM) aims to reduce the serious consequences of network congestion in the router buffer and its negative effects on network performance. AQM methods implement different techniques in accordance with congestion indicators, such as queue length and average queue length. The performance of the network is evaluated using delay, loss, and throughput. The gap between congestion indicators and network performance measurements leads to the decline in network performance. In this study, delay and loss predictions are used as congestion indicators in a novel stochastic approach for AQM. The proposed method estimates the congestion in the router buffer and then uses the indicators to calculate the dropping probability, which is responsible for managing the router buffer. The experimental results, based on two sets of experiments, have shown that the proposed method outperformed the existing benchmark algorithms including RED, ERED and BLUE algorithms. For instance, in the first experiment, the proposed method resides in the third-place in terms of delay when compared to the benchmark algorithms. In addition, the proposed method outperformed the benchmark algorithms in terms of packet loss, packet dropping, and packet retransmission. Overall, the proposed method outperformed the benchmark algorithms because it preserves packet loss while maintaining reasonable queuing delay.