Time: 9h30 Thusday 13 February 2014
Venue: Room 301, Building A5, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi

Abstract: In this talk we will consider the paths in a graph G which satisfy the QoS constraint, i.e. the paths having the length smaller than or equal to a value L.

1. In the first part of the talk, we will present a Depth-First-Search method to explore all possible paths with QoS constraint from a vertex s in the graph G. This method is implemented in Constant Amortized Time.
2. In the second part of the talk, we will present applications of this method to problems of QoS routing in survivable networks which provides protection against link failures.