Approximation for Multi-service Systems with Reservation by Systems with Limited-Availability

DOI10.1007/978-3-540-87412-6_19MaRDI QIDQ3543322zbMATH OpenOpenAlexFDO

Authors Maciej Stasiak, Sławomir Hanczewski

Publication date 2 December 2008

Published in Computer Performance Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87412-6_19

zbMATH Keywords

availabilityErlang's ideal gradingMarkov processesreservation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Communication networks in operations research (90B18)

Recommendations

• A simple approximation of the link model with reservation by a one-dimensional Markov chain
• scientific article; zbMATH DE number 2200750
• Multiservice switching networks with overflow links and resource reservation
• Modeling Erlang's ideal grading with multirate BPP traffic
• Approximation for overflow moments of a multiservice link with trunk reservation

Cites work

• A simple approximation of the link model with reservation by a one-dimensional Markov chain
• An approximate model of a switching network carrying mixture of different multichannel traffic streams
• scientific article; zbMATH DE number 3146366 (Why is no real title available?)
• scientific article; zbMATH DE number 3860856 (Why is no real title available?)

Cited in

(5)

• Modelling of cellular networks with traffic overflow
• Modeling Erlang's ideal grading with multirate BPP traffic
• scientific article; zbMATH DE number 4131936 (Why is no real title available?)
• Two-dimensional convolution algorithm for modelling multiservice networks with overflow traffic
• A simple approximation of the link model with reservation by a one-dimensional Markov chain

This page was built for publication: Approximation for Multi-service Systems with Reservation by Systems with Limited-Availability

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