Efficient content delivery through fountain coding in opportunistic information-centric networks

Parisis, George; Sourlas, Vasilis; Κατσαρός, Κωνσταντίνος; Chai, Wei Koong; Pavlou, George; Wakeman, Ian

doi:10.1016/j.comcom.2016.12.005

Cited by 10 publications

(9 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the previous section, we have shown that the objective function in the maximization problem in (20) is a monotone non-decreasing submodular function. We can now show that the optimization problem defined by Eqs.…”

Section: Greedy Algorithmsmentioning

confidence: 98%

“…It thus holds that ∆D v,t u (S 1 ) ≤ ∆D v,t u (S 2 ), i.e., the distortion reduction at user u for reconstructing the segment B v,t is a monotone non-decreasing function. Hence, the objective function in (20) is also monotone non-decreasing as a linear combination of monotone non-decreasing functions with non-negative weights.…”

Section: Proposition 2 the Objective Function In (20) Is A Monotone mentioning

confidence: 99%

“…Along with the most popular content cached only in few SBSs, the joint caching and scheduling algorithm also caches the less popular content, which, when delivered to the users, improves the reconstruction quality of the views. It is worth noting that this range of capacity values is of great practical interest as SBSs are typically assumed to cache only 5-10% of the total video catalogue [19], [20]. The performance of all the algorithms becomes limited by the insufficient transmission capacity of the network.…”

Section: Performance Evaluationsmentioning

confidence: 99%

See 2 more Smart Citations

Cache-Aided Interactive Multiview Video Streaming in Small Cell Wireless Networks

Bourtsoulatze

Gündüz

2018

2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

View full text Add to dashboard Cite

The emergence of novel interactive multimedia applications with high rate and low latency requirements has led to a drastic increase in the video data traffic over wireless cellular networks. Endowing the small base stations of a macrocell with caches that can store some of the content is a promising technology to cope with the increasing pressure on the backhaul connections, and to reduce the delay for demanding video applications. In this work, delivery of an interactive multiview video to a set of wireless users is studied in an heterogeneous cellular network. Differently from existing works that focus on the optimization of the delivery delay and ignore the video characteristics, the caching and scheduling policies are jointly optimized, taking into account the quality of the delivered video and the video delivery time constraints. We formulate our joint caching and scheduling problem as the average expected video distortion minimization, and show that this problem is NPhard. We then provide an equivalent formulation based on submodular set function maximization and propose a greedy solution with 1 2 (1−e −1 ) approximation guarantee. The evaluation of the proposed joint caching and scheduling policy shows that it significantly outperforms benchmark algorithms based on popularity caching and independent scheduling. Another important contribution of this paper is a new constant approximation ratio for the greedy submodular set function maximization subject to a d-dimensional knapsack constraint.

show abstract

Section: Greedy Algorithmsmentioning

confidence: 98%

Section: Proposition 2 the Objective Function In (20) Is A Monotone mentioning

confidence: 99%

Section: Performance Evaluationsmentioning

confidence: 99%

See 1 more Smart Citation

Cache-Aided Interactive Multiview Video Streaming in Small Cell Wireless Networks

Bourtsoulatze

Gündüz

2018

2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

View full text Add to dashboard Cite

show abstract

“…Network coding has various theoretical frameworks [11][12][29][30][31]. In this study, we employed an algebraic approach to network coding, as discussed in another study [11].…”

Section: Algebraic Approach To Network Coding For Icnmentioning

confidence: 99%

Network-Coding Approach for Information-Centric Networking

Bilal

Kang

2019

IEEE Systems Journal

View full text Add to dashboard Cite

The current internet architecture is inefficient in fulfilling the demands of newly emerging internet applications. To address this issue, several over-the-top (OTT) application-level solutions have been employed, making the overall architecture very complex. Information-centric-networking (ICN) architecture has emerged as a promising alternative solution. The ICN architecture decouples the content from the host at the network level and supports the temporary storage of content in an innetwork cache. Fundamentally, the ICN can be considered a multisource, multicast content-delivery solution. Because of the benefits of network coding in multicasting scenarios and proven benefits in distributed storage networks, the network coding is apt for the ICN architecture. In this study, we propose a solvable linear network-coding scheme for the ICN architecture. We also propose a practical implementation of the network-coding scheme for the ICN, particularly for the content-centric network (CCN) architecture, which is termed the coded CCN (CCCN). The performance results show that the network-coding scheme improves the performance of the CCN and significantly reduces the network traffic and average download delay.

show abstract

“…They can also support communication and content exchange when the cellular infrastructure is under severe stress [2][22] [23], whereas at the same time, are the only means of communication when the network infrastructure is down or inaccessible due to natural disasters or government censorship. In opportunistic networks, connectivity among devices is intermittent and communication can be very lossy.…”

Section: Related Workmentioning

confidence: 99%

On the feasibility of a user-operated mobile content distribution network

Psaras

Sourlas

Shtefan

et al. 2017

2017 IEEE 18th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)

Self Cite

View full text Add to dashboard Cite

Abstract-The vast majority of mobile data transfers today follow the traditional client-server model. Although in the fixed network P2P approaches have been exploited and shown to be very efficient, in the mobile domain there has been limited attempt to leverage on P2P (D2D) for large-scale content distribution (i.e., not DTN-like, point-to-point message transfers). In this paper, we explore the potential of a user-operated, smartphonecentric content distribution model for smartphone applications. In particular, we assume source nodes that are updated directly from the content provider (e.g., BBC, CNN), whenever updates are available; destination nodes are then directly updated by source nodes in a D2D manner. We leverage on sophisticated information-aware and application-centric connectivity techniques to distribute content between mobile devices in densely-populated urban environments. Our target is to investigate the feasibility of an opportunistic content distribution network in an attempt to achieve widespread distribution of heavy content (e.g., video files) to the majority of the destination nodes. We propose ubiCDN as a ubiquitous, user-operated and distributed CDN for mobile applications.

show abstract

Efficient content delivery through fountain coding in opportunistic information-centric networks

Cited by 10 publications

References 49 publications

Cache-Aided Interactive Multiview Video Streaming in Small Cell Wireless Networks

Cache-Aided Interactive Multiview Video Streaming in Small Cell Wireless Networks

Network-Coding Approach for Information-Centric Networking

On the feasibility of a user-operated mobile content distribution network

Contact Info

Product

Resources

About