Sciweavers

8 search results - page 1 / 2
» Perfect Sampling for Multiclass Closed Queueing Networks
Sort
View
MASCOTS
2004
13 years 6 months ago
Bottlenecks Identification in Multiclass Queueing Networks Using Convex Polytopes
It is known that the resources that limit the overall performance of the system are the congested ones, referred to as bottlenecks. From the knowledge of the bottleneck stations w...
Giuliano Casale, Giuseppe Serazzi
QUESTA
2008
382views more  QUESTA 2008»
13 years 4 months ago
A note on stable flow-equivalent aggregation in closed networks
We introduce the Conditional Mean Value Analysis (CMVA) algorithm, an exact solution method for product-form load-dependent closed queueing networks that provides a numerically st...
Giuliano Casale
PE
2010
Springer
144views Optimization» more  PE 2010»
12 years 11 months ago
A unified framework for the bottleneck analysis of multiclass queueing networks
We introduce a new framework supporting the bottleneck analysis of closed, multiclass BCMP queueing networks in the limiting regime where the number of jobs proportionally grows t...
Jonatha Anselmi, Paolo Cremonesi
IWDC
2001
Springer
101views Communications» more  IWDC 2001»
13 years 9 months ago
Resource Stealing in Endpoint Controlled Multi-class Networks
Abstract. Endpoint admission control is a mechanism for achieving scalable services by pushing quality-of-service functionality to end hosts. In particular, hosts probe the network...
Susana Sargento, Rui Valadas, Edward W. Knightly
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
12 years 12 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely