Course Description
This course discusses those models, algorithms, and tools in optimization, control, and systems theory that underpin complex networked systems such as computer networks. The objective is to introduce mathematically rigorous tools for the modeling, analysis, design, and control of complex networks, as well as to explore a unified framework for communication, computing, and control that can better address issues in these networks.
Time and Location
TUE 2:30PM - 5:00PM; ECOT 317
Instructor
Lijun Chen (lijun.chen@colorado.edu)
Office hours: TUE 12:30PM-2:15PM
Office: ECOT335; Ext. 4384
Reference Texts
D. Bertsekas, Network Optimization: Continuous and Discrete Models, Athena Scientific, 1998. (This book is
available on-line).
S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004. (This book is
available on-line).
D. Fudenberg and J. Tirole, Game Theory, MIT Press, 1991. (This book is
available on-line).
C. Godsil and G. Royle, Algebraic Graph Theory, Springer, 2001.
A. Mas-Colell, M. D. Whinston, and J. R. Green, Microeconomic Theory, Oxford University Press, 1995.
J. Walrand and S. Parekh, Communication Networks: A Concise Introduction, Morgan & Claypool Publishers, 2010. (This book is
available on-line).
Lectures
This is a tenetaive outline of the topics we will cover and will likely change as the semester goes by.
- Introduction (Jan 12)
Lecture Notes
Reading: Bertsekas, Chapter 1.
Reading: Walrand and Parekh, Chapter 1-2.
- Static Games and Classical Mechanism Design (Jan 12, 19 & 26)
Lecture Notes
Reading: Fudenberg and Tirole, pp.3-64.
Reading: Classic Mech
anism Design, D. C. Parkes, Chapter 2 in PhD thesis, Iterative Combinatorial
Auctions: Achieving Economic and Computational Efficiency, University of Pennsy
lvania, 2001.
- Review on Convex Optimization
Lecture Notes
- Minmum Cost Flows (Jan 26)
Lecture Notes
Reading: Bertsekas, Chapter 1.2, 4.1.
- Duality Model of TCP/AQM (Feb 9)
Lecture Notes
Reading: Walrand and Parekh, Chapter 7-8.
Reading: Rate control in communication networks: shadow prices, proportional fairness and stability, F. P. Kelly, A.K. Maulloo and D. K. H. Tan, Journal of the Operational Research Society 49 (1998), 237-252.
Reading: Optimization Flow Control, I: Basic Algorithm and Convergence, S. H. Low and D. E. Lapsley,
IEEE/ACM Transactions on Networking, 7(6):861-75, December 1999.
Reading: A Duality Model of TCP and Queue Management Algorithms, S. H. Low, IEEE/ACM Trans. on Networking, 11(4):525-536, August 2003.
- Path Algebra and Routing (Feb 16)
Lecture Notes
Review on Network Routing
Reading: Walrand and Parekh, Chapter 5.
Reading: Stable Internet routing without global coordination, L. Gao, J. Rexford, IEEE/ACM Trans. on Networking, 2001.
Reading: An algebraic theory of dynamic network routing, J. Sobrinho, IEEE/ACM Trans. on Networking, 2005.
- Random Access Game and Medium Access Control (Feb 23)
Lecture Notes
Reading: Walrand and Parekh, Chapter 3-4.
Reading: Random access games and medium access control design, L. Chen, S. Low and J. Doyle, IEEE/ACM Transactions on Networking, 2010.
- S-modular Games and Power Control (Mar 1)
Lecture Notes
Reading: Supermodular Games, J. Lev
in, 2006.
Reading: A framework for uplink power control i
n cellular radio systems, R. D. Yates, IEEE Journal of Selected Areas in Communication
s, 1995.
Reading: Efficient power control via pricing in
wireless data networks, C. Saraydar, N. Mandayam and D. Goodman, IEEE Trans. on Co
mmunications, 2002.
Reading: S-modular games and power control in w
ireless networks, E. Altman and Z. Altman, IEEE Trans. on Automatic Cont
rol, 2003.
- Architectural Principles of the Internet (Mar 1)
Lecture Notes
Reading: Walrand and Parekh, Chapter 1-2.
Reading: The Design Philosophy of the DARPA Internet Protocols, D. Clark, Proceedings of ACM SIGC
OMM Symposium, 1988.
Reading: Internet clean-slate desi
gn: what and why?, A. Feldmann, ACM SIGCOMM Computer Communication Review, 37(3), 2007.
- Potential Games and the Inefficiency of Equilibria (Mar 8)
Lecture Notes
Reading: Potential G
ames, D
. Monderer and L. S. Shapley, Games and Economic Behaviors, 14(1):124-143, 1996.
Reading: Potential functio
ns and the
inefficiency of equilibria, T. Roughgarden, ICM, 2006.
Reading: How bad is selfish routing?, T. R
oughgarden
and E. Tardos,Journal of the ACM, 2002.
Reading: Efficiency loss in a network resou
rce allocat
ion Game, R. Johari and J. N. Tsitsiklis, Mathematics of Operations Research, 2004.
Reading: The price of stability for network design
with fair
cost allocation, E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler and T. Roughgarden, FO
CS, 2004.
- Optimization, Dynamics, and Layering in Complex Networked Systems (Mar 10; ECES 131)
Lecture Notes
Reading: Robustness, Optimization, and Archi
tecture, F. Chandra, D. F. Gayme, L. Chen and J. C. Doyle, European Journal of Control, 2011.
Reading: Layering as optimization decomposition, M. Chian
g, S. H. Low, A. R. Calderbank and J. C. Doyle,
Proceedings of IEEE, January 2007.
Reading:
Exact Convex Relaxation for Radial Networks using Branch Flow Models
, N. Li, L. Chen and S. H. Low, IEEE SmartGridComm, 2012.
Reading:
Reverse and Forward Engineering of Frequency Control in Power Networks
, S. You and L. Chen, IEEE CDC, 2014.
Reading: Branch flow m
odel: relaxations and convexification,
M. Farivar and S. H. Low, IEEE Transactions on Power Systems, 2013.
- The Role of Information in Distributed Resource Allocation (Mar 15; Mohammed)
Lecture Notes
Reading: The Role of Information in Distributed Resource Allocation, J. Marden, 2015.
- Faireness and Efficiency in Resource Allocation (Mar 29; Guohui and Zhe)
Lecture Notes
Reading: Multiresource allocation: Fairness-efficiency tradeoffs in a unifying framework, C. Joe-Wong, S. Sen, T. Lan, and M. Chiang, IEEE/ACM Transactions on Networking, 2013.
Reading: An axiomatic theory of fairness,
T. Lan and M. Chiang, Technical Report, 2011.
- Throughput-Optimal Scheduling (Mar 31; ECES 131; Salman and Wanshan)
Lecture Notes
Reading: Stability properties of const
rained queueing systems and scheduling policies for maximum throughput in multihop radio networks,
L. Tassiulas and A. Ephremides, IEEE Transactions on Automatic Control, 1992.
- Dynamical Model of Cascading Failure (Apr 5; Zhiyuan)
Lecture Notes
Reading: Robust Network Routing under Cascading Failures, IEEE Transactions on Network Science and Engineering, 2014.
- Games and Passivity (Apr 19; Mark)
Lecture Notes
Reading: Population Games, Stable Games, and Passivity,
M. Fox and J. Shamma, Games, 2013.
- Project presentations (Apr 26)
Grading
This is a preliminary breakdown that may change during the semester.
- Homework -- 10%
- Topic review -- 50%
- Project -- 40%
Homeworks
There will be about two homework sets, mainly during the first half of the semester. Students are strongly encouraged
to collaborate on homeworks,
but should make sure to fully understand the problems and solutions and must write down solutions independently.
Topic review
Students are expected to write a (at least) one-page review for each topic.
Project
There will be projects for students to work, in group of no more than 2. There are two choices:
- Choose one of the suggested projects
- Propose and work on your own project
Students are expected to make a 30 minutes' presentation and write a project report at the end of the semester.
Accommodations for Disability
If you qualify for accommodations because of a disability, please submit to
your professor a letter from Disability Services in a timely manner (for exam
accommodations provide your letter at least one week prior to the exam) so that
your needs can be addressed. Disability Services determines accommodations
based on documented disabilities. Contact Disability Services at 303-492-8671
or by e-mail at dsinfo@colorado.edu.
If you have a temporary medical condition or injury, see Temporary Medical
Conditions: Injuries, Surgeries, and Illnesses guidelines under Quick Links at
Disability Services website and discuss your needs with your professor.
Religious Observances
Campus policy regarding religious observances requires that faculty make every
effort to deal reasonably and fairly with all students who, because of
religious obligations, have conflicts with scheduled exams, assignments or
required attendance. In this class, we accommodate the absences of the class and delay
in homeworks and project due to religious observances, upon notifying the instructor one week ahead.
See full details at http://www.colorado.edu/policies/fac_relig.html.
Classroom
Behavior
Students and faculty each have responsibility for maintaining an appropriate
learning environment. Those who fail to adhere to such behavioral standards may
be subject to discipline. Professional courtesy and sensitivity are especially
important with respect to individuals and topics dealing with differences of
race, color, culture, religion, creed, politics, veteran's status, sexual
orientation, gender, gender identity and gender expression, age, disability,
and nationalities. Class rosters are provided to the instructor with the
student's legal name. I will gladly honor your request to address you by an
alternate name or gender pronoun. Please advise me of this preference early in
the semester so that I may make appropriate changes to my records. See policies at
http://www.colorado.edu/policies/classbehavior.html and at
http://www.colorado.edu/studentaffairs/judicialaffairs/code.html#student_code.
The instructor reserves the right to adjust grades as he sees needed, in response to the student behavior issues.
Discrimination and Harassment
The University of Colorado Boulder (CU-Boulder) is committed to maintaining a
positive learning, working, and living environment. The University of Colorado
does not discriminate on the basis of race, color, national origin, sex, age,
disability, creed, religion, sexual orientation, or veteran status in admission
and access to, and treatment and employment in, its educational programs and
activities. (Regent Law, Article 10, amended 11/8/2001). CU-Boulder will not
tolerate acts of discrimination or harassment based upon Protected Classes or
related retaliation against or by any employee or student. For purposes of this
CU-Boulder policy, "Protected Classes" refers to race, color, national origin,
sex, pregnancy, age, disability, creed, religion, sexual orientation, gender
identity, gender expression, or veteran status. Individuals who believe they
have been discriminated against should contact the Office of Discrimination and
Harassment (ODH) at 303-492-2127 or the Office of Student Conduct (OSC) at
303-492-5550. Information about the ODH, the above referenced policies, and
the campus resources available to assist individuals regarding discrimination
or harassment can be obtained at http://www.colorado.edu/odh.
Honor Code
All students of the University of Colorado at Boulder are responsible for
knowing and adhering to the academic integrity policy of this institution.
Violations of this policy may include: cheating, plagiarism, aid of academic
dishonesty, fabrication, lying, bribery, and threatening behavior. All
incidents of academic misconduct shall be reported to the Honor Code Council
(honor@colorado.edu; 303-735-2273). Students who are found to be in violation
of the academic integrity policy will be subject to both academic sanctions
from the faculty member and non-academic sanctions (including but not limited
to university probation, suspension, or expulsion). Other information on the
Honor Code can be found at http://www.colorado.edu/policies/honor.html and at
http://www.colorado.edu/academics/honorcode/.
|