Congested Banyan network analysis using congested-queue states and neighboring-queue effects

Koppelman, David M.

doi:10.1109/90.503766

Cited by 1 publication

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This effect was partially incorporated into a model by determining the service rate for a queue feeding a congested queue and a correlation between congested queues in adjacent stages; from this adjusted service rates were found. See [9]. Although the results were better (at some cost in complexity) correlation of congestion between adjacent stages did not match simulations to a satisfying degree.…”

Section: Analysis Resultsmentioning

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

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: Analysis Resultsmentioning

confidence: 99%

“…In a related work a queue is modeled using sticky states as well as the state of queues in the next and same stage, quadrupling the number of states [9]. While the predicted throughput is closer than that obtained here, the added complexity is not necessary to model the sticky states induced by congestion.…”

Section: Introductionmentioning

confidence: 99%

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

Congested Banyan network analysis using congested-queue states and neighboring-queue effects

Cited by 1 publication

References 21 publications

Sticky States in Banyan Network Queues and Their Application to Analysis

Sticky States in Banyan Network Queues and Their Application to Analysis

Contact Info

Product

Resources

About