Multiclass batch arrival retrial queues analyzed as branching processes with immigration
Queueing Systems: Theory and Applications
Bounds for performance measures of token rings
IEEE/ACM Transactions on Networking (TON)
A simple analytical framework to analyze search strategies in large-scale peer-to-peer networks
Performance Evaluation - Performance 2005
A basic stochastic network calculus
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Expected waiting time in symmetric polling systems with correlated walking times
Queueing Systems: Theory and Applications
Semi-linear Stochastic Difference Equations
Discrete Event Dynamic Systems
On the maximum stable throughput of tree algorithms with free access
IEEE Transactions on Information Theory
Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Branching processes can describe the dynamics of various queueing systems, peer-to-peer systems, delay tolerant networks, etc. In this paper we study the basic stochastic recursion of multitype branching processes, but in two non-standard contexts. First, we consider this recursion in the max-plus algebra where branching corresponds to finding the maximal offspring of the current generation. Secondly, we consider network-calculus-type deterministic bounds as introduced by Cruz, which we extend to handle branching-type processes. The paper provides both qualitative and quantitative results and introduces various applications of (max-plus) branching processes in queueing theory.