Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2004-11-27
2008-09-09
Zimmerman, Brian (Department: 2612)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S351000, C370S357000, C370S386000, C340S002200, C340S002220, C340S002210, C340S002280, C379S306000
Reexamination Certificate
active
07424011
ABSTRACT:
A rearrangeably nonblocking multicast network includes an input stage having r1switches and n1inlet links for each of r1switches, an output stage having r2switches and n2outlet links for each of r2switches. The network also has a middle stage of m switches, and each middle switch has at least one link connected to each input switch for a total of at least r1first internal links and at least one link connected to each output switch for a total of at least r2second internal links, where m≧n1+n2. The network has all multicast connections set up such that each multicast connection passes through at most two middle switches to be connected to the destination outlet links.
REFERENCES:
patent: 3980834 (1976-09-01), Akiyama et al.
patent: 4038638 (1977-07-01), Hwang
patent: 4566007 (1986-01-01), Richards
patent: 5023864 (1991-06-01), Cloonan et al.
patent: 5179551 (1993-01-01), Turner
patent: 5276425 (1994-01-01), Swanson et al.
patent: 5291477 (1994-03-01), Liew
patent: 5451936 (1995-09-01), Yang et al.
patent: 5544160 (1996-08-01), Cloonan et al.
patent: 5801641 (1998-09-01), Yang et al.
V.E. Benes, “Mathematical Theory of Connecting Networks and Telephone Traffic” (Academic Press, 1965).
Y. Yang, and G.M., Masson, “Nonblocking Broadcast Switching Networks” IEEE Transactions on Computers, vol. 40, No. 9, Sep. 1991.
G. M. Masson & B. W. Jordan, “Generalized Multi-Stage Connection Networks” Networks, 2: pp. 191-209, 1972 by John Wiley and Sons, Inc.
F. K. Hwang, “Rearrangeability of Multi-Connection Three-Stage Clos Networks”, Networks, 2: pp. 301-306, 1972 by John Wiley and Sons, Inc.
Gaylord W. Richards and Frank K. Hwang, “A Two-Stage Rearrangeable Broadcast Switching Network”. IEEE Transactions on Communications, vol. COM-33, No. 10, Oct. 1985, pp. 1025.
Charles Clos “A Study of Non-Blocking Switching Networks”, The Bell System Technical Journal, vol. XXXII, Jan. 1953, No. 1, pp. 406-424.
D.S. Kim, and D. Du, “Performance of Split Routing Algorithm for three-stage multicast networks”, IEEE/ACM Transactions on Networking, vol. 8, No. 4, Aug. 2000.
F.K. Hwang, “Three-stage multiconnection networks which are nonblocking in the wide sense”, The Bell systems technical journal, vol. 58, No. 10, Dec. 1979.
D. G. Cantor, “On Non-blocking Switching Networks”, Networks, 1: pp. 367-377, 1972 by John Wiley and Sons, Inc.
F. K. Hwang and A. Jajszczyk, “On nonblocking multiconnection networks,” IEEE Trans. Communications, vol. COM-34, pp. 1038-1041, 1986.
G. M. Masson, “Binomial switching networks for concentration and distribution,” IEEE Trans. Communications, vol. COM-25, pp. 873-884, 1977.
G.M. Masson, “Upper Bounds on Fanout in Connection Networks”, IEEE Transactions on Circuit Theory, vol. CT-20 No. 3, May 1973.
Brown Vernal
Cooley Godward Kronish LLP
Teak Technologies, Inc.
Zimmerman Brian
LandOfFree
Rearrangeably nonblocking multicast multi-stage networks does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Rearrangeably nonblocking multicast multi-stage networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rearrangeably nonblocking multicast multi-stage networks will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3966160