The Experts below are selected from a list of 294 Experts worldwide ranked by ideXlab platform
Harrison Chandler - One of the best experts on this subject based on the ideXlab platform.
-
Toward Efficient Short-Video Sharing in the YouTube Social Network
ACM Transactions on Internet Technology, 2018Co-Authors: Haiying Shen, Harrison Chandler, Haoyu WangAbstract:The past few years have seen an explosion in the popularity of online short-video sharing in YouTube. As the number of users continue to grow, the bandwidth required to maintain acceptable quality of service (QoS) has greatly increased. Peer-to-peer (P2P) architectures have shown promise in reducing the bandwidth costs; however, the previous works build one P2P Overlay for each video, which provides limited availability of video providers and produces high Overlay Maintenance overhead. To handle these problems, in this work, we novelly leverage the existing social network in YouTube, where a user subscribes to another user’s channel to track all his/her uploaded videos. The subscribers of a channel tend to watch the channel’s videos and common-interest nodes tend to watch the same videos. Also, the popularity of videos in one channel varies greatly. We study real trace data to confirm these properties. Based on these properties, we propose SocialTube, which builds the subscribers of one channel into a P2P Overlay and also clusters common-interest nodes in a higher level. It also incorporates a prefetching algorithm that prefetches higher-popularity videos. To enhance the system performance, we further propose the demand/supply-based cache management scheme and reputation-based neighbor management scheme. Extensive trace-driven simulation results and PlanetLab real-world experimental results verify the effectiveness of SocialTube at reducing server load and Overlay Maintenance overhead and at improving QoS for users.
-
ICDCS - An Interest-Based Per-Community P2P Hierarchical Structure for Short Video Sharing in the YouTube Social Network
2014 IEEE 34th International Conference on Distributed Computing Systems, 2014Co-Authors: Haiying Shen, Yuhua Lin, Harrison ChandlerAbstract:The past few years have seen an explosion in the popularity of online short-video sharing in You Tube. As the number of users continued to grow, the bandwidth required to maintain acceptable quality of service (QoS) has greatly increased. Peer-to-peer (P2P) architectures have shown promise in reducing the bandwidth costs, however, the previous works build one P2P Overlay for each video, which provides limited availability of video providers and produces high Overlay Maintenance overhead. To handle these problems, in this work, we novelly leverage the existing social network in You Tube, where a user subscribes to another user's channel to track all his uploaded videos. The subscribers of a channel tend to watch the channel's videos and common-interest nodes tend to watch the same videos. Also, the popularity of videos in one channel varies greatly. We study real trace data to confirm these properties. Based on these properties, we propose Social Tube that builds the subscribers of one channel into a P2P Overlay and also clusters common-interest nodes in a higher level. It also incorporates a prefetching algorithm that prefetches higher-popularity videos. Extensive trace-driven simulation results and Planet Lab real world experimental results verify the effectiveness of Social Tube at reducing server load and Overlay Maintenance overhead and at improving QoS for users.
Haiying Shen - One of the best experts on this subject based on the ideXlab platform.
-
Toward Efficient Short-Video Sharing in the YouTube Social Network
ACM Transactions on Internet Technology, 2018Co-Authors: Haiying Shen, Harrison Chandler, Haoyu WangAbstract:The past few years have seen an explosion in the popularity of online short-video sharing in YouTube. As the number of users continue to grow, the bandwidth required to maintain acceptable quality of service (QoS) has greatly increased. Peer-to-peer (P2P) architectures have shown promise in reducing the bandwidth costs; however, the previous works build one P2P Overlay for each video, which provides limited availability of video providers and produces high Overlay Maintenance overhead. To handle these problems, in this work, we novelly leverage the existing social network in YouTube, where a user subscribes to another user’s channel to track all his/her uploaded videos. The subscribers of a channel tend to watch the channel’s videos and common-interest nodes tend to watch the same videos. Also, the popularity of videos in one channel varies greatly. We study real trace data to confirm these properties. Based on these properties, we propose SocialTube, which builds the subscribers of one channel into a P2P Overlay and also clusters common-interest nodes in a higher level. It also incorporates a prefetching algorithm that prefetches higher-popularity videos. To enhance the system performance, we further propose the demand/supply-based cache management scheme and reputation-based neighbor management scheme. Extensive trace-driven simulation results and PlanetLab real-world experimental results verify the effectiveness of SocialTube at reducing server load and Overlay Maintenance overhead and at improving QoS for users.
-
ICDCS - An Interest-Based Per-Community P2P Hierarchical Structure for Short Video Sharing in the YouTube Social Network
2014 IEEE 34th International Conference on Distributed Computing Systems, 2014Co-Authors: Haiying Shen, Yuhua Lin, Harrison ChandlerAbstract:The past few years have seen an explosion in the popularity of online short-video sharing in You Tube. As the number of users continued to grow, the bandwidth required to maintain acceptable quality of service (QoS) has greatly increased. Peer-to-peer (P2P) architectures have shown promise in reducing the bandwidth costs, however, the previous works build one P2P Overlay for each video, which provides limited availability of video providers and produces high Overlay Maintenance overhead. To handle these problems, in this work, we novelly leverage the existing social network in You Tube, where a user subscribes to another user's channel to track all his uploaded videos. The subscribers of a channel tend to watch the channel's videos and common-interest nodes tend to watch the same videos. Also, the popularity of videos in one channel varies greatly. We study real trace data to confirm these properties. Based on these properties, we propose Social Tube that builds the subscribers of one channel into a P2P Overlay and also clusters common-interest nodes in a higher level. It also incorporates a prefetching algorithm that prefetches higher-popularity videos. Extensive trace-driven simulation results and Planet Lab real world experimental results verify the effectiveness of Social Tube at reducing server load and Overlay Maintenance overhead and at improving QoS for users.
Yuhua Lin - One of the best experts on this subject based on the ideXlab platform.
-
ICDCS - An Interest-Based Per-Community P2P Hierarchical Structure for Short Video Sharing in the YouTube Social Network
2014 IEEE 34th International Conference on Distributed Computing Systems, 2014Co-Authors: Haiying Shen, Yuhua Lin, Harrison ChandlerAbstract:The past few years have seen an explosion in the popularity of online short-video sharing in You Tube. As the number of users continued to grow, the bandwidth required to maintain acceptable quality of service (QoS) has greatly increased. Peer-to-peer (P2P) architectures have shown promise in reducing the bandwidth costs, however, the previous works build one P2P Overlay for each video, which provides limited availability of video providers and produces high Overlay Maintenance overhead. To handle these problems, in this work, we novelly leverage the existing social network in You Tube, where a user subscribes to another user's channel to track all his uploaded videos. The subscribers of a channel tend to watch the channel's videos and common-interest nodes tend to watch the same videos. Also, the popularity of videos in one channel varies greatly. We study real trace data to confirm these properties. Based on these properties, we propose Social Tube that builds the subscribers of one channel into a P2P Overlay and also clusters common-interest nodes in a higher level. It also incorporates a prefetching algorithm that prefetches higher-popularity videos. Extensive trace-driven simulation results and Planet Lab real world experimental results verify the effectiveness of Social Tube at reducing server load and Overlay Maintenance overhead and at improving QoS for users.
K.t.v Subbarao - One of the best experts on this subject based on the ideXlab platform.
-
To Achieve An Optimal Tradeoff Between P2p Overlay Maintenance And Video Sharing Efficiency In Osn’s
2014Co-Authors: D Bhanuprakash, A Ramamurthy, K.t.v SubbaraoAbstract:Video sharing has been a gradually more popular application in OSNs facilitating users to share their personal videos or interesting videos they found with their friends. However OSN’s additional progress is strictly caught up by the inherent limits of the conventional client/server architecture of its video sharing system which is not only costly in terms of server storage and bandwidth but also not scalable with the high amount of users and video content in OSNs. The efforts have been dedicated to perk up the client/server architecture for video sharing with the peer-to-peer (P2P) architecture being the most promising. P2P-based video sharing has been used in on demand video streaming.The dimension reveals that mainly of the viewers of a user’s videos are the user’s close friends, most video views are driven by social relationships and the rest are driven by interests and viewers of the same video tend to live in the same location. Based on our observations we propose Social Tube a system that discover the social relationship interest resemblance and location to improve the presentation of video sharing in OSNs. Specifically an OSN has a social network (SN)-based P2P Overlay construction algorithm that come together peers based on their social relationships and interests.
-
to achieve an optimal tradeoff between p2p Overlay Maintenance and video sharing efficiency in osn s
IJSEAT, 2014Co-Authors: D Bhanuprakash, A Ramamurthy, K.t.v SubbaraoAbstract:Video sharing has been a gradually more popular application in OSNs facilitating users to share their personal videos or interesting videos they found with their friends. However OSN’s additional progress is strictly caught up by the inherent limits of the conventional client/server architecture of its video sharing system which is not only costly in terms of server storage and bandwidth but also not scalable with the high amount of users and video content in OSNs. The efforts have been dedicated to perk up the client/server architecture for video sharing with the peer-to-peer (P2P) architecture being the most promising. P2P-based video sharing has been used in on demand video streaming.The dimension reveals that mainly of the viewers of a user’s videos are the user’s close friends, most video views are driven by social relationships and the rest are driven by interests and viewers of the same video tend to live in the same location. Based on our observations we propose Social Tube a system that discover the social relationship interest resemblance and location to improve the presentation of video sharing in OSNs. Specifically an OSN has a social network (SN)-based P2P Overlay construction algorithm that come together peers based on their social relationships and interests.
A Virgillito - One of the best experts on this subject based on the ideXlab platform.
-
evaluation of unstructured Overlay Maintenance protocols under churn
International Conference on Distributed Computing Systems Workshops, 2006Co-Authors: Roberto Baldoni, Silvia Bonomi, A Rippa, Leonardo Querzoni, Sara Tucci Piergiovanni, A VirgillitoAbstract:An Overlay network is formed on top of - and generally independently from - the underlying physical computer network, by the peers (nodes) of a P2P system. The dynamics of peers is taken into account by devising appropriate Overlay Maintenance protocols that are able to join and leave peers from the Overlay. Due to the need for scaling in the number of nodes, Overlay Maintenance protocols have been simulated only in environments showing a very restricted behavior with respect to the possible concurrent and interleaved execution of join/leave operations. In this paper we compare two Overlay Maintenance protocols well suited to unstructured P2P systems, namely SCAMP and Cyclon, in an event-based simulation setting including concurrent and interleaved join and leave operations as well as variable message transfer delay. This simulation setting allows to point out surprising results for both protocols. In particular, under a continuous and concurrent replacement of nodes, permanent partitioning of the Overlay arises after a very small number of join/leave operations.
-
ICDCS Workshops - Evaluation of Unstructured Overlay Maintenance Protocols under Churn
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06), 2006Co-Authors: Roberto Baldoni, Silvia Bonomi, A Rippa, Leonardo Querzoni, Sara Tucci Piergiovanni, A VirgillitoAbstract:An Overlay network is formed on top of - and generally independently from - the underlying physical computer network, by the peers (nodes) of a P2P system. The dynamics of peers is taken into account by devising appropriate Overlay Maintenance protocols that are able to join and leave peers from the Overlay. Due to the need for scaling in the number of nodes, Overlay Maintenance protocols have been simulated only in environments showing a very restricted behavior with respect to the possible concurrent and interleaved execution of join/leave operations. In this paper we compare two Overlay Maintenance protocols well suited to unstructured P2P systems, namely SCAMP and Cyclon, in an event-based simulation setting including concurrent and interleaved join and leave operations as well as variable message transfer delay. This simulation setting allows to point out surprising results for both protocols. In particular, under a continuous and concurrent replacement of nodes, permanent partitioning of the Overlay arises after a very small number of join/leave operations.
