No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Geo swarm: A multi-source download scheme for peer-to-peer location-based services
... Since P2P was proposed, it has become the main method for content distribution because of its efficient multisource transmission scheme. Gross et al. [9] presented GeoSwarm: a reliable multi-source download scheme for P2P locationbased services. GeoSwarm combines the strengths of a BitTorrent-like download scheme with the locality awareness of an overlay for location-based search and its built-in replication mechanism. ...
as one of the most promising future Internet, Information-Centric Networking (ICN) is attracting more attention. However, the previous works which have achieved either single-source transmission or low-efficiency multisource transmission did not fully exploit the potential of underlying its in-network caching opportunities. We propose Information-Centric Networking with Built-in Network Coding (ICN-NC) where in-network caching can be collaborated with network coding to achieve multisource transmission at network-layer. In ICN-NC, due to network coding, partitioned caching and parallel transmission with multiple data sources can be achieved. Moreover, four schemes are proposed to address the key challenges of ICN-NC: Firstly, a novel signature scheme ensures that signature scheme can be compatible with network coding. Secondly, a communication scheme based on piggyback technology ensures that the number of returned Coded Message (CM) is exactly matched with the desired number. Thirdly, we propose a forwarding plane separated from routing plane to observe the network state, such as network failure, link transmission performance and distribution of CM, where a strategy of forwarding Interest ensures that the probability of returned CM being linearly dependent is low. Fourthly, an acknowledgement mechanism ensures that the choice of Interest exploration direction is reasonable and adaptive. Finally, experiment results shows that ICN-NC can improve transmission efficiency, caching efficiency and robustness compared to original ICN and IP.
... Since P2P was proposed, it has become the main method for content distribution because of its efficient multisource transmission scheme. Gross et al. [9] presented GeoSwarm: a reliable multi-source download scheme for P2P locationbased services. GeoSwarm combines the strengths of a BitTorrent-like download scheme with the locality awareness of an overlay for location-based search and its built-in replication mechanism. ...
As one of the most promising future Internet, Information-Centric Networking (ICN) is attracting more attention. However, the previous works which have achieved either single-source transmission or low-efficiency multisource transmission did not fully exploit the potential of underlying its in-network caching opportunities. We propose Information-Centric Networking with Built-in Network Coding (ICN-NC) where in-network caching can be collaborated with network coding to achieve multisource transmission at network-layer. In ICN-NC, due to network coding, partitioned caching and parallel transmission with multiple data sources can be achieved. Moreover, four schemes are proposed to address the key challenges of ICN-NC: Firstly, a novel signature scheme ensures that signature scheme can be compatible with network coding. Secondly, a communication scheme based on piggyback technology ensures that the number of returned Coded Message (CM) is exactly matched with the desired number. Thirdly, we propose a forwarding plane separated from routing plane to observe the network state, such as network failure, link transmission performance and distribution of CM, where a strategy of forwarding Interest ensures that the probability of returned CM being linearly dependent is low. Fourthly, an acknowledgement mechanism ensures that the choice of Interest exploration direction is reasonable and adaptive. Finally, experiment results shows that ICN-NC can improve transmission efficiency, caching efficiency and robustness compared to original ICN and IP.
... Finally, Geodemlia includes a component for the fast up-andFigure 3. Screenshot of the Geodemlia visualization. downloading of larger multimedia files in BitTorrent-like way termed GeoSwarm [1]. The overlay provides the interface for storing and searching of location-based information as explained in Section II. ...
Location-based services have become increasingly popular in the recent years due to the vast deployment of position-aware devices such as smartphones and tablet PCs and the ubiquitous availability of fast Internet connectivity. Existing location-based services are realized as cloud services, which cause considerably high costs. Furthermore, they are not location-aware leading to unnecessary long transmission paths between the users and the cloud infrastructure. The concept of Peer-to-Peer has proven to be a valid alternative for realizing the functionality of location-based services, which resulted in a plethora of approaches for location-based search [1], [4], [5]. Existing concepts, however, suffer from two major drawbacks: (i) they are not robust against high peer churn and (ii) they do not allow for the persistent storage of location-based data. To this end, in this demo we present the prototype of the overlay Geodemlia [3], which allows for both: the persistent storage of location-based information as well as the reliable search even under high churn rates. Location-based information in Geodemlia is stored in a location-aware way, reducing the length of the transmission path for store and search operations.
Efficient file query is important to the overall performance of peer-to-peer (P2P) file sharing systems. Clustering peers by their common interests can significantly enhance the efficiency of file query. Clustering peers by their physical proximity can also improve file query performance. However, few current works are able to cluster peers based on both peer interest and physical proximity. Although structured P2Ps provide higher file query efficiency than unstructured P2Ps, it is difficult to realize it due to their strictly defined topologies. In this work, we introduce a Proximity-Aware and Interest-clustered P2P file sharing System (PAIS) based on a structured P2P, which forms physically-close nodes into a cluster and further groups physically-close and common-interest nodes into a sub-cluster based on a hierarchical topology. PAIS uses an intelligent file replication algorithm to further enhance file query efficiency. It creates replicas of files that are frequently requested by a group of physically close nodes in their location. Moreover, PAIS enhances the intra-sub-cluster file searching through several approaches. First, it further classifies the interest of a sub-cluster to a number of sub-interests, and clusters common-sub-interest nodes into a group for file sharing. Second, PAIS builds an overlay for each group that connects lower capacity nodes to higher capacity nodes for distributed file querying while avoiding node overload. Third, to reduce file searching delay, PAIS uses proactive file information collection so that a file requester can know if its requested file is in its nearby nodes. Fourth, to reduce the overhead of the file information collection, PAIS uses bloom filter based file information collection and corresponding distributed file searching. Fifth, to improve the file sharing efficiency, PAIS ranks the bloom filter results in order. Sixth, considering that a recently visited file tends to be visited again, the bloom filter based appr- ach is enhanced by only checking the newly added bloom filter information to reduce file searching delay. Trace-driven experimental results from the real-world PlanetLab testbed demonstrate that PAIS dramatically reduces overhead and enhances the efficiency of file sharing with and without churn. Further, the experimental results show the high effectiveness of the intra-sub-cluster file searching approaches in improving file searching efficiency.
ResearchGate has not been able to resolve any references for this publication.