| TSIN01 |
Information Networks, 6 ECTS credits.
/Informationsnät/
For:
CS
D
DAV
I
Ii
IT
SY
U
Y
|
| |
Prel. scheduled
hours: 36
Rec. self-study hours: 124
|
| |
Area of Education: Technology
Main field of studies: Computer Engineering, Computer Science, Information Technology
|
| |
Advancement level
(G1, G2, A): A
|
|
Aim:
The course aim is to provide understanding of how a packet-oriented information network works and how the choice of technology can affect its performance. The course intends to give good knowledge of the fundamental methods for multiple-access and routing in network communications. After completing the course the student is expected to be able to:
- describe the slotted multiple-access model, as well as the Poisson model for packet arrivals in an information network.
- describe protocols for multiple-access to a shared media.
- give an account of properties of mechanisms in protocols for multiple access to a shared media
- formulate assumptions to model and analyse information networks and discuss how valid these assumptions are.
- perform typical calculations to implement the various algorithms covered in the course.
|
|
Prerequisites: (valid for students admitted to programmes within which the course is offered)
Basic knowledge of Probability theory.
Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshhold requirements for progression within the programme, or corresponding.
|
|
Organisation:
The course consists of lectures, problem-solving classes and a home assignment.
|
|
Course contents:
Lectures and exercise sessions treat the following topics of Information Networks:
- Layered network architecture and the OSI model.
- Slotted multiple-access models and Markov chains.
- Arrival statistics and the Poisson process.
- ALOHA system (slotted and unslotted) and stabilization.
- Splitting algorithms: tree and FCFS algorithms.
- Performance analysis of multiple-access systems.
- Carrier sensing: CSMA ALOHA, CSMA/CD, and CSMA/CA.
- Packet radio networks and IEEE 802.11 protocols.
- Routing algorithms: minimum-weight spanning trees and shortest-path algorithms.
|
|
Course literature:
Dimitri Bertsekas / Robert Gallager: "Data Networks", second edition, 1992, ISBN 9780132009164.
|
|
Examination: |
|
Written examination
Assignment report
|
4 ECTS
2 ECTS
|
| |
|
|
Course language is English.
Department offering the course: ISY.
Director of Studies: Klas Nordberg
Examiner: Danyo Danev
Link to the course homepage at the department
Course Syllabus in Swedish
|