IDEAS home Printed from https://ideas.repec.org/h/spr/stcchp/978-3-540-79128-7_21.html
   My bibliography  Save this book chapter

Optimal Reservation Scheme Routing for Two-Rate Wide-Sense Nonblocking Three-Stage Clos Networks

In: The Mathematics of Preference, Choice and Order

Author

Listed:
  • Wenqing Dou

    (Shanghai Second Polytechnic University)

  • Frank K. Hwang

    (National Chiaotung University)

Abstract

The well-known Clos network has been widely employed for data communications and parallel computing systems, while the symmetric three-stage Clos network C(n,m,r) is considered the most basic and popular multistage interconnection network. A lot of efforts have been put on the research of the three-stage Clos network. Let us first introduce some related concepts. The three-stage Clos network C(n,m,r) is a three-stage interconnection network symmetric with respect to the center stage. The network consists of r (n × m)-crossbars (switches) in the first stage (or input stage), m (r × r)-crossbars in the second stage (or central stage), r (m × n)-crossbars in the third stage (or output stage). The n inlets (outlets) on each input (output) crossbar are the inputs (outputs) of the network. Thus the total number the inputs (outputs) of C(n,m,r) is rn. There exists exactly one link between every center crossbar and every input (output) crossbar. These links are the internal links while the inputs and outputs are the external links of the network.

Suggested Citation

  • Wenqing Dou & Frank K. Hwang, 2009. "Optimal Reservation Scheme Routing for Two-Rate Wide-Sense Nonblocking Three-Stage Clos Networks," Studies in Choice and Welfare, in: Steven J. Brams & William V. Gehrlein & Fred S. Roberts (ed.), The Mathematics of Preference, Choice and Order, pages 355-360, Springer.
    • Handle: RePEc:spr:stcchp:978-3-540-79128-7_21
    DOI: 10.1007/978-3-540-79128-7_21
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    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:stcchp:978-3-540-79128-7_21. 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.