S-38.149 Postgraduate Course in Teletraffic Theory, Fall 2001

Homeworks by Timo Holopainen
Deadline: 19 November

1) Exercise 5.7  (page 208 of the textbook)
2) Consider the single origin/all destinations shortest path 
   problem (section 5.2.2, page 192). Show that each artificial 
   arc eventually becomes the out-arc but never becomes the 
   in-arc.
3) Exercise 5.15 (page 211 of the textbook): 
   Show that feasible trees, basic flow vectors, and price 
   vectors generated by the two methods are in one-to-one 
   correspondence.