Joint Caching and Routing in Congestible Networks of Arbitrary Topology
| Autor: | Leandros Tassiulas, Tao Jiang, Konstantinos Poularakis, Boxi Liu |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Computer Networks and Communications
Wireless network Computer science Approximation algorithm 020206 networking & telecommunications Topology (electrical circuits) 02 engineering and technology Network topology Topology 01 natural sciences Computer Science Applications Network congestion 010104 statistics & probability Hardware and Architecture Signal Processing 0202 electrical engineering electronic engineering information engineering Bandwidth (computing) 0101 mathematics Routing (electronic design automation) Randomized rounding Information Systems |
| Zdroj: | IEEE Internet of Things Journal. 6:10105-10118 |
| ISSN: | 2372-2541 |
| DOI: | 10.1109/jiot.2019.2935742 |
| Popis: | In-network caching constitutes a promising approach to reduce traffic loads and alleviate congestion in both wired and wireless networks. In this article, we study the joint caching and routing problem in congestible networks of arbitrary topology (JoCRAT) as a generalization of previous efforts in this particular field. We show that JoCRAT extends many previous problems in the caching literature that are intractable even with specific topologies and/or assumed unlimited bandwidth of communications. To handle this significant but challenging problem, we develop a novel approximation algorithm with guaranteed performance bound based on a randomized rounding technique. Evaluation results demonstrate that our proposed algorithm achieves near-optimal performance over a broad array of synthetic and real networks, while significantly outperforming the state-of-the-art methods. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|