BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI
WORK INTEGRATED LEARNING PROGRAMMES
Digital
Learning
Part A: Content Design
|
Course Title
|
Advanced Computer Networks
|
|
Course No(s)
|
CS
ZG525
|
|
Credit Units
|
|
|
Credit Model
|
|
|
Course Author
|
K Hari Babu
|
|
Version No
|
Ver
1
|
|
Date
|
02-08-2015
|
Course Objectives
|
No
|
Course Objective
|
|
CO1
|
To
learn fundamental of computer network principles, services and architectures
of various networks
|
|
CO2
|
To
introduce a set of advanced technologies in networking.
|
|
CO4
|
To
learn advanced routing protocols and router architecture.
|
|
CO5
|
To
gain knowledge of QoS and congestion control in end-to-end data transfer..
|
Text
Book(s)
|
T1
|
Larry
L. Peterson, Bruce S. ,"Computer Networks: A Systems Approach", 4th
edition, Davie Publisher: Elsevier/Morgan Kaufmann, ISBN:
13:978-0-12-370548-8; 10:0-12- 370548-7. )
|
|
T2
|
Deepankar
Medhi, Karthikeyan Ramasamy, "Network Routing Algorithms, Protocols, and
Architectures", Publisher: Morgan Kaufmann Publisher Elsevier ISBN 13:
978-0-12- 088588-6
|
|
T3
|
Wireless
Sensor Networks, F.Zhao and L. Guibas, Morgan Kaufmann, 2004.
|
Reference
Book(s) & other resources
|
R1
|
Andrew S. Tanenbaum,
"Computer Networks", PHI, Fifth Edition, ISBN: 978-0132- 126953.
|
|
R2
|
C. Siva Ram Murthy and B. S.
Manoj, "Ad Hoc Wireless Networks: Architectures and Protocols"
Prentice Hall, 2004
|
Modular
Content Structure
1.
ADVANCED COMPUTER NETWORK
·
Introduction to the course
·
Internet Architecture and Functionalities
·
Next generation Internet design and challenges
2.
GENERAL TCP CONGESTION CONTROL AND QUEUING
·
Cubic, Datacentre TCP
·
Congestion for high bandwidth delay
·
Modern congestion control algorithms
·
High speed TCP
·
Cubic compound TCP
·
Multipath TCP 11 and
Multipath TCP 1
3.TRAFFIC ENGINEERING AND QUEUING
·
War between mice and elephants
·
RED for Web traffic
4. BGP PROTOCOL
·
Instability
·
Policies
·
Security
·
Interactions
5 MULTI-HOP WIRELESS AD HOC NETWORK
ROUTING PROTOCOLS TCP
·
Ad Hoc Routing Protocols comparison and analysis of
·
DSDV – TORA – DSR – AODV
6. TCP PERFORMANCE AND WIRELESS LINKS
·
Geomorphic view of networking
·
Dynamic-routing mobility and sessionlocation mobility
·
Dynamic-routing mobility with a nonhierarchical name space
7.P2P NETWORKS AND
ECONOMICS, DATA CENTER NETWORK
·
Case studies of Skype and Bit Torrent
·
Charting CDN Networks
·
Measuring CDN delay performance
·
CDN Availability
8. INTRODUCTION to
Advanced Computer networking Technologies
·
Software defined networking
·
Control and data planes
·
Network virtualization
·
Open flow
Learning Outcomes:
|
No
|
Learning Outcomes
|
|
LO1
|
Students will be able to apply basic
principles in designing modern computer networks .
|
|
LO2
|
Students
will be able to use functionality of high speed networks in development of
advanced network applications.
|
|
LO3
|
Students
will be able to use advanced routing architecture and protocols in networking and also students can
apply performance measures for routing in computer
networks
|
Part B: Course Handout
|
Academic Term
|
Second Semester
2015-16
|
|
Course Title
|
Advanced Computer
Networks
|
|
Course No
|
CS ZG525
|
|
Lead Instructor
|
|
|
|
|
|
Contact Hours
|
List of Topic Title
(from content structure in Part A)
|
Topic #
(from content structure
in Part A)
|
Text/Ref Book/external resource
|
|
1
|
ADVANCED COMPUTER NETWORK
·
Introduction to the course
·
Internet Architecture and Functionalities
·
Next generation Internet design and challenges
|
|
T1:
Ch-1
The
Design Philosophy of The DARPA Internet Protocols [Clark 1988]
End-to-End Argument in System Design [J H Saltzer 1984]
A Brief History of The Internet [B Leiner 2009] , Tussle in
Cyberspace: Defining Tomorrow’s Internet [Clark 2005]
|
|
2
|
|||
|
3
|
|||
|
4
|
GENERAL TCP CONGESTION CONTROL AND QUEUING
·
Cubic, Datacentre TCP
·
Congestion for high bandwidth delay
·
Modern congestion control algorithms
·
High speed TCP
·
Cubic compound TCP
·
Multipath TCP 11 and
Multipath TCP 1
|
|
T1 Chapters 3,4,6
Computer Networks, A Systems
Approach, Fifth Edition, L. Peterson and B. Davie,
Morgan Kaufman, 2012.,
Congestion Control for High Bandwidth Delay Product Networks [Katabi 2002]
|
|
5
|
|||
|
6
|
|||
|
|
|||
|
7
|
TRAFFIC ENGINEERING AND QUEUING
·
War between mice and elephants
·
RED for Web traffic
|
|
T3 chapter 7
The War between Mice and
Elephants by Guo and Matta
Core-Stateless Fair Queueing: Achieving Approximately Fair
Bandwidth Allocations in High Speed Networks [Stoica 1998],
Random Early Detection
Gateways for Congestion Avoidance [Floyd 1993]
|
|
8
|
|||
|
9
|
|||
|
10
|
BGP PROTOCOL
·
Instability
·
Policies
·
Security
·
Interactions
|
|
T 3 Chapter 8
Internet Routing Instability
Craig Labovitz[1998]
Stable Internet Routing Without
Global Coordination
Lixin Gao[2001]
BGP Security in Partial
Deployment
Robert Lychev[2013]
|
|
11
|
|||
|
12
|
|||
|
|
|||
|
13
|
MULTI-HOP WIRELESS AD HOC NETWORK ROUTING PROTOCOLS
Ad Hoc Routing Protocols comparison and analysis of
DSDV – TORA – DSR – AODV
|
|
T4,R4
A High-Throughput Path Metric for Multi-Hop Wireless Routing [Douglas 2003]
]
|
|
14
|
|||
|
|
|||
|
|
|||
|
15
|
TCP PERFORMANCE AND WIRELESS LINKS
Geomorphic view of networking
Dynamic-routing mobility and sessionlocation mobility
Dynamic-routing mobility with a nonhierarchical name space
|
|
T1 chapter 4,6, R4
A Performance Comparisonof
Multi-Hop Wireless Ad Hoc Network Routing Protocols [Josh Broch 1998]
A Comparison of Mechanisms for Improving TCP Performance over
Wireless Links [Balakrishanan 1996]
Understanding TCP fairness over Wireless LAN [Saar Pilosof 2003]
Impact of Multihop Wireless
Channel on TCP Throughput and Loss [Zhenghua Fu 2003
|
|
16
|
P2P
NETWORKS AND ECONOMICS, DATA CENTER NETWORK
Case studies of Skype and Bit Torrent
Charting CDN Networks
Measuring CDN delay performance
CDN Availability
Methodology for CDN deployment
|
|
Robust Incentive Techniques for
Peer-to-Peer Networks [Feldman 2004], A Scalable and Flexible Data
Center Network
[Albert Greenberg 2009]
|
|
17-18
|
SDN,
CONTROL AND DATA PLANES , NETWORK VIRTUALIZATION SOFTWARE DEFINED NETWORKING, OPENFLOW
|
|
Measuring and Evaluating large scale CDNs []Cheng Huang 2008]
|
#
The above contact hours and topics can be adapted for non-specific and specific
WILP programs depending on the requirements.
Detailed Plan for Lab
work/Design work
1.Learn first-hand the
dynamics of TCP sawtooth and router buffer occupancy in a network. Learn how to
use any network tool ex: NS2, NS3, Mininet to create network topologies, run
traffic generators,collect statistics and plot them. Record the performance
parameters.
2. Learn why
large router buffers can lead to poor performance. This problem is often called
“bufferbloat.” Observe Bufferbloat using any tool.
3. All Internet routers contain buffers to hold
packets during times of congestion. The size of the buffers is dictated by the
dynamics of TCP’s congestion coantrol algorithm. The goal is to make sure that
when a link is congested, it is busy 100% of the time, which is equivalent to
making sure the buffer never goes empty. Until 2004, the common assumption was
that each link needs a buffer of size RTT * C where RTT is the average
round-trip time of a flow passing across the link, and C is the data-rate of
the bottleneck link. In 2004, Guido Appenzeller, Isaac Keslassy and Nick
McKeown’s buffer sizing paper outlined a new “rule of thumb” to decide the
amount of buffering needed to maintain “high” link utilization. The authors
showed that a link with N flows requires a buffer size of not more than
(RTT*C)/ (N)^1/2 .The original paper included results from simulation and measurements
from a real router, but not from a real network. Later, Neda Beheshti created a
hardware testbed to test the buffer sizing results in the Internet2 backbone
and demonstrated it at SIGCOMM 2008. Understand and validate the improved
buffer sizing rule-of-thumb. Gain experience replicating a real-world network
research result using any network simulation tool (including replicating the
test topology, traffic generation, experimental methodology, and measurement of
results).Understand the limitations of your simulation tool.Learn how to
package your experiments so it’s easy for others to run your code.
Case studies: Future
Internet Architectures:
Read research
papers describing the deficiencies of the current internet architecture and
protocols, as well as proposed future internet architectures and protocols are
required reading. You are expected to read the abstract paper(s) before the
class in which they will be discussed. You will be required to lead an in-class
presentation of a paper, and participate in discussion of the papers. Give •
give a short presentation in class about your literature review, and • write a
short (maximum 10 page) report on your literature review
Evaluation Scheme:
Legend: EC = Evaluation Component; AN =
After Noon Session; FN = Fore Noon Session
|
No
|
Name
|
Type
|
Duration
|
Weight
|
Day, Date,
Session, Time
|
|
EC-1
|
Quiz-I/
Assignment-I
|
Online
|
-
|
5%
|
February 1 to 10,
2016
|
|
|
Quiz-II
|
|
|
5%
|
March 1 to 10,
2016
|
|
|
Quiz-III/
Assignment-II
|
|
|
5%
|
March 25 to April
3, 2016
|
|
EC-2
|
Mid-Semester Test
|
Closed Book
|
2 hours
|
35%
|
27/02/2016 (FN)
10 AM – 12 Noon
Or
27/02/2016 (AN) 2
PM – 4 PM
|
|
EC-3
|
Comprehensive
Exam
|
Open Book
|
3 hours
|
50%
|
09/04/2016 (FN) 9
AM – 12 Noon
Or
09/04/2016 (AN) 2
PM – 5 PM
|
Note: If Assignment kindly remove Quiz-I, II,
III
Syllabus for Mid-Semester Test (Closed
Book): Topics in Contact Hours : 1 TO 9
Syllabus for Comprehensive Exam (Open
Book): All topics
Important links and information:
Elearn portal:
https://elearn.bits-pilani.ac.in
Students are expected to visit the Elearn
portal on a regular basis and stay up to date with the latest announcements and
deadlines.
Contact sessions:
Students should attend the online lectures as per the schedule provided on the
Elearn portal.
Evaluation Guidelines:
1.
EC-1 consists of either two Assignments or
three Quizzes. Students will attempt them through the course pages on the
Elearn portal. Announcements will be made on the portal, in a timely manner.
2.
For Closed Book tests: No books or
reference material of any kind will be permitted.
3.
For Open Book exams: Use of books and any
printed / written reference material (filed or bound) is permitted. However,
loose sheets of paper will not be allowed. Use of calculators is permitted in
all exams. Laptops/Mobiles of any kind are not allowed. Exchange of any
material is not allowed.
4.
If a student is unable to appear for the
Regular Test/Exam due to genuine exigencies, the student should follow the
procedure to apply for the Make-Up Test/Exam which will be made available on
the Elearn portal. The Make-Up Test/Exam will be conducted only at selected
exam centres on the dates to be announced later.
It shall be the responsibility of the individual
student to be regular in maintaining the self study schedule as given in the
course handout, attend the online lectures, and take all the prescribed
evaluation components such as Assignment/Quiz, Mid-Semester Test and
Comprehensive Exam according to the evaluation scheme provided in the handout.
No comments:
Post a Comment