A unified framework for approximation of general telecommunication networks

DOI10.1016/J.EJOR.2003.10.027zbMATH Open1071.90518OpenAlexW2020203918MaRDI QIDQ706895FDOQ706895

Authors: D. Kharzeev 

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.027

Recommendations

• General open and closed queueing networks with blocking: a unified framework for approximation
• A reduced load approximation accounting for link interactions in a loss network
• The computation algorithm of capacity indices of the telecommunication networks with repeated transmissions
• Tandem behavior of a telecommunication system with repeated calls. II: A general case without buffers
• MC-based algorithm for a telecommunication network under node and budget constraints

zbMATH Keywords

TelecommunicationsQueueingNetwork approximations

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication networks in operations research (90B18)

Cites Work

• Computational algorithms for closed queueing networks with exponential servers
• Title not available (Why is that?)
• Approximate Analysis of General Queuing Networks by Decomposition
• An Analytical Method for Performance Evaluation of Kanban Controlled Production Systems
• General open and closed queueing networks with blocking: a unified framework for approximation
• Nonblocking multirate distribution networks
• Flow control in kanban based multicell manufacturing: II. Design of control systems and experimental results
• Flow control in kanban based multicell manufacturing: I. A structural analysis of general blocking design space
• Title not available (Why is that?)
• Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach
• Tandem Behaviour of a Telecommunication System with Repeated Calls: A Markovian Case with Buffers

Cited In (2)

• On product form approximations for communication networks with losses: Error bounds
• On the arrival theorem for communication networks

This page was built for publication: A unified framework for approximation of general telecommunication networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706895)