S-38.149 Postgraduate Course in Teletraffic Theory, Fall 2001

Homeworks by Olli-Pekka Hiironen
Deadline: 22 October

1) Rest of Exercise 2.1 (page 99 of the textbook): 
   Consider the graph of Fig. 2.14 (on page 100). 
   Find a shortest path from 1 to all nodes using 
   a) the D'Esopo-Pape algorithm, 
   b) the SLF method, and
   c) the SLF/LLL method.
2) Exercise 2.11 (page 103 of the textbook)
3) Exercise 2.19 (page 106 of the textbook)