75473 - Network Modelling M

Learning outcomes

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. Internet router architectures and modelling. Input and output queueing. Application examples.

Course contents

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

2. Traffic theory: basic concepts and definitions

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

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

5. Discrete-time Markov Chains

6. Continuous-time Markov Chains

7. Birth/Death Markov processes

8. Queuing systems, Kendall's notation

9. Little's formula

10. Pure loss Systems, Erlang B

11. Ideal waiting systems, Erlang C

12. M/G/1 average delay P-K formula, M/G/1 residual time

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

14. Parallel queues with priority: average delay formula

     Part II

     Application examples of network design

15. Routing and forwarding in the Internet

16. Router architectures and queuing techniques

17. Discrete-time input and output queueing

18. Application examples of network design

Readings/Bibliography

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

Seminar given by invited speakers

Assessment methods

written test

Teaching tools

Slides prepared by the teacher

Journal papers

Links to further information

http://www.unibo.it/docenti/carla.raffaelli

Office hours

See the website of Carla Raffaelli