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

Rojas‐Cessa, Roberto; Lin, Chuan-Bi

doi:10.1109/icc.2005.1494494

Cited by 3 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The resulting matching schemes are a combination of weight-based and weightless approaches where randomness may play a role in their delivered performance. In [16], [17] has been shown that holding the matches of busy flows for longer time is beneficial to achieve higher switching performance than using a complex matching policy. On the other hand, the performance of cell-and packet-based switching modes have been shown with some performance differences [18]- [20].…”

Section: Introductionmentioning

confidence: 99%

Concatenating Packets in Variable-Length Input-Queued Packet Switches with Cell-Based and Packet-Based Scheduling

Al-Saber

Oberoi

Pedasanaganti

et al. 2008

2008 IEEE Sarnoff Symposium

View full text Add to dashboard Cite

Abstract-Internet data is transmitted in variable-size packets to provide flexibility for different applications. There has been a growing interest in developing the design of Internet routers based variable-lenght packets to improve performance and reduce the amount of re-assembly memory. However, most of variable-length designs follow a time-slotted approach, which make them similar to routers that switch fixed-length packets. The use of slotted timing makes padding necessary when packet sizes are not proportional to the time-slot length. In this paper, we investigate the impact of concatenating packets to reduce the amount of padding in variable-length packet switches. This approach increases the utilization of interconnection bandwidth and overall throughput performance. Performance evaluation in an input-queued packet switch using packet concatenation is presented.Index Terms-Packet scheduling, input-queued switch, variable length packet, cell switching, packet-based scheduling, packet concatenation.

show abstract

Section: Introductionmentioning

confidence: 99%

Concatenating Packets in Variable-Length Input-Queued Packet Switches with Cell-Based and Packet-Based Scheduling

Al-Saber

Oberoi

Pedasanaganti

et al. 2008

2008 IEEE Sarnoff Symposium

View full text Add to dashboard Cite

show abstract

“…We simulated WMoM under four different nonuniform traffic patterns: unbalanced, Chang's, asymmetric, and diagonal. Because of space limitations, the description of these models are referenced to [11]. Unbalanced probability , w…”

Section: Implementation Of Mommentioning

confidence: 99%

Module Matching Schemes for Input-Queued Clos-Network Packet Switches

Lin

Rojas‐Cessa

2007

IEEE Commun. Lett.

View full text Add to dashboard Cite

Abstract-Current schemes for configuration of input-queued three-stage Clos-network (IQC) switches involve port matching and path routing assignment, in that order. The implementation of a scheduler capable of matching thousands of ports in largesize switches is complex. To decrease the scheduler complexity for such switches (e.g., 1024 ports or more), we propose a configuration scheme for IQC switches that hierarchizes the matching process. In a practical scenario our scheme performs routing first and port matching thereafter. This approach reduces the scheduler size and the configuration complexity of IQC switches. We show that the switching performance of the proposed approach using weight-based and weightless selection schemes is high under uniform and nonuniform traffic.Index Terms-Clos-network switch, Space-Space-Space switch, matching, input queued, scheduler design.

show abstract

“…An OM (j) has n output ports, each of which is denoted as OP (j, l), and has an output buffer. The following definitions, adapted from [11], are used in the description of the proposed dispatching scheme. Frame.…”

Section: Clos-network Switch Model and Preliminary Definitionmentioning

confidence: 99%

“…In this paper, we apply framing, based on queue occupancy citerrc, to improve throughput under under nonuniform traffic patterns, without allocating any buffers in the second stage to avoid the out-of-sequence problem, and to offer a low implementation complexity. Here, we introduce the frame occupancy-based random dispatching (FRD), which is based on random dispatching [7], and the frame-occupancy concurrent round-robin dispatching (FCRRD) scheme, which is based on the CRRD scheme and on the captured-frame concept [11]. This paper shows that the captured-frame concept, used for matching eligibility, improves the performance of dispatching schemes.…”

Section: Introductionmentioning

confidence: 99%

Frame Occupancy-Based Dispatching Schemes for Buffered Three-stage Clos-Network Switches

Lin

Rojas‐Cessa

2005 13th IEEE International Conference on Networks Jointly Held With the 2005 IEEE 7th Malaysia International Conf on Communic

View full text Add to dashboard Cite

Abstract-The three-stage Clos-network switch architecture has attractive scalability features that makes it appealing as an alternative for scalable switches. However, scheduling packets in a Clos-network switch is complex. This complexity can be simplified by adding buffers to the first and third stages. By adding these buffers, the scheme used for dispatching packets from the first stage of the switch becomes important. Several dispatching schemes for Clos-network, without internal expansion, that deliver high throughput under uniform traffic model have been proposed. However, there is a need of dispatching schemes that provide high throughput under several admissible traffic patterns, including those with nonuniform distributions, with a small number of matching iterations and without internal expansion. In this paper, we propose two frame-occupancy based dispatching schemes to increase throughput performance in Closnetwork switches without using internal expansion. We show that frame-occupancy based schemes deliver high throughput under uniform and nonuniform traffic patterns.

show abstract

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

Cited by 3 publications

References 18 publications

Concatenating Packets in Variable-Length Input-Queued Packet Switches with Cell-Based and Packet-Based Scheduling

Concatenating Packets in Variable-Length Input-Queued Packet Switches with Cell-Based and Packet-Based Scheduling

Module Matching Schemes for Input-Queued Clos-Network Packet Switches

Frame Occupancy-Based Dispatching Schemes for Buffered Three-stage Clos-Network Switches

Contact Info

Product

Resources

About