|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| L.M. Huisman, S. Kundu, "Highly Reliable Symmetric Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 1, pp. 94-97, January, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/71.262592, author = {L.M. Huisman and S. Kundu}, title = {Highly Reliable Symmetric Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {1}, issn = {1045-9219}, year = {1994}, pages = {94-97}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.262592}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - Highly Reliable Symmetric Networks IS - 1 SN - 1045-9219 SP94 EP97 EPD - 94-97 A1 - L.M. Huisman, A1 - S. Kundu, PY - 1994 KW - Index Termslocal area networks; reliability; highly reliable symmetric networks; directed loopnetworks; loop-symmetric networks; generalized loop networks; connectivity; local areanetworks VL - 5 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
We generalize directed loop networks to loop-symmetric networks in which there are Nnodes and in which each node has in-degree and out-degree k, subject to the conditionthat 2/sup k/ does not exceed N. We show that by proper selection of links one canobtain generalized loop networks with optimal or close to optimal diameter andconnectivity. The optimized diameter is less than k/spl lsqb/N/sup 1/k//spl rsqb/, where/spl lsqb/x/spl rsqb/ indicates the ceiling of x. We also show that these networks arerather compact in that the diameter is not more than twice the average distance.Roughly 1/2(k/spl minus/1)N/sup 1/k/ nodes can be removed such that the network ofremaining nodes is still strongly connected, if all remaining nodes have at least oneincoming and one outgoing link left.
[1] W. D. Farmer and E. E. Newhall, "An experimental distributed switching system to handle bursty computer traffic," in1969 Proc. ACM Symp. Problems in the Optimization of Data Commun., Pine Mountain, GA, 1969, pp. 1-33.
[2] M. T. Liu,Distributed Loop Computer Networks. New York: Academic Press, 1978, pp. 163-221.
[3] M. Imase and M. Itoh, "Design to minimize diameter on building-block network,"IEEE Trans. Comput., vol. C-30, pp. 439-442, June 1981.
[4] C. S. Raghavendra, M. Gerla and A. Avizienis, "Reliable loop topologies for large local computer networks,"IEEE Trans. Comput., vol. C-34, pp. 46-55, Jan. 1985.
[5] B. W. Arden and H. Lee, "Analysis of chordal ring network,"IEEE Trans. Comput., vol. C-30, pp. 291-296, Apr. 1981.
[6] F. Boesch and R. Tindell, "Circulants and their connectivities,"J. Graph Theory, vol. 8, pp. 487-499, 1984.
[7] F. T. Boesch and J. Wang, "Reliable circulant networks with minimum transmission delay,"IEEE Trans. Circuits Syst., vol. CAS-32, pp. 1286-1291, 1985.
[8] B. Bollobas and F. Harary, "Extremal graphs with given diameter and connectivity,"ARS Combinatoria, vol. 1, pp. 281-296, 1976.
[9] C. K. Wong and D. Coppersmith, "A combinatorial problem related to multimodule memory organization,"J. Assoc. Computing Machinery, vol. 21, pp. 392-402, July 1974.