基于IP网络规划与设计的抖动模型的研究

提出了一个典型的模型,该模型考虑到包延时的相关性和串联队列的相关性,这对端到端的抖动有重要影响。针对一个单队列的Poisson流量分布的抖动,给出了一个非常易于计算的公式,然后推广到基于串联队列的标记流的端到端抖动。通过模拟实验可以发现,模型的分析值和模拟值基本吻合,在大流量背景下更为精确,更重要的是对于抖动而言该值是可信的,这样就可以用于网络设计过程中。     

Fuzzy service control of queueing systems

We consider queueing systems in which the service rate is the controlled variable. The cost depends on the queue length and selected rate. The objective is to choose the service rate dynamically, based on the state of the system so as to minimize the average cost over an infinite horizon. Six classes, either known in the literature or new, are studied in detail: queueing systems with vacations, single-server queueing systems with and without switching costs, and tandem queueing systems with and without service costs. A novel approach is presented here using fuzzy control to solve these problems. Simulation shows that the approach is efficient and promising, especially in cases where analytical solutions do not exist.     

On the nonstationary Erlang loss model

Nonstationary loss queueing system (Erlang model) is considered. We study weak ergodicity, bounds on the rate of convergence, approximations, bounds for limit characteristics.     

Delay-jitter control in multimedia applications

The growing needs of multimedia communications are leading to new developments in providing real-time communication with guarantees. Several extensions have been proposed for different layers of the Open Systems Interconnection Reference Model to accomodate these needs. In this paper, we study methods for guaranteeing delay jitter bounds for high-speed networks in the network and application layers of this model. The method proposed for the network layer provides distributed jitter control. The method proposed for the application layer allows the destination application to control delay jitter. We use a simulation to compare the effects on delay jitter in each method for various scenarios, such as constant bit rate, cross traffic, and bursty data. In addition, the buffer space requirements for accommodating real-time channels are monitored at each node in the network.     

Fast techniques for the optimal smoothing of stored video

Work-ahead smoothing is a technique whereby a server, transmitting stored compressed video to a client, utilizes client buffer space to reduce the rate variability of the transmitted stream. The technique requires the server to compute a schedule of transfer under the constraints that the client buffer neither overflows nor underflows. Recent work established an optimal off-line algorithm (which minimizes peak, variance and rate variability of the transmitted stream) under the assumptions of fixed client buffer size, known worst case network jitter, and strict playback of the client video. In this paper, we examine the practical considerations of heterogeneous and dynamically variable client buffer sizes, variable worst case network jitter estimates, and client interactivity. These conditions require on-line computation of the optimal transfer schedule. We focus on techniques for reducing on-line computation time. Specifically, (i) we present an algorithm for precomputing and storing the optimal schedules for all possible client buffer sizes in a compact manner; (ii) we show that it is theoretically possible to precompute and store compactly the optimal schedules for all possible estimates of worst case network jitter; (iii) in the context of playback resumption after client interactivity, we show convergence of the recomputed schedule with the original schedule, implying greatly reduced on-line computation time; and (iv) we propose and empirically evaluate an “approximation scheme” that produces a schedule close to optimal but takes much less computation time.     

延迟锁相环的Verilog-A精确建模与仿真

分析了噪声以及器件失配对延迟锁相环的抖动影响,并对延迟锁相环的各模块进行了Verilog-A精确建模和性能仿真。仿真结果表明,器件失配对延迟链中间相输出的抖动影响最大,产生了约50ps的偏移;而噪声对延迟链最后一相输出的抖动影响最大,其peak-to-peak抖动值达到85ps。另外,与电路晶体管级仿真相比,通过Verilog-A建模节省了大量仿真时间,极大地提高了设计效率。     

A review on queueing network models with finite capacity queues for software architectures performance prediction

A review is carried out on how queueing network models with blocking have been applied so far into the performance evaluation and prediction of Software Architectures (SA). Queueing network models with finite capacity queues and blocking have recently been introduced and applied as more realistic models of systems with finite capacity resources and population constraints. Queueing network models have been often adopted as models for the evaluation of software performance. Starting from our own experience, we observe the need of a more accurate definition of the performance models of SA to capture some features of the communication systems. We consider queueing networks with finite capacity and blocking after service (BAS) to represent some synchronization constraints that cannot be easily modeled with queueing network models with infinite capacity queues. We investigate the use of queueing networks with blocking as performance models of SA with concurrent components and synchronous communication. Queueing theoretic analysis is used to solve the queueing network model and study the synchronous communication and performance of concurrent software components. Our experience is supported by other approaches that also propose the use of queueing networks with blocking. Directions for future research work in the field are included.     

一种通用的移动智能网SCF排队网络模型

在分析移动智能网SCF（Service Control Function）软件功能模型的基础上，提出了一种通用的SCF排队网络模型．然后以移动智能网中的预付费业务和短消息业务为例，使用具有反馈的M／G／1排队系统分析了业务消息的时延与消息到达率之间的关系，同时通过仿真对结果进行验证．仿真和分析结果的一致性表明，该排队网络模型是一个有效的数学模型，能用于快速地预测SCP（Service Control Point）系统的性能．     

Simulation of queueing network with time varying arrival rates

Queueing models are important in the analysis of many aspects of system or human behaviour. In such widely divergent fields as administrative processes, health services, traffic control, production control, computer communication networks, time sharing, and architecture, queueing analysis is indisposable for better understanding and ultimately synthesis of the system.However straight mathematical analysis is difficult, as the difference equations describing a queueing network are non-linear and of infinite dimensional. Due to this difficulty, time varying cases are seldomly included in the study of analytic solutions of queueing systems. In existing literature, the mean arrival rates are assumed independent of time. This assumption is of dubious validity as the arrival rate in actual operations varies with a twenty four hours period. While one can assume further that at every instant in time, the equilibrium condition for constant arrival rate is reached for the current arrival rate, it has never been verified that such is the case.An alternative approach is to reduce the queueing problem to finite dimensional and to simulate it on computer as is proposed in the present paper. The basic assumptions are (1) time-varying random arrival rate with Poisson statistics and (2) exponentially distributed service time. An algorithm and flow diagram for doing this is given. With the simulation techniques developed in this paper, we can study the dynamics of varying arrival rate. Simulation of a simple network shows that as the arrival rate approaches capacity, the divergence between simulated results and previous analytical results for the equilibrium condition become increasingly large. A conclusion is therefore that except for systems with very light loading, analytical results based on constant arrival rate are not accurate. Simulation is necessary if one is to obtain a true picture of the system.     

Jitter models for the design and test of Gbps-speed serial interconnects

We present a comprehensive analysis of jitter causes and types, and develops accurate jitter models for design and test of high-speed interconnects. The recent deployment of gigabit-per-second (Gbps) serial I/O interconnects aims at overcoming data transfer bottlenecks resulting from the limited ability to increase chip pin counts in parallel bus architectures. The traditional measure of a communication link's performance has been its associated bit error rate (BER), which is the ratio of the number of bits received in error to the total number of bits transmitted. When data rates increase, jitter magnitude and signal amplitude noise must decrease to maintain the same BER. As data rates exceed 1 Gbps, a slight increase in jitter or amplitude noise has a far greater effect on the BER.     

A new solution for a queueing model of a manufacturing cell with negative customers under a rotation rule

In this paper, we consider a queueing model extension for a manufacturing cell composed of a machining center and several parallel downstream production stations under a rotation rule. A queueing model is extended with the arrival processes of negative customers to capture failures of production stations, reorganization of works and disasters in the manufacturing cell. We present an exact solution for the steady-state probabilities of the proposed queueing model. The solution does not require the approximation of the infinite sum. In addition, it provides an alternative way to compute the rate matrix for the matrix-geometric method as well.     

Queueing Theory for Semiconductor Manufacturing Systems: A Survey and Open Problems

This paper surveys applications of queueing theory for semiconductor manufacturing systems (SMSs). Due to sophisticated tool specifications and process flows in semiconductor manufacturing, queueing models can be very complicated. Research efforts have been on the improvement of model assumptions and model input, mainly in the first moment (averages) and the second moment (variations). However, practices show that implementation of classical queueing theory in semiconductor industry has been unsatisfactory. In this paper, open problems on queueing modeling of SMS are discussed. A potential solution is also proposed by relaxing the independent assumptions in the classical queueing theory. Cycle time reduction has constantly been a key focus of semiconductor manufacturing. Compared with simulation, queueing theory-based analytical modeling is much faster in estimating manufacturing system performance and providing more insights for performance improvement. Therefore, queueing modeling attracts generous semiconductor research grants. Unfortunately, existing queueing models focus on simple extensions of the classical queueing theory and fail to question its applicability to the complicated SMS. Hence, related researches have not been employed widely in the semiconductor industry. In this paper, we conduct a survey on the important works and also present some open problems. We also propose a novel solution by relaxing a key assumption in the classical queueing theory. We are currently funded by Intel to explore this potential solution, and we hope it can foster an interesting research field for the years to come.     

Optimal power allocation for a time-varying wireless channel under heavy-traffic approximation

This paper studies the problem of minimizing the queueing delay for a time-varying channel with a single queue, subject to constraints on the average and peak power. First, by separating the time-scales of the arrival process, the channel process and the queueing dynamics it derives a heavy-traffic limit for the queue length in the form of a reflected diffusion process. Given a monotone function of the queue-length process that serves as a penalty, and constraints on the average and peak available power, it shows that the optimal power allocation policy is a channel-state based threshold policy. For each channel state j there corresponds a threshold value of the queue length, and it is optimal to transmit at peak power if the queue length exceeds this threshold, and not transmit otherwise. Numerical results compare the optimal policy for the original Markovian dynamics to the threshold policy which is optimal for the heavy-traffic approximation, to conclude that that latter performs very well even outside the heavy-traffic operating regime.     

Design and simulation of an efficient real-time traffic schedulerwith jitter and delay guarantees

In this paper, we propose a framework for real-time multimedia transmission in asynchronous transfer mode (ATM) networks using an efficient traffic scheduling scheme called multilayer gated frame queueing (MGFQ). MGFQ employs only one set of FIFO queues to provide a wide range of QoS for real-time applications. We also propose special cell formats for real-time multimedia transport and a hybrid design to allow MGFQ to combine its scheduling scheme with Age Priority Packet Discarding scheme. For this hybrid design, the cell level performance as well as the packet level QoS can be improved at the same time, Simulation results show that this hybrid design will be useful for packetized voice and progressive layer-compressed video transmission across the backbone networks. With the presented framework and the MGFQ algorithm, real-time multimedia traffic streams can be much better supported in terms of cell/packet delay and jitter     

Queueing systems with service interruptions: An approximation model

We present a single queueing model which can be used to analyse queueing systems with service interruptions. The model is based on a diffusion approximation using an instantaneous return process which reflects the particular queueing system under consideration. Applications to queueing systems with preemptive resume priority and breakdowns are given in this paper as well as numerical results showing the accuracy of the approximation.     

Diffusion approximation for a closed Jackson network

We investigate the asymptotic behavior of a vector queueing process in the Markov model of a closed queueing network. The number of jobs circulating in the network is assumed to increase without bound, while the processing rate at each node is directly proportional to the number of jobs at that node.Translated from Kibernetika, No. 1, pp. 30–33, January–February, 1989.     

Media streaming via TFRC: An analytical study of the impact of TFRC on user-perceived media quality

TCP-Friendly Rate Control (TFRC) is being adopted in Internet standards for congestion control of streaming media applications. In this paper, we consider the transmission of prerecorded media from a server to a client by using TFRC, and analytically study the impact of TFRC on user-perceived media quality, which is roughly measured by calculating the rebuffering probability. A rebuffering probability is defined to be the probability that the total duration of all rebuffering events experienced by a user is longer than a certain threshold. Several approaches are presented to help an application determine an appropriate initial buffering delay and media playback rate in order to achieve a certain rebuffering probability under a given network condition. First, we derive a closed-form expression to approximate the average TFRC sending rate, which could be used as the maximum allowed playback rate of a media stream. Second, we develop a queueing model for a TFRC client buffer with the traffic described by a Markov-Renewal-Modulated Deterministic Process (MRMDP), which captures the fundamental behavior of TFRC that predicts the immediate future TCP sending rate based on the history of past loss intervals. We present a closed-form solution and a more accurate iterative method to solve the queueing model and calculate the rebuffering probability.     

基于时钟相位补偿的同步触发信号产生技术

触发信号时间抖动和延时调节分辨率是同步系统的重要参数,提出一种同步触发信号产生技术,通过测量基准触发信号与系统时钟信号间的相位差,对系统时钟相位进行补偿,减小同步触发信号与基准触发信号间的时间抖动,同时利用计数器结合可编程数字延时方案,提高同步触发信号延时调节分辨率,实现了20通道的同步触发信号输出。实验结果表明,输出的同步触发信号与输入的基准触发信号的时间抖动峰峰值小于500ps,延时调节分辨率达到250ps,满足需要精密时序控制的系统对同步触发信号的要求。     

Regulating an M/G/1 queue when customers know their demand

Customers do not necessarily join a queue at a socially optimal rate. Hence, queueing systems may call for regulation. For customers in an M/G/1 unobservable (not necessarily FCFS) queue and homogeneous with respect to waiting costs and service rewards, we show how queueing systems can be regulated by imposing an entry fee, a holding fee (based on time in the system), or a service fee (based on the required service time) when customers know their service requirements. We start with a unified approach and state the socially optimal fees. We show that customers are always worse off under a flat entry fee in comparison with holding and service fees. As for holding vs. service fees, the answer depends on the queueing regime and/or the service length itself. For example, under FCFS, service fees are preferred by all. Details are given on some common service regimes. We also review the case where customers know only the common distribution of service times, but not their actual requirements.     

立体视频分级网络传输码率平滑方法

立体视频视角分级后会造成各视角码流的码率波动过大的现象,对网络传输及终端造成冲击.为解决该问题,提出一种自适应双缓冲码率平滑策略实现视角分级后的码率平滑.该方法根据视角分离后码率抖动的特点,在发送端对各视角码流进行两级缓冲码率平滑.不同视角的码流经过视角分离后存入各自缓冲区中并按帧率向第2级发送码流进行第1级平滑,经过...