Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2004-09-05
2008-09-09
Kizou, Hassan (Department: 2619)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S401000, C340S002220
Reexamination Certificate
active
07424010
ABSTRACT:
In one embodiment, a controller is configured to establish a new multicast connection within a network without changing a path of an existing multicast connection within the network. The network can have an input stage having a total of at least n1*r1inlet links, an output stage including r2output switches, and n2outlet links for each of said r2output switches for a total of at least n2*r2outlet links, and a middle stage including m middle switches, where m≧s*Min(n1,n2) and where s=2 when r2=[9,11], s=3 when r2=[25,48], s=4 when r2=[49,99, s=5 when r2=[100,154], s=6 when r2=155,224], and s=7 when r2=[225,278 ]. The new multicast connection from an inlet link from the n1*r1inlet links passes through at most s 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.
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.
Cooley Godward Kronish LLP
Kizou Hassan
TEAK Technologies, Inc.
Zhu Bo Hui A
LandOfFree
Strictly nonblocking multicast multi-split linear-time... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Strictly nonblocking multicast multi-split linear-time..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strictly nonblocking multicast multi-split linear-time... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3983842