COURSE UNIT TITLE

: PERFORMANCE ANALYSIS OF COMPUTER NETWORKS

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CSE 5089 PERFORMANCE ANALYSIS OF COMPUTER NETWORKS ELECTIVE 3 0 0 7

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

PROFESSOR DOCTOR YALÇIN ÇEBI

Offered to

Computer Engineering Non-Thesis
COMPUTER ENGINEERING
Computer Engineering
Computer Engineering
Computer Engineering (Non-Thesis-Evening)

Course Objective

This course s objective, mainly, is making the students able to tackle with the most common network performance issues of today in a mathematical/theoretical way. For that effect, this course will anable the student to use Queueing theory in modeling/solving basic network perfonmance problems and will teach them using simulation techniques for solving the more complex ones. The course also aims that the students will understand how to predict the impact of several factors on network perfonmance by using analytical and simulation techniques.

Learning Outcomes of the Course Unit

1   to be able to Understand performance issues as applied to Computer Networks.
2   to be able to understand Queing theory: intermediate level.
3   to be able to analyze network performance theoretically.
4   to be able to understand QoS issues of today's IP networks and Learning the actual solution approaches.
5   Learning basics of using NS2 and to be able to simulate networks by using it.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction: The aim of this course. Modeling concept.
2 Probability, markov chains, basics of queueing theory.
3 intermediate queueing theory.
4 Revival: Workings of TCP. Most used vers.
5 Congestion concept. Effects of congestion on TCP s performance.
6 TCP s througtup analysis: Theoretically calculated.
7 IP-level control and RED protocol.
8 NP completness and QoS Routing problems
9 Integrated Services approach
10 Differentiated Services: RIO and GPS
11 Midterm.
12 WFQ and similar scheduling algorithms.
13 Wireless related Data Link Layer Protocols.
14 Positioning simulation in analysis work and NS2. Project discussions.

Recomended or Required Reading


Main: Huang Yih, Network Performance Analysis, 2002. Course notes/slides.
References: Web based resources for related topics (will be specified during the semestr).
Other: W. Stallings, High Speed Networks and Internet (book)

Planned Learning Activities and Teaching Methods

Lectures in interactive class sessions. Mandatory submittals for given text reading summaries. Personal presantation on chosen topics.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 ASG ASSIGNMENT
3 FCG FINAL COURSE GRADE MTE * 0.50 + ASG * 0.50


*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

AS1 is a homework. AS2 is an individual project. Final is a written submisson about project report.

Assessment Criteria

Interaction during class hours will be counted in Attendance and effect Final.
Checking the knowledge transfer, interest in the area and presantation of what is understood.

Language of Instruction

English

Course Policies and Rules

: Continous connection with class progress and lecturer is required.

Contact Details for the Lecturer(s)

Dokuz Eylül University, Department of Computer Engineering
Tınaztepe Campus 35160 Buca, Izmir
Tel:+90-(232) 301 74 01

Office Hours

will be Furnished upon request by students.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 12 3 36
Preparation for midterm exam 1 11 11
Preparing assignments 1 31 31
Design Project 1 31 31
Preparations before/after weekly lectures 14 5 70
Quiz etc. 0 0 0
Midterm 1 3 3
TOTAL WORKLOAD (hours) 182

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11
LO.14333434442
LO.21314232331
LO.32515342342
LO.44454544443
LO.53434343441