Broadband and
Optical Networks Case Study
The case study is an creative exercise in:
- synthesizing
a picture of an area, its relevance, structure and core ideas; and identifying
what problems are worth working on going forward.
- integrating
the concepts learnt in class, with an in-depth focus in a single area.
- understanding
the *research* and *engineering* issues in a focus area and a crisp
articulation of state-of-the-art and research/engineering directions being
investigated in the community. No fluff. Suggested length ~ about 10
pages.
- reading
key technical research papers. Papers marked as Required Readings
are to supplement whatever has been covered in the class and are a must
read. In most of the cases these papers present the Big Picture.
Papers marked as References further elaborate on the topic and
could be dealing with specific problems.
- making
a creative attempt at any open research problems to suggest solution
directions/approaches. Well articulated solution approaches/breakthroughs
can get upto 5 bonus points.
Note: you are free to propose your own topic for your case
study. However, it should conform to the following guidelines:
- List of sub-topics to be
covered
- List of at least 3 papers,
IETF RFCs/drafts and/or one book you plan to
read in depth for the case study. This should include a "core
set" of papers/books which should be approved by the instructor. The
goal is to exclude "fluff" papers from this list. For example,
your proposal should be of similar depth as the papers listed in the
suggested case studies. It is implicitly assumed that your case study
should go far deeper into the topics than covered in class. The class
lecture material is a starting point.
- Upto
2 students can collaborate on a case study project, provided the proposed
work is substantial enough (in terms of depth/breadth). Please refer to course
syllabus for due dates.
- The final case study writeup (of about 10 pages) should clearly specify:
- The scope of the
problem you are studying - detail all the fundamental design issues/subproblems involved
- Solution approaches
to each of these issues (in isolation)
- Solutions adopted in
practice
- Conclusions stating
the open issues involved, and possible solution directions.
- Precise definition
of problems and original insight into solution directions will lead to
bonus points.
- the depth/breadth of issues
investigated
- clarity
of thought and presentation. Problem definition and scope before solution
presentation.
- quality of critique of the state-of-the-art
and insight in presenting open issues
- Well articulated solution
approaches/breakthroughs can get upto 5 bonus
points. Badly written reports or reports with more "fluff" than
clear technical exposition will lose points in the evaluation.
Case Study Topics
Network Processors
Network
Processors are designed as fast embedded processors that can handle the header
processing in a fast and configurable manner. Notable among the network
processors are the ones that belong to the Intel's IXP family. The goals of the
case study in this area can consist of analyzing the currently available
network processors for their design and capabilities. Please note that the
study should go significantly beyond the overview provided in the class.
- Network Processors
Design:
- Intel
IXP Network Processors:
[Back to Top]
Optical Networks
- General Issues in Optical
Networking:
-
DWDM:
- Sonet:
[Back to Top]
ATM
·
Congestion Control in ATM Networks:
o
Required Reading:
A. Charny, D. Clark, R. Jain Congestion Control
with Explicit Rate Indication ICC 95
o
Required Reading: S. Kalyanaraman, R. Jain, S. Fahmy,
R. Goyal, and B. Vandalore
The ERICA Switch Algorithm for ABR Traffic Management in ATM Networks
TON 2000
o
Reference: Kung, H. T. and R.
Morris Credit-Based Flow
Control for ATM Networks IEEE Network Magazine 1995
o
Reference: R.Jain
Congestion Control
and Traffic Management in ATM Networks: Recent Advances and A Survey
Computer Networks and ISDN Systems 1996
o
Reference: R. Jain A Timeout Based
Congestion Control Scheme for Window Flow-Controlled Networks JSAC 86
o
Reference: R. Jain Myths about
Congestion Management in High Speed Networks Internetworking: Research
and Experience 1992
·
Quality of Service:
o
Reference: Sonia Fahmy and Raj Jain ABR Flow Control
for Multipoint Connections IEEE Network Magazine 1998
o
Reference: Rohit
Goyal, Xiangrong Cai, Raj Jain, Sonia Fahmy, Bobby Vandalore Per-VC Rate
Allocation Techniques for ATM-ABR Virtual Source Virtual Destination Networks Globecom 98
o
Reference: Bobby Vandalore, Sonia Fahmy, Raj Jain, Rohit Goyal and Mukul Goyal QoS
and Multipoint support for Multimedia Applications over ATM ABR service IEEE
Communications Magazine 1999
o
Reference: T. V. Lakshman, P. P. Mishra and K. K. Ramakrishnan Transporting
Compressed Video Over ATM Networks with Explicit Rate Feedback Control INFOCOM
1997
o
Reference: H. Kanakia,
P. P. Mishra, and A. Riebman
An
Adaptive Congestion Control Scheme for Real Time Packet Video transport SIGCOMM
1993
[Back to Top]
Scheduling Algorithms
Scheduling
algorithms presented in the literature are broadly classified based on whether
they can seperate rate fairness and delay guarantees.
The references presented under the headings of Virtual Clock (Sorted-priority)
schemes and Frame-based schemes do not achieve this seperation. The references under the title Fair service
curve schemes do provide this seperation.
- Virtual Clock
(Sorted-Priority) schemes:
- Required Reading:
A. Demers, S. Keshav, S. Shenker, Analysis
and simulation of a fair queueing algorithm. SIGCOMM
89
- Required Reading:
A. Parekh, R. Gallager,
A
Generalized Processor Sharing Approach to Flow Control - The Single Node
Case. ToN 93
- Reference: S.J.
Golestani, A self-clocked Fair Queueing scheme for Broadband Applications. INFOCOM
94
- Reference: J.C.R.
Bennett, H. Zhang, WF2Q: Worst-case
Fair Weighted Fair Queueing. INFOCOM 96
- Reference: P.
Goyal, H.M. Vin, H. Chen Start-time
Fair Queuing: A scheduling algorithm for integrated services. SIGCOMM
96
- Reference: S.
Suri, G. Varghese, G. Chandramenon,
Leap Forward Virtual Clock. INFOCOM
97
- Frame-Based
schemes:
- Required Reading:
D. Stiliadis, A
Varma, Design
and Analysis of Frame-Based Fair-Queueing: A
New Traffic Scheduling Algorithm For Packet-Switched Networks. SIGMETRICS
96
- Required Reading:
D. Stiliadis, A Varma,
A General Methodology for
Designing Efficient Traffic Scheduling and Shaping. INFOCOM 97
- Reference: C.R.
Kalmanek, H.Kanakia, S.
Keshav, Rate controlled servers for very
high-speed networks. GLOBECOM 90
- Reference: M.
Katevenis, S. Sidiropoulos,
C. Courcoubetis, Weighted round-robin cell multiplexing
in a general-purpose ATM switch chip. JSAC 91
- Reference: M Shreedhar, G Varghese, Efficient Fair-Queueing
Using Deficit Round Robin. SIGCOMM 95
- Fair
Service Curve Schemes:
[Back to Top]
Admission Control
Measurement-based admission control (MBAC) algorithms are used to make
resource reservation decisions to achieve particular QoS
goals. MBAC schemes either assume a particular traffic model for sources or
employ generic traffic envelopes to describe them.
- Schemes
with Source Traffic Model Assumptions
- Required Reading:
E.W. Knightly, N.B. Shroff, Admission control for statistical QoS: theory and practice Network 99
- Reference: R.J.
Gibbens, F.P. Kelly, P.B. Key, A decision-theoretic approach to call
admission control in ATM networks. JSAC 95
- Reference: Z.
Dziong, M. Juda, L.
Mason A framework for bandwidth
management in ATM networks - aggregate equivalent bandwidth estimation
approach. ToN 97
- Reference: M.
Grossglauser, D. Tse,
A
Framework for robust measurement-based admission control. ToN 99
- Reference: L.
Breslau, S. Jamin, S. Shenker, Comments on the performance of
measurement-based admission control algorithms. INFOCOM 2000
- Schemes
without Source Traffic Model Assumptions
[Back to Top]
Active Queue Management
- Required Reading:
Floyd, S., and Jacobson, V. Random Early
Detection gateways for Congestion Avoidance. ToN
1993
- Required Reading:
S. Athuraliya, V. H. Li, Steven H. Low
and Qinghe Yin REM: Active
Queue Management IEEE Network, 2001
- Reference: Dong Lin
and Robert Morris Dynamics of Random Early Detection
SIGCOMM 1997
- Reference: W. Feng, D. Kandlur, D. Saha, K. Shin Techniques for
Eliminating Packet Loss in Congested TCP/IP Networks INFOCOM 1999
- Reference: W.
Feng, D. Kandlur,
D. Saha, K. Shin, "" Blue:
A New Class of Active Queue Management Algorithms INFOCOMM 2000
- Reference: R. Pan,
B. Prabhakar, K. Psounis,
CHOKe, a stateless
active queue management scheme for approximating fair bandwidth allocation
INFOCOM 2000
- Reference: S. Kunniyur and R. Srikant. Analysis and Design of an Adaptive Virtual Queue
Algorithm for Active Queue Management. SIGCOMM 2001
- Reference: C.V. Hollot, V. Misra, D. Towsley, W. Gong A
Control Theoretic Analysis of RED INFOCOM 2001
- Reference: C.V. Hollot, V. Misra, D. Towsley, W. Gong On Designing
Improved Controllers for AQM Routers Supporting TCP Flows INFOCOM
2001
- Reference: S. H.
Low, A Duality
Model of TCP and Queue Management Algorithms ITC 2000.
[Back to Top]
Traffic Engineering
- Required Reading:
D. Awduche, A. Chiu, A. Elwalid,
I. Widjaja, X. Xiao, Overview
and Principles of Internet Traffic Engineering ,
2001.
- Reference S.
Kalyanaraman, H. Tahilramani, J. Akella, S. Raghunath, H. Nagar, Bananas:
An Evolutionary Framework for Explicit and Multipath
Routing in the Internet , 2002.
- Required Reading:
D. Awduche, A. Chiu, A. Elwalid,
I. Widjaja, X. Xiao, A
Framework for Internet Traffic Engineering ,
2001.
- Required Reading:
D. Awduche, MPLS
and Traffic Engineering in IP Networks ,
Communications Magazine, 1999.
- Reference A. Feldmann and J. Rexford, IP
Network Configuration for Intradomain Traffic Engineering , 2000.
- Reference Bernard Fortz and Mikkel Thorup, Internet
Traffic Engineering by Optimizing OSPF Weights ,
INFOCOM 2000.
- Reference Anwar Elwalid, Cheng Jin,
Steven Low, Indra Widjaja,
MATE: MPLS Adaptive Traffic Engineering , INFOCOM 2001.
- Reference D. Awduche, J. Malcolm, J. Agogbua,
M. O'Dell, and J. McManus, Requirements
for Traffic Engineering Over MPLS, RFC-2702, 1999.
More Links on BANANAS
[Back to Top]
High Speed Routing and Networks:
[Back to Top]
[Back to Top]