Method and apparatus for a rearrangeably non-blocking...

Multiplex communications – Pathfinding or routing – Through a circuit switch

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S389000, C340S002200

Reexamination Certificate

active

06982974

ABSTRACT:
A switching apparatus is disclosed that employs a relatively simple and inexpensive switching matrix, but which avoids interruption of existing connections when connections are added or removed. The switching matrix switches errorlessly by controlling the point in time at which switching occurs. Using such a technique, switching can be performed without disturbing the connections already configured in the switching matrix, and so is referred to herein as being non-blocking. Optionally, the incoming data can be rearranged to provide a larger window of time in which the switching matrix can be switched. In the case of a switch using an optical backplane, this also allows more time for various components of the system (e.g., clock/data recovery units) to re-acquire lock. The switching apparatus includes a switching matrix and control circuitry. The switching matrix has a matrix input, a control input and a number of matrix outputs, and is configured to receive an information stream at the matrix input. The information stream includes a number of portions, while the control circuitry has a control output coupled to the control input. The control circuitry is configured to initially configure the switching matrix to output the information stream at a one of the matrix outputs and to subsequently configure the switching matrix to output the information stream at another of the matrix outputs during a period of time during which the one of the portions is transiting the switching matrix.

REFERENCES:
patent: 4074072 (1978-02-01), Christensen et al.
patent: 4470139 (1984-09-01), Munter
patent: 4683564 (1987-07-01), Young et al.
patent: 5084891 (1992-01-01), Ariyavisitakul et al.
patent: 5168492 (1992-12-01), Beshai et al.
patent: 5200746 (1993-04-01), Yoshifuji
patent: 5307342 (1994-04-01), Georigiou et al.
patent: 5357249 (1994-10-01), Azaren et al.
patent: 5410600 (1995-04-01), Toy
patent: 5459718 (1995-10-01), Kusano
patent: 5657449 (1997-08-01), Osaki
patent: 5777761 (1998-07-01), Fee
patent: 6145024 (2000-11-01), Maezawa et al.
patent: 6160813 (2000-12-01), Banks et al.
patent: 6188686 (2001-02-01), Smith
patent: 6208667 (2001-03-01), Caldara et al.
patent: 6266333 (2001-07-01), Kartalopoulos
patent: 6307653 (2001-10-01), Bala et al.
patent: 0 802 697 (1997-10-01), None
patent: 0 752 795 (1998-01-01), None
patent: WO 97/04397 (1997-02-01), None
patent: WO 97/24901 (1997-07-01), None
Ali Saleh; H. Michael Zadikian; Zareh Baghdasarian, Vahid Parsi, “A Method For Routing Information Over A Network”, Jan. 15, 1999; Ser. No. 09/232,397. (Copy not enclosed.).
H. Michael Zadikian; Steven E. Plote, John C. Adler, David Parish Autry, Ali Saleh, “Method of Providing Network Services”, Jan. 4, 2000; Ser. No. 09/477,498. (Copy not enclosed).
Ali Saleh, “A Method For Path Selection In A Network”, Jan. 4, 2000; Ser. No. 09/478,235. (Copy not enclosed).
Ali N. Saleh and Stevan E. Plote, “A Network Addressing Scheme For Reducing Protocol Overhead In An Optical Network”, Sep. 2, 1999; Ser. No. 09/389,302. (Copy not enclosed.).
Ali Saleh, H. Michael Zadikian; John C. Adler, Zareh Baghdasarian, Vahid Parsi, “Configurable Network Router”, Jan. 15, 1999; Ser. No. 09/232,395. (Copy not enclosed.).
H. Michael Zadikian, Ali Saleh; John C. Adler, Zareh Baghdasarian, Vahid Parsi, “Configurable Network Router”, Jan. 15, 1999; Ser. No. 09/232,396. (Copy not enclosed.).
H. Michael Zadikian, Ali Saleh; John C. Adler, Zareh Baghdasarian, Vahid Parsi, “A Resource Management Protocol For A Configurable Network Router”, Jan. 4, 2000; Ser. No. 60/174,323. (Copy not enclosed.).
Ronald Alan Russell and Michael Kevin Anthony, “A Method And Apparatus For Isolating Faults In A Switching Matrix”, Jan. 4, 2000; Ser. No. 09/477,217. (Copy not enclosed.).
Komine, et al., “A Distributed Restoration Algorithm for Multiple-Link and Node Failures of Transport Networks,”IEEE, Globecom '90,Apr. 1990.
Zhang, et al., “On Fundamental Issues in IP Over WDM Multicast,”IEEE, Computer Communications and Networks,Sep. 1999.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for a rearrangeably non-blocking... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for a rearrangeably non-blocking..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for a rearrangeably non-blocking... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3537096

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.