On product form approximations for communication networks with losses: Error bounds

DOI10.1007/BF02023091zbMath0760.90043OpenAlexW2143391794MaRDI QIDQ1197751

Nico M. van Dijk, Hayri Korezlioglu

Publication date: 16 January 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02023091

zbMATH Keywords

approximationstransmission errorscollisionsfinite buffer constraintsmessae losses

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
• Multiprocessor systems with reserves and preferences
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• Approximate uniformization for continuous-time Markov chains with an application to performability analysis
• Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems
• Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
• Simple bounds for queueing systems with breakdowns

This page was built for publication: On product form approximations for communication networks with losses: Error bounds