Result: Optimal doublecast path in hexagonal honeycomb mesh
Title:
Optimal doublecast path in hexagonal honeycomb mesh
Authors:
Source:
Applied mathematics and computation. 182(2):1267-1279
Publisher Information:
New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 25 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Optimisation. Problèmes de recherche, Optimization. Search problems, Théorie des files d'attente. Théorie du trafic, Queuing theory. Traffic theory, Telecommunications et theorie de l'information, Telecommunications and information theory, Télécommunications, Telecommunications, Réseaux téléinformatiques. Rnis, Teleprocessing networks. Isdn, Types de réseaux et services en france et à l'étranger, Networks and services in france and abroad, Réseaux interconnectés, Interconnected networks, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Chemin optimal, Optimal path, Camino óptimo, Maillage, Grid pattern, Celdarada, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Performance, Rendimiento, Réseau interconnexion, Interconnection network, Red interconexión, Longueur chemin, Maille hexagonale nid abeille, Hexagonal honeycomb mesh, Routage multidestinataire, Multicast routing, Optimal doublecast path
Document Type:
Academic journal
Article
File Description:
text
Language:
English
Author Affiliations:
College of Computer Science, Chongqing University, Chongqing 400044, China
Department of Computer Science, Hong Kong Baptist University, Kowloon, Hong-Kong
Department of Chemistry, Eighth College, Chongqing 400030, China
Department of Computer Science, Hong Kong Baptist University, Kowloon, Hong-Kong
Department of Chemistry, Eighth College, Chongqing 400030, China
ISSN:
0096-3003
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Telecommunications and information theory
Telecommunications and information theory
Accession Number:
edscal.18371114
Database:
PASCAL Archive
Further Information
The performance of a multicomputer is greatly dependent on the multicast strategy, i.e., how to deliver the same message from a source node to a number of destination nodes. Building an optimal multicast path is suited for multicast wormhole routing. A doublecast path is a multicast path with exactly two destination nodes. Hexagonal honeycomb mesh is a promising candidate for interconnection networks. This paper addresses the building of an optimal doublecast path on hexagonal honeycomb mesh. A theorem concerned with the length of an optimal doublecast path is established, and a time-optimal algorithm for building an optimal doublecast path is proposed.