AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
TL;DR
A totally distributed dynamic replication scheme, which uses a (cid:12)nite automaton based technique to learn access patterns and dynamically reorder copies of data in the network, in anticipation of predicted accesses, to reduce network message costs.
Strongly consistent geo-replication often relies on fast paths to reduce latency in the common case of no failures or contention. Existing fast-path schemes, however, are ad hoc and restrictive: each corresponds to a point in a broad design space shaped by network topology, workload, and latency objective, so no single...
HARE introduces a holistic allocation model that captures the demand correlation between cache size and other resources, and uses a novel two-phase harvest/redistribute method to optimize resource allocation across tenants, maximizing the throughput of each while maintaining fairness.
Data replication is a fundamental mechanism in distributed database systems, supporting fault tolerance, availability, and reliable data access across networked nodes. Cockroach DB is a cloud native, open-source distributed SQL database that relies on replication and consensus protocols to maintain consistency and re...
Consistent replication of data among distributed processes -- a task involving the well-known consensus problem -- is notoriously expensive and hard to scale, affecting especially datacenter services with stringent performance requirements. To mitigate this problem, we introduce scalable replication in-hardware ( scarH...
The SRM experience suggests a broader architectural lesson: scalable multiparty communication benefits from aligning network delivery mechanisms with the data-centric semantics of applications—a principle that becomes increasingly important as collaborative systems, content platforms, and large-scale multiparty applica...
This paper studies coded distributed computing (CDC) in a dynamic system in which workers may depart and new clusters may join. The caches of the surviving workers and their existing Reduce assignments stay untouched, while the storage brought by arriving clusters is put to use. In contrast to elastic computing, which...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.