This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Linear Recursive Networks and Their Applications in Distributed Systems
July 1997 (vol. 8 no. 7)
pp. 673-680

Abstract—We present a new class of interconnection topologies called the Linear Recursive Networks (LRNs) and examine their possible applications in distributed systems. Each LRN is characterized by a recursive pattern of interconnection which can be specified by simple parameters. Basic properties such as node degree, diameter, and the performance of routing algorithms for all LRNs are then collectively analyzed in terms of these parameters. By choosing appropriate values for the parameters, our results can assist a network designer in selecting a topology with required routing performance and cost of interconnection. A subclass of LRNs, called Congruent LRNs (CLRNs), is also identified here and shown to possess desirable properties for more tightly coupled systems. It is shown that the CLRNs include existing networks such as hypercube and generalized Fibonacci cubes. These results suggest that the linear recursive networks potentially have applications in interconnecting distributed systems.

[1] D. Bertzekas and R. Gallager, Data Networks, second ed. Prentice-Hall, 1992.
[2] N. Deo, Graph Theory with Application to Engineering and Computer Science,Old Tappan, N.J.: Prentice Hall, 1974.
[3] M.D. Gaudreau, "Recursive Formula for the Calculation of Point-to-Point Congestion," IEEE Trans. Comm., vol. 28, pp. 313-316, Mar. 1980.
[4] M. Gerla and L. Kleinrock, “On the Topological Design of Distributed Computer Networks,” IEEE Trans. Comm., vol. 25, no. 1, pp. 48-60, 1977.
[5] F. Harary, Graph Theory.Reading, Mass.: Addison-Wesley, 1969.
[6] J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, pp. 22-24. Addison-Wesley, 1979.
[7] W.J. Hsu, "Fibonacci Cubes—A New Interconnection Topology," IEEE Trans. Parallel and Distributed Systems, vol 4, no.1, pp. 3-12, Jan. 1993.
[8] W.-J. Hsu and M.J. Chung, "Generalized Fibonacci Cubes," Proc. Int'l Conf. Parallel Processing, pp. 299-303, 1993.
[9] W.J. Hsu, A. Das, and M.J. Chung, "Linear Recursive Graphs and Their Applications in Network Topological Design and Data Routing," Proc. ACM SIGCOMM Ann. Conf.,San Francisco, Calif., 1993.
[10] S. Rai and D.P. Agrawal, Distributed Computing Network Reliability. Los Alamitos, Calif.: IEEE CS Press, 1990.
[11] S. Ranka and S. Shani,Hypercube Algorithms for Image Processing and Pattern Recognition. New York: Springer-Verlag, 1990.
[12] A.M. Rushdi, "On Reliability Evaluation by Network Decomposition," IEEE Trans. Reliability, vol. 33, pp. 379-384, Dec. 1984.
[13] A. Satyanarayana and M.K. Chang, "Network Reliability and the Factoring Theorem," Networks, vol. 13, pp. 107-120, 1983.
[14] R.L. Sharma, Network Topology Optimization: The Art and Science of Network Design.New York: Van Nostrand Reinhold, 1990.

Index Terms:
Design and analysis of interconnection topologies, hypercube, Fibonacci cube, recursive networks, self-similar networks, routing algorithms.
Citation:
Wen-Jing Hsu, Moon Jung Chung, Amitabha Das, "Linear Recursive Networks and Their Applications in Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 7, pp. 673-680, July 1997, doi:10.1109/71.598343
Usage of this product signifies your acceptance of the Terms of Use.