ECTS - Communication Network Design

Communication Network Design (EE543) Course Detail

Course Name Course Code Season Lecture Hours Application Hours Lab Hours Credit ECTS
Communication Network Design EE543 3 0 0 3 5
Pre-requisite Course(s)
COMPE 102, EE 311
Course Language English
Course Type N/A
Course Level Natural & Applied Sciences Master's Degree
Mode of Delivery Face To Face
Learning and Teaching Strategies Lecture, Drill and Practice, Problem Solving, Project Design/Management.
Course Coordinator
Course Lecturer(s)
  • Assoc. Prof. Dr. Yaser DALVEREN
Course Assistants
Course Objectives The aim of this course is to provide students with an understanding of different communication network models, their analyses and simulation, and to provide with a thorough grounding in the principles underlying the inside of modern computer and communication networks.
Course Learning Outcomes The students who succeeded in this course;
  • able to model simple discrete event based systems or processes by means of queuing theory and Markov chains,
  • able to model and analyze simple discrete event based systems by Petri Nets,
  • able to model and verify elementary data link protocols by Petri Nets,
  • able to model and analyze elementary data link protocols by Coloured-Petri Nets
  • able to model and analyze elementary data link protocols by Omnet++ ,
  • able to identify fundamentals of today’s computer and communication networks with specialized and detailed information relating to quality of service concepts,
  • able to identify fundamentals of industrial networks with specialized and detailed information relating to quality of service concepts.
Course Content Introduction to Petri nets and colored Petri nets; introduction to Omnet++; congestion management, throughput, task scheduling and resource allocation in communication networks; network architectures and topologies, OSI and TCP/IP reference models.

Weekly Subjects and Releated Preparation Studies

Week Subjects Preparation
1 Petri Nets - Introduction to place/transition Petri Nets - Enabling and firing rules - Concurrency, synchronization - Determinism, safeness, boundedness - Liveness, reachability
2 Petri Nets - Marking vector, capacitance vector - Incidence matrix - Algebraic representation - Discrete event-based system models - Simulation of verification of simple protocols Review last week and Glance this week’s topics from the lecture
3 Colored Petri Nets - Introduction to high level Petri Nets - Timed Petri Nets - Functional Modeling and Analysis methods Review last week and Glance this week’s topics from the lecture
4 Colored Petri Nets - Discrete event-based system models - Simulation and verification of simple protocols - Project #1 Assignment (Petri Nets) Review last week and Glance this week’s topics from the lecture
5 Traffic Flow Control Protocols - Modeling the Leaky Bucket Algorithm - Single Arrival/Single Departure Model - Multiple Arrival/Single Departure Model - Modeling the Token Bucket Algorithm - Single Arrival/Single Departures Model - Multiple Arrivals/Single Departures Model Review last week and Glance this week’s topics from the lecture
6 Error Control Protocols - Modeling Stop and Wait - Performance of Stop and Wait - Modeling Go Back N - Performance of Go Back N - Modeling Selective-Repeat - Performance Selective-Repeat Review last week and Glance this week’s topics from the lecture
7 Medium Access Control Protocols - IEEE 802.1p Model Assumptions - IEEE 802.1p State Transition Diagram - IEEE 802.1p Protocol Performance - IEEE 802.3 (CSMA/CD) Model Assumptions - IEEE 802.3 (CSMA/CD) State Transition Diagram - IEEE 802.3 (CSMA/CD) Protocol Performance - Aloha and Slotted Aloha - Performance comparison of Aloha and Slotted Aloha Review last week and Glance this week’s topics from the lecture
8 Switching and Routing - Time Division Multiple Access (TDMA) - Circuit Switching and Packet Switching - Hub, Bridge, Switch, Router, Gateway - Routing and Traffic Management - Project #2 (Omnet++) Assignment Review last week and Glance this week’s topics from the lecture
9 Markov Chains - Discrete-TimeMarkov Chains - Memoryless Property of Markov Chains - Markov Chain Transition Matrix - Markov Matrices Review last week and Glance this week’s topics from the lecture
10 Markov Chains - Eigenvalues and Eigenvectors - Constructing the State Transition Matrix - Introduction to reducible Markov Chains - Introduction to Periodic Markov Chains Review last week and Glance this week’s topics from the lecture
11 Introduction to Queuing Theory - M/M/1 Queue - M/M/1/B Queue - Mm/M/1/B Queue Review last week and Glance this week’s topics from the lecture
12 Introduction to Queuing Theory - M/Mm/1/B Queue - The D/M/1/B Queue - The M/D/1/B Queue - Project #3 Assignment Review last week and Glance this week’s topics from the lecture
13 Project Presentation and Assessment Week-1 Review last week and Glance this week’s topics from the lecture
14 Project Presentation and Assessment Week-2 Review last week and Glance this week’s topics from the lecture
15 Final examination period Review of topics
16 Dönem sonu sınav çalışmaları Review of topics

Sources

Course Book 1. George Kesidis, “An Introduction to Communication Network Analysis”, Wiley-IEEE Press, 2007
Other Sources 2. Fayez Gebali, “Analysis of Computer and Communication Networks”, Springer, 2008
3. Richard M. Fujimoto, Kalyan S. Perumalla and George F. Riley, “Network Simulation”, Morgan & Claypool, 2007
4. Andrew S. Tanenbaum, “Computer Networks”, 4th Edition, Pearson Education International, 2003
5. Michel Diaz, “Petri Nets: Fundamental Models, Verification and Applications, Wiley-ISTE, 2009
6. Kurt Jensen, Lars M. Kristensen, “Coloured Petri Nets: Modelling and Validation of Concurrent Systems”, Springer, 2009

Evaluation System

Requirements Number Percentage of Grade
Attendance/Participation - -
Laboratory - -
Application - -
Field Work - -
Special Course Internship - -
Quizzes/Studio Critics - -
Homework Assignments - -
Presentation - -
Project 2 60
Report - -
Seminar - -
Midterms Exams/Midterms Jury 1 20
Final Exam/Final Jury 1 20
Toplam 4 100
Percentage of Semester Work
Percentage of Final Work 100
Total 100

Course Category

Core Courses X
Major Area Courses
Supportive Courses
Media and Managment Skills Courses
Transferable Skill Courses

The Relation Between Course Learning Competencies and Program Qualifications

# Program Qualifications / Competencies Level of Contribution
1 2 3 4 5
1 Ability to apply knowledge on Mathematics, Science and Engineering to advanced systems. X
2 Implementing long-term research and development studies in major areas of Electrical and Electronics Engineering. X
3 Ability to use modern engineering tools, techniques and facilities in design and other engineering applications. X
4 Graduating researchers active on innovation and entrepreneurship.
5 Ability to report and present research results effectively.
6 Increasing the performance on accessing information resources and on following recent developments in science and technology.
7 An understanding of professional and ethical responsibility.
8 Increasing the performance on effective communications in both Turkish and English.
9 Increasing the performance on project management.
10 Ability to work successfully at project teams in interdisciplinary fields.

ECTS/Workload Table

Activities Number Duration (Hours) Total Workload
Course Hours (Including Exam Week: 16 x Total Hours) 16 3 48
Laboratory
Application
Special Course Internship
Field Work
Study Hours Out of Class 8 5 40
Presentation/Seminar Prepration
Project 2 10 20
Report
Homework Assignments
Quizzes/Studio Critics
Prepration of Midterm Exams/Midterm Jury 1 8 8
Prepration of Final Exams/Final Jury 1 9 9
Total Workload 125