IEEE/ACM Transactions on Networking · 1999 · 50 citations · 21 references
BusinessComputer EngineeringComputer ScienceComputer NetworksInterconnection NetworksQueuing TheoryNetwork Performance AnalysisQueueing AnalysisQueueing NetworksQueueing ProcessesQueueing SystemsQueueing TheoryAsynchronous Transfer ModeAsynchronous Transfer Mode SwitchingParallel Matching AlgorithmsSimulation Of Queueing SystemsSwitch ModelingSwitch SimulationSwitching ThroughputThroughput
An analytical model for the performance analysis of a multiple input queued asynchronous transfer mode (ATM) switch is presented. The interconnection network of the ATM switch is internally nonblocking and each input port maintains a separate queue of cells for each output port. The switch uses parallel iterative matching (PIM) to find the maximal matching between the input and output ports of the switch. A closed-form solution for the maximum throughput of the switch under saturated conditions is derived. It is found that the maximum throughput of the switch exceeds 99% with just four iterations of the PIM algorithm. Using the tagged input queue approach, an analytical model for evaluating the switch performance under an independent identically distributed Bernoulli traffic with the cell destinations uniformly distributed over all output ports is developed. The switch throughput, mean cell delay, and cell loss probability are computed from the analytical model. The accuracy of the analytical model is verified using simulation.
21
High-speed switch scheduling for local-area networks
Thomas E. Anderson, Susan Owicki, James B. Saxe et al. · ACM Transactions on Computer Systems · 1993 · 896 citations · Full text
Matrix-geometric solutions in stochastic models
Gian‐Carlo Rota · Advances in Mathematics · 1985 · 880 citations