Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2006-09-26
2006-09-26
Kizou, Hassan (Department: 2616)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S427000, C370S429000
Reexamination Certificate
active
07113505
ABSTRACT:
A synchronous cross-connect switch for routing data samples from a source node to a destination node comprises a mesh architecture including a plurality of inputs for receiving one or more of the data samples presented to the cross-connect switch. The mesh architecture includes a plurality of nodes operatively interconnected with one another using one or more half-duplex links. Each of the nodes further includes a receiver and a transmitter. Each node further includes an input time-slot-interchanger (TSI) operatively coupled to a first half-duplex link and to the receiver, the input TSI being configurable to selectively reorder one or more data samples received by the receiver, and an output TSI operatively coupled to a second half-duplex link and to the transmitter, the output TSI being configurable to selectively reorder one or more data samples to be transmitted by the transmitter. A controller operatively coupled to the receiver and to the transmitter is configured to selectively route a data sample to at least one of an output of the cross-connect switch and an adjacent node in the mesh architecture in a conflict-free manner.
REFERENCES:
patent: 4782478 (1988-11-01), Day, Jr. et al.
patent: 5159595 (1992-10-01), Flanagan et al.
patent: 5323390 (1994-06-01), Pawelski
patent: 5329524 (1994-07-01), Paker et al.
patent: 5430716 (1995-07-01), Pawelski
patent: 5457556 (1995-10-01), Shiragaki
patent: 6108333 (2000-08-01), Raamot et al.
patent: 6240063 (2001-05-01), Suzuki
patent: 6584119 (2003-06-01), Taniquchi et al.
patent: 6587470 (2003-07-01), Elliot et al.
patent: 6850660 (2005-02-01), Notani
patent: 6870838 (2005-03-01), Dally
patent: 6934471 (2005-08-01), Carvey et al.
patent: 2001/0033569 (2001-10-01), Dally
patent: 2003/0021267 (2003-01-01), Wu et al.
“A systolic architecture for sorting an arbitrary number of elements” Zheng, S.Q.; Olariu, S.; Pinotti, M.C.; Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97. 1997 3rd International Conference on Dec. 10-12, 1997 pp. 113-126.
C. Clos, “A Study of Non-Blocking Switching Networks,” Bell Labs Technical Journal, pp. 406-424 (1952).
S. Kumar et al., “An Algorithm for Control of a Three Stage Clos-Type Interconnection Network,” Fourth IEEE Region 10 International Conference, pp. 794-797 (1989).
C. Scheideler et al., “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,”SIAM Journal on Computing, vol. 30, No. 4, pp. 1126-1155 (1999).
R. Cypher et al., “Universal Algorithms for Store-and-Forward and Wormhole Routing,”In Proc. of the 28th ACM Symp. on Theory of Computing(STOC), pp. 356-365 (1996).
J. Hopcroft et al., “Ann5/2Algorithm for Maximum Matchings in Bipartite Graphs,”SIAM Journal of Computing, vol. 2, No. 4, pp. 225-231 (Dec. 1973).
H.N. Gabow et al., “Algorithms for Edge Coloring Bipartite Graphs and Multigraphs,”SIAM Journal of Computing, vol. 11, No. 1 (Feb. 1982).
A. Schrijver, “Bipartite Edge Coloring in O(Δm) Time,”SIAM Journal of Computing, vol. 28, No. 3, pp. 841-846 (Dec. 1973).
J. Carpinelli et al., “Applications of Edge-Coloring Algorithms to Routing on Parallel Computers,”Proceedings of the Third International Conference on Supercomputing, Boston, MA, pp. 249-257 (May 1988).
Agere Systems Inc.
Kizou Hassan
Roberts Brian
LandOfFree
Mesh architecture for synchronous cross-connects does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Mesh architecture for synchronous cross-connects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mesh architecture for synchronous cross-connects will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3616942