Sciweavers

MMB
2010
Springer
153views Communications» more  MMB 2010»
13 years 9 months ago
The Total Overflow during a Busy Cycle in a Markov-Additive Finite Buffer System
We consider a finite buffer system where the buffer content moves in a Markov-additive way while it is strictly between the buffer boundaries. Upon reaching the upper boundary of t...
Lothar Breuer
MMB
2010
Springer
185views Communications» more  MMB 2010»
13 years 9 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker
MMB
2010
Springer
185views Communications» more  MMB 2010»
13 years 9 months ago
Reducing the Cost of Generating APH-Distributed Random Numbers
Phase-type (PH) distributions are proven to be very powerful tools in modelling and analysis of a wide range of phenomena in computer systems. The use of these distributions in sim...
Philipp Reinecke, Miklós Telek, Katinka Wol...
MMB
2010
Springer
180views Communications» more  MMB 2010»
13 years 9 months ago
ResiLyzer: A Tool for Resilience Analysis in Packet-Switched Communication Networks
We present a tool for the analysis of fault-tolerance in packet-switched communication networks. Network elements like links or routers can fail or unexpected traffic surges may o...
David Hock, Michael Menth, Matthias Hartmann, Chri...
MMB
2010
Springer
182views Communications» more  MMB 2010»
13 years 11 months ago
CrossTrace: Cross-Layer Measurement for IEEE 802.11 Wireless Testbeds
In this paper, we introduce and evaluate CrossTrace, a framework for performing cross-layer measurements in IEEE 802.11 based wireless networks. CrossTrace allows tracing of parame...
Simon Frohn, Sascha Gübner, Christoph Lindema...
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 2 hour ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt