Người báo cáo: Do Phan Thuan (Hanoi University of Technology)
Thời gian: 9h30, Thứ 5, ngày 13/2/2014
Địa điểm: Phòng 301, Nhà A5, Viện Toán học, 18 Hoàng Quốc Việt Cầu Giấy, Hà nội
Tóm tắt: 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.
- 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.
- 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.
|
