An optimal permutation routing algorithm on full duplex hexagonal networks

Discrete Mathematics and Theoretical Computer Science

Volumn 10, Issue 3, 2008, Pages 49-62

  Sau, Ignasi ^a,b   Žerovnik, Janez ^c,d  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c UNIVERSITY OF MARIBOR   (Slovenia)

^d INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

Communication networks; Distributed algorithm; Hexagonal networks; Oblivious algorithm; Permutation routing; Shortest path

Indexed keywords

MATHEMATICAL TRANSFORMATIONS; NETWORK ROUTING;

ADDRESSING SCHEME; APPLICATIONS.; COMMUNICATION NETWORKS; DISTRIBUTED ALGORITHM; HEXAGONAL NETWORKS; OBLIVIOUS ALGORITHM; PERMUTATION ROUTING; PERMUTATION ROUTING PROBLEM; SHORTEST PATH; SUB GRAPHS; TRANSLATION INVARIANTS; TRIANGULAR GRIDS;

ROUTING ALGORITHMS;

EID: 51849083318     PISSN: 14627264     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (19)

1. M. Chen, K. Shin, and D. Kandlur. Addressing, routing and broadcasting in hexagonal mesh multiprocessors. IEEE Transactions on Computers, 1(C-39):10-18, 1990.
2. J. Cogolludo and S. Rajasekaran. Permutation routing on reconfigurable meshes. Algorithmica, 31: 44-57, 2001.
3. A. Datta. A fault-tolerant protocol for energy-efficient permutation routing in wireless networks. IEEE Transactions on Computers, 54(11):1409-1421, 2005.
4. C. Decayeux. Réseaux hexagonaux: Modélisation Géomètrique et Application à la Téléphonie Mobile. PhD thesis, Université de Picardie Jules Verne, October 2006.
5. C. Decayeux and D. Seme. 3d hexagonal network: Modeling, topological properties, addressing scheme, and optimal routing algorithm. IEEE Transactions on Parallel and Distributed Systems, 16(9):875-884, 2005.
6. T. Dobravec, J. Žerovnik, and B. Robič. Permutation routing in double-loop networks: design and empirical evaluation. Journal of Systems Architecture, 48:387-402, 2003.
7. P. Fraigniaud and E. Lazard. Methods and problems of communication in usual networks. Discrete Applied Mathematics, 53:79-134, 1994.
8. F. García, J. Solano, I. Stojmenović, and M. Stojmenović. Higher dimensional hexagonal networks. Journal of Parallel and Distributed Computing, 63(1164-1172), 2003.
9. F. Hwang, T. Lin, and R. Jan. A permutation routing algorithm for double loop network. Parallel Processing Letters, 7(3):259-265, 1997.
10. F. Hwang, Y. Yao, and B. Dasgupta. Some permutation routing algorithms for low-dimensional hypercubes. Theoretical Computer Science, 270:111-124, 2002.
11. G. E. Jan and M.-B. Lin. Concentration, load balancing, partial permutation routing, and superconcentration on cube-connected cycles parallel computers. Journal of Parallel and Distributed Computing, 65: 1471-1482, 2005.
12. D. Karimou and J. F. Myoupo. An application of an initialization protocol to permutation routing in a single-hop mobile ad hoc networks. The Journal of Supercomputing, 31:215-226, 2005.
13. W. Liang and X. Shen. Permutation routing in all-optical product networks. IEEE Transactions on Circuits and Systems, 49(4):533-538, 2002.
14. F. G. Nocetti, I. Stojmenović, and J. Zhang. Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks. IEEE Transactions on Parallel and Distributed Systems, 13(9):963-971, 2002.
15. B. Robič and J. Žerovnik. Minimum 2-terminal routing in 2-jump circulant graphs. Computers and Artificial Intelligence, 19(1):37-46, 2000.
16. I. Sau and J. Žerovnik. Optimal permutation routing on mesh networks. In International Network Optimization Conference, Spa, Belgium, April 2007. 6 pages.
17. I. Stojmenovič. Honeycomb networks: Topological properties and communication algorithms. IEEE Transactions on Parallel and Distributed Systems, 8(10): 1036-1042, 1997.
18. R. Tošić, D. Masulović, I. Stojmenović, J. Brunvoll, B. Cyvin, and S. Cyvin. Enumeration of polyhex hydrocarbons up to h= 17. Journal of Chemical Information and Computer Sciences, 35:181-187, 1995.
19. R. Trobec. Two-dimensional regular d-meshes. Parallel Computing, 26:1945-1953, 2000.