אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

A major challenge in optimizing network utilization is how to reduce bottleneck links, while taking into account that bandwidth demands may be increased over time. Traffic engineering algorithms attempt to address this challenge by employing smart routing, however current solutions optimization criterion is biased towards a non-realistic setting in which demands are increased uniformly. In this talk, I will present a novel traffic engineering algorithm which is the first to consider the more realistic assumption, that only some (unknown) set of demands will increase. An exact solution to this problem is exponential in the initial number of demands, however we show that some of the constraints can be omitted without affecting the solution, thereby easing the computation complexity. We use this observation to design an algorithm that takes a network and bandwidth demands and returns a routing robust to non-uniform demand increase. We evaluated our algorithm on two network graphs and compared against previous work. Experimental results indicate that our algorithm outperforms the most widely used algorithm by up to 10%.