Εμφάνιση απλής εγγραφής

dc.creatorGitzenis, S.en
dc.creatorPaschos, G. S.en
dc.creatorTassiulas, L.en
dc.date.accessioned2015-11-23T10:28:21Z
dc.date.available2015-11-23T10:28:21Z
dc.date.issued2013
dc.identifier10.1109/tit.2012.2235905
dc.identifier.issn0018-9448
dc.identifier.urihttp://hdl.handle.net/11615/27976
dc.description.abstractWe investigate the scalability of multihop wireless communications, a major concern in networking, for the case that users access content replicated across the nodes. In contrast to the standard paradigm of randomly selected communicating pairs, content replication is efficient for certain regimes of file popularity, cache, and network size. Our study begins with the detailed joint content replication and delivery problem on a 2-D square grid, a hard combinatorial optimization. This is reduced to a simpler problem based on replication density, whose performance is of the same order as the original. Assuming a Zipf popularity law, and letting the size of content and network both go to infinity, we identify the scaling laws and regimes of the required link capacity, ranging from O(root N) down to O(1).en
dc.source.uri<Go to ISI>://WOS:000318163500013
dc.subjectAsymptotic lawsen
dc.subjectcapacityen
dc.subjectcontent distribution wireless networksen
dc.subjectcooperative cachingen
dc.subjectmultihop wireless networksen
dc.subjectnetwork sustainabilityen
dc.subjectscaling lawsen
dc.subjectZipf lawen
dc.subjectCAPACITYen
dc.subjectDISTRIBUTIONSen
dc.subjectComputer Science, Information Systemsen
dc.subjectEngineering, Electrical &en
dc.subjectElectronicen
dc.titleAsymptotic Laws for Joint Content Replication and Delivery in Wireless Networksen
dc.typejournalArticleen


Αρχεία σε αυτό το τεκμήριο

ΑρχείαΜέγεθοςΤύποςΠροβολή

Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στις ακόλουθες συλλογές

Εμφάνιση απλής εγγραφής