Skip Navigation

The Computer Journal 1979 22(3):246-250; doi:10.1093/comjnl/22.3.246
© 1979 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bozyigit, M.
Right arrow Articles by Paker, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A fixed routing problem in large and high connectivity networks

M. Bozyigit1 * and Y. Paker2 §

1 School of Engineering and Science, The Polytechnic of Central London, 115 New Cavendish Street, London, UK, 2 UER Informatique, Universite de Rennes, BP25A, Rennes, France

The consideration is optimum route assignment in homogeneous, uniform and large networks (multiprocessor systems) of high connectivity utilising a fixed routing technique. The approach taken is based on a preference for the paths of least distance between nodes whilst establishing a balance in the traffic flow load distribution provided that there is more than one possible equal distance path between pairs of nodes.

Un algorithme de routage optimal est présenté pour le réseaux uniformes et homogènes à haute connexité où les nombres des noeuds (sommets) sont considérables. Pour ces réseaux il existe plusieurs chemins équidistants entre deux noeuds quelconques. L'algorithme de Floyd pour ces réseaux donne une matrice de routage où certains noeuds sont plus chargés que les autres. L'algorithme qui est présenté nous donne une distribution presque uniforme de la fréquence d'utilisation des noeuds comme intermédiaires. L'algorithme est appliqué sur quelques exemples et les résultats sont analysés dans cet article.

Received August 1977.

* School of Engineering and Science, The Polytechnic of Central London, 115 New Cavendish Street, London W1M 8JS

§ Presently with UER Informatique, Université de Rennes, BP25A, 35031 Rennes Cedex, France; on leave from the Polytechnic of Central London.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.