On the distribution of the number of packets in the fluid flow approximation of packet arrival streams

Fluid flow approximations are widely used for approximating models of communication systems where packet arrival streams are generated in a regular manner over certain intervals (constant rate). The appropriate mathematical model for describing those bursty arrival streams in the fluid flow framework are the well-known Markov modulated rate processes (MMRP). The paper deals with the distribution of the numberN(t) of packets in the interval [0,t] of MMRP. For two-state MMRPs and their superpositions we derive formulas for the distribution ofN(t) and its density. Further we give asymptotic results. The presented numerical results and simulation studies illustrate the goodness of the fluid flow approximation and show that the proposed numerical algorithms work well even in the case of multiplexing a large number of burst silence sources.This work was partially supported by a grant from the Deutsche Bundespost TELEKOM.     

Heavy and light traffic in fluid models with burst arrivals

We consider the problem of finding a heavy and light traffic limits for the steady-state workload in a fluid model having a continuous burst arrival process. Such a model is useful for describing (among other things) the packetwise transmission of data in telecommunications, where each packet is approximated to be a continuous flow. Whereas in a queueing model, each arrival epoch,t _n , corresponds to a customer with a service timeS _n , the burst model is different: each arrival epoch,t _n , corresponds to a burst of work, that is, a continuous flow of work (fluid, information) to the system at rate 1 during the time interval [t _n ,t _n +S _n ]. In the present paper we show that the burst and queueing models share the same heavy-traffic limit for work, but that their behavior in light traffic is quite different.Research supported by the Japan Society for the Promotion of Science, during the author's fellowship in Tokyo.Research funded by C & C Information Technology Research Laboratories, NEC, and the International Science Foundation.     

Scheduling networks of queues: Heavy traffic analysis of a simple open network

We consider a queueing network with two single-server stations and two types of customers. Customers of type A require service only at station 1 and customers of type B require service first at station 1 and then at station 2. Each server has a different general service time distribution, and each customer type has a different general interarrival time distribution. The problem is to find a dynamic sequencing policy at station 1 that minimizes the long-run average expected number of customers in the system.The scheduling problem is approximated by a dynamic control problem involving Brownian motion. A reformulation of this control problem is solved, and the solution is interpreted in terms of the queueing system in order to obtain an effective sequencing policy. Also, a pathwise lower bound (for any sequencing policy) is obtained for the total number of customers in the network. We show via simulation that the relative difference between the performance of the proposed policy and the pathwise lower bound becomes small as the load on the network is increased toward the heavy traffic limit.     

Formulation,Stability, and Computation of Traffic Network Equilibria as Projected Dynamical Systems

In this paper, we present a unified treatment and analysis of a dynamic traffic network model with elastic demands formulated and studied as a projected dynamical system. We propose a travel route choice adjustment process that satisfies the projected dynamical system. Under certain conditions, stability and asymptotical stability of the equilibrium patterns are then derived. Finally, two discrete-time algorithms, the Euler method and the Heun method, are proposed for the computation of the solutions, and convergence results established. The convergence results depend crucially on stability analysis. The performance of the algorithms is then illustrated on several transportation networks.     

Light traffic for workload in queues

General exact light traffic limit theorems are given for the distribution of steadystate workloadV, in open queueing networks having as input a general stationary ergodic marked point process {(t _n ,K _n )n0 (where t_n denotes the arrival time and K_n the routing and service times of the nth customer). No independence assumptions of any kind are required of the input. As the light traffic regime, it is only required that the Palm distribution for the exogenous interarrival time converges weakly to infinity (while the service mechanism is not allowed to change much). As is already known in the context of a single-server queue, work is much easier to deal with mathematically in light traffic than is customer delayD, and consequently, our results are far more general than existing results forD. We obtain analogous results for multi-channel and infinite-channel queues. In the context of open queueing networks, we handle both the total workload in the network as well as the workload at isolated nodes.Research supported in part by the Japan Society for the Promotion of Science during the author's fellowship in Tokyo, and by NSF Grant DDM 895 7825.     

Variational Inequalities and Applications to a Continuum Model of Transportation Network with Capacity Constraints

A continuum model of transportation network is considered in presence of capacity constraints on the flow. The equilibrium conditions are expressed in terms of a Variational Inequality for which an existence theorem is provided.     

A Survivable Wavelength Division Multiplexing Passive Optical Network with Both Point-to-Point Service and Broadcast Service Delivery

Abstract

A survivable wavelength division multiplexing passive optical network enabling both point-to-point service and broadcast service is presented and demonstrated. This architecture provides an automatic traffic recovery against feeder and distribution fiber link failure, respectively. In addition, it also simplifies the protection design for multiple services transmission in wavelength division multiplexing passive optical networks.