Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Content caching in cellular networks: an algorithmic comparison

Motos Michail

Simple record


URIhttp://purl.tuc.gr/dl/dias/12EA8855-1DC2-4BB0-A987-193A57D3FBA5-
Identifierhttps://doi.org/10.26233/heallink.tuc.83236-
Languageen-
Extent59 pagesen
TitleContent caching in cellular networks: an algorithmic comparisonen
TitleΠροσωρινή αποθήκευση περιεχομένου σε κυψελωτά δίκτυα: μία σύγκριση αλγορίθμωνel
CreatorMotos Michailen
CreatorΜωτος Μιχαηλel
Contributor [Committee Member]Deligiannakis Antoniosen
Contributor [Committee Member]Δεληγιαννακης Αντωνιοςel
Contributor [Committee Member]Liavas Athanasiosen
Contributor [Committee Member]Λιαβας Αθανασιοςel
Contributor [Thesis Supervisor]Paterakis Michalisen
Contributor [Thesis Supervisor]Πατερακης Μιχαληςel
PublisherΠολυτεχνείο Κρήτηςel
PublisherTechnical University of Creteen
Academic UnitTechnical University of Crete::School of Electrical and Computer Engineeringen
Academic UnitΠολυτεχνείο Κρήτης::Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστώνel
Content SummaryThe 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.en
Type of ItemΔιπλωματική Εργασίαel
Type of ItemDiploma Worken
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2019-09-20-
Date of Publication2019-
SubjectNetwork cachingen
SubjectKnapsack problemen
Bibliographic CitationMichail Motos, "Content caching in cellular networks: an algorithmic comparison", Diploma Thesis, Department of Electrical and Computer Engineering, Technical University of Crete, Chania, Greece, 2019en
Bibliographic CitationΜιχαήλ Μώτος, "Προσωρινή αποθήκευση περιεχομένου σε κυψελωτά δίκτυα: μία σύγκριση αλγορίθμων", Διπλωματική Εργασία, Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών, Πολυτεχνείο Κρήτης, Χανιά, Ελλάς, 2019el

Available Files

Services

Statistics