Now showing items 21-30 of 88
Design of an ATM LAN Access Switch Based on IEEE P1355
An ATM LAN Access Switch (ALAX) based on IEEE P1355 is being designed at the Laboratory for Advanced Switching Technologies (LAST) as a collaborative project by a research team which consists of the Protocol Engineering ...
Heavy Traffic Analysis for a Multiplexer Driven by M|GI|Input Processes
We study the heavy traffic regime of a multiplexer driven by correlated inputs, namely the M|GI|input processes of Cox. We distinguish between M|GI|processes exhibiting short or long- range dependence, identifying for ...
ATM/LAN Access Switch (ALAX): System Architecture
This document contains the hardware information for the ATM LAN Access Switch (ALAX) that was done as a collaborative research and development effort by the Institute for Systems Research at the University of Maryland, ...
M|G|Input Processes: A versatile class of models for network traffic
We suggest the M|G|input process as a viable model for network traffic due to its versatility and tractability. To gauge its performance, we study the large buffer asymptotics of a multiplexer driven by an M|G|input ...
ATM LAN Access Switch (ALAX): Protocol Architecture (LAN Emulation Version)
This document describes the protocol architecture of the LAN Emulation Version of the ATM LAN Access Switch (ALAX). The main function of the ALAX is to provide an interface between legacy LAN and ATM world giving network ...
Stochastic Orders Associated with the Forward Recurrence Time of a Renewal Process
WAITING FOR JAYA TO CREATE SYMBOLS FOR THE ABSTRACT OF THIS REPORT.
Cell Loss Probabilities in Input Queueing Crossbar Switches Via Light Traffic
Under most system assumptions, closed form solutions of performance measures for input queueing crossbar switches are not available. In this paper, we present expressions and bounds for the derivatives of cell loss ...
Interpolation Approximations for Symmetric Fork-Join Queues
In this paper we propose a family of heuristic approximations for the expected response time of K-dimensional symmetric Fork-Join systems in statistical equilibrium with general inter-arrival and service time distributions. ...
Adaptive Policies for a System of Competing Queues I: Convergence Results for the Long-Run Average Cost.
This paper considers a system of discrete-time queues competing for the attention of a single geometric server. The problem of implementing a given Markov stationary service allocation policy g through an adaptive allocation ...
On the Poisson Equation for Countable Markov Chains: Existence of Solutions and Parameter Dependence by Probabilistic Methods
This paper considers the Poisson equation associated with time- homogeneous Markov chains on a countable state space. The discussion emphasizes probabilistic arguments and focuses on three separate issues, namely (i) the ...