Monotone structure in discrete-event systems
Monotone structure in discrete-event systems
Queueing networks with blocking
Queueing networks with blocking
Exact sampling with coupled Markov chains and applications to statistical mechanics
Proceedings of the seventh international conference on Random structures and algorithms
Optimal and heuristic policies for dynamic server allocation
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part I
Perfect Simulation of Queueing Networks with Blocking and Rejection
SAINT-W '05 Proceedings of the 2005 Symposium on Applications and the Internet Workshops
Perfect simulation of monotone systems for rare event probability estimation
WSC '05 Proceedings of the 37th conference on Winter simulation
Perfect Simulation of Stochastic Automata Networks
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Perfect simulation and non-monotone Markovian systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Statistical Model Checking Using Perfect Simulation
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Perfect sampling of load sharing policies in large scale distributed systems
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Monotone queuing networks and time parallel simulation
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
Stationary solution approximation using a memory-efficient perfect sampling technique
Proceedings of the 44th Annual Simulation Symposium
Tradeoff between accuracy and efficiency in the time-parallel simulation of monotone systems
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Tradeoff between accuracy and efficiency in the time-parallel simulation of monotone systems
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
| Hi-index | 0.00 |
Markovian queueing networks models are widely used for performance evaluation of computer systems, production lines, communication networks and so on. Routing strategies allocate clients to queues after the end of service. In many situations such as deterministic, probabilistic, or state dependent like Join the shortest queue routing, the routing function could be written in terms of index scheduling functions introduced in [3, 6].