Cpr E 547X: Resource Allocation in Communication Networks
Location and Timings
Time: 5:10pm --- 6:30pm, Tuesday and Thursday, Coover 1012
Course Description
Traditionally, communication networks analysis has primarily meant a purely queueing theoretic viewpoint. Lately, this view has undergone a radical change and there is need to view a communication network architecture as a slow time-scale, control-theoretic solution to a large-scale distributed optimization problem. This approach will show a student why the layered architecture is a natural by-product of the desire to design a fair and stable system. This course will also demonstrate the important role of distributed algorithms, probabilistic methods, queueing theory and stochastic processes in designing algorithms.
This course will also address some social network topics including random graphs, and learning and diffusion through networks.
Four Major Topics
  • Network utility maximization and the Internet congestion control algorithm
  • Layering as optimization decomposition: A cross-layer design approach in multihop wireless networks
  • Capacity results of ad hoc wireless networks
  • Social networks and random graph
    • Textbook
  • S. Shakkottai and R. Srikant, "Network Optimization and Control"
  • L. Georgiadis, M. J. Neely and L. Tassiulas, "Resource Allocation and Cross-Layer Control in Wireless Networks"
  • S. Boyd and Lieven Vandenberghe, "Convex Optimization"
  • H. K. Khalil, "Nonlinear Systems"
  • M. O. Jackson, "Social and Economic Networks"
    • Grading
  • Homework: 30%
  • Midterm (take home): 30%
  • Final (presentation): 30%
  • Attendance: 10%
    • Schedule
  • August 25 (Tuesday): Introduction (notes)
  • August 27 (Thursday): TCP-Reno (notes)(Section 4.2 of Shakkottai&Srikant)
  • September 1 (Tuesday): Convex optimization: Convex sets and convex functions (notes) (Section 2.1.1, 2.1.4, 2.3.1, 2.3.2, 3.1.1-3.1.5 of Boyd&Vandenberghe)
  • September 3 (Thursday): Convex optimization: Convex optimization and duality (notes) (Section 4.2.1, 4.2.1, 5.1.1-5.1.3 5.2.1-5.2.3, 5.5.3 of Boyd&Vandenberghe)
  • September 8 (Tuesday): Duality and network utility maximization (notes)
  • September 10 (Thursday): Network utility maximization: Utility functions (notes)
  • September 17 (Thursday): Network utility maximization: Primal algorithm and Lyapunov theorem (Section 3.1 Shakkottai&Srikant)
  • September 22 (Tuesday) (2-hour lecture): Network utility maximization: Primal algorithm, Lyapunov theorem and Price functions (notes) (Section 3.1 Shakkottai&Srikant, Section 4.1 Khalil)
  • September 24 (Thursday) (2-hour lecture): Dual algorithm and congestion cotnrol protocols (notes) (Section 3.2, 3.3, and 4 of Shakkottai&Srikant)
  • October 6 (Tuesday) (2-hour lecture): Scheduling in wireless networks (notes) (Paper [P1])
  • October 8 (Thursday) (2-hour lecture): MaxWeight and Opportunistic scheduling
  • October 13 (Tuesday): Opportunistic scheduling
  • October 15 (Thursday): Opportunistic scheduling (notes) (Paper [P2])
  • October 20 (Tuesday): Joint congestion control and scheduling (notes) (Paper [P3])
  • October 22 (Thursday): Joint congestion control/routing/scheduling (notes) (Section 3.4 of Shakkottai&Srikant, Section 4 of Georgiadis&Neely&Tassiulas, [P4])
  • October 29 (Thursday): Low-compleixty scheduling algorithms (notes) (Papers [P5], [P6])
  • November 5 (Thursday): CSMA-based scheduling and cpacity of ad hoc networks(notes_1) ([P7])
  • November 10 (Tuesday): Capacity of ad hoc networks(notes) ([P8], [P9])
  • November 17 (Tuesday): VCG mechanism (notes) (Section 6.1 of Shakkottai&Srikant)
  • November 19 (Thursday): Kelly's mechanism and scale-free networks (notes) (Section 6.2 of Shakkottai&Srikant)
  • November 30 (Monday): Strategic or price-anticipating users (notes) (Section 6.3 of Shakkottai&Srikant)
    • Homeworks
  • Homework 1 (due on Sept. 3)
  • Homework 2 (due on Sept. 24)
  • Homework 3 (due on Oct. 8)
  • Homework 4 (due on Oct. 29)
    • Papers
  • [P1] A. Eryilmaz, R. Srikant and J. Perkins. Stable scheduling policies for fading wireless channels, IEEE/ACM Transactions on Networking, April 2005, pp. 411-424.

  • [P2] X. Liu, E. K. P. Chong, and N. B. Shroff, A Framework for Opportunistic Scheduling in Wireless Networks, Computer Networks, vol. 41, no. 4, pp. 451-474, March 2003.

  • [P3] A. Eryilmaz and R. Srikant. Fair Resource Allocation in Wireless Networks using Queue-length-based Scheduling and Congestion Control, IEEE/ACM Transactions on Networking, 2007, pp. 1333-1344.

  • [P4] A. Eryilmaz and R. Srikant. Joint Congestion Control, Routing and MAC for Stability and Fairness in Wireless Networks, IEEE Journal on Selected Areas in Communications, August 2006, 1514-1524.

  • [P5] L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queuing switches", Proceedings of INFOCOM 98, San Francisco, California, 1998.

  • [P6] B. Hajek and G. H. Sasaki, "Link scheduling in polynomial time. IEEE Transactions on Information Theory", 34(5):910-917, 1988.

  • [P7] L. Jiang and J. Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks", Allerton Conference on Communication, Control, and Computing, 2008.

  • [P8] P. Gupta and P.R. Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.

  • [P9] M. Grossglauser and D. Tse, "Mobility Increases the Capacity of Adhoc Wireless Networks", IEEE/ACM Transactions on Networking, vol. 10, no. 4, August, 2002, pp. 477-486.