Chordal rings based on symmetric odd-radix number systems

Proceedings of the 2005 International Conference on Communications in Computing, CIC'05

Volumn , Issue , 2005, Pages 196-199

  Parhami, Behrooz ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION CONTEXTS; CHORD LENGTHS; CHORDAL RINGS; DIGIT SETS; DYNAMIC PERFORMANCE; NUMBER SYSTEMS; STATIC NETWORKS;

EID: 48349088464     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. B.W. Arden, and H. Lee, "Analysis of Chordal Ring Networks," IEEE Trans. Computers, Vol. 30, No. 4, pp. 291-295, April 1981.
2. J.-C. Bermond, F. Comellas and D.F. Hsu, "Distributed Loop Computer Networks: A Survey," J. Parallel & Distrib. Computing, Vol. 24, pp. 2-10, 1995.
3. N. Chalamaiah, and B. Ramamurty, "Finding Shortest Paths in Distributed Loop Networks," Info. Processing Letters, Vol. 67, pp. 157-161, 1998.
4. B.X. Chen, W.J. Xiao, and B. Parhami "Diameter Formulas for Double-Loop Networks," J. Interconnection Networks, to appear.
5. Day, K. and A.E. Al-Ayyoub, "Fault Diameter of k-ary n-cube networks," IEEE Trans. Parallel and Distributed Systems, Vol. 8, No. 9, pp. 903-907, September 1997.
6. F.K. Hwang, "A Complementary Survey on Double-Loop Networks," Theoretical Computer Science, Vol. 263, pp. 211-229, 2001.
7. K. Mukhopadhyaya and B.P. Sinha, "Fault-Tolerant Routing in Distributed Loop Networks," IEEE Trans. Computers, Vol. 44, No. 12, pp. 1452-1456, 1995.
8. Parhami, B. and D.-M. Kwai, "A Characterization of Symmetric Chordal Rings Using Redundant Number Representations," Proc. 11th International Conf. Systems Engineering, July 1996, pp. 467-472.
9. Parhami, B. and D.-M. Kwai, "Periodically Regular Chordal Rings," IEEE Trans. Parallel and Distributed Systems, Vol. 10, No. 6, pp. 658-672, June 1999. (Printer's errors corrected in Vol. 10, No. 7, pp. 767-768, July 1999.)
10. J.A.L. Yenra, M.A. Fiol, P. Morillo, and I. Alegre, "The Diameter of Undirected Graphs Associated to Plane Tessellations," Ars Combinatoria, Vol. 20-B, pp. 151-171, 1985.
11. J. Zerovnik and T. Pisanski, "Computing the Diameter in Multi-Loop Networks, J. Algorithms, Vol. 14, pp. 226-243, 1993.