102 research outputs found

    Caching on Named Data Network: a Survey and Future Research

    Get PDF
    The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The userโ€™s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance

    ์ •๋ณด ์ค‘์‹ฌ ๋„คํŠธ์›Œํ‚น์—์„œ์˜ ์ฝ˜ํ…ํŠธ ํƒ์ƒ‰ ๋ฐ ๋ฐ์ดํ„ฐ ์˜คํ”„๋กœ๋”ฉ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ์ „๊ธฐยท์ปดํ“จํ„ฐ๊ณตํ•™๋ถ€, 2015. 8. ๊ถŒํƒœ๊ฒฝ.ํ˜„์žฌ์˜ ์ธํ„ฐ๋„ท์€ ์ž์› ๊ณต์œ ๋ฅผ ๋ชฉ์ ์œผ๋กœ ํ˜ธ์ŠคํŠธ๊ฐ„ ํ†ต์‹  ํŒจ๋Ÿฌ๋‹ค์ž„์— ๊ธฐ๋ฐ˜ํ•˜์—ฌ ์„ค๊ณ„๋˜์—ˆ์ง€๋งŒ, ์˜ค๋Š˜๋‚  ์ธํ„ฐ๋„ท ์‚ฌ์šฉ ํŒจํ„ด์€ ์ฝ˜ํ…ํŠธ ํš๋“์— ์ง‘์ค‘๋˜์–ด์žˆ๋‹ค. ์ด๋Ÿฌํ•œ ์ด์œ ๋กœ, ๋Œ€๋ถ€๋ถ„์˜ ์ธํ„ฐ๋„ท ํŠธ๋ž˜ํ”ฝ์€ ๋น„๋””์˜ค ์„œ๋น„์Šค๋‚˜ P2P ํŒŒ์ผ ๊ณต์œ ์™€ ๊ฐ™์€ ์ฝ˜ํ…ํŠธ ํš๋“์— ์˜ํ•ด ๋ฐœ์ƒํ•˜๊ณ  ์žˆ๋Š” ์ƒํ™ฉ์ด๋‹ค. ํ•˜์ง€๋งŒ, ํ˜„์žฌ ์ธํ„ฐ๋„ท์˜ ๊ตฌ์กฐ์™€ ์‹ค์ œ ์‚ฌ์šฉ ํŒจํ„ด์˜ ๊ดด๋ฆฌ๋Š” ๋น„ํšจ์œจ์ ์ธ ์ฝ˜ํ…ํŠธ ์ „๋‹ฌ (์˜ˆ, ๋™์ผํ•œ ์ธ๊ธฐ์žˆ๋Š” ์ฝ˜ํ…ํŠธ์— ๋Œ€ํ•œ ์ค‘๋ณต๋œ ์ฝ˜ํ…ํŠธ ์ „์†ก)์„ ์•ผ๊ธฐํ•˜๊ณ  ์žˆ๊ณ , ์ด๋Š” ํŠธ๋ž˜ํ”ฝ ํญ๋ฐœ ๋ฌธ์ œ๋กœ ์ด์–ด์ง€๊ณ  ์žˆ๋‹ค. ์ด๋Ÿฌํ•œ ์ด์Šˆ๋ฅผ ๋‹ค๋ฃจ๊ธฐ ์œ„ํ•ด (i) ์ธํ„ฐ๋„ท ๊ตฌ์กฐ๋ฅผ ์ƒˆ๋กญ๊ฒŒ ์„ค๊ณ„ํ•˜๊ฑฐ๋‚˜ (ii) ๋ฐ์ดํ„ฐ ์˜คํ”„๋กœ๋”ฉ ๊ธฐ๋ฒ•์„ ํ†ตํ•ด ๋„คํŠธ์›Œํฌ ํŠธ๋ž˜ํ”ฝ์„ ์ค„์ด๋ ค๋Š” ์‹œ๋„๋“ค์ด ์žˆ๋‹ค. ๋ณธ ํ•™์œ„ ๋…ผ๋ฌธ์—์„œ๋Š” ์ •๋ณด ์ค‘์‹ฌ ๋„คํŠธ์›Œํ‚น๊ณผ ์ •๋ณด ์ค‘์‹ฌ์˜ ์ฐจ๋Ÿ‰ ๋„คํŠธ์›Œํฌ๋ผ๋Š” ๋‘๊ฐ€์ง€ ์˜์—ญ์—์„œ์˜ ํŠธ๋ž˜ํ”ฝ ๊ฐ์†Œ ๊ธฐ๋ฒ•์— ๋Œ€ํ•ด ํƒ๊ตฌํ•œ๋‹ค. ์ฒซ ๋ฒˆ์งธ๋กœ, ์ •๋ณด ์ค‘์‹ฌ ๋„คํŠธ์›Œํ‚น์„ ์œ„ํ•œ ํŠธ๋ž˜ํ”ฝ ๊ฐ์†Œ ์ฝ˜ํ…ํŠธ ํƒ์ƒ‰ ๊ธฐ๋ฒ•์„ ์ œ์•ˆํ•œ๋‹ค. ์ •๋ณด ์ค‘์‹ฌ ๋„คํŠธ์›Œํ‚น์€ ํŠธ๋ž˜ํ”ฝ ํญ๋ฐœ๊ณผ ๊ฐ™์€ ํ˜„์žฌ ์ธํ„ฐ๋„ท์˜ ๋ฌธ์ œ์ ์„ ํ•ด๊ฒฐํ•˜๊ธฐ ์œ„ํ•ด, ์ดˆ๊ธฐ ๋‹จ๊ณ„๋ถ€ํ„ฐ ์ธํ„ฐ๋„ท ๊ตฌ์กฐ๋ฅผ ์ƒˆ๋กญ๊ฒŒ ์„ค๊ณ„ํ•˜์ž๋Š” ๋ฐฉํ–ฅ์œผ๋กœ ์ œ์•ˆ๋˜์—ˆ๋‹ค. ์ •๋ณด ์ค‘์‹ฌ ๋„คํŠธ์›Œํ‚น์€ ๊ฐ€๊นŒ์ด์— ์กด์žฌํ•˜๋Š” ์บ์‹œ๋œ ์ฝ˜ํ…ํŠธ๋ฅผ ์ด์šฉํ•˜๊ฑฐ๋‚˜ ๋™์ผํ•œ ์ฝ˜ํ…ํŠธ ์ „์†ก์— ๋Œ€ํ•œ ์ค‘๋ณต๋œ ์ „์†ก์„ ์ค„์ด๋Š” ๊ฒƒ์„ ํ†ตํ•ด ๋„คํŠธ์›Œํฌ ํŠธ๋ž˜ํ”ฝ ๊ฐ์†Œ์™€ ๊ฐ™์€ ์ด๋“์„ ์ œ๊ณตํ•  ์ˆ˜ ์žˆ๋‹ค. ํ•˜์ง€๋งŒ, ์ด์ „์˜ ์—ฐ๊ตฌ๋“ค์€ ์ด๋Ÿฌํ•œ ์บ์‹œ๋œ ์ฝ˜ํ…ํŠธ๋ฅผ ์ด์šฉํ•˜๊ธฐ ์œ„ํ•ด ๊ธฐํšŒ์ฃผ์˜์  ์บ์‹œ ์ผ์น˜ ๋ฐฉ์‹์— ์˜์กด์„ ํ•˜๊ณ  ์žˆ๋‹ค. ์ด๋Ÿฌํ•œ ๋ฐฉ์‹์€ ์ฝ˜ํ…ํŠธ ์†Œ์Šค๋กœ ๊ฐ€๋Š” ๊ฒฝ๋กœ์— ์กด์žฌํ•˜๋Š” ์บ์‹œ๋œ ์ฝ˜ํ…ํŠธ๋งŒ ์ด์šฉํ•  ์ˆ˜ ์žˆ๊ธฐ ๋•Œ๋ฌธ์— ๋„คํŠธ์›Œํฌ ๊ณณ๊ณณ์— ์žˆ๋Š” ๋„คํŠธ์›Œํฌ ๋‚ด์žฌ ์ €์žฅ ๊ณต๊ฐ„์„ ์ถฉ๋ถ„ํžˆ ์ด์šฉํ•˜์ง€ ๋ชปํ•˜๋Š” ํ•œ๊ณ„๊ฐ€ ์žˆ๋‹ค. ์ œ์•ˆํ•˜๋Š” ๊ธฐ๋ฒ•์ธ SCAN์€ ๋„คํŠธ์›Œํฌ์— ์‚ฐ์žฌ๋œ ์บ์‹œ๋œ ์ฝ˜ํ…ํŠธ๋ฅผ ๋” ์ž˜ ์ด์šฉํ•˜๊ธฐ ์œ„ํ•ด์„œ ๊ฐ€๊นŒ์ด์— ์กด์žฌํ•˜๋Š” ์บ์‹œ๋œ ์ฝ˜ํ…ํŠธ๋ฅผ ํƒ์ƒ‰ํ•œ๋‹ค. ์ด๋ฅผ ์œ„ํ•ด SCAN์€ ๋ธ”๋ฃธ ํ•„ํ„ฐ๋ฅผ ์‚ฌ์šฉํ•˜์—ฌ ์ฃผ๋ณ€ ๋ผ์šฐํ„ฐ๋“ค ์‚ฌ์ด์—์„œ ์บ์‹œ๋œ ์ฝ˜ํ…ํŠธ์— ๋Œ€ํ•œ ์ •๋ณด๋ฅผ ๊ตํ™˜ํ•œ๋‹ค. ์‹œ๋ฎฌ๋ ˆ์ด์…˜์„ ํ†ตํ•ด SCAN์€ ๊ธฐํšŒ์ฃผ์˜์  ์บ์‹œ ์ผ์น˜ ๋ฐฉ์‹์˜ ๊ธฐ๋ฒ•์— ๋น„ํ•ด ํ‰๊ท  ํ™‰ ๊ฑฐ๋ฆฌ, ํŠธ๋ž˜ํ”ฝ ์–‘, ๋งํฌ๊ฐ„ ๋กœ๋“œ ๋ถ„๋ฐฐ์—์„œ ๋” ๋‚˜์€ ์„ฑ๋Šฅ์„ ๋ณด์ž„์„ ์•Œ ์ˆ˜ ์žˆ๋‹ค. ๋‹ค์Œ์œผ๋กœ, ์ •๋ณด ์ค‘์‹ฌ์˜ ์ฐจ๋Ÿ‰ ๋„คํŠธ์›Œํฌ๋ฅผ ์œ„ํ•œ ํŠธ๋ž˜ํ”ฝ ์˜คํ”„๋กœ๋”ฉ ๊ธฐ๋ฒ•์„ ์ œ์•ˆํ•œ๋‹ค. ๋ฌด์„  ํ™˜๊ฒฝ์—์„œ ๊ธ‰์ฆํ•˜๊ณ  ์žˆ๋Š” ๋ชจ๋ฐ”์ผ ํŠธ๋ž˜ํ”ฝ์€ ๋ชจ๋ฐ”์ผ ๋„คํŠธ์›Œํฌ ์ œ๊ณต์ž์—๊ฒŒ ์‹ฌ๊ฐํ•œ ์šฐ๋ ค๊ฐ€ ๋˜๊ณ  ์žˆ๋‹ค. ์ด๋Ÿฌํ•œ ํŠธ๋ž˜ํ”ฝ ํญ๋ฐœ ๋ฌธ์ œ๋ฅผ ๋‹ค๋ฃจ๊ธฐ ์œ„ํ•ด, ํŠธ๋ž˜ํ”ฝ์„ ์…€๋ฃฐ๋Ÿฌ ๋„คํŠธ์›Œํฌ์—์„œ WiFi ํ•ซ์ŠคํŒŸ์ด๋‚˜ ํŽจํ† ์…€๊ณผ ๊ฐ™์€ ๋‹ค๋ฅธ ๋„คํŠธ์›Œํฌ๋กœ ์˜คํ”„๋กœ๋”ฉํ•˜๋ ค๋Š” ์—ฐ๊ตฌ๋“ค์ด ์žˆ์—ˆ๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ๊ธฐ์กด์˜ ์‹œ๋„์—์„œ ๋” ๋‚˜์•„๊ฐ€์„œ ๋ฐ์ดํ„ฐ ์˜คํ”„๋กœ๋”ฉ์„ ์œ„ํ•œ ์ฐจ๋Ÿ‰ ๋„คํŠธ์›Œํฌ์˜ ์ž ์žฌ์  ์žฅ์ ์— ์ง‘์ค‘ํ•˜์—ฌ ์ฐจ๋Ÿ‰ ๋„คํŠธ์›Œํฌ๋ฅผ ์ด์šฉํ•œ ๋ฐ์ดํ„ฐ ์˜คํ”„๋กœ๋”ฉ ํ”„๋ ˆ์ž„์›Œํฌ์ธ DOVE๋ฅผ ์ œ์•ˆํ•œ๋‹ค. ์ œ์•ˆํ•˜๋Š” ๋ฐ์ดํ„ฐ ์˜คํ”„๋กœ๋”ฉ ํ”„๋ ˆ์ž„์›Œํฌ๋Š” ์ฐจ๋Ÿ‰ ๋‚ด ๋ฐ์ดํ„ฐ ์„œ๋น„์Šค๋ฅผ ์œ„ํ•ด ํ•„์š”ํ•œ ์…€๋ฃฐ๋Ÿฌ ํŠธ๋ž˜ํ”ฝ์„ ๋น„์šฉ ํšจ๊ณผ๊ฐ€ ๋†’์€ ๋ฐฉ์‹์œผ๋กœ ๊ฐ์†Œ์‹œํ‚ฌ ์ˆ˜ ์žˆ๋‹ค. DOVE์—์„œ๋Š” ์˜คํ”„๋กœ๋”ฉ์„ ๋ชฉ์ ์œผ๋กœ ์ฐจ๋Ÿ‰ ์ด๋™ ๊ฒฝ๋กœ๋ฅผ ์ด์šฉํ•˜๊ณ , ๊ฒฝ์ œ์ ์ธ ๋น„์šฉ ์ ˆ๊ฐ์„ ๋ชฉ์ ์œผ๋กœ ์ฐจ๋Ÿ‰์—์„œ ์š”์ฒญ๋˜๋Š” ์ฝ˜ํ…ํŠธ ํŒŒ์ผ๋“ค์€ ์…€๋ฃฐ๋Ÿฌ ๋„คํŠธ์›Œํฌ ๋Œ€์‹  ์ฐจ๋Ÿ‰ ๋„คํŠธ์›Œํฌ๋ฅผ ํ†ตํ•ด ์ „๋‹ฌ๋œ๋‹ค. ์ด๋ฅผ ์œ„ํ•ด ์˜คํ”„๋กœ๋”ฉ ์œ„์น˜๋ฅผ ์„ ํƒํ•˜๋Š” ๋ฌธ์ œ๋ฅผ ์‹œ๊ณต๊ฐ„์  ์ง‘ํ•ฉ ๋ฎ๊ฐœ ๋ฌธ์ œ๋กœ ๋งŒ๋“ค๊ณ , ์ฐจ๋Ÿ‰ ์ด๋™ ๊ฒฝ๋กœ๋ฅผ ์ด์šฉํ•œ ์‹œ๊ฐ„ ์˜ˆ์ธก ๊ธฐ๋ฐ˜์˜ ์ง‘ํ•ฉ ๋ฎ๊ฐœ ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ œ์•ˆํ•œ๋‹ค. ์‹œ๋ฎฌ๋ ˆ์ด์…˜ ๊ฒฐ๊ณผ์— ๋”ฐ๋ฅด๋ฉด, DOVE ํ”„๋ ˆ์ž„์›Œํฌ๋Š” ์ฐจ๋Ÿ‰ ๋„คํŠธ์›Œํฌ๋ฅผ ํ†ตํ•œ ์˜คํ”„๋กœ๋”ฉ์„ ์ˆ˜ํ–‰ํ•˜์—ฌ 57%์˜ ์…€๋ฃฐ๋Ÿฌ ๋งํฌ ์‚ฌ์šฉ๋Ÿ‰์„ ํฌ๊ฒŒ ๊ฐ์†Œ์‹œํ‚ฌ ์ˆ˜ ์žˆ๋‹ค.While the architecture of current Internet was designed based on the host-to-host communication paradigm for resource sharing, today's Internet usage has been concentrated on content retrievals. As a result, most of Internet traffic is generated by the content retrievals, such as video service and P2P file sharing. However, the discrepancy between the current Internet architecture and the real usage pattern causes inefficient content deliveries (e.g., duplicated content transmission for the same popular content), which leads to traffic explosion problem. To address such issues, there have been a lot of efforts to reduce the network traffic by (i) redesigning the Internet architecture and (ii) proposing data offloading schemes. In this dissertation, we investigate traffic reduction schemes in two different domains, information-centric networking and information-centric vehicular networks. First, we propose a traffic-reduction content-discovery scheme for information-centric networking (ICN). ICN has been proposed to resolve the problem of current Internet such as traffic explosion by redesigning the Internet architecture in a clean-slate manner. ICN can provide substantial benefits such as network traffic reduction by exploiting a nearby (cached) copy of content and reducing duplicated transmissions for the same content request. However, prior studies usually rely on an opportunistic cache-hit (happen-to-meet) to utilize the cached contents. In the happen-to-meet fashion, only the content cached on the path towards the content source can be utilized, which limits the network-wide usage of the in-network storages. To exploit cached contents better, our proposed scheme SCAN discovers nearby content copies. SCAN exchanges the cached content information among the neighbor routers using Bloom filters for the content discovery. With extensive simulations, SCAN shows better performance than a happen-to-meet cache-hit scheme in terms of average hop counts, traffic volume, and load balancing among links. Next, we propose a traffic offloading scheme for information-centric vehicular network. In wireless environments, the increasing mobile traffic is becoming a serious concern for mobile network providers. To address the traffic explosion problem, there have been a lot of efforts to offload the traffic from cellular networks to other networks, such as WiFi hotspots and femtocells. Our work moves forward from prior studies by focusing on the potential benefits of vehicular networks for data offloading. In particular, we propose a Data Offloading framework using Vehicular nEtworks (DOVE), which reduces the cellular traffic for in-vehicle data services in a cost effective way. DOVE exploits vehicle trajectories for offloading purposes so that content files requested by vehicles can be delivered via vehicular networks rather than cellular networks for economical purposes. We formulate the problem of selecting offloading positions as a spatio-temporal set-covering problem, and propose a time-prediction based set-covering algorithm using vehicle trajectories. Simulation results show that our DOVE framework can significantly reduce 57% of cellular link usage by performing data offloading through vehicular networks.I. Introduction 1 II. Content Discovery for Information-Centric Networking 4 2.1 Introduction 4 2.2 Related Work 7 2.2.1 Named Data Networking (NDN) 7 2.2.2 ICN-based Schemes 8 2.2.3 Approaches using BFs 10 2.3 SCAN Architecture 11 2.3.1 SCAN Description 11 2.3.2 SCAN Operation 16 2.3.3 Discussion 19 2.4 CIB Maintenance in SCAN 21 2.4.1 Information Unit 21 2.4.2 Information Exchange 22 2.4.3 Information Decay 23 2.5 Performance Evaluation 25 2.5.1 Content Discovery Performance 27 2.5.2 Network-wide Performance 28 2.5.3 Effect of Cache Size 30 2.5.4 Effect of Scanning Depth 32 2.5.5 Effect of Information Decay Probability 34 2.5.6 Effect of BF Size 36 2.5.7 Effect of BF Exchange Interval 39 2.5.8 Comparison with ICN-enhancements 39 III. Data Offloading for Information-Centric Vehicular Networks 42 3.1 Introduction 42 3.2 Related Work 44 3.3 Problem Formulation 46 3.3.1 Target Scenario and Goal 46 3.3.2 DOVE Components and Assumptions 46 3.3.3 Design Principles using RNs 49 3.3.4 The Concept of Offloading in DOVE 50 3.4 Design and Operations of DOVE 51 3.4.1 Travel Time Prediction 51 3.4.2 The Operation of TCC 53 3.4.3 The Selection Algorithm for Offloading Positions 54 3.4.4 The Selection of Providers 59 3.4.5 The Operation of Vehicles using Offloading Positions 59 3.5 Performance Evaluation 60 3.5.1 Overall Performance of Data Offloading 61 3.5.2 The Impact of Vehicle Number 67 3.5.3 The Impact of Vehicle Speed 68 3.5.4 The Impact of Waiting Time 70 3.5.5 The Impact of Deployment Ratio and Tolerance Time 71 IV. Conclusion 74 Bibliography 76 Korean Abstract 82Docto

    Mobile Ad-Hoc Networks

    Get PDF
    Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: vehicular ad-hoc networks, security and caching, TCP in ad-hoc networks and emerging applications. It is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks
    • โ€ฆ
    corecore