Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2005-04-05
2005-04-05
Nguyen, Chau (Department: 2663)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S388000
Reexamination Certificate
active
06876650
ABSTRACT:
A method of adding a new connection (c, d) to a time:space:time switch fabric. The fabric has a set I of k input elements, a set M of m switch elements, and a set O of l output elements. Each input element contributes one input to each switch element, and each output element receives one output from each switch element. A state Smcharacterizes the switch elements as a set of ordered pairs (i, j), where (i, j) ε Smif and only if the jthoutput element is coupled to the ithinput element through one of the switch elements. The range of Smis the set of outputs of Smsuch that if j ε range(Sm) then (i, j) ε Smfor some i ε I. The domain of Smis the set of inputs of Smsuch that if i ε domain(Sm) then (i, j) ε Smfor some j ε O.
REFERENCES:
patent: 4817083 (1989-03-01), Richards
patent: 5369400 (1994-11-01), Bowdon
patent: 5430716 (1995-07-01), Pawelski
patent: 5987027 (1999-11-01), Park et al.
patent: 6169737 (2001-01-01), Lindberg et al.
patent: 6335930 (2002-01-01), Lee
patent: 6470011 (2002-10-01), Tanimura et al.
patent: 1049352 (2000-11-01), None
Nobuo Fujii, “Application of a Rearrangement Algorithm for Digital Cross-Connect System Control”, 1989, IEEE, vol. 1, pp. 228-233.*
Joseph Y. Hui, Switching and Traffic Theory For Integrated Broadband Networks, Chapter 3 “Point-to-Point Multi-Stage Circuit Switching”, Kluwer Academic Publishing, Jan., 1990.
C. Clos, “A Study of Non-blocking Switching Networks”, Bell Syst. Tech. J., vol. 32, pp. 406-424, Mar. 1953.
M.C. Paul l, “Reswitching of Connection Networks”, Bell Syst. Tech. J., vol. 41, pp. 833-855, 1962.
Hughes Andrew Milton
McCrosky Carl Dietz
Meacham, II James Ames
Sailor Kenneth Evert
Somogyi Paul Edmund
Mace Brad
Nguyen Chau
Oyen Wiggs Green & Mutala LLP
PMC-Sierra Inc.
LandOfFree
Bipartite graphical connecting scheduling in time and space... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Bipartite graphical connecting scheduling in time and space..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bipartite graphical connecting scheduling in time and space... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3440487