D
Danny Raz
Researcher at Technion – Israel Institute of Technology
Publications - 170
Citations - 6729
Danny Raz is an academic researcher from Technion – Israel Institute of Technology. The author has contributed to research in topics: Cloud computing & Approximation algorithm. The author has an hindex of 37, co-authored 164 publications receiving 6403 citations. Previous affiliations of Danny Raz include International Computer Science Institute & Google.
Papers
More filters
Journal ArticleDOI
IDMaps: a global internet host distance estimation service
TL;DR: In this paper, the authors propose a scalable Internet-wide architecture, called IDMaps, which measures and disseminates distance information on the global Internet, and present solutions to the measurement server placement and distance map construction problems in IDMaps.
Proceedings ArticleDOI
Near optimal placement of virtual network functions
TL;DR: A thorough study of the NFV location problem is performed, it is shown that it introduces a new type of optimization problems, and near optimal approximation algorithms guaranteeing a placement with theoretically proven performance are provided.
Journal ArticleDOI
The cache location problem
TL;DR: There is a surprising consistency over time in the relative amount of web traffic from the server along a path, lending a stability to the TERC location solution and these techniques can be used by network providers to reduce traffic load in their network.
Proceedings ArticleDOI
Understanding TCP fairness over wireless LAN
TL;DR: This paper identifies four different regions of TCP unfairness that depend on the buffer availability at the base station, with some regions exhibiting significant unfairness of over 10 in terms of throughput ratio between upstream and downstream TCP flows.
Proceedings ArticleDOI
Constrained mirror placement on the Internet
TL;DR: The results show that increasing the number of mirror sites under the constraint is effective in reducing client download time and reducing server load only for a surprisingly small range of values regardless of the mirror placement algorithm.