Kelly Cache Networks

We study networks of M/M/1 queues in which nodes act as caches that store objects. Exogenous requests for objects are routed towards nodes that store them; as a result, object traffic in the network is determined not only by demand but, crucially, by where objects are cached. We determine how to pla...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annual Joint Conference of the IEEE Computer and Communications Societies s. 217 - 225
Hlavní autoři: Mahdian, Milad, Moharrer, Armin, Ioannidis, Stratis, Yeh, Edmund
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2019
Témata:
Approximation algorithms
cache networks
Cache storage
Delays
Greedy algorithms
ICN
Kelly networks
Optimization
Peer-to-peer computing
Servers
ISSN:2641-9874
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study networks of M/M/1 queues in which nodes act as caches that store objects. Exogenous requests for objects are routed towards nodes that store them; as a result, object traffic in the network is determined not only by demand but, crucially, by where objects are cached. We determine how to place objects in caches to attain a certain design objective, such as, e.g., minimizing network congestion or retrieval delays. We show that for a broad class of objectives, including minimizing both the expected network delay and the sum of network queue lengths, this optimization problem can be cast as an NP-hard submodular maximization problem. We show that so-called continuous greedy algorithm [1] attains a ratio arbitrarily close to 1-1/ e\approx 0.63 using a deterministic estimation via a power series; this drastically reduces execution time over prior art, which resorts to sampling. Finally, we show that our results generalize, beyond M/M/1 queues, to networks of Mmlk and symmetric M/D/1 queues.
ISSN:2641-9874
DOI:10.1109/INFOCOM.2019.8737377