Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Isaac Keslassy"'
Publikováno v:
Machine Learning. 110:2835-2866
The capability to perform anomaly detection in a resource-constrained setting, such as an edge device or a loaded server, is of increasing need due to emerging on-premises computation constraints as well as security, privacy and profitability reasons
Publikováno v:
2022 IFIP Networking Conference (IFIP Networking).
Publikováno v:
IEEE/ACM Transactions on Networking. 29:517-528
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 solutions cannot ensure full consistency under arbitrary changes and/or can
Publikováno v:
Stochastic Systems. 10:152-169
A parallel server system is considered in which a dispatcher routes incoming jobs to a fixed number of heterogeneous servers, each with its own queue. Much effort has been previously made to design policies that use limited state information (e.g., t
Autor:
Isaac Keslassy, Shay Vargaftik, Kathy Barabash, Gal Mendelson, Ariel Orda, Dean Har'el Lorenz
Publikováno v:
Proceedings of the 17th International Conference on emerging Networking EXperiments and Technologies.
Hash-based stateful load-balancers employ connection tracking to avoid per-connection-consistency (PCC) violations that lead to broken connections. In this paper, we propose Just Enough Tracking (JET), a new algorithmic framework that significantly r
Publikováno v:
ACM SIGCOMM Computer Communication Review. 49:69-74
The queueing delay faced by a packet is arguably the largest source of uncertainty during its journey. It therefore seems crucial that we understand how big the buffers should be in Internet routers. Our 2004 Sigcomm paper revisited the existing rule
Publikováno v:
Operations Research. 67:1678-1698
The degree to which delays or queue lengths equalize under load-balancing algorithms gives a good indication of their performance. Some of the most well-known results in this context are concerned with the asymptotic behavior of the delay or queue le
Publikováno v:
Queueing Systems. 92:1-23
This paper introduces a load-balancing policy that interpolates between two well-known policies, namely join the shortest queue (JSQ) and join the least workload (JLW), and studies it in heavy traffic. This policy, which we call replicate to the shor
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 server heterogeneity. In such heterogeneous systems with many load-balanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::696bf76942a31cbd86194a671e36c5e5
Publikováno v:
IEEE/ACM Transactions on Networking. 25:2571-2584
Backpressure schemes are known to stabilize stochastic networks through the use of congestion gradients in routing and resource allocation decisions. Nonetheless, these schemes share a significant drawback, namely, the delay guarantees are obtained o