\documentstyle[12pt]{article}
\oddsidemargin 0.1in
\evensidemargin -0.1in
\textwidth 6.25in
\topmargin 0.07in
\headsep 0.25in
\textheight 8.5in
\parindent 0.75in
\footnotesep 0.25in
\newtheorem{theorem}{Theorem}[section]
\newtheorem{lemma}{Lemma}[section]
\newtheorem{proposition}{Proposition}[section]
\newtheorem{corollary}{Corollary}[section]
\newtheorem{definition}{Definition}[section]
\newcommand{\be}{\begin{equation}}
\newcommand{\ee}{\end{equation}}
\newcommand{\beq}{\begin{eqnarray*}}
\newcommand{\eeq}{\end{eqnarray*}}
\newcommand{\dis}{\displaystyle}
\newcommand{\ie}{{\em i.e., }}
\newcommand{\cqfd}{\hfill $\Box$}
\newcommand{\qed}{\hfill{$\Box$}}
\newcommand{\la}{\lambda}
\newcommand{\makeline}{\noindent \rule{6.40in}{0.05in} \newline}
\newcommand{\maketline}{\noindent \rule{6.40in}{0.025in} \newline}
\def\Reals{\Bbb{R}}
\def\Ints{\Bbb{Z}}
\def\Nats{\Bbb{N}}
\def\E{\Bbb{E}}
\def\P{\Bbb{P}}
\input{psfig}
%%%%%%%%%%%%%%%%
\begin{document}
\thispagestyle{empty}
%%%%%%%%%%%%%%%%%%%%%%%%
\begin{center}
{\sf \Large
EECS 290Q Topics in Communication Networks}
\end{center}
\vspace{0.4in}
\begin{description}
\item[Instructor:]
David Tse, Room 269M, Cory, x2-5807, dtse@eecs
\item[Office Hours:]
11-12, Tu. and Th.
\item[Administrative Assistant:] Chris Colbert, Room 275 Cory, x2-8458, chrisc@eecs
\item [Description:] \hfill
Traditional data networks like the Internet offers a single class of
best-effort service to users; that is, there is no guarantee on the
delay or loss suffered by the packets. With increasing widespread use
of applications such as multimedia with stringent performance
requirements, there is a need to engineer networks and to design
services in which quality-of-service (QOS) guarantees can be made to
individual users. This course studies some of the approaches
recently developed to meet this challenge. In particular,
we will focus on three aspects of the problem: (i) the role of packet
scheduling disciplines and rate control in QOS provisioning, (ii)
statistical multiplexing and admission control, (iii) call routing and
blocking.
As a special topic to be covered near the end of the course,
we will discussing some networking issues in wireless CDMA networks.
\item[Prerequisite:] \hfill
The basic prerequisites for this course are some background in random
processes and networking. The course will be based on a sequence of
research papers which the instructor will explain. While the
questions to be addressed are mainly concerned with networking issues,
the instructor will provide a minimal amount of supporting material on
topics such as queueing, large deviations theory and optimization
as required. I am confident we can make up for small deficiencies in your
background as we go along.
\item [Evaluation:] \hfill
Students will be required to do a project on a topic of their choice
and present their findings in class at the end of the semester. Also,
each student will be a scribe for one or two lectures, taking and
organizing the class notes. They are to be typesetted, preferably in
Latex, and then distributed to the class.
\item[Required Text:] \hfill
A course reader compiled of the papers to be covered will be available
at Copy Central. The book {\em Discrete Stochastic Processes}, by
R.G. Gallager provide supporting materials and
is on reserve in the Engineering Library.
\end{description}
\newpage
\noindent{{\sf \large Course Outline}}\\
\begin{description}
\item[0. Overview and Motivation]\hfill
\begin{itemize}
\item A service-oriented view of three communication networks: the
telephone network, Internet and ATM.
\item Issues in providing QOS in an integrated service network.
\item Overview of the course.
\end{itemize}
\item[1. QOS Guarantee via Scheduling and Policing]\hfill
\begin{itemize}
\item Introduction to issues in scheduling and policing.
\item The worst-case resource allocation framework.
\item Performance guarantees of two classes of scheduling disciplines:
\begin{itemize}
\item Generalized Processor Sharing.
\item Rate-Controlled.
\end{itemize}
\item Implementation complexity.
\end{itemize}
\item[2. Statistical Multiplexing and Admission Control]\hfill
\begin{itemize}
\item Introduction to large deviations techniques.
\item Effective bandwidths.
\item Multiple time-scales in traffic dynamics and dynamic resource
allocation.
\item Renegotiated CBR: A service based on time-scale separation.
\item Measurement-based admission control.
\end{itemize}
\item[3. Circuit Routing and Blocking] \hfill
\begin{itemize}
\item Modeling as loss networks.
\item Blocking probability analysis via fixed-point approximation techniques.
\item Route optimization via shadow prices.
\item Dynamic routing and trunk reservation.
\item Performance bounds via network programming methods.
\item Competitive analytic approach towards routing.
\end{itemize}
\item[4. Special topic: Networking Issues in Wireless CDMA Networks] \hfill
\begin{itemize}
\item Introduction to basic concepts in CDMA.
\item Power control, handoffs and capacity assessment for CDMA
networks.
\item A framework for optimal power control.
\end{itemize}
\end{description}
\end{document}