Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2005-07-05
2005-07-05
Nguyen, Chau (Department: 2663)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S380000, C370S388000
Reexamination Certificate
active
06914902
ABSTRACT:
A marching algorithm for the selection of middle stage switch elements in a network uses an arbitrary but settled sequence in which middle stage switch elements are sampled. The sequence is applied in the forward direction to find an appropriate middle stage switch element during connection and in a reverse direction during disconnection to find an appropriate middle stage switch element for rearrangement. All of the input switch elements use the same marching sequence. The marching algorithm is applicable to both single rate and multi-rate connections. In the case of multi-rate connections, multiple rearrangements may occur at disconnect to match the capacity of the terminated connection.
REFERENCES:
patent: 4394541 (1983-07-01), Seiden
patent: 5276425 (1994-01-01), Swanson et al.
patent: 5450074 (1995-09-01), Yoshifuji
patent: 5495476 (1996-02-01), Kumar
patent: 5754120 (1998-05-01), Argentati
patent: 5801641 (1998-09-01), Yang et al.
A Rearrangement Algorithm for Three-Stage Switchingby Satoru Ohta et al.,Electronics and Communications in Japan, Part 1, vol. 70, No. 9, 1987.
A Simple Control Algorithm for Rearrangeable Switching Networks with Time Division Multiplexed Linksby Satoru Ohta,IEEE Journal on Selected Areas in Communications, vol. SAC-5, No. 8, Oct. 1987.
Semi-Rearrangeably Nonblocking Operation of Clos Networks in the Multirate Environmentby Fotios K. Liotopoulos et al.,IEEE/ACM Transactions on Networking, vol. 4, No. 2, Apr. 1996.
Clos Networks, Benes Networks, and Introduction to Routing Algorithmsby Bill Dally, EE482:Advanced Computer Organization, Lecture # 5, Interconnection Networks Architecture and Design, Stanford University, Apr. 18, 2001.
Wide-Sense Nonblocking Clos Networks under Packing Strategyby Yuanyuan Yang et al., Department of Computer Science and Electrical Engineering, University of Vermont, Burlington, VT and GTE Laboratories, Waltham, MA.
A New Decomposition Algorithm for Rearrangeable Clos Interconnection Networks, By Hyun Y. Lee et al., IEE Transactions on Communications, vol. 44, No. 11, Nov. 1996.
Synchronous Optical Network(SONET)—Automatic Protection Switching, American National Standard for Telecommunications, T1.105.01-200 (Revision of T1.105.01- 1998).
Gordon & Jacobson, PC
Hyun Soon D.
Nguyen Chau
Opal Acquisition Corporation
LandOfFree
Distributed semi-rearrangeable non-blocking algorithm for... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Distributed semi-rearrangeable non-blocking algorithm for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed semi-rearrangeable non-blocking algorithm for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3411006