Constant Bit Rate Connections Research Articles

A queue with semiperiodic traffic

In this paper, we analyze the diffusion limit of a discrete-time queueing system with constant service rate and connections that randomly enter and depart from the system. Each connection generates periodic traffic while it is active, and a connection's lifetime has finite mean. This can model a time division multiple access system with constant bit-rate connections. The diffusion scaling retains semiperiodic behavior in the limit, allowing for both short-time analysis (within one frame) and long-time analysis (over multiple frames). Weak convergence of the cumulative arrival process and the stationary buffer-length distribution is proved. It is shown that the limit of the cumulative arrival process can be viewed as a discrete-time stationary-increment Gaussian process interpolated by Brownian bridges. We present bounds on the overflow probability of the limit queueing process as functions of the arrival rate and the connection lifetime distribution. Also, numerical and simulation results are presented for geometrically distributed connection lifetimes.

A queue with semiperiodic traffic

In this paper, we analyze the diffusion limit of a discrete-time queueing system with constant service rate and connections that randomly enter and depart from the system. Each connection generates periodic traffic while it is active, and a connection's lifetime has finite mean. This can model a time division multiple access system with constant bit-rate connections. The diffusion scaling retains semiperiodic behavior in the limit, allowing for both short-time analysis (within one frame) and long-time analysis (over multiple frames). Weak convergence of the cumulative arrival process and the stationary buffer-length distribution is proved. It is shown that the limit of the cumulative arrival process can be viewed as a discrete-time stationary-increment Gaussian process interpolated by Brownian bridges. We present bounds on the overflow probability of the limit queueing process as functions of the arrival rate and the connection lifetime distribution. Also, numerical and simulation results are presented for geometrically distributed connection lifetimes.

Simple tariffs based on price multipliers for ATM VBR services

We present an approach for constructing simple time-based tariffs for variable bit-rate (VBR) connections from constant bit-rate (CBR) prices, using price multipliers that depend on the traffic parameters of the VBR connection and reflect the resource usage of VBR connections relative to CBR connections. Our approach employs an effective bandwidth bound as a proxy for the maximum amount of traffic that conforms to the connection's traffic contract, and thus for the maximum resource usage. We compare the price multipliers computed by our approach with the multipliers published by an actual ATM service provider, and with those computed using a proxy for resource usage that is based on ATM Forum's generic CAC algorithm. Although our approach is presented in the context of ATM VBR services, it can be applied for creating tariffs for service level agreements (SLAs) where the maximum amount of conforming traffic is given by leaky (or token) bucket constraints. Copyright © 2003 AEI.

QoS performance bounds and efficient connection admission control for heterogeneous services in wireless cellular networks

Quality-of-Service (QoS) performance and connection admission control (CAC) for heterogeneous services in wireless multiple access networks are investigated. The heterogeneous services include constant bit rate (CBR), variable bit rate (VBR) and available bit rate (ABR) services. Multiple access control is handled by a polling-based scheme with non-preemptive priority. Tight delay variation (jitter) bounds for CBR connections and delay bounds for VBR connections are derived. A CAC scheme based on the derived bounds is developed. The CAC makes use of user mobility information to reserve an appropriate amount of system resources for potential handoff connections to achieve low handoff connection dropping rate (HCDR). Simulation results show that the proposed CAC scheme can achieve both low HCDR and high resource utilization.

Model and performance evaluation for multiservice network link supporting ABR and CBR services

We consider a "dynamic" model for a link jointly supporting two types of service: rate-adaptive and constant-bit rate services, e.g., ABR and CBR service in ATM networks. We construct and solve the associated two dimensional Markov chain via matrix-geometric techniques. This permits an analytical evaluation of performance when such services share resources. Moreover, when constant-bit rate connections are long lived relative to rate-adaptive connections (e.g., file transfers), we prove a separation of time scale result. This leads to a useful approximation that closely matches the performance in this regime.