Analysis of nonblocking ATM switches with multiple input queues

Nong, Ge; Muppala, Jogesh K.; Hamdi, Mounir

doi:10.1109/90.759320

Cited by 45 publications

(16 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We call unlimited to this scheme because the captured-frame size is not limited to a maximum value at the capture time. It has been shown that PIM delivers a limited throughput under uniform traffic [14], [13] for a large N and a single iteration. The throughput of PIM, (T P IM ), can be described as in [14]:…”

Section: Unlimited Frame Occupancy-based Pim Schemementioning

confidence: 99%

Matching schemes with captured-frame eligibility for input-queued packet switches

Rojas‐Cessa

Lin

2005

IEEE International Conference on Communications, 2005. ICC 2005. 2005

View full text Add to dashboard Cite

Abstract-Virtual output queues (VOQs) are widely used by input-queued (IQ) switches to eliminate the head-of-line (HOL) blocking phenomena, which limits switching performance. An effective matching scheme must provide high throughput under several admissible traffic patterns and keep implementation complexity low. A variety of matching schemes for IQ switches that deliver high throughput under uniform traffic have been proposed. However, there is a need of matching schemes that provide high throughput under several admissible traffic patterns, including those with nonuniform distributions. In this paper, we introduce the captured frame-size concept for matching schemes in IQ switches. We use the captured-frame eligibility concept in a round-robin based scheme, uFORM, and in a random-base scheme, uFPIM, to improve switching performance under nonuniform traffic patterns. The uFPIM scheme is based in the parallel iterative matching (PIM) scheme and shows the throughput improvement achieved with the captured frame concept. The uFORM scheme provides high performance under nonuniform traffic while keeping the high performance that round-robin schemes are known to have under uniform traffic.Index Terms-input-queued switch, round-robin matching, virtual output queue, captured frame, frame eligibility, service frame, unbalanced traffic

show abstract

Section: Unlimited Frame Occupancy-based Pim Schemementioning

confidence: 99%

Matching schemes with captured-frame eligibility for input-queued packet switches

Rojas‐Cessa

Lin

2005

IEEE International Conference on Communications, 2005. ICC 2005. 2005

View full text Add to dashboard Cite

show abstract

“…Therefore, the throughput of this switch when m = N is 63.2% (as in an N × N IQ switch with random selection [27], [31]). This shows that the performance of the mSMCB switch is also determined by the matching process.…”

Section: Maximum Throughput Of the 2smcb And Smcbx2 With Random Sementioning

confidence: 99%

Throughput analysis of shared-memory crosspoint buffered packet switches

Dong

Rojas‐Cessa

2012

IET Commun.

View full text Add to dashboard Cite

This paper presents a theoretical throughput analysis of two buffered-crossbar switches, called shared-memory crosspoint buffered (SMCB) switches, in which crosspoint buffers are shared by two or more inputs. In one of the switches, the sharedcrosspoint buffers are dynamically partitioned and assigned to the sharing inputs, and memory is sped up. In the other switch, inputs are arbitrated to determine which of them accesses the shared-crosspoint buffers, and memory speedup is avoided. SMCB switches have been shown to achieve a throughput comparable to that of a combined input-crosspoint buffered (CICB) switch with dedicated crosspoint buffers to each input but, with less memory than a CICB switch. The two analyzed SMCB switches use random selection as the arbitration scheme. We model the states of the shared crosspoint buffers of the two switches using a Markov-modulated process and prove that the throughput of the proposed switches approaches 100% under independent and identically distributed uniform traffic. In addition, we provide numerical evaluations of the derived formulas to show how the throughput approaches asymptotically to 100%.

show abstract

“…Some of the scheduling algorithms are LQF (Kumar et al, 2004), OCF (Serpanos and Antoniadis, 2000) and LPF (Mekkittikul and McKeown, 1996). However, MWM has intrinsically high computation complexity that is translated into long resolution time and high hardware complexity.…”

Section: Input Queuingmentioning

confidence: 99%

A Combined Low Latency and Weighted Fair Queuing Based Scheduling of an Input-Queued Switch

Raghupathikumar¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm manages the size of the queues and drops packets when necessary or appropriate. Scheduling algorithms determine next packet to transfer and solves conflicts with the switching fabric. Fairness and Starvation are another two properties of IQ switches and it is analyzed in finite VOQ in this works. Fairness performs fair allocation of bandwidth among flows and prevents flows from misbehaving flows. Starvation of VOQ prevents serving High priority queue. The motivation behind this study is to schedule the HoL packets queued in finite VOQs by Framing with Low Latency Queuing (LLQ) and Weighted Fair Queueing (WFQ). This queueing technique of VOQ is measured in terms of throughput and average delay by fair allocation of bandwidth with WFQ and Starvation-free queue with LLQ.

show abstract

Analysis of nonblocking ATM switches with multiple input queues

Cited by 45 publications

References 23 publications

Matching schemes with captured-frame eligibility for input-queued packet switches

Matching schemes with captured-frame eligibility for input-queued packet switches

Throughput analysis of shared-memory crosspoint buffered packet switches

A Combined Low Latency and Weighted Fair Queuing Based Scheduling of an Input-Queued Switch

Contact Info

Product

Resources

About