Self-Converse Directed BIBDs with Block Size Four

A directed balanced incomplete block design (or D B(k,;v)) (X,) is called self-converse if there is an isomorphic mapping f from (X,) to (X,^–1), where ^–1={B ^–1:B} and B ^–1=(x _k ,x _{k –1},,x ₂,x ₁) for B=(x ₁,x ₂,,x _{k –1},x _k ). In this paper, we give the existence spectrum for self-converse D B(4,1;v). AMS Classification:05BResearch supported in part by NSFC Grant 10071002 and SRFDP under No. 20010004001     

Worst Case Traffic from Regulated Sources

We address the problem of finding the worst possible traffic a user of a telecommunications network can send. We take worst to mean having the highest effective bandwidth, a concept that arises in the Large Deviation theory of queueing networks. The traffic is assumed to be stationary and to satisfy leaky bucket constraints, which represent the a priori knowledge the network operator has concerning the traffic. Firstly, we show that this optimization problem may be reduced to an optimization over periodic traffic sources. Then, using convexity methods, we show that the realizations of a worst case source must have the following properties: at each instant the transmission rate must be either zero, the peak rate, or the leaky bucket rate; it may only be the latter when the leaky bucket is empty or full; each burst of activity must either start with the leaky bucket empty or end with it full.     

The Ergodic Theory of Traffic Jams

We introduce and analyze a simple probabilistic cellular automaton which emulates the flow of cars along a highway. Our Traffic CA captures the essential features of several more complicated algorithms, studied numerically by K. Nagel and others over the past decade as prototypes for the emergence of traffic jams. By simplifying the dynamics, we are able to identify and precisely formulate the self-organized critical evolution of our system. We focus here on the Cruise Control case, in which well-spaced cars move deterministically at maximal speed, and we obtain rigorous results for several special cases. Then we introduce a symmetry assumption that leads to a two-parameter model, described in terms of acceleration () and braking () probabilities. Based on the results of simulations, we map out the (, ) phase diagram, identifying three qualitatively distinct varieties of traffic which arise, and we derive rigorous bounds to establish the existence of a phase transition from free flow to jams. Many other results and conjectures are presented. From a mathematical perspective, Traffic CA provides local, particle-conserving, one-dimensional dynamics which cluster, and converge to a mixture of two distinct equilibria.     

On the Number of Lost Customers in Stationary Loss Systems in the Light Traffic Case

For the stationary loss systems M/M/m/K and GI/M/m/K, we study two quantities: the number of lost customers during the time interval (0,t] (the first system only), and the number of lost customers among the first n customers to arrive (both systems). We derive explicit bounds for the total variation distances between the distributions of these quantities and compound Poisson–geometric distributions. The bounds are small in the light traffic case, i.e., when the loss of a customer is a rare event. To prove our results, we show that the studied quantities can be interpreted as accumulated rewards of stationary renewal reward processes, embedded into the queue length process or the process of queue lengths immediately before arrivals of new customers, and apply general results by Erhardsson on compound Poisson approximation for renewal reward processes.     

Sojourn times in a processor sharing queue with service interruptions

We study the sojourn times of customers in an M/M/1 queue with the processor sharing service discipline and a server that is subject to breakdowns. The lengths of the breakdowns have a general distribution, whereas the on-periods are exponentially distributed. A branching process approach leads to a decomposition of the sojourn time, in which the components are independent of each other and can be investigated separately. We derive the Laplace–Stieltjes transform of the sojourn-time distribution in steady state, and show that the expected sojourn time is not proportional to the service requirement. In the heavy-traffic limit, the sojourn time conditioned on the service requirement and scaled by the traffic load is shown to be exponentially distributed. The results can be used for the performance analysis of elastic traffic in communication networks, in particular, the ABR service class in ATM networks, and best-effort services in IP networks.     

Applications of SMP Bounds to Multi-class Traffic in High-speed Networks

In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are multiplexed onto a single output channel using one of the service scheduling policies: the Timed Round Robin Policy or the Static Priority Service Policy. The Quality of Service requirements for each class are based on cell loss probabilities. Using effective bandwidth methodologies and the recently developed bounds for semi-Markov modulated traffic, we solve call admission control problems for the two service scheduling policies at this node. We compare the performance of the effective bandwidth methodologies and the SMP bounds technique. We also numerically compare the performance of the two service scheduling policies.     

低噪声通过特性的测量仿真研究

本文研究运用组合传感器和声压、振速联合信息处理技术进行低品声通过特性的测量。通过特性的背景噪声出非相干的各向同性白噪声和相干的交通干扰组成,交通干扰又分为平稳与非平稳两种,用平均声强器来抗非相干干扰;用交通干扰能量流中心方位抑制技术来抗平稳的相干干扰;对于非平稳的相干干扰而能量流中心方位抑制技术。仿真试验表明效果良好。     

车辆的长度和速度对单车道混合交通流的影响

在NaSch交通流模型的基础上，建立了单车道上由两种长度不一样、可分别以不同最大速度行驶的车辆构成的混合交通流模型.在周期性边界条件下，通过计算机模拟研究了车辆的长度、最大速度和混合比例系数对混合交通流的影响. 关键词： 元胞自动机 混合交通流 计算机模拟     

基于GMPLS的光突发交换体系及其关键技术

文章给出了基于通用多协议标签交换(GMPLS)的光突发交换(OBS)对等体系(GLOBS)的功能结构和分层视图.在此范畴内,针对标签空间减小和流量工程两方面,结合国内外最新的研究动态,比较了各种已有技术的优缺点,并提出了适合于GLOBS体系的可能的解决方案以及今后工作的重要技术问题.     

对称三进制光学加法器的进位直达通道设计

以对称三进制光学半加器为基础,提出了一个对称三进制光学全加器方案。主要介绍了进位直达并行通道在对称三进制光学全加器中的实现方案和工作原理,从而论证了实现对称三进制光学全加器的可行性。