Performance analysis of multibuffered packet-switching networks in multiprocessor systems

Yoon, Hyunsoo; Lee, K.Y.; Liu, M.T.

doi:10.1109/12.48863

Cited by 136 publications

(55 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The queue's stationary state distribution can be found in closed form although analysis of the entire network uses iteration. Similar models for finite-buffered banyan networks were presented by Yoon, et al [17] and Szymanski and Shaikh [15] and more recently by Ding and Bhuyan [2]. The stationary distribution for the queues in these models can also be found in closed form.…”

Section: Introductionmentioning

confidence: 64%

“…In the remainder of this paper Yoon's analysis method will be used to refer to an analysis which is similar to that of Yoon, Lee, and Liu [17], except that packets move as described above, as later done by Ding [2].…”

Section: Preliminariesmentioning

confidence: 99%

“…In the simplest of these analyses, Lin and Kleinrock's [11], the queue itself is modeled as by Yoon [17], however an effective service rate is used in place of the service rate computed as in [17]. This service rate is derived by considering two cases: the probability of service for a packet first arriving at the head slot and the probability of service for a packet which was blocked by a full queue at the previous cycle.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Sticky States in Banyan Network Queues and Their Application to Analysis

Koppelman

1997

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

A finite-buffered banyan network analysis technique designed to model networks at high traffic loads is presented. The technique specially models two states of the network queues: queue empty and queue congested (roughly, zero or one slots free). A congested queue tends to stay congested because packets bound for the queue accumulate in the previous stage. The expected duration of this state is computed using a probabilistic model of a switching module feeding the congested queue. A technique for finding a lower arrival rate to an empty queue is also described. The queues themselves are modeled using independent Markov chains with an additional congested state added. The new analysis technique is novel in its modeling the higher arrival rate to a congested queue and a lower arrival rate to an empty queue. Comparison of queue state distributions obtained with the analysis and simulation show that an important feature of congestion is modeled.

show abstract

Section: Introductionmentioning

confidence: 64%

Section: Preliminariesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Sticky States in Banyan Network Queues and Their Application to Analysis

Koppelman

1997

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…However, their model does not consider multi-packet messages. Our research integrates the various aspects studied separately in [8], [9]. In addition, we introduce a refined metric called wait delay and the notion of congestion-region to provide a better understanding of the performance results.…”

Section: Introductionmentioning

confidence: 99%

“…Davis and Siegel's work is restricted to Delta networks. Recently, Yoon et al [9] provided a study of buffered multipath MINs. However, their model does not consider multi-packet messages.…”

Section: Introductionmentioning

confidence: 99%

Performance Study of Packet Switching Multistage Interconnection Networks

Kim¹

1994

ETRI J

View full text Add to dashboard Cite

This paper provides a performance study of multistage interconnection networks in packet switching environment. In comparison to earlier work, the model is more extensive ‐ it includes several parameters such as multiple‐packet messages, variable buffer size, and wait delay at a source. The model is also uniformly applied to several representative networks and thus provides a basis for fair comparison as well as selection of optimal values for parameters. The complexity of the model required use of simulation. However, a partial analytical model is provided to measure the congestion in a network.

show abstract

Accurate modelling of the queueing behaviour of shared buffer ATM switches

Saleh

Atiquzzaman

1999

Int. J. Commun. Syst.

View full text Add to dashboard Cite

A model for the analysis of multistage switches based on shared bu!er switching for Asynchronous Transfer Mode (ATM) networks is developed, and the results are compared with the simulation. Switches constructed from shared bu!er switches do not su!er from the head of line blocking which is the common problem in simple input bu!ering. The analysis models the state of the entire switch and extends the model introduced by Turner to global #ow control with backpressure mechanism. It is shown that bu!er utilization is better and throughput improves signi"cantly compared with the same switch using local #ow control policy.

show abstract

Performance analysis of multibuffered packet-switching networks in multiprocessor systems

Cited by 136 publications

References 14 publications

Sticky States in Banyan Network Queues and Their Application to Analysis

Sticky States in Banyan Network Queues and Their Application to Analysis

Performance Study of Packet Switching Multistage Interconnection Networks

Accurate modelling of the queueing behaviour of shared buffer ATM switches

Contact Info

Product

Resources

About