Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2008-06-06
2010-11-30
Ho, Duc C (Department: 2465)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S388000, C370S389000, C340S002220
Reexamination Certificate
active
07843908
ABSTRACT:
A configuration scheme for IQC switches that hierarchizes the matching process reduces configuration complexity by performing routing first and port matching afterwards in a three-stage Clos-network switch. This scheme applies the reduction concept of Clos networks to the matching process. This, in turn, results in a feasible size of schedulers for up to Exabit-capacity switches, an independent configuration of the middle stage modules from port matches, a reduction of the matching communication overhead between different stages, and a release of the switching function to the last-stage modules in a three-stage switch. The switching performance of the proposed approach using weight-based and weightless selection schemes is high under uniform and non-uniform traffic. The number of stages of a Clos-network switch can be reduced to two.
REFERENCES:
patent: 6696917 (2004-02-01), Heitner et al.
patent: 2002/0061020 (2002-05-01), Chao et al.
patent: 2005/0152352 (2005-07-01), Jun et al.
patent: 2006/0285548 (2006-12-01), Hill et al.
C. Clos, “A Study of Nonblocking Switching Networks,”Bell Syst. Tech. J., 32:406-424, 1953.
M. G. Hlychyj and M. J. Karol, “Queueing in High-Performance Packet Switching”,IEEE Journal on Selected Areas in Communications, 6(9):1587-1597, Dec. 1988.
F. M. Chiussi, J. G. Kneuer and V. P. Kumar, “Low-Cost Scalable Switching Solutions for Broadband Networking: The ATLANTA Architecture and Chipset”,IEEE Communications Magazine, 44-53, Dec. 1997.
J. Turner and N. Yamanaka, “Architectural Choices in Large Scale ATM Switches”,IEICE Transactions in Communications, E81-B(2):120-137, Feb. 1998.
R. Schoenen, G. Post and G. Sander, “Weighted Arbitration Algorithms with Priorities for Input-Queued Switches with 100% Thoroughput”,IEEE International Workshop on Broadband Switching Systems, 1999.
P. Gupta and N. McKeown, “Designing and Implementing A Fast Crossbar Scheduler”,Micro IEEE, 19(1):20-28, Jan./Feb. 1999.
N. McKeown, “TheiSLIP Scheduling Algorithm for Input-Queued Switches”,IEEE/ACM Transactions on Networking, 7(2):188-201, Apr. 1999.
N. McKeown, et al., “Achieving 100% Thoroughput in an Input-Queued Switch”,IEEE Transactions on Communications, 47(8):1260-1267, Aug. 1999.
C-S Chang, W-J Chen and H-Y Huang, “Birkhoff-von Neumann Input Buffered Crossbar Switches”, Proc.IEEE Infocom 2000, 1614-1623, 2000.
C-S Chang, D-S Lee and Y-S Jou, “Load Balanced Birkhoff-von Neumann Switches”,Proc. IEEE HPSR 2001, 324-329, May 2001.
R. Rojas-Cessa, et al., “CIXB-1: Combined Input-One-cell-Crosspoint Buffered Switch”,Proc. IEEE HPSR 2001, 324-329, May 2001.
K. Pun and M. Hamdi, “Static Round-Robin Dispatching Schemes for Clos-Network Switches”,Proc. 2002 IEEE Conf. HPSR, 329-222, 2002.
T. T. Lee and S. Y. Liew, “Parallel Routing Algorithms in Benes-Clos Networks”,IEEE Transactions on Communications, 50(11):1841-1847, Nov. 2002.
K. Pun and M. Hamdi, “Distro: A Distributed Static Round-Robin Scheduling Algorithm for Bufferless Clos-Network Switches”,IEEE Globecom, 2298-2302, Nov. 2002.
E. Oki, et al., “Concurrent Round-Robin-Based Dispatching Schemes for Clos-Network Switches”,IEEE/ACM Transactions on Networking, 10(6): 830-844, Dec. 2002.
H. J. Chao, S. Y. Liew and Z. Jing, “A Dual-Level Matching Algorithm for 3-Stage Clos-Network Packet Switches”,Proc. 11thHOTI, 2003.
H. J. Chao, Z. Jing and S. Y. Liew, “Matching Algorithms for Three-Stage Bufferless Clos Network Switches”,Communications Magazine, IEEE, 41(10):46-53, Oct. 2003.
R. Rojas-Cessa, E. Oki and H. J. Chao, “Maximum Weight Matching Dispatching Scheme in Buffered Clos-Network Packet Switches”,2004 IEEE International Conference on Communications, 2:1075-1079, Jun. 20-24, 2004.
C-B Lin and R. Rojas-Cessa, “Captured-Frame Eligibility and Round-Robin Matching for Input-Queued Packet Switches”,2004 IEEE Communications Letters, 8(9):585-587, Sep. 2004.
C-B Lin and R. Rojas-Cessa, “Frame Occupancy-Based Dispaching Schemes for Buffered Three-stage Clos-Network Switches”,13thIEEE International Conference on Networks, 2005, 771-775, Nov. 2005.
International Search Report and Written Opinion for PCT/US2008/066133 mailed Oct. 7, 2008.
Chuan-Bi Lin et al., “Module Matching Schemes for Input-Queued Clos-Network Packet Switches”,IEEE Communications Letters, IEEE Service Center, Piscataway, NJ, vol. 11, No. 2, Feb. 1, 2007, pp. 194-196.
Jajszczyk A., Nonblocking, Repackable, and Rearrangeable Clos Networks: Fifty Years of the Theory Evolution,IEEE Communications Magazine, IEEE Service Center, Piscataway, US, vol. 41, No. 10, Oct. 1, 2003, pp. 28-33.
International Preliminary Report on Patentability for PCT/US2008/066133, mailed Dec. 23, 2009.
Lin Chuan-Bi
Rojas-Cessa Roberto
LandOfFree
Scalable two-stage Clos-networking switch and module-first... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Scalable two-stage Clos-networking switch and module-first..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable two-stage Clos-networking switch and module-first... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4177807