Applying Branching Processes to Delay-Tolerant Networks

DOI10.1007/978-3-642-12808-0_11zbMath1214.68033OpenAlexW314108693MaRDI QIDQ3006020

Dieter Fiems, Eitan Altman

Publication date: 10 June 2011

Published in: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/1008235

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (1)

Gated polling with stationary ergodic walking times, Markovian routing and random feedback

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(M/M/\infty\) queues in semi-Markovian random environment
• Limiting distributions and regeneration times for multitype branching processes with immigration in a random environment
• The genealogy of continuous-state branching processes with immigration
• Polling systems and multitype branching processes
• A note on multitype branching processes with immigration in a random environment
• Expected waiting time in symmetric polling systems with correlated walking times
• The \(M/M/\infty\) queue in a random environment
• Optimality Models in Behavioral Biology
• ON THE DISCRETE-TIME G/GI/∞ QUEUE
• Competition and Cooperation between Nodes in Delay Tolerant Networks with Two Hop Routing
• On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes

This page was built for publication: Applying Branching Processes to Delay-Tolerant Networks