Social-Based Cooperative Caching in DTNs: A Contact Duration Aware Approach

Zhuo, Xuejun; Li, Qinghua; Cao, Guohong; Dai, Yanwei; Szymanski, Boleslaw K.; Porta, Thomas La

doi:10.1109/mass.2011.22

Cited by 50 publications

(35 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [15], the authors proposed DAC, a novel caching protocol adaptive to the challenging environment of DTNs. In this protocol, they relay on social community structure to overcome a challenge of the dynamically changing network topology in DTNs.…”

Section: Data Access Is Also An Important Issue In Delay Tolerantmentioning

confidence: 99%

“…While our intended use of caches is for repeated data instead of replication and connectivity, the ideas of choosing which packets to cache and attempting to predict demand are common to both uses. There are already some studies done in literature regarding community estimation and caching based on community-based metrics [17] and the impact of the contact duration limitation on cooperative caching [18]. However, our approach does not use user nodes as part of the delivery system and does not utilize information about contacts between user nodes.…”

Section: Data Access Is Also An Important Issue In Delay Tolerantmentioning

confidence: 99%

See 1 more Smart Citation

Impact of socially based demand on the efficiency of caching strategy

Holzbauer

Szymanski

Bulut

2014

2014 IEEE International Conference on Pervasive Computing and Communication Workshops (PERCOM WORKSHOPS)

View full text Add to dashboard Cite

Abstract-Routers are often faced with a variety of users throughout a day. These users make requests, of which the most bandwidth consuming and least delay tolerant are requests for internet content including videos. To save cost of uploading all requested data, routers use content-aware caching schemes. The efficiency of such schemes is dependent on router ability to predict the use of the currently requested content. At the same time, research on social networks indicates that users with social ties have the correlated mobility patterns and the correlated interests in requested content. In this paper, we demonstrate that these correlations between mobility and between interests can be used to improve efficiency of content-based caching network caching by taking into account social ties between users visiting a router. To this end, we built a model for router visits and user demand based on social relations. We then used this model to create a content-aware caching scheme called "SOcial Content Caching Scheme (SOCCS)". Our results demonstrate that by using information about frequency of visit by members of different social communities combined with topic tags on the content requested by each community, the performance of routers can be increased remarkably compared to their performance with random caching. Moreover, such socially based caching is robust to changes in many parameters of our model that affect visits by mobile nodes, the tags of content that they request, and how history is incorporated into caching decisions.

show abstract

Section: Data Access Is Also An Important Issue In Delay Tolerantmentioning

confidence: 99%

Section: Data Access Is Also An Important Issue In Delay Tolerantmentioning

confidence: 99%

Impact of socially based demand on the efficiency of caching strategy

Holzbauer

Szymanski

Bulut

2014

2014 IEEE International Conference on Pervasive Computing and Communication Workshops (PERCOM WORKSHOPS)

View full text Add to dashboard Cite

show abstract

“…Some later works [7] [8] disseminate data among the mobile users by exploiting their social relations. Data replication is another way to facilitate data access in DTNs, which has been studied in [9] [10]. Being orthogonal with how to improve the performance of data access in DTNs, in this paper, we propose an accurate model to capture the expected volume of 3G traffic that can be offloaded to DTNs to facilitate our incentive framework design.…”

Section: Related Workmentioning

confidence: 99%

Win-Coupon: An incentive framework for 3G traffic offloading

Zhuo

Gao

Dai

2011

2011 19th IEEE International Conference on Network Protocols

Self Cite

112

View full text Add to dashboard Cite

Abstract-3G networks are currently facing severe traffic overload problems caused by excessive demands of mobile users. Offloading part of the 3G traffic through other forms of networks, such as Delay Tolerant Networks (DTNs), WiFi hotspots, and Femtocells, is a promising solution. However, since these networks can only provide intermittent and opportunistic connectivity to mobile users, utilizing them for 3G traffic offloading may result in a non-negligible delay. As the delay increases, the users' satisfaction decreases. In this paper, we investigate the tradeoff between the amount of traffic being offloaded and the users' satisfaction. We provide a novel incentive framework to motivate users to leverage their delay tolerance for 3G traffic offloading. To minimize the incentive cost given an offloading target, users with high delay tolerance and large offloading potential should be prioritized for traffic offloading. To effectively capture the dynamic characteristics of users' delay tolerance, our incentive framework is based on reverse auction to let users proactively express their delay tolerance by submitting bids. We further take DTN as a case study to illustrate how to predict the offloading potential of the users by using stochastic analysis. Extensive tracedriven simulations verify the efficiency of our incentive framework for 3G traffic offloading.

show abstract

“…Recently, there are some literatures focusing on the cooperative caching problem in DTNs [1][2][3][4][5][6]. A typical strategy in cooperative caching works as follows.…”

Section: Introductionmentioning

confidence: 99%

Hierarchical cooperative caching in mobile opportunistic social networks

Wang

Xiao

2014

2014 IEEE Global Communications Conference

View full text Add to dashboard Cite

Abstract-A mobile opportunistic social network (MOSN) is a new type of delay tolerant network (DTN), in which the mobile users contact each other opportunistically. While cooperative caching in the Internet has been studied extensively, cooperative caching in MOSNs is a considerably different and challenging problem due to the probabilistic nature of contact among the mobile users in MOSNs. In order to reduce the total access delay, we let the mobile users cooperatively cache these data items in their limited buffer space. We balance between selfishness (caching the data items according to its own preference) and unselfishness (helping other nodes to cache). The friends with higher contact frequency may share similar interests, hence, caching the data items for friend users can lead to some benefit. In this paper, we present a hierarchical cooperative caching scheme, which divides the buffer space into three components: self, friends, and strangers. In the self component, mobile users cache the data items according to their preference. In the friends component, mobile users help their friends to cache some data items. In the strangers component, mobile users randomly cache the remaining data items. We formally analyze the access delay of the proposed scheme. The effectiveness of our approach is verified through extensive real world trace-driven simulations.Index Terms-Access delay, cooperative caching, mobile opportunistic social networks (MOSNs), Zipf-like distribution.

show abstract

Social-Based Cooperative Caching in DTNs: A Contact Duration Aware Approach

Cited by 50 publications

References 29 publications

Impact of socially based demand on the efficiency of caching strategy

Impact of socially based demand on the efficiency of caching strategy

Win-Coupon: An incentive framework for 3G traffic offloading

Hierarchical cooperative caching in mobile opportunistic social networks

Contact Info

Product

Resources

About