IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v206y2025i2d10.1007_s10957-025-02710-8.html
   My bibliography  Save this article

Closed-Form Formulas for Cluster Sizing for Two-Level Hierarchical Networks with Source Routing

Author

Listed:
  • Eric Rosenberg

    (Seton Hall University)

Abstract

In a two-level hierarchical network, nodes are grouped into clusters. A node in one cluster sees the entire topology of that cluster, but only a summarized view of other clusters. With source routing, the source node of a connection does an initial route computation based on its view of the network, and additional route computations are performed as the connection makes its way towards the destination. We study the problem of choosing the number of clusters to minimize the total complexity of all the path computations required to compute a path from a source node to a destination node. We show that, under mild conditions, for all sufficiently large networks two-level hierarchical routing is superior to flat network routing. Utilizing the duality theory of geometric programming, we provide a closed-form solution estimate for the number of clusters to minimize the total routing complexity. We also provide a closed-form expression for a lower bound on the minimal total complexity. We illustrate the modelling assumptions for a variety of networks. Computational results for a range of network sizes and parameters show that our solution estimate yields near-optimal results.

Suggested Citation

  • Eric Rosenberg, 2025. "Closed-Form Formulas for Cluster Sizing for Two-Level Hierarchical Networks with Source Routing," Journal of Optimization Theory and Applications, Springer, vol. 206(2), pages 1-34, August.
    • Handle: RePEc:spr:joptap:v:206:y:2025:i:2:d:10.1007_s10957-025-02710-8
    DOI: 10.1007/s10957-025-02710-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02710-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-025-02710-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:joptap:v:206:y:2025:i:2:d:10.1007_s10957-025-02710-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.