Tele-traffic Systems

Recommended Prerequisites

Calculus I, II, and III, Probability and Statistics, Communication Networks and Systems.

Teaching Methods

Theoretical classes involving detailed presentation of concepts, principles and relevant mathematical models and resolution of some problems enabling the application of the lectured subjects to basic teletraffic systems to be illustrated. From time to time students will be asked to answer questions for greater involvement in the teaching process and detection of basic difficulties. Practical classes of computational type involving the development of a library of numerical routines for resolving some basic models of teletrafic systems.

Learning Outcomes

The central objective is a unifying and systematised learning process focused on concepts, fundamental principles and basic mathematical models supporting the theory of teletraffic systems (Teletraffic Theory) with emphasis on applications in teletraffic engineering aiming at creating competencies of analysis of QoS (Quality of Service) and dimensioning of essential characteristics of telecommunication systems and networks envisaged as stochastic service systems, with our without queueing facilities, capable of carrying traffic of stochastic nature, according to certain technic-functional rules depending on the basic information transfer technology.

Work Placement(s)

No

Syllabus

Introduction-Objectives and Basic Concepts on teletraffic theory and teletraffic engineering. Topics on Stochastic Processes; Poisson process and its properties; Palm and Raikov theorems (statement and applications); distributions of service times; Kendall notation. Birth-death Processes Theory; definition; Kolmogorov equations; statistical equilibrium theorem. Models of Basic Teletraffic Systems with loss or with queue, including Erlang-B, Poisson, Engset, Negative Binomial, Truncated Negative Binomial; Engset with delay  and Cromelin-Pollaczek systems; applications in teletraffic engineering. Little Theorem and its applications; law of the efficiency of great trunks. Link Systems; classical theory; basic models of digital switches; internal blocking calculation; non-blocking systems and Clos networks.

Head Lecturer(s)

Rita Cristina Girão Coelho da Silva

Assessment Methods

Continuous
Evaluation of obligatory computational works: 25.0%
Final test: 35.0%
Mini Tests: 40.0%

Bibliography

Main Bibliography:

-R. B. Cooper, "Introduction to Queueing Theory", North Holland, 80.

-H. Akimaru and K. Kawashima, “Teletraffic Theory and Applications”, Springer Verlag, 93, 99.

-ITU-T, Handbook of Teletraffic Engineering, 1999, 2005.

Recommended/Complementary:

-G. Grimmett and D. Stirzaker, Probablity and Random Processes, Oxford Science Publ., 97.

-J. Boucher, Voice Teletraffic Systems Engineering, Artech House, 88.

-L. Kleinrock, Queueing Systems, Vol I, John Wiley.

-Point Processes, D. Cox and V. Isham, Chapman and Hall, 1980.