IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4419-5513-5_6.html
   My bibliography  Save this book chapter

Network Flows

In: Networks in Action

Author

Listed:
  • Gerard Sierksma

    (Fac. Economische Wetenschappen Rijksuniversiteit Groningen)

  • Diptesh Ghosh

    (Indian Institute of Management)

Abstract

The schematic diagram of the telecommunication network of GTC in a particular region is shown in Figure 3.1. Each node in the network represents a major network hub, while each edge in the network represents a link between two such hubs. In the figure, there is a vector containing two numbers along each edge. The first entry of the vector indicates the cost of sending one GBps of data along that edge (in “100 units), while the second entry indicates the bandwidth available along that edge (in 100GBps units). GTC is considering a request to provide a bandwidth of 600GBps between the points A and H in the network and is wondering what the minimum cost of providing this bandwidth would be. This problem is a typical example of a minimum cost flow problem. The solution to the problem consists of a collection of edges in the network, which can be combined to form paths, and the amount of flow along each of the edges. The sum of the costs of this collection of edges, each weighted by the amount of flow it carries, is the minimum cost that has to be incurred to route the required amount of flow.

Suggested Citation

  • Gerard Sierksma & Diptesh Ghosh, 2010. "Network Flows," International Series in Operations Research & Management Science, in: Networks in Action, chapter 3, pages 61-85, Springer.
    • Handle: RePEc:spr:isochp:978-1-4419-5513-5_6
    DOI: 10.1007/978-1-4419-5513-5_6
    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.

    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:isochp:978-1-4419-5513-5_6. 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.