IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-0857-4_4.html
   My bibliography  Save this book chapter

Joint Optimization of Resources and Routes for Minimum Resistance: From Communication Networks to Power Grids

In: Handbook of Optimization in Complex Networks

Author

Listed:
  • Ali Tizghadam

    (University of Toronto (and Lakehead University))

  • Alireza Bigdeli

    (University of Toronto (and Lakehead University))

  • Alberto Leon-Garcia

    (University of Toronto (and Lakehead University))

  • Hassan Naser

    (University of Toronto (and Lakehead University))

Abstract

In this chapter, we are concerned with robustness design in complex communication networks and power grids. We define robustness as the ability of a network to adapt to environmental variations such as traffic fluctuations, topology modifications, and changes in the source (sink) of external traffic. We present a network theory approach to the joint optimization of resources and routes in a communication network to provide robust network operation. Our main metrics are the well-known point-to-point resistance distance and network criticality (average resistance distance) of a graph. We show that some of the key performance metrics in a communication network, such as average link betweenness sensitivity or average network utilization, can be expressed as a weighted combination of point-to-point resistance distances. A case of particular interest is when the external demand is specified by a traffic matrix. We extend the notion of network criticality to be a traffic-aware metric. Traffic-aware network criticality is then a weighted linear combination of point-to-point resistance distances of the graph. For this reason, in this chapter, we focus on a weighted linear sum of resistance distances (which is a convex function of link weights) as the main metric and we discuss a variety of optimization problems to jointly assign routes and flows in a network. We provide a complete mathematical analysis of the network planning problem (optimal weight assignment), where we assume that a routing algorithm is already in place and governs the distribution of network flows. Then, we extend the analysis to a more general case involving the simultaneous optimization of resources and flows (routes) in a network. Furthermore, we briefly discuss the problems of finding the best set of demands that can be matched to a given network topology (joint optimization of resources, flows, and demands) subject to the condition that the weighted linear sum of all point-to-point resistance distances of the network should remain below a certain threshold. We discuss applications of the proposed optimization methods to the design of virtual networks. Moreover, we show how our techniques can be used in the design of robust communication networks and robust sparse power grids.

Suggested Citation

  • Ali Tizghadam & Alireza Bigdeli & Alberto Leon-Garcia & Hassan Naser, 2012. "Joint Optimization of Resources and Routes for Minimum Resistance: From Communication Networks to Power Grids," Springer Optimization and Its Applications, in: My T. Thai & Panos M. Pardalos (ed.), Handbook of Optimization in Complex Networks, chapter 0, pages 97-142, Springer.
  • Handle: RePEc:spr:spochp:978-1-4614-0857-4_4
    DOI: 10.1007/978-1-4614-0857-4_4
    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:spochp:978-1-4614-0857-4_4. 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.