4 citations · 5 across the 3 of their papers we have counts for
7 papers
On the Persistent-Idle Load Distribution Policy Under Batch Arrivals and Random Service Capacity
Rami Atar, Isaac Keslassy, Gal Mendelson +2
The Persistent-Idle (PI) load distribution policy was recently introduced as an appealing alternative to current low-communication load balancing techniques. In PI, servers only up…
LSQ: Load Balancing in Large-Scale Heterogeneous Systems with Multiple Dispatchers
Shay Vargaftik, Isaac Keslassy, Ariel Orda
Nowadays, the efficiency and even the feasibility of traditional load-balancing policies are challenged by the rapid growth of cloud infrastructure and the increasing levels of ser…
RADE: Resource-Efficient Supervised Anomaly Detection Using Decision Tree-Based Ensemble Methods
Shay Vargaftik, Isaac Keslassy, Ariel Orda +1
Decision-tree-based ensemble classification methods (DTEMs) are a prevalent tool for supervised anomaly detection. However, due to the continued growth of datasets, DTEMs result in…
Pied Piper: Rethinking Internet Data Delivery
Aran Bergman, Israel Cidon, Isaac Keslassy +4
We contend that, analogously to the transition from resource-limited on-prem computing to resource-abundant cloud computing, Internet data delivery should also be adapted to a real…
AnchorHash: A Scalable Consistent Hash
Gal Mendelson, Shay Vargaftik, Katherine Barabash +3
Consistent hashing (CH) is a central building block in many networking applications, from datacenter load-balancing to distributed storage. Unfortunately, state-of-the-art CH solut…
Memento: Making Sliding Windows Efficient for Heavy Hitters
Ran Ben Basat, Gil Einziger, Isaac Keslassy +3
Cloud operators require real-time identification of Heavy Hitters (HH) and Hierarchical Heavy Hitters (HHH) for applications such as load balancing, traffic engineering, and attack…