An SDN-based algorithm for caching, routing, and load balancing in ICN
One of the challenges of Information-centric Networking (ICN) is finding the optimal location for caching content and processing users' requests. In this paper, we address this challenge by leveraging Software-defined Networking (SDN) for efficient ICN management. To achieve this, we formulate...
Uložené v:
| Vydané v: | China communications Ročník 21; číslo 5; s. 64 - 76 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
China Institute of Communications
01.05.2024
Department of Electrical and Computer Engineering,Isfahan University of Technology,Isfahan,Iran%Department of Technology and Engineering,Shahrekord University,Shahrekord,Iran |
| Predmet: | |
| ISSN: | 1673-5447 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | One of the challenges of Information-centric Networking (ICN) is finding the optimal location for caching content and processing users' requests. In this paper, we address this challenge by leveraging Software-defined Networking (SDN) for efficient ICN management. To achieve this, we formulate the problem as a mixed-integer nonlinear programming (MINLP) model, incorporating caching, routing, and load balancing decisions. We explore two distinct scenarios to tackle the problem. Firstly, we solve the problem in an offline mode using the GAMS environment, assuming a stable network state to demonstrate the superior performance of the cache-enabled network compared to non-cache networks. Subsequently, we investigate the problem in an online mode where the network state dynamically changes over time. Given the computational complexity associated with MINLP, we propose the software-defined caching, routing, and load balancing (SDCRL) algorithm as an efficient and scalable solution. Our evaluation demonstrates that the SDCRL algorithm significantly reduces computational time while maintaining results that closely resemble those achieved by GAMS. |
|---|---|
| ISSN: | 1673-5447 |
| DOI: | 10.23919/JCC.ja.2023-0165 |