اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSocially-Aware Distributed Hash Tables for Decentralized Online Social Networks
60
0
0.0
(
0
)
نشر من قبل
Muhammad Anis Uddin Nasir
تاريخ النشر
2015
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Many decentralized online social networks (DOSNs) have been proposed due to an increase in awareness related to privacy and scalability issues in centralized social networks. Such decentralized networks transfer processing and storage functionalities from the service providers towards the end users. DOSNs require individualistic implementation for services, (i.e., search, information dissemination, storage, and publish/subscribe). However, many of these services mostly perform social queries, where OSN users are interested in accessing information of their friends. In our work, we design a socially-aware distributed hash table (DHTs) for efficient implementation of DOSNs. In particular, we propose a gossip-based algorithm to place users in a DHT, while maximizing the social awareness among them. Through a set of experiments, we show that our approach reduces the lookup latency by almost 30% and improves the reliability of the communication by nearly 10% via trusted contacts.
قيم البحث
اقرأ أيضاً
Online Social Networks (OSN) are among the most popular applications in todays Internet. Decentralized online social networks (DOSNs), a special class of OSNs, promise better privacy and autonomy than traditional centralized OSNs. However, ensuring a
vailability of content when the content owner is not online remains a major challenge. In this paper, we rely on the structure of the social graphs underlying DOSN for replication. In particular, we propose that friends, who are anyhow interested in the content, are used to replicate the users content. We study the availability of such natural replication schemes via both theoretical analysis as well as simulations based on data from OSN users. We find that the availability of the content increases drastically when compared to the online time of the user, e. g., by a factor of more than 2 for 90% of the users. Thus, with these simple schemes we provide a baseline for any more complicated content replication scheme.
An increasing number of todays social interactions occurs using online social media as communication channels. Some online social networks have become extremely popular in the last decade. They differ among themselves in the character of the service
they provide to online users. For instance, Facebook can be seen mainly as a platform for keeping in touch with close friends and relatives, Twitter is used to propagate and receive news, LinkedIn facilitates the maintenance of professional contacts, Flickr gathers amateurs and professionals of photography, etc. Albeit different, all these online platforms share an ingredient that pervades all their applications. There exists an underlying social network that allows their users to keep in touch with each other and helps to engage them in common activities or interactions leading to a better fulfillment of the services purposes. This is the reason why these platforms share a good number of functionalities, e.g., personal communication channels, broadcasted status updates, easy one-step information sharing, news feeds exposing broadcasted content, etc. As a result, online social networks are an interesting field to study an online social behavior that seems to be generic among the different online services. Since at the bottom of these services lays a network of declared relations and the basic interactions in these platforms tend to be pairwise, a natural methodology for studying these systems is provided by network science. In this chapter we describe some of the results of research studies on the structure, dynamics and social activity in online social networks. We present them in the interdisciplinary context of network science, sociological studies and computer science.
The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level,
we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.
Ad-hoc Social Network (ASNET), which explores social connectivity between users of mobile devices, is becoming one of the most important forms of todays internet. In this context, maximum bandwidth utilization of intermediate nodes in resource scarce
environments is one of the challenging tasks. Traditional Transport Control Protocol (TCP) uses the round trip time mechanism for sharing bandwidth resources between users. However, it does not explore socially-aware properties between nodes and cannot differentiate effectively between various types of packet losses in wireless networks. In this paper, a socially-aware congestion avoidance protocol, namely TIBIAS, which takes advantage of similarity matching social properties among intermediate nodes, is proposed to improve the resource efficiency of ASNETs. TIBIAS performs efficient data transfer over TCP. During the course of bandwidth resource allocation, it gives high priority for maximally matched interest similarity between different TCP connections on ASNET links. TIBIAS does not require any modification at lower layers or on receiver nodes. Experimental results show that TIBIAS performs better as compared against existing protocols, in terms of link utilization, unnecessary reduction of the congestion window, throughput and retransmission ratio.
Ad-hoc social networks (ASNETs) represent a special type of traditional ad-hoc network in which a users social properties (such as the social connections and communications metadata as well as application data) are leveraged for offering enhanced ser
vices in a distributed infrastructureless environments. However, the wireless medium, due to limited bandwidth, can easily suffer from the problem of congestion when social metadata and application data are exchanged among nodes---a problem that is compounded by the fact that some nodes may act selfishly and not share its resources. While a number of congestion control schemes have been proposed for the traditional ad-hoc networks, there has been limited focus on incorporating social awareness into congestion control schemes. We revisit the existing traditional ad-hoc congestion control and data distribution protocols and motivate the need for embedding social awareness into these protocols to improve performance. We report that although some work is available in opportunistic network that uses socially-aware techniques to control the congestion issue, this area is largely unexplored and warrants more research attention. In this regards, we highlight the current research progress and identify multiple future directions of research.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
