This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports
September 1988 (vol. 37 no. 9)
pp. 1148-1151
The problem of minimizing the number of service ports of a central facility which serves a number of users subject to some constraints is addressed. At any time, a set of at most s users may want to use the facility, and one user can be connected to each port at a given time. It is assumed that there are direct communication links from users to service ports, with at most d links incident at a

[1] N. Alon, "Eigenvalues, geometric expanders, sorting in rounds and Ramsey theory,"Combinatorica, vol. 6, pp. 207-219, 1986.
[2] N. Alon and V. D. Milman, "Eigenvalues, expanders, and superconcentrators," inProc. 25th IEEE Conf. Foundations Comput. Sci., 1984, pp. 320-322.
[3] N. Alon, Z. Galil, and V. D. Milman, "Better expanders and superconcentrators," preprint.
[4] D. Angluin, "A note on a contruction of Margulis,"Inform. Processing Lett., vol. 8, pp. 17-19, Jan. 1979.
[5] L. Bassalygo and M. Pinsker, "Complexity of an optimum nonblocking switching network without reconnections,"Problemy Peredachi Informatsii, vol. 9, no. 1, pp. 84-87, 1973; translated into English inProblems Inform. Transmission, vol. 9, no. 1, pp. 64-66, 1974.
[6] F. R. K. Chung, "On concentrators, superconcentrators, generalizers, and nonblocking networks,"Bell Syst. Tech. J., vol. 58, pp. 1765- 1777, Oct. 1979.
[7] C. Cohen and J. Stein,Multi-Purpose Optimization System, User's Guide, Vogelback Comput. Center, Northwestern Univ., Evanston, IL, 1978.
[8] O. Gabber and Z. Galil, "Explicit constructions of linear size superconcentrators," inProc. 20th IEEE Conf. Foundations Comput. Sci., 1979, pp. 364-370, andJ. Comput. Syst. Sci., vol. 22, pp. 407-420, 1981.
[9] G. A. Margulis, "Explicit construction of concentrators,"Problemy Peredachi Informatsii, vol. 9, no. 4, pp. 79-80, 1973; translated into English in Problems Inform. Transmission, vol. 9, pp. 325-332, 1973.
[10] M. S. Pinsker, "On the complexity of a concentrator," inProc. 7th Int. Teletraffic Conf., Stockholm, Sweden, 1973, pp. 318/1-318/4.
[11] N. Pippenger, "Superconcentrators,"SIAM J. Comput., vol. 6, pp. 298-304, 1977.
[12] N. Pippenger, "Generalized connectors,"SIAM J. Comput., vol. 7, pp. 510-514, 1978.
[13] R. M. Tanner, "Explicit concentrators from generalized N-gons,"SIAM J. Algebraic Discrete Methods, vol. 5, no. 3, pp. 287-293, 1984.
[14] L. G. Valiant, "On nonlinear lower bounds in computational complexity," inProc. 7th Annu. ACM Symp. Theory Comput., Albuquerque, NM, 1975, pp. 45-53.

Index Terms:
communication networks; bounded fan-in; service ports; users; graph-theoretic problem; bipartite graph; linear programming; computer networks; graph theory; linear programming.
Citation:
D.B. West, P. Banerjee, "On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports," IEEE Transactions on Computers, vol. 37, no. 9, pp. 1148-1151, Sept. 1988, doi:10.1109/12.2270
Usage of this product signifies your acceptance of the Terms of Use.