Non-blocking grooming switch

Details Non-blocking grooming switch Non-blocking grooming switch

2006-12-26

2006-12-26

Nguyen, Hanh (Department: 2616)

Multiplex communications

Pathfinding or routing

Through a circuit switch

C370S375000, C370S380000, C370S389000

Reexamination Certificate

active

07154887

ABSTRACT:
A grooming switch comprises plural input ports for receiving multi-time-slot input signals and plural output ports for forwarding multi-time-slot output signals. At least five switching stages alternate between time switching and space switching. The first stage is connected to the input ports, and the last stage is connected to the output ports. Each intermediate stage is connected to two other stages. Collectively, these stages perform compact superconcentration of the input signals, copying and distribution of the compact superconcentrated signals, and unicast switching of the distributed signals to form the output signals, resulting in a grooming switch that is rearrangeably non-blocking for arbitrary multicast traffic.

REFERENCES:
patent: 3735049 (1973-05-01), Buchner et al.
patent: 3736381 (1973-05-01), Johnson et al.
patent: 3925621 (1975-12-01), Collins et al.
patent: 3927267 (1975-12-01), Voyer et al.
patent: 3956593 (1976-05-01), Collins et al.
patent: 4005272 (1977-01-01), Collins et al.
patent: 4038497 (1977-07-01), Collins et al.
patent: 4797589 (1989-01-01), Collins
patent: 4967405 (1990-10-01), Upp et al.
patent: 5229991 (1993-07-01), Turner
patent: 5493565 (1996-02-01), Hanson et al.
patent: 5671222 (1997-09-01), Chen et al.
patent: 5724352 (1998-03-01), Cloonan et al.
patent: 5801641 (1998-09-01), Yang et al.
patent: 5945922 (1999-08-01), Gao et al.
patent: 6169737 (2001-01-01), Lindberg et al.
patent: 6215773 (2001-04-01), Karlsson
patent: 6240063 (2001-05-01), Suzuki
patent: 6870831 (2005-03-01), Hughes et al.
patent: 2001/0053160 (2001-12-01), Dally
patent: 2002/0146003 (2002-10-01), Kam et al.
patent: WO 96/08902 (1996-03-01), None
Sezaki, K., et al, “The Cascade Clos Broadcast Switching Network—A New ATM Switching Network Which is Multiconnection Non-Blocking”,Proceedings of the International Switching Symposium(ISS 1990); vol. 4, May 28, 1990-Jun. 1, 1990, pp. 143-147, XP000130910.
Ghaffar, A., et al., “Middle Stage Requirements and Blocking Probability Validation for Three Stage Broadcasting Clos Networks”,International Conference on Communications(ICC 1996); vol. 2, Jun. 23-27, 1996, pp. 1050-1054, XP 000625932.
To, P., et al., “Generalized Non-blocking Copy Networks”, InternationalConference on Communications(ICC 1997), Jun. 8-12, 1997, pp. 467-471, XP010227061.
Hwang, F. K., and Liaw, S.-C., “On Nonblocking Multicast Three-Stage Clos Networks,”IEEE/ACM Transactions on Networking, 8(4): 535-539 (2000).
Bene{hacek over (s)}, V.E., “Rearrangeable Networks.” InMathematical Theory of Connecting Networks and Telephonic Traffic, pp. 82-135.
Clos, C., “A Study of Non-Blocking Switching Networks,”The Bell System Technical Journal, 406-424 (1953).
Hui, J., “Multi-Point and Generalized Circuit Switching.” InSwitching and Traffic Theory for Integrated Broadband Networks, pp. 85-107.
“3.2 Gbps Cross Point Switches with Integrated Clock and Data Recovery,”VC3003&VC3002, Velio Communications, Inc., pp. 1-2 (May 21, 2001).
“72=72, 2.5Gb/s (STS-48/STS-48c/STM-16) with OC-192 Support SONET/SDH Grooming Switch,”VC2002, Velio Communications, Inc., pp. 1-2 (Mar. 15, 2001).
“SONET Telecommunications Standard Primer.” Tektronix, pp. 1-34 [as found on www.tektronix.com] (2001).
“SDH Telecommunications Standard Primer.” Tektronix, pp. 1-38 [as found on www.tektronix.com] (2001).

Affiliated with

Also associated with

Rating

Non-blocking grooming switch does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Non-blocking grooming switch, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-blocking grooming switch will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3667592