Skip to main content
Springer Nature Link
Log in

Low-bandwidth routing and electrical power networks

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1443))

Included in the following conference series:

Abstract

Given a graph G and a (multi-)set of pairs of vertices in it, the classical NP-hard maximum edge-disjoint-paths problem (MDP) is to connect as many of the given pairs as possible using pairwise edge-disjoint paths in G. We study a relative of this problem: we have a network with fixed link capacities that may have to service large demands when necessary. In particular, individual demands are allowed to exceed capacities, and thus flows for some request pairs necessarily have to be split into different flow-paths. This is the framework for computational problems arising from: (i) electrical power networks due to the proposed deregulation of the electric utility industry in the USA, and (ii) applications such as real-time Internet services (e.g., telephone, fax, video). We show that these problems come in a few variants, some efficiently solvable and many NP-hard; we also present approximation algorithms for many of the NP-hard variants presented. Some of our approximation algorithms benefit from certain improved tail estimates that we derive; the latter also yield improved approximations for a family of packing integer programs.

This work has been supported by EPRI and Department of Energy under Contract W-7405-ENG-36.

Work done while visiting Los Alamos National Laboratory, Los Alamos NM 87545.

Supported in part by National University of Singapore Academic Research Fund Grant RP970607.

Part of this work was done while visiting Los Alamos National Laboratory, Los Alamos NM 87545. Supported in part by NSF CAREER Award CCR-9501355.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993.

    Google Scholar 

  2. D. Bertsekas, G. Lauer, N. Sandell and T.A. Posberg. Solution of large scale optimal unit commitment problems. Transactions on Power Apparatus and Systems, PAS 101(1), 1982.

    Google Scholar 

  3. D. Cook, V. Faber, M. Marathe, A. Srinivasan and Y. J. Sussmann. Combinatorial Problems in Production and Transmission of Electric Power: Theory and Experimental Results. Technical Report LAUR-97-2321, Los Alamos National Laboratory, Los Alamos, NM, 87545.

    Google Scholar 

  4. The Economist, Asian edition. From circuits to packets, in Survey on Telecommunications, pages 25–27, September 13th–19th, 1997.

    Google Scholar 

  5. EPRI-Workshop: Underlying Technical Issues in Electricity Deregulation, Technical report forthcoming, Electric Power Research Institute (EPRI), April 25–27, 1997.

    Google Scholar 

  6. The U. S. Federal Energy Regulatory Commission, Notice of Proposed Rulemaking (“NOPRA”) (Docket No. RM95-8-000, March 29, 1995).

    Google Scholar 

  7. C. M. Fortuin, J. Ginibre, and P. N. Kasteleyn. Correlational inequalities for partially ordered sets. Communications of Mathematical Physics, 22:89–103,1971.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Håstad. Testing of the long code and hardness for clique. In Proc. ACM Symposium on the Theory of Computing, pages 11–19, 1996.

    Google Scholar 

  9. J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD Thesis, Department of EECS, MIT, 1996.

    Google Scholar 

  10. J. Kleinberg. Single-source unsplittable flow. In Proc. IEEE Symposium on Foundations of Computer Science, pages 68–77, 1996.

    Google Scholar 

  11. S. G. Kolliopoulos and C. Stein. Improved approximation algorithms for unsplittable flow problems. In Proc. IEEE Symposium on Foundations of Computer Science, 1997.

    Google Scholar 

  12. G. Lawton, In Search of Real-Time Internet Services. In IEEE Computer, pages 14–16, November 1997.

    Google Scholar 

  13. J. Muckstadt and S. Koenig. An application of Lagrangean relaxation to scheduling in power generation systems. Operations Research, 25(3):387–403, 1977.

    Article  MATH  Google Scholar 

  14. C. Pang and H. Chen. Optimal short-term unit commitment. Transactions on Power Apparatus and System, 1976.

    Google Scholar 

  15. A. Srinivasan. Improved approximations of packing and covering problems. In Proc. ACM Symposium on the Theory of Computing, pages 268–276, 1995.

    Google Scholar 

  16. A. Srinivasan. Improved approximations for edge disjoint paths, unsplittable flow, and related routing problems. In Proc. IEEE Foundations on Computer Science, pages 416–425, 1997.

    Google Scholar 

  17. A.M. Wildberger. Issues associated with real time pricing. Unpublished Technical report, Electric Power Research Institute (EPRI), 1997.

    Google Scholar 

  18. A. M. Wildberger. Brief Overview of power systems operations, & Planning from the point of view of Mathematical Modeling, Simulation and Computation with Selected References to Books, EPRI Reports, Available Software & Web Sites. Unpublished Manuscript, Electric Power Research Institute (EPRI), 1997.

    Google Scholar 

  19. A.M. Wildberger. Autonomous adaptive agents for the distributed control of the power grid in a competitive electric power industry. Keynote Address, IEEE Symposium on Knowledge Engineering and Systems, KES'97, Adelaide, Australia, 1997.

    Google Scholar 

  20. Websites: http://www.magicnet.net/∼metzler/page2d.html and http://www.enron.com/choice/dereg.fset.html (also see references therein).

    Google Scholar 

  21. A.J. Wood and B.F. Wollenberg. Power Generation, Operation and Control. John Wiley and Sons, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Engineering, Colorado School of Mines, 80401, Golden, CO

    Doug Cook

  2. Los Alamos National Laboratory, MS B265, P.O. Box 1663, 87545, Los Alamos, NM

    Vance Faber & Madhav Marathe

  3. Department of Information Systems and Computer Science, National University ofSingapore, 119260, Singapore

    Aravind Srinivasan

  4. Department of Computer Science, University of Maryland, 20742, College Park, MD

    Yoram J. Sussmann

Authors
  1. Doug Cook
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vance Faber
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Madhav Marathe
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Aravind Srinivasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yoram J. Sussmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cook, D., Faber, V., Marathe, M., Srinivasan, A., Sussmann, Y.J. (1998). Low-bandwidth routing and electrical power networks. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055088

Download citation

  • DOI: https://doi.org/10.1007/BFb0055088

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation