Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01pv63g329w
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorChen, Yuxin
dc.contributor.authorBrady, Nick
dc.date.accessioned2020-10-02T21:30:16Z-
dc.date.available2020-10-02T21:30:16Z-
dc.date.created2020-05-03
dc.date.issued2020-10-02-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp01pv63g329w-
dc.description.abstractMore people are using wireless networks than ever before due to the increase of personal communication devices, such as cell phones. The increase in personal communication device usage has resulted in a greater load on wireless networks, but users still expect data to arrive at their fingertips at a lightning-fast speed. Currently, backhaul bandwidth limitations can restrict information speeds through the rest of the network. Therefore, a method is needed to compensate for increasing backhaul bandwidth requirements. One proposed solution is to move popular network content to the network edges prior to user requests, known as wireless caching. Pushing content during times of low network usage decreases peak loads on the backhaul link. Multiple proposed methods of wireless caching have been presented in the literature, each with limitations and differing implications for real-world usage. This report presents the analysis and evaluation of one previously published method by modeling them and considering the possible practical applications and limitations of it.
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleAnalysis and Simulation of Network Caching Models as a Solution for Improving Network Throughput
dc.typePrinceton University Senior Theses
pu.date.classyear2020
pu.departmentElectrical Engineering
pu.pdf.coverpageSeniorThesisCoverPage
pu.contributor.authorid960893897
Appears in Collections:Electrical Engineering, 1932-2020

Files in This Item:
File Description SizeFormat 
BRADY-NICK-THESIS.pdf4.1 MBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.