Probability THROUGHPUT ANALYSIS OF STOCHASTIC NETWORKS USING FLUID LIMITS

نویسندگان

  • John Musacchio
  • Jean Walrand
  • J. WALRAND
چکیده

We study the throughput of a stochastic network with input policing. Such policing can be used to improve the fairness of packet switches and of communication networks as well as of service systems. Our approach consists in showing that the throughput of the network approaches that of a corresponding fluid network. The type of queueing network we study consists of multiple stations, carries multiple flows of customers, each flow is queued separately at each station, and there is a single server at each station serving the queues in a round-robin fashion. The particular control scheme we study discards packets that arrive when any one of the queues holds more than a specified number of packets of the same flow, and does so until all of that flow’s queues fall below their thresholds. To illustrate the application of our results, we analyze a network resembling a 2-input, 2-output communications network switch.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fluid Limits and the Eeciency of Scheduling Policies for Stochastic Closed Reentrant Lines in Heavy Traac

In this paper, we address the behavior of stochastic closed reentrant lines in heavy traac, i.e., when the population of the resulting closed queueing network increases without bound. We show that the uid limits of the network can be used to study the asymptotic throughput in the innnite population limit. As applications of this technique, the Last Buuer First Serve (LBFS) scheduling policy, an...

متن کامل

Arrival probability in the stochastic networks with an established discrete time Markov chain

The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...

متن کامل

Spatial Throughput of Mobile Ad Hoc Networks with Energy Harvesting

Designing mobiles to harvest ambient energy such as kinetic activities or electromagnetic radiation will enable wireless networks to be self sustaining besides alleviating global warming. In this paper, the spatial throughput of a mobile ad hoc network powered by energy harvesting is analyzed using a stochastic-geometry model. In this model, transmitters are distributed as a Poisson point proce...

متن کامل

Closed Queueing Networks in Heavy Traac: Fluid Limits and Eeciency

We address the behavior of stochastic Markovian closed queueing networks in heavy traac, i.e., when the population trapped in the network increases to innnity. All service time distributions are assumed to be exponential. We show that the uid limits of the network can be used to study the asymptotic throughput in the innnite population limit. As applications of this technique, we show the eecie...

متن کامل

Robust Fluid Control of Multiclass Queueing Networks

This thesis applies recent advances in the field of robust optimization to the optimal control of multiclass queueing networks. We develop models that take into account the uncertainty of interarrival and service time in multiclass queueing network problems without assuming a specific probability distribution, while remaining highly tractable and providing insight into the corresponding optimal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006