國立虎尾科技大學 |

Content Caching in Next-generation Networks.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Content Caching in Next-generation Networks./
作者:	Liu, Teng.
面頁冊數:	1 online resource (148 pages)
附註:	Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
Contained By:	Dissertation Abstracts International79-12B(E).
標題:	Computer engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9780438206748

Content Caching in Next-generation Networks.
Liu, Teng.

Content Caching in Next-generation Networks. - 1 online resource (148 pages)

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

Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2018.

Includes bibliographical references

Caching data is a known technique for improving system performance, and has been used extensively in many areas of computer engineering. Caching in communication networks reduces content access delay and alleviates congestion in the network core.

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

Mode of access: World Wide Web

ISBN: 9780438206748Subjects--Topical Terms:

569006
Computer engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Content Caching in Next-generation Networks.
LDR:03588ntm a2200373Ki 4500 001 918388
005 20181114145236.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780438206748
035 $a (MiAaPQ)AAI10790125
035 $a (MiAaPQ)rpi:11293
035 $a AAI10790125
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Liu, Teng. $3 1192701
245 1 0 $a Content Caching in Next-generation Networks.
264 0 $c 2018
300 $a 1 online resource (148 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: Alhussein A. Abouzeid.
502 $a Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2018.
504 $a Includes bibliographical references
520 $a Caching data is a known technique for improving system performance, and has been used extensively in many areas of computer engineering. Caching in communication networks reduces content access delay and alleviates congestion in the network core.
520 $a In this research, we study the use of caching in future communication networks, which consists of four chapters: i) cache allocation in content-enabled Internet routers, ii) content placement at the edge of heterogeneous wireless networks, iii) caching in vehicular networks that support vehicle-to-vehicle (V2V) communication, and iv) caching in vehicular networks with different user groups, which support both V2V communication and vehicle-to-infrastructure (V2I) communication.
520 $a First, we study the problem of allocating two types of memory, which have different access speeds, to a set of routers in a single content-centric network domain. The goal is to develop a cache allocation scheme with a desired performance. Second, we consider the joint problem of content placement and service scheduling in wireless femtocell networks to maximize the traffic volume served from the cache. A probabilistic algorithm is proposed which is scalable and can converge relatively fast. Then, we study caching in vehicular transportation networks that support vehicle-to-vehicle (V2V) communication. We derive the data throughput, based on which we propose a communication cost function. With this communication cost, we develop a technique to drive the user equilibrium to the system optimal by tuning communication network related parameters under the marginal cost pricing framework. Finally, we incorporate the vehicle-to-infrastructure (V2I) communication in vehicular transportation networks and model the trip cost of different user groups. We propose a V2I bandwidth allocation scheme in a two-route network to lower the Price-of-Anarchy (PoA).
520 $a Each of the four chapters is supported by intensive simulations. Specifically, in Chapter 3 and Chapter 4, we use OMNeT++ simulator to show that the proposed algorithms, namely HMAC and ICAP, outperform the corresponding state-of-the-art algorithms; in Chapter 5 and Chapter 6, we use Veins simulator to validate the proposed models, and to show that the V2V and V2I bandwidth allocation schemes can lower the PoA under 802.11p protocol.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer engineering. $3 569006
650 4 $a Transportation. $3 558117
655 7 $a Electronic books. $2 local $3 554714
690 $a 0464
690 $a 0709
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Rensselaer Polytechnic Institute. $b Electrical Engineering. $3 1184401
773 0 $t Dissertation Abstracts International $g 79-12B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10790125 $z click for full text (PQDT)