Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
An Aggregation Technique for the Transient Analysis of Stiff Markov Chains
IEEE Transactions on Computers
A decomposition approach for stochastic reward net models
Performance Evaluation
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
A simulation study of IP switching
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Asynchronous Transfer Mode Networks: Performance Issues
Asynchronous Transfer Mode Networks: Performance Issues
Transient behavior of ATM networks under overloads
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Flow labelled IP: a connectionless approach to ATM
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Supporting IP on the ATM networks: an overview
Computer Communications
Performance benchmarking of signaling in ATM networks
IEEE Communications Magazine
| Hi-index | 0.00 |
In this paper, we develop performance models of the Broadcast and Unkn own Server (BUS) in the LANE. The traffic on the BUS is divided into two classes: the broadcast and multicast traffic, and the unicast relay flow. The broadcast and multicast traffic is assumed to form a Markov Modulated Poisson Process (MMPP). The traffic for a particular unicast relay flow is an MMPP as well. However, the number of active unicast relay flows sojourning on the BUS is determined by a tandem queueing system, where the flow arrival process is Poisson, the address resolution delay is exponentially distributed, and the connection setup delay is three-stage Erlang distributed. The size of data frames in traffic flows is a random variable with three possible values: short, medium, and large. In order to deal with the intractability (i.e., largeness and stiffness) of the underlying Markov chain, a hierarchical model is used to decompose the system. With the help of Stochastic Petri Net Package (SPNP), a software package for the automated generation and solution of Markovian stochastic systems, and the decomposition method, we study the performance of the BUS module under different loads. We also investigate the effect of address resolution delay and connection setup delay on the performance of the BUS.