Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2003-02-19
2008-03-18
Nguyen, Steven (Department: 2619)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S388000
Reexamination Certificate
active
07346049
ABSTRACT:
A scheduling algorithm is provided that may be implemented in a multi-stage switch requiring less switching elements than known switching architectures in order to increase bandwidth and to retain the non-blocking properties of the constituent switching elements for incoming traffic, including multicast traffic. A scheduling algorithm is also provided for incremental scheduling of connections being added or removed from the switch.
REFERENCES:
patent: 3576398 (1971-04-01), Dejean et al.
patent: 3632883 (1972-01-01), Augaard
patent: 3735049 (1973-05-01), Buchner et al.
patent: 3736381 (1973-05-01), Johnson et al.
patent: 3832492 (1974-08-01), Charransol et al.
patent: 3927267 (1975-12-01), Voyer et al.
patent: 4004103 (1977-01-01), Liu et al.
patent: 4035584 (1977-07-01), Lurtz
patent: 4038638 (1977-07-01), Hwang
patent: 4123624 (1978-10-01), Gagnier et al.
patent: 4394541 (1983-07-01), Seiden
patent: 4470139 (1984-09-01), Munter
patent: 4566007 (1986-01-01), Richards
patent: 4764918 (1988-08-01), Waters
patent: 4771420 (1988-09-01), Deschaine et al.
patent: 4797589 (1989-01-01), Collins
patent: 4817083 (1989-03-01), Richards
patent: 4849964 (1989-07-01), Van Baardewijk
patent: 4935921 (1990-06-01), Ishizaki et al.
patent: 4967405 (1990-10-01), Upp et al.
patent: 5040170 (1991-08-01), Upp et al.
patent: 5111414 (1992-05-01), Arrathoon
patent: 5144297 (1992-09-01), Ohara
patent: 5189410 (1993-02-01), Kosugi et al.
patent: 5311506 (1994-05-01), Beisel
patent: 5323390 (1994-06-01), Pawelski
patent: 5345441 (1994-09-01), Paker et al.
patent: 5408231 (1995-04-01), Bowdon
patent: 5430716 (1995-07-01), Pawelski
patent: 5436890 (1995-07-01), Read et al.
patent: 5469154 (1995-11-01), Karp
patent: 5526359 (1996-06-01), Read et al.
patent: 5629932 (1997-05-01), Kim
patent: 5987027 (1999-11-01), Park et al.
patent: 6034947 (2000-03-01), Yoshida et al.
patent: 6041055 (2000-03-01), Chopping
patent: 6816487 (2004-11-01), Roberts et al.
patent: 6885669 (2005-04-01), Konda
Hwang, Frank K., et al., “On Nonblocking Multicast Three-State Clos Networks”, IEEE/ACMTransactions on Networking,vol. 8(4), 535-539 (2000).
Benes, V.E., “On Rearrangeable Three-Stage Connecting Networks,” The Bell System Technical Journal, vol. XLI, No. 5, Sep. 1962, pp. 1481-1492.
Clos, Charles, “A Study of Non-Blocking Switching Networks,” Bell System Technical Journal, Mar. 1953, pp. 406-424.
“Lucent Technologies introduces cross-connect ship for high-speed optical networking systems,” 1999, http://www.chipcenter.com/telecommunications/mdp/webscan/mn00e/mn00e016.htm; 2 pages.
“900-Series DSX (Digital Signal Cross-Connect) System,” 1996, http/connectivity1.avaya.com/exchangemax/fact—sheets/pdf/2883fs-3.pdf, 6 pages.
Benes, V.E., “Mathematical Theory of Connecting Networks and Telephone Traffic”,Academic Press,1965, pp. 82-95.
Maiorana P.C. Christopher P.
Nguyen Steven
LandOfFree
Scheduling connections in a multi-stage switch to retain... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Scheduling connections in a multi-stage switch to retain..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling connections in a multi-stage switch to retain... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3980059