Abstract
Undirected double-loop networks G(n; ± s 1, ± s 2), where n is the number of its nodes, s 1 and s 2 are its steps, 1 ≤ s 1 < s 2 < n / 2 and gcd(n, s 1, s 2)=1, are important interconnection networks. In this paper, by using the four parameters of the L-shape tile and a solution (x̄,ȳ) of a congruence equation s 1 x + s 2 y ≡ 1 (mod n), we give a constant time optimal routing algorithm for G(n; ± s 1, ± s 2).
This work was supported by the Natural Science Foundation of Fujian Province(No. Z0511035)and the Scientific Research Foundation of Fujian Provincial Education Department(No. JA04249).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aguilo, F., Fiol, M.A.: An efficient algorithm to find optimal double loop networks. Discrete Mathematics 138, 15–29 (1995)
Boesch, F.T., Wang, J.F.: Reliable circulant networks with minimum transmission delay. IEEE Trans. Circuits Syst. CAS-32, 1286–1291 (1985)
Chalamaiah, N., Ramamurty, B.: Finding shortest paths in distributed loop networks. Information Processing Letters 67, 157–161 (1998)
Chen, B.X., Xiao, W.J.: A constant time optimal routing algorithm for directed double loop networks G(n; s 1, s 2). In: The proceeding of 5th International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2004), pp. 1–5 (2004)
Chen, B.X., Xiao, W.J.: Optimal designs of directed double-loop networks. In: Zhang, J., He, J.-H., Fu, Y. (eds.) CIS 2004. LNCS, vol. 3314, pp. 19–24. Springer, Heidelberg (2004)
Chen, C., Hwang, F.K.: The minimum distance diagram of double-loop networks. IEEE Trans. Comput. 49(9), 977–979 (2000)
Fiol, M.A., Yebra, J.L.A., Alegre, I., Valero, M.: A discrete optimization problem in local networks and data alignment. IEEE Trans. Comput. 36(6), 702–713 (1987)
Guan, D.J.: An optimal message routing algorithm for double-loop networks. Information Processing Letters 65, 255–260 (1998)
Hwang, F.K.: A complementary survey on double-loop networks. Thereotical Computer Science 263, 211–229 (2001)
Hwang, F.K.: A survey on multi-loop networks. Theoretical Computer Science 299, 107–121 (2003)
Li, Q., Xu, J.M., Zhang, Z.L.: Infinite families of optimal double loop networks. Science in China, Ser A 23, 979–992 (1993)
Mukhopadhyaya, K., Sinha, B.P.: Fault-tolerant routing in distributed loop networks. IEEE Trans. Comput. 44(12), 1452–1456 (1995)
Wong, C.K., Coppersmith, D.: A combinatorial problem related to multimodule memory organizations. J. ACM 21, 392–402 (1974)
Ying, C., Hwang, F.K.: Diameters of weighted double loop networks. Journal of Algorithm 9, 401–410 (1988)
Ying, C., Hwang, F.K.: Routing algorithms for double loop networks. International Journal of Foundations of Computer Science 3(3), 323–331 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, BX., Meng, JX., Xiao, WJ. (2005). A Constant Time Optimal Routing Algorithm for Undirected Double-Loop Networks. In: Jia, X., Wu, J., He, Y. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2005. Lecture Notes in Computer Science, vol 3794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599463_31
Download citation
DOI: https://doi.org/10.1007/11599463_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30856-0
Online ISBN: 978-3-540-32276-4
eBook Packages: Computer ScienceComputer Science (R0)