Sciweavers

TC
2010
13 years 6 months ago
Model-Driven System Capacity Planning under Workload Burstiness
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
PE
2010
Springer
144views Optimization» more  PE 2010»
13 years 6 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
BIRTHDAY
2010
Springer
13 years 8 months ago
QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets
Abstract Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the model...
Samuel Kounev, Simon Spinner, Philipp Meier
PE
2010
Springer
133views Optimization» more  PE 2010»
13 years 9 months ago
Positive Harris recurrence and diffusion scale analysis of a push pull queueing network
We consider a push pull queueing system with two servers and two types of jobs which are processed by the two servers in opposite order, with stochastic generally distributed proc...
Yoni Nazarathy, Gideon Weiss
QUESTA
2007
136views more  QUESTA 2007»
13 years 11 months ago
A resource allocation queueing fairness measure: properties and bounds
Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to comp...
Benjamin Avi-Itzhak, Hanoch Levy, David Raz
QUESTA
2007
170views more  QUESTA 2007»
13 years 11 months ago
Priority queueing systems: from probability generating functions to tail probabilities
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...
Tom Maertens, Joris Walraevens, Herwig Bruneel
TELSYS
2002
122views more  TELSYS 2002»
13 years 11 months ago
Performance Analysis of Reassembly and Multiplexing Queueing with Long-Range-Dependent Input Traffic
This paper studies the impact of long-range-dependent (LRD) traffic on the performance of reassembly and multiplexing queueing. A queueing model characterizing the general reassemb...
George C. Lin, Tatsuya Suda, Fumio Ishizaki
TON
2008
107views more  TON 2008»
13 years 11 months ago
On guaranteed smooth switching for buffered crossbar switches
Scalability considerations drive the evolution of switch design from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, CICQ s...
Simin He, Shutao Sun, Hong-Tao Guan, Qiang Zheng, ...
ALGORITHMICA
2005
102views more  ALGORITHMICA 2005»
13 years 11 months ago
Effective Routing and Scheduling in Adversarial Queueing Networks
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...
Jay Sethuraman, Chung-Piaw Teo
4OR
2006
115views more  4OR 2006»
13 years 11 months ago
Empirical validation of a queueing approach to uninterrupted traffic flows
Abstract In this paper, the use of queueing theory for modeling uninterrupted traffic flows is evaluated. Empirical data on speeds and flows are used to evaluate speeds generated b...
Tom Van Woensel, Nico Vandaele