Sciweavers

148 search results - page 2 / 30
» A generalized method of moments for closed queueing networks
Sort
View
IOR
2008
113views more  IOR 2008»
13 years 5 months ago
Service Competition with General Queueing Facilities
In many service industries, companies compete with each other on the basis of the waiting time their customers experience, along with the price they charge for their service. A fi...
Gad Allon, Awi Federgruen
CSJM
2007
92views more  CSJM 2007»
13 years 5 months ago
Generalized Priority Models for QoS and CoS Network Technologies
The variety of priority queueing systems with random switchover times is suggested in this paper. Such systems represent generalized models for a wide class of phenomena which inv...
Gh. Mishkoy, S. Giordano, A. Iu. Bejan, O. Benders...
ISQED
2006
IEEE
108views Hardware» more  ISQED 2006»
13 years 11 months ago
SMM: Scalable Analysis of Power Delivery Networks by Stochastic Moment Matching
This paper proposes a novel method for analyzing large onchip power delivery networks via a stochastic moment matching (SMM) method. The proposed method extends the existing direc...
Andrew B. Kahng, Bao Liu, Sheldon X.-D. Tan
QUESTA
2006
119views more  QUESTA 2006»
13 years 5 months ago
Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
Ivo J. B. F. Adan, Vidyadhar G. Kulkarni
PE
2010
Springer
144views Optimization» more  PE 2010»
13 years 11 days 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