Performance comparison between ATM LAN emulation, classical IP over ATM, and native ATM in a multi-platform multi-operating system environment

Driscoll, D.J.; Mehravari, Nader; Olson, Melvin

doi:10.1109/milcom.1997.648749

Cited by 1 publication

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If we denote packet loss ratio of large packet, medium packet and small packet when there are customers in the tandem queueing system as and respectively. Then (9) We can define reward function, which is a powerful function in SPNP [21] to get and . For example, for the , we define reward function as double l loss() if (mark("PBUF") ) if(mark("Pon")) return( ); else return( ); else return(0);…”

Section: ) Approximate Solution 3: Hierachical Decompsitionmentioning

confidence: 99%

“…1 The LANE specification was standardized by ATM Forum in May 1995, and widely implemented in the existing ATM switches. However, the performance analysis for the LANE is rare in the references, and only some measurement-based studies can be found [8], [9]. Because the BUS must forward not only all the broadcast and multicast frames, but also the frames for the LECs before they establish the Data Direct VCC to the destinations, some researchers conjectured that the BUS is the potential bottleneck in the process of forwarding frames [5].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Performance of broadcast and unknown server (BUS) in ATM LAN emulation

Sun

Zang

Trivedi

2001

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

In this paper, we develop performance models of the Broadcast and Unknown 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 possibile 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 genaration 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 conection setup delay on the performance of the BUS.Index Terms-ATM, broadcast and unknown server, LAN emulation, stochastic petri net package (SPNP), stochastic reward nets.

show abstract

Section: ) Approximate Solution 3: Hierachical Decompsitionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%