performance analysis of computer networks

BLG 517E-Performance Analysis of Computer Networks , Fall 2008

Department of Computer Engineering, ITU

Instructor: Dr.Sema Oktug , e-mail:oktug@itu.edu.tr (office hours: Wed. 10:00-12:00 )

Schedule: Thu.13.30-16.30 (Room: 1303)

Web page: http://www3.itu.edu.tr/~oktug/PACN/performance08.html

Grading (tentative):

Midterm Exam. (25%),
Term paper + its presentation (15%) (A short (2-4 pages) summary of the paper should be submitted. Hard + electronic copies),
Projects using ns will be presented at Baal on Jan. 5,2009 at 10:00 a.m. (15%) (Simulation results should be given considering 95% confidence intervals.),
Paper on the metrics used in the papers discussed in class (max. 3 pages long, based on the papers presented in the class, IEEE paper format must be used) (5%)
Final Exam.(35%), Jan. 14, 2009 – Wednesday (9.00-11.00)
Contribution to lectures (5%).

Term Paper Presentation Schedule

Dec. 25,2008
            -Ahmet Salih Er,
            -Selda Kuruoğlu, “A Queuing Approach to Optimal Resource Replication in Wireless Sensor Networks”
            -Esra Demirtaş, “Performance of ad hoc networks with two-hop relay routing and limited packet lifetime (extended version)”
            -Cem Başar Çayıroğlu, “Systems with multiple servers under heavy-tailed workloads”
Jan. 2, 2009- at 9:30, Baal
            - Sanjarbek Hudaiberdiev
            -Arif Taşkol, “A Conditional Probability Approach to M/G/1-like Queues”
            - Sheikh Moinuddin

Textbooks:

- G. Giambene, Queueing Theory and Telecommunications: Networks and Applications, Springer, 2005.
- D. Bertsekas and R. Gallager, Data Networks, 2nd ed., Prentice Hall, 1992 (available at the Central Library),
- L.Kleinrock, Queueing Systems, Volume I: Theory, John Wiley & Sons, 1975 (available at the Central Library).

Outline:

As we all know, performance is the key issue in research. In this course, it is aimed to give the necessary knowledge to analyze the performance of computer networks. Lectures can be grouped into two: The first group focuses on the modeling of the computer networks and their performance based on delay. The second group focuses on the topics related to graph theory and computer networks. As the term paper, each student works on/presents a paper which is selected from the paper-pool formed by the instructor. Moreover, each student prepares a project by using the Qualnet or the ns simulation tool.

Weekly Schedule:

Week	Topic
1 (Sep.18, 2008)	Introduction
2 (Sep.25, 2008)	Stochastic processes. Markov Models.
3 (Oct.9, 2008)	Little’s Rule. M/M/1 queueing system.
4 (Oct.16, 2008)	M/M/m, M/M/m/m systems. Multi-dimensional Markov chains.
5 (Oct.23, 2008)	Kleinrock Independence Approximation.
6 (Oct.30, 2008)	Networks of queues.
7 (Nov.6,2008)	Studying some example cases (3.1, 3.5, 3.8, 3.9, 3.13(a), 3.14(a), 3.18, 3.19)
8 (Nov. 13, 2008)	Jackson’s Theorem. Some Applications
9 (Nov. 20, 2008)	MIDTERM
10 (Nov. 27, 2008)	Modeling networks as graphs. Network Flow Models, Network Flow Algorithms.
11 (Dec. 4, 2008)	Qualnet Tutorial. Confidence interval. Paper-pool will be ready.
12 (Dec. 18, 2008)	Paper discussion.
13 (Dec.25, 2008)	Paper discussion.
14 (Jan.2, 2009)?	Paper discussion.

By Sema Oktug, Sep.2008.