Skip to main content
SpringerLink
Log in
Book cover

Modeling and Optimization: Theory and Applications pp 25–52Cite as

Distributed Optimization in Networking: Recent Advances in Combinatorial and Robust Formulations

  • Conference paper
  • First Online:

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 21))

Abstract

Optimization has become an essential modeling language and design method for communication networks. It has been widely applied to many key problems, including power control, coding, scheduling, routing, congestion control, content distribution, and pricing. It has also provided a fresh angle to view the interactions across a network protocol stack as the solutions to an underlying optimization problem. A unique requirement for optimization in networks is that the solution algorithm must be distributed. This has in turn motivated the development of new tools in distributed optimization. Many of these results have been well documented. In this chapter, we turn to a sample of three recent results on some of the challenging new issues, centered around the need to tackle combinatorial or robust optimization formulation through distributed algorithms. Much more on existing results, including proofs and numerical examples, can be found from the papers referenced here.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    As compared to single-session scenario, the multi-session scenario involves multiple sessions competing for the underlying physical link capacities, and one has to take the fairness consideration into account when formulating the problem. We refer interested readers on the multi-session study to [1].

References

  1. Sengupta, S., Liu, S., Chen, M., Chiang, M., Li, J., Chou, P.: Peer-to-peer streaming capacity. IEEE Trans. Inform. Theory 57(8), 5072–5087 (2011)

    Article  MathSciNet  Google Scholar 

  2. Liu, S., Chen, M., Sengupta, S., Chiang, M., Li, J., Chou, P.: “Peer-to-Peer Streaming Capacity under Node Degree Bound”, Proceedings of the 30th International Conference on Distributed Computing Systems (ICDCS 2010), Genoa, Italy, 21–25 (2010)

    Google Scholar 

  3. Zhang, S., Shao, Z., Chen, M.: Optimal distributed p2p streaming under node degree bounds. In: Proceedings of the IEEE ICNP, Kyoto, Japan (2010)

    Google Scholar 

  4. Garg, N., Konemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS 1998), Palo Alto, CA, USA, 8–11 (1998)

    Google Scholar 

  5. Dantzig, G., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8, 101–111 (1960)

    Article  MATH  Google Scholar 

  6. Gilmore, P., Gomory, R.: A linear programming approach to the cutting-stock problem. Oper. Res. 9, 849–859 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gilmore, P., Gomory, R.: A linear programming approach to the cutting stock problem—Part II. Oper. Res. 11, 863–888 (1963)

    Article  MATH  Google Scholar 

  8. Lin, X., Shroff, N., Srikant, R.: A tutorial on cross-layer optimization in wireless networks. IEEE J. Sel. Areas Commun. 24(8), 1452–1463 (2006)

    Article  Google Scholar 

  9. Jiang, L., Walrand, J.: “A distributed csma algorithm for throughput and utility maximization in wireless networks”. In: Proceedings of the 46th Annual Allerton Conference on Communication, Control, and Computing, Urbana, IL, USA (2008)

    Google Scholar 

  10. Chen, M., Liew, S., Shao, Z., Kai, C.: Markov approximation for combinatorial network optimization. CUHK Technical Report (2009). Available at http://www.ie.cuhk.edu/~mhchen/ma.tr.pdf

  11. Zhang, H., Chen, M., Parekh, A., Ramchandran, K.: An adaptive multi-channel p2p video-on-demand system using plug-and-play helpers. EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2010-111, July 2010. [Online] Available: http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-111.html

  12. Jiang, W., Lan, T., Ha, S., Chen, M., Chiang, M.: “Joint VM Placement and Routing for Data Center Traffic Engineering”. In: Proceedings of IEEE INFOCOM (mini-conference), Orlando, Florida, USA, 25–30 (2012)

    Google Scholar 

  13. Chen, M., Liew, S.C., Shao, Z., Kai, C.: Markov approximation for combinatorial network optimization. In: Proceedings of the IEEE INFOCOM, San Diego (2010)

    Google Scholar 

  14. Meng, X., Pappas, V., Zhang, L.: Improving the scalability of data center networks with traffic aware virtual machine placement. In: Proceedings of the IEEE INFOCOM 2010, San Diego, CA, US (2010)

    Google Scholar 

  15. Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. In the 9th Annual ACM-SIAM SODA (1998), San Francisco, CA, USA, 25–27 (1998)

    Google Scholar 

  16. Feige, U.: A threshold of ln n for approximating set cover. In: Proceedings of the 28th ACM STOC (1996), Philadelphia, PA, USA, 22–24 (1996)

    Google Scholar 

  17. Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner tree problems. In: Proceedings of the 9th Annual ACM-SIAM SODA (1998), San Francisco, CA, USA, 25–27 (1998)

    Google Scholar 

  18. Chiang, M.: Geometric programming for communication systems, Now Publishers Inc (2005)

    Google Scholar 

  19. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge, UK (2004)

    MATH  Google Scholar 

  20. Diaconis, P., Stroock, D.: Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob. 1, 36–61 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  21. Ben-Tal, A., Nemirovski, A.: Robust solutions to uncertain programs. Oper. Res. Lett. 25(1), 1–13 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  22. Ben-Tal, A., Nemirovski, A.: Selected topics in robust convex optimization. Math. Program. 112(1), 125–158 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Nemirovski, A.: On tractable approximations of randomly perturbed convex constraints. In Proceedings of the 42nd IEEE Conference on Decision and Control, Maui, HI, USA, 8–12 (2003)

    Google Scholar 

  24. El-Ghaoui, L.: Robust solutions to least-square problems to uncertain data matrices. SIAM J. Matrix Anal. Appl. 18, 1035–1064 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  25. El Ghaoui, L., Oustry, F., Lebret, H.: Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9, 33 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  26. Ben-Tal, A., Nemirovski, A.: Robust solutions to linear programming problems contaminated with uncertain data. Math. Program. 88, 411–424 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  27. Kelly, F., Maulloo, A., Tan, D.: Rate control for communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 237–252 (1998).

    Google Scholar 

  28. Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  29. Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1–14 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  30. Xu, D., Li, Y., Chiang, M., Calderbank, A.: Optimal provision of elastic service availability. In Proceedings of IEEE INFOCOM (2007), Anchorage, AK, USA, 6–12 (2007)

    Google Scholar 

  31. Leyffer, S.: The return of the active set method. Oberwolfach Rep. 2(1) (2005)

    Google Scholar 

  32. Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont, Mass., USA (1997)

    Google Scholar 

Download references

Acknowledgements

Minghua Chen was partially supported by the China 973 Program (Project No. 2012CB315904), and the General Research Fund grants (Project Nos. 411209, 411010, and 411011) and an Area of Excellence Grant (Project No. AoE/E-02/08), established under the University Grant Committee of the Hong Kong SAR, China, as well as two gift grants from Microsoft and Cisco. Mung Chiang was partially supported by AFOSR MURI grant FA9550-09-1-0643.

Author information

Authors and Affiliations

  1. Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong, China

    Minghua Chen

  2. Department of Electrical Engineering, Princeton University, Princeton, NJ, USA

    Mung Chiang

Authors
  1. Minghua Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mung Chiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Minghua Chen .

Editor information

Editors and Affiliations

  1. , Dept. Industrial & Systems Engineering, Lehigh University, W. Packer Avenue 200, Bethlehem, 18015-1582, Pennsylvania, USA

    Tamás Terlaky

  2. , Dept. of Industrial and Systems Engineer, Lehigh University, West Packer Ave 200, Bethlehem, 18018, Pennsylvania, USA

    Frank E. Curtis

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media New York

About this paper

Cite this paper

Chen, M., Chiang, M. (2012). Distributed Optimization in Networking: Recent Advances in Combinatorial and Robust Formulations. In: Terlaky, T., Curtis, F. (eds) Modeling and Optimization: Theory and Applications. Springer Proceedings in Mathematics & Statistics, vol 21. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3924-0_2

Download citation

Publish with us

Policies and ethics

Search

Navigation