ITA | ENG
B010702 - TELECOMMUNICATIONS NETWORKS
Main information
Teaching Language
Course Content
Suggested readings
Learning Objectives
Prerequisites
Teaching Methods
Further information
Type of Assessment
Course program
Academic Year 2012-13
Coorte 2012 - Second Cycle Degree in TELECOMMUNICATION ENGINEERING
Course year
First year - Second Semester
Belonging Department
Information Engineering (DINFO)
Course Type
Single education field course
Scientific Area
ING-INF/03 - TELECOMMUNICATIONS
Credits
9
Teaching Hours
72
Teaching Term
11/03/2013 ⇒ 10/06/2013
Attendance required
No
Type of Evaluation
Final Grade
Course Content
show
Course program
show
Lectureship
Teaching Language
Italian/English (Limited to specific parts and activities)
Course Content
Fundamental and advanced queueing models
Priority Queues
Open and Close Networks of Queues
Capacity Allocation in Data Networks
Routing in Data Networks;
Congestion and Flow Control;
Wireless Networks
Sensor and Actor Newtworks
Applications : communication networks and computer operations.
Priority Queues
Open and Close Networks of Queues
Capacity Allocation in Data Networks
Routing in Data Networks;
Congestion and Flow Control;
Wireless Networks
Sensor and Actor Newtworks
Applications : communication networks and computer operations.
Suggested readings (Search our library's catalogue)
D. Bersekas, R. Gallager, Data Networks, Prentice Hall, 1992.
• M. Schwartz , Telecommunication Networks, Addison Wesley, 1987
• J.F. Hayes, T V.J. Modelling and Analysis of Telecommunications
Networks, J. Wiley, 2004.
• M. Schwartz , Telecommunication Networks, Addison Wesley, 1987
• J.F. Hayes, T V.J. Modelling and Analysis of Telecommunications
Networks, J. Wiley, 2004.
Learning Objectives
This course deals with both theory and application of fundamental and advanced queueing models. Fundamental models include M/M/1 model and its variants, M/G/1 and G/M/1 models, bulk arrival and bulk service processes, and priority queues. The course also deals with open and closed Jackson networks and optimal solving of the capacity assignment problem in different cases. Applications emphasize communication networks and computer operations, but may include examples from different fields as transportation, manufacturing, and the service industry.
The course aims to provide students with capabilities to understand Queueing Theory and its applications to the modeling and analysis of Telecommunication Networks and Computer Systems.
Specific course objectives are :
- in-depth knowledge of fundamnetal queueing models;
- to be familiar with performance evaluation of queueing systems;
- Apply and extend queueing models to analyze real teleccomunication and computer systems.
The course aims to provide students with capabilities to understand Queueing Theory and its applications to the modeling and analysis of Telecommunication Networks and Computer Systems.
Specific course objectives are :
- in-depth knowledge of fundamnetal queueing models;
- to be familiar with performance evaluation of queueing systems;
- Apply and extend queueing models to analyze real teleccomunication and computer systems.
Prerequisites
Probability and Linear Algebra
Teaching Methods
Lectures, discussion groups, tutorials, problem solving, debates, etc
Further information
Lecture notes and PowerPoint presentations covering the course topics will be made available at the page dedicated to the course on the moodle website (CSIAF) . To login on moodle, you need to have activated your academy account.
Exams
Data Time
January 15, 2013 9:00
February 7, 2013 9:00
February 26, 2013 9:00
June 18, 2013 9:00
July 12, 2013 9:00
July 23, 2013 9:00
September 18, 2013 9:00
September 26, 2013 9:00
December 17, 2013 9:00
Location : ask at reception desk.
Exams
Data Time
January 15, 2013 9:00
February 7, 2013 9:00
February 26, 2013 9:00
June 18, 2013 9:00
July 12, 2013 9:00
July 23, 2013 9:00
September 18, 2013 9:00
September 26, 2013 9:00
December 17, 2013 9:00
Location : ask at reception desk.
Type of Assessment
Oral exam
Course program
Probability and Random Processes Review
Application of Birth and Death Processes to Queueing Theory
Analysis of multiplexing and access schemes
Imbedded Markov Chain : Theory, Analysis and Applications
Priority Queues
Advanced topics in queuing theory: The matrix geometric Techniques and Applications
Networks of Queues
Capacity Allocation
Routing in Data Networks
Congestion and Flow Control
Wireless Networks
Sensor and Actor Newtworks
Applications : Cognitive Systems, Cloud Computing.
Application of Birth and Death Processes to Queueing Theory
Analysis of multiplexing and access schemes
Imbedded Markov Chain : Theory, Analysis and Applications
Priority Queues
Advanced topics in queuing theory: The matrix geometric Techniques and Applications
Networks of Queues
Capacity Allocation
Routing in Data Networks
Congestion and Flow Control
Wireless Networks
Sensor and Actor Newtworks
Applications : Cognitive Systems, Cloud Computing.