Module-First Matching Schemes for Scalable Input-Queued Space-Space-Space Clos-Network Packet Switches

Lin, Chuan-Bi; Rojas‐Cessa, Roberto

doi:10.1109/icc.2008.1062

2008 IEEE International Conference on Communications 2008

DOI: 10.1109/icc.2008.1062

|View full text |Cite

Module-First Matching Schemes for Scalable Input-Queued Space-Space-Space Clos-Network Packet Switches

Chuan-Bi Lin

Roberto Rojas‐Cessa

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2009

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Analysis of Space-Space-Space Clos-Network Packet Switch

Oki

Kitsuwan

Rojas‐Cessa

2009

2009 Proceedings of 18th International Conference on Computer Communications and Networks

View full text Add to dashboard Cite

The throughput of a packet switch is a major switch property, and therefore, of major interest to analyze it. An approximation of the throughput of a staged random selection algorithm with a single iteration under uniform for a three-stage Clos-network packet switch, also called a Space-Space-Space (S 3 ) Clos-network packet switch, has been recently presented. However, the difference between this approximation and the actual throughput of the staged random selection algorithm is significant. To address this issue, this paper presents a theoretical throughput analysis of the staged random selection algorithm with a single iteration for a S 3 Clos-network switch and show that the throughput is higher than that estimated by the existing approximation. Second, the paper extends the analysis to calculate the throughput of the staged random selection algorithm with multiple iterations by considering the analysis of the parallel iterative matching scheme, which is a random-based matching scheme for single-stage switches. The introduced derivation carefully considers the behavior of the selection algorithm at the switching modules in all three stages of the switch. The probability that a request reaches the third-stage modules is affected by the matching results at the second-stage modules. Numerical evaluations of the analytical formulas are performed. The results show that the staged random selection algorithm with multiple iterations for a S 3 Clos-network switch without internal expansion can achieve 100% throughput under uniform traffic.

show abstract

Analysis of Space-Space-Space Clos-Network Packet Switch

Oki

Kitsuwan

Rojas‐Cessa

2009

2009 Proceedings of 18th International Conference on Computer Communications and Networks

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Module-First Matching Schemes for Scalable Input-Queued Space-Space-Space Clos-Network Packet Switches

Cited by 1 publication

References 14 publications

Analysis of Space-Space-Space Clos-Network Packet Switch

Analysis of Space-Space-Space Clos-Network Packet Switch

Contact Info

Product

Resources

About