Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2005-04-26
2005-04-26
Zimmerman, Brian (Department: 2635)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C340S002200
Reexamination Certificate
active
06885669
ABSTRACT:
A rearrangeably nonblocking multicast network in accordance with the invention 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. When the number of inlet links in each input switch n1is equal to the number of outlet links in each output switch n2, and n1=n2=n, a three-stage network is operated in rearrangeably nonblocking manner in accordance with the invention, where m≧2*n. Also in accordance with the invention, a three-stage network having m>n1+n2is operated in rearrangeably nonblocking manner even if some multicast connections are set up using more than two middle switches as long as each connection has available links into at least two middle switches.
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.
Masson, Upper Bounds on Fanout in Connection Networks, May 1973, IEEE Transactions on Circuit Theory Bol. CT-20 No. 3.*
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.
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.
Teak Networks, 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-3398029