IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i21p4016-d957027.html
   My bibliography  Save this article

Construction of Dual Optimal Bidirectional Double-Loop Networks for Optimal Routing

Author

Listed:
  • Hui Liu

    (School of Artificial Intelligence, Beijing Normal University, Beijing 100875, China
    School of Computer Science and Technology, An Hui University of Technology, Maanshan 243002, China)

  • Xiaowan Li

    (School of Computer Science and Technology, An Hui University of Technology, Maanshan 243002, China)

  • Shenling Wang

    (School of Artificial Intelligence, Beijing Normal University, Beijing 100875, China)

Abstract

Bidirectional double-loop networks (BDLNs) are widely used in computer networks for their simplicity, symmetry and scalability. One common way to improve their performance is to decrease the diameter and average distance. Attempts have been made to find BDLNs with minimal diameters; however, such BDLNs will not necessarily have the minimum average distance. In this paper, we construct dual optimal BDLNs with minimum diameters and average distances using an efficient method based on coordinate embedding and transforming. First, we get the lower bounds of both the diameter and average distance by embedding a BDLN into Cartesian coordinates. Then, we construct tight optimal BDLNs that provide the aforementioned lower bounds based on an embedding graph. On the basis of node distribution regularity in tight optimal BDLNs, we construct dual optimal BDLNs with minimum diameters and average distances for any number of nodes. Finally, we present on-demand optimal message routing algorithms for the dual optimal BDLNs that we have constructed. The presented algorithms do not require routing tables and are efficient, requiring little computation.

Suggested Citation

  • Hui Liu & Xiaowan Li & Shenling Wang, 2022. "Construction of Dual Optimal Bidirectional Double-Loop Networks for Optimal Routing," Mathematics, MDPI, vol. 10(21), pages 1-17, October.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:21:p:4016-:d:957027
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/21/4016/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/21/4016/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:21:p:4016-:d:957027. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.