Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
PE
2011
Springer
274views Optimization» more  PE 2011»
10 years 8 months ago
A generalized method of moments for closed queueing networks
We introduce a new solution technique for closed product-form queueing networks that generalizes the Method of Moments (MoM), a recently proposed exact algorithm that is several o...
Giuliano Casale
PE
2011
Springer
365views Optimization» more  PE 2011»
10 years 8 months ago
Optimal resource allocation for time-reservation systems
This paper studies the optimal resource allocation in time-reservation systems. Customers arrive at a service facility and receive service in two steps; in the first step informa...
Ran Yang, Sandjai Bhulai, Rob van der Mei, Frank J...
PE
2011
Springer
215views Optimization» more  PE 2011»
10 years 8 months ago
Energy-aware routing in the Cognitive Packet Network
An energy aware routing protocol (EARP) is proposed to minimise a performance metric that combines the total consumed power in the network and the QoS that is specified for the ...
Toktam Mahmoodi
PE
2011
Springer
321views Optimization» more  PE 2011»
10 years 8 months ago
Quasi-birth-and-death processes with restricted transitions and its applications
In this paper we identify a class of Quasi-Birth-and-Death (QBD) processes where the transitions to higher (resp. lower) levels are restricted to occur only from (resp. to) a subs...
Juan F. Pérez, Benny Van Houdt
PE
2011
Springer
167views Optimization» more  PE 2011»
10 years 8 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
PE
2011
Springer
228views Optimization» more  PE 2011»
10 years 8 months ago
Closed-form waiting time approximations for polling systems
A typical polling system consists of a number of queues, attended by a single server in a fixed order. The present study derives closed-form approximations for the mean waiting t...
Marko A. A. Boon, Erik M. M. Winands, Ivo J. B. F....
PE
2011
Springer
214views Optimization» more  PE 2011»
10 years 8 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
PE
2011
Springer
266views Optimization» more  PE 2011»
10 years 8 months ago
Lumping partially symmetrical stochastic models
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
Souheib Baarir, Marco Beccuti, Claude Dutheillet, ...
books