82071 - Network Design M

Course Unit Page

Academic Year 2018/2019

Learning outcomes

Acquisition of skills in fundamental mathematical models and methodologies for performance evaluation and dimensioning of communication networks, and related applications to network design. Knowledge of main network models, quality of service mechanisms, control and management techniques and protocols for traffic and service engineering in evolving and emerging network scenarios, with applications to practical case studies.

Course contents

  1. Review of main network transfer modes:circuit, packet, cell switching. Deterministic and statistical multiplexing. Identification of network performance evaluation and design aspects.

  2. Method to represent and evaluate network systems: analysis simulation and measurement

  3. Traffic theory: basic concepts and definitions

  4. Poisson process as arrival process: arrival probability, inter-arrival time, residual time

  5. Bernoulli process as arrival process: inter-arrival time

  6. Discrete-time Markov Chains

  7. Continuous-time Markov Chains

  8. Birth/Death Markov processes

  9. Queuing systems, Kendall's notation

  10. Little's formula

  11. Pure loss Systems, Erlang B

  12. Ideal waiting systems, Erlang C

  13. M/M/1 queue case study and application

Part II

Application examples of network design

  1. Routing and forwarding in the Internet

  2. Router architectures and queuing techniques

  3. Discrete-time input and output queueing

  4. Application examples of network design

  5. Simple TCP modeling


Part I

L. Kleinrock, 'Queuing systems, part I', Wiley editions.

Part II

J. F. Kurose, K. W. Ross, ' Computer Networking, a Top-Down Approach', Fifth ed. Pearson.

L. Peterson, B. Davie, "Computer networks: a system approach", Elsevier, Morgan Kaufmann

M. Hassan, R. Jain, High Performance TCP/IP Networking, Concepts, Issues and Solutions, Pearson, Prentice Hall, 2004.

Teaching methods

Theoretical lectures and numerical exercises.

Exercises on practical daily situations.

Recorded lectures will be available upon request.

Assessment methods

Written exercise to test the ability to solve new design problems by applications of the methodologies explained in the course.

The oral exam will immediately follow the written part and will check the ability of the student to elaborate the demonstrations of the theorems and to explain motivations and reasoning in support of network design methodologies.

The highest scores will require, in addition to correctness, appropriate reporting and good speech organization.

Teaching tools

Slides prepared by the teacher available on Unibo Moodle platform

Links to further information


Office hours

See the website of Carla Raffaelli