A simple algorithm to find the steps of double-loop networks

檔案

日期

2002-09-15

期刊名稱

DISCRETE APPLIED MATHEMATICS

摘要

Double-loop networks have been widely studied as architecture for local area networks and it is well-known that the minimum distance diagram of a double-loop network yields an L-shape. Given an N, it is desirable to find a double-loop network DL(N;s(1),s(2)) with its diameter being the minimum among all double-loop networks with N stations. Since the diameter can be easily computed from an L-shape, one method is to start with a desirable L-shape and then asks whether there exist s(1) and s(2) (also called the steps of the double-loop network) to realize it. In this paper, we propose a simple and efficient algorithm to find s(1) and s(2), which is based on the Smith normalization method of Aguilo, Esque and Fiol. (C) 2002 Elsevier Science B.V. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料