Communications: electrical – Continuously variable indicating – With meter reading
Patent
1994-03-25
1996-05-28
Swarthout, Brent A.
Communications: electrical
Continuously variable indicating
With meter reading
3408258, 370 54, 379271, 379272, H01H 6700
Patent
active
055215912
ABSTRACT:
A class of switching networks is comprised of expansive logical clusters and/or dispersive logical clusters. These clusters are of low degree. The class of networks include multibutterfly networks as well as multi-Benes networks. These networks provide for fault tolerance and routing and for efficient routing. Moreover, routing is provided in a non-blocking fashion.
REFERENCES:
patent: 3851122 (1974-11-01), Gibson
patent: 4349702 (1982-09-01), Joel, Jr.
patent: 4651318 (1987-03-01), Luderer
patent: 4731825 (1988-03-01), Wojcinski et al.
patent: 4845736 (1989-07-01), Posner et al.
patent: 4862161 (1989-08-01), Schomers
patent: 5040173 (1991-08-01), Richards
Upfal, Eliezer, "An 0(logN) Deterministic Packet Routing Scheme" Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington, May 15-17, 1989, pp. 241-250.
Leighton, Tom & Maggs, Bruce, "Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies" Proceedings of the Thirtieth Annual Symposium on Foundations of Computer Science, IEEE, Oct. 1989, pp. 384-389.
Fahlman, Scott E., "The Hashnet Interconnection Scheme," Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania, Jun. 2, 1980, pp. 1-19.
Feldman, Paul et al., "Non-Blocking Networks (Preliminary Version)," Association for Computing Machinery, 1986, pp. 247-254.
Feldman, Paul et al., "Wide-Sense Nonblocking Networks," Siam J. Disc. Math., vol. 1, No. 2, May 1988, Copyright 1988 Society for Industrial and Applied Mathematics.
Pippenger, Nicholas, "Telephone Switching Networks," Proceedings of Symposia in Applied Mathematics, vol. 26, 1982, copyright 1982 American Mathematical Society, pp. 101-133.
Bassalygo, L. A. et al., "Complexity of an Optimum Nonblocking Switching Network Without Reconnections", Translated from Problemy Peredachi Informatsii, vol. 9, No. 1, pp. 84-87, Jan.-Mar. 1973. Origianl articla submitted Jun. 25, 1971, 1975 Plenum Publishing Corporation, 227 W. 17th St., New York, N.Y.
Arora, S., et al., "On-line Algorithms for Path Selection in Nonblocking Networks", Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 1990, pp. 149-158.
Arora Sanjeev
Knight, Jr. Thomas F.
Leighton Frank T.
Maggs Bruce M.
Upfal Eliezer
Hill Andrew
Massachusetts Institute of Technology
Swarthout Brent A.
LandOfFree
Switching networks with expansive and/or dispersive logical clus does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Switching networks with expansive and/or dispersive logical clus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Switching networks with expansive and/or dispersive logical clus will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-790017