國立虎尾科技大學 |

Online Edge Caching and Wireless Delivery in Fog-Aided Networks.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Online Edge Caching and Wireless Delivery in Fog-Aided Networks./
作者:	Azimi, Seyyed Mohammadreza.
面頁冊數:	1 online resource (117 pages)
附註:	Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
Contained By:	Dissertation Abstracts International79-12B(E).
標題:	Electrical engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9780438155541

Online Edge Caching and Wireless Delivery in Fog-Aided Networks.
Azimi, Seyyed Mohammadreza.

Online Edge Caching and Wireless Delivery in Fog-Aided Networks. - 1 online resource (117 pages)

Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.

Thesis (Ph.D.)--New Jersey Institute of Technology, 2018.

Includes bibliographical references

Multimedia content is the significant fraction of transferred data over the wireless medium in the modern cellular and wireless communication networks. To improve the quality of experience perceived by users, one promising solution is to push the most popular contents as close as to users, also known as the "edge" of network. Storing content at the edge nodes (ENs) or base stations (BSs) is called "caching". In Fog Radio Access Network (F-RAN), each EN is equipped with a cache as well as a "fronthaul" connection to the content server. Among the new design problems raised by the outlined scenarios, two key issues are addressed in this dissertation: 1) How to utilize cache and fronthaul resources while taking into account the wireless channel impairments; 2) How to incorporate the time-variability of popular set in the performance evaluation of F-RAN. These aspects are investigated by using information-theoretic models, obtaining fundamental insights that have been corroborated by various illustrative examples. To address point 1), two scenarios are investigated. First, a single-cell scenario with two transmitters is considered. A fog-aided small-cell BS as one of the transmitters and a cloud-aided macro-cell BS as the second transmitter collaborate with each other to send the requested content over a partially connected wireless channel. The intended and interference channels are modeled by erasure channels. Assuming a static set of popular contents, offline caching maps the library of files to cached contents stored at small-cell BS such that the cache capacity requirement is met. The delivery time per bit (DTB) is adopted as a measure of the coding latency, that is, the duration of the transmission block, required for reliable delivery. It is proved that optimal DTB is a linear decreasing function of cache capacity as well as inversely proportional with capacity of fronthaul link. In the second scenario, the same single-cell model is used with the only caveat that the set of popular files is time-varying. In this case, online caching maps the library of files to cached contents at small-cell BS. Thanks to availability of popular set at macro-BS, the DTB is finite and has upper and lower bounds which are functions of system resources i.e., cache and fronthaul link capacities. As for point 2), the model is comprised of an arbitrary number of ENs and users connected through an interference-limited wireless channel at high-SNR regime. All equally important ENs are benefited from cache capacity as well as fronthaul connection to the content server. The time-variability of popular set necessitates online caching to enable ENs keep track of changes in the popular set. The analysis is centered on the characterization of the long-term Normalized Delivery Time (NDT), which captures the temporal dependence of the coding latencies accrued across multiple time slots in the high-SNR regime. Online edge caching and delivery schemes based on reactive and proactive caching principles are investigated for both serial and pipelined transmission modes across fronthaul and edge segments. The outcome of analytical results provides a controversial view of contemporary research on the edge caching. It is proved that with a time-varying set of popular files, the capacity of fronthaul link between ENs and content server set a fundamental limit on the system performance. This is due to the fact that the original information source is content server and the only way to retrieve information is via fronthaul links. While edge caching can provide some gains in term of reduced latency, the gain diminishes as a result of the fact that the cached content is prone to be outdated with time-varying popularity.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780438155541Subjects--Topical Terms:

596380
Electrical engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Online Edge Caching and Wireless Delivery in Fog-Aided Networks.
LDR:04992ntm a2200349Ki 4500 001 919174
005 20181116131021.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780438155541
035 $a (MiAaPQ)AAI10790542
035 $a (MiAaPQ)njit:10001
035 $a AAI10790542
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Azimi, Seyyed Mohammadreza. $3 1193684
245 1 0 $a Online Edge Caching and Wireless Delivery in Fog-Aided Networks.
264 0 $c 2018
300 $a 1 online resource (117 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
500 $a Adviser: Osvaldo Simeone.
502 $a Thesis (Ph.D.)--New Jersey Institute of Technology, 2018.
504 $a Includes bibliographical references
520 $a Multimedia content is the significant fraction of transferred data over the wireless medium in the modern cellular and wireless communication networks. To improve the quality of experience perceived by users, one promising solution is to push the most popular contents as close as to users, also known as the "edge" of network. Storing content at the edge nodes (ENs) or base stations (BSs) is called "caching". In Fog Radio Access Network (F-RAN), each EN is equipped with a cache as well as a "fronthaul" connection to the content server. Among the new design problems raised by the outlined scenarios, two key issues are addressed in this dissertation: 1) How to utilize cache and fronthaul resources while taking into account the wireless channel impairments; 2) How to incorporate the time-variability of popular set in the performance evaluation of F-RAN. These aspects are investigated by using information-theoretic models, obtaining fundamental insights that have been corroborated by various illustrative examples. To address point 1), two scenarios are investigated. First, a single-cell scenario with two transmitters is considered. A fog-aided small-cell BS as one of the transmitters and a cloud-aided macro-cell BS as the second transmitter collaborate with each other to send the requested content over a partially connected wireless channel. The intended and interference channels are modeled by erasure channels. Assuming a static set of popular contents, offline caching maps the library of files to cached contents stored at small-cell BS such that the cache capacity requirement is met. The delivery time per bit (DTB) is adopted as a measure of the coding latency, that is, the duration of the transmission block, required for reliable delivery. It is proved that optimal DTB is a linear decreasing function of cache capacity as well as inversely proportional with capacity of fronthaul link. In the second scenario, the same single-cell model is used with the only caveat that the set of popular files is time-varying. In this case, online caching maps the library of files to cached contents at small-cell BS. Thanks to availability of popular set at macro-BS, the DTB is finite and has upper and lower bounds which are functions of system resources i.e., cache and fronthaul link capacities. As for point 2), the model is comprised of an arbitrary number of ENs and users connected through an interference-limited wireless channel at high-SNR regime. All equally important ENs are benefited from cache capacity as well as fronthaul connection to the content server. The time-variability of popular set necessitates online caching to enable ENs keep track of changes in the popular set. The analysis is centered on the characterization of the long-term Normalized Delivery Time (NDT), which captures the temporal dependence of the coding latencies accrued across multiple time slots in the high-SNR regime. Online edge caching and delivery schemes based on reactive and proactive caching principles are investigated for both serial and pipelined transmission modes across fronthaul and edge segments. The outcome of analytical results provides a controversial view of contemporary research on the edge caching. It is proved that with a time-varying set of popular files, the capacity of fronthaul link between ENs and content server set a fundamental limit on the system performance. This is due to the fact that the original information source is content server and the only way to retrieve information is via fronthaul links. While edge caching can provide some gains in term of reduced latency, the gain diminishes as a result of the fact that the cached content is prone to be outdated with time-varying popularity.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Electrical engineering. $3 596380
650 4 $a Communication. $3 556422
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0544
690 $a 0459
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a New Jersey Institute of Technology. $b Electrical and Computer Engineering. $3 1190500
773 0 $t Dissertation Abstracts International $g 79-12B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10790542 $z click for full text (PQDT)