A universal building block for the approximate analysis of a shared buffer ATM switch architecture

DOI10.1007/BF02031600zbMath0798.90053OpenAlexW2026842326MaRDI QIDQ1319837

Demetres D. Kouvatsos, Spiros G. Denazis

Publication date: 1 November 1994

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

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

zbMATH Keywords

entropy maximizationmean queue lengthcell-loss probability

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• Maximum entropy and the G/G/1/N queue
• Entropy maximisation and queueing network models
• Information Theory and Statistical Mechanics
• Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions
• Approximate Analysis of General Queuing Networks
• A generating function approach to queueing network analysis of multiprogrammed computers

This page was built for publication: A universal building block for the approximate analysis of a shared buffer ATM switch architecture