Αναζήτηση

Πλοήγηση

• Κοινότητες
• Συγγραφείς
• Έτος
• Τίτλοι
• Θέματα

Ο Χώρος μου

• Είσοδος

Προσωρινή αποθήκευση περιεχομένου σε κυψελωτά δίκτυα: μία σύγκριση αλγορίθμων

Motos Michail

Πλήρης Εγγραφή

---

Περίληψη

The ever-increasing content demand along with an increase in content size has begged the question to explore efficient caching algorithms in order to address the need for lag free content delivery and reduced costs and backhaul load. First, we consider the caching placement policy as a 0-1 Knapsack problem and then proceed to introduce the system model. Next, we comprehensively formulate the 0-1 Knapsack problem, and describe two algorithmic solutions, a simple and fast greedy algorithm, which is not optimal, and an optimal dynamic programming one. We also describe in detail the simulation model and the pertinent distributions we ran our simulations with. The results indicate that no matter the type of the weight distribution (weight here corresponds to the length of the content items) or its characteristics, the greedy algorithm manages to closely match the results of the dynamic programming one, while at the same time offering greatly reduced runtime complexity. On this basis, the simple and fast greedy algorithm considered is a very good choice as a caching policy, since content provision services currently offer large catalogues, where dynamic programming exhibits exorbitant running times.

Διαθέσιμα αρχεία

Υπηρεσίες