The Experts below are selected from a list of 120 Experts worldwide ranked by ideXlab platform
Subhabrata Sen - One of the best experts on this subject based on the ideXlab platform.
-
characterizing Unstructured Overlay topologies in modern p2p file sharing systems
IEEE ACM Transactions on Networking, 2008Co-Authors: Daniel Stutzbach, Reza Rejaie, Subhabrata SenAbstract:In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the Unstructured Overlay topologies formed by these peers. Little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications, despite their importance. This paper presents a detailed characterization of P2P Overlay topologies and their dynamics, focusing on the modern Gnutella network. We present Cruiser, a fast and accurate P2P crawler, which can capture a complete snapshot of the Gnutella network of more than one million peers in just a few minutes, and show how inaccuracy in snapshots can lead to erroneous conclusions-such as a power-law degree distribution. Leveraging recent Overlay snapshots captured with Cruiser, we characterize the graph-related properties of individual Overlay snapshots and Overlay dynamics across slices of back-to-back snapshots. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its Overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, Overlay dynamics lead to an ldquoonion-likerdquo biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite Overlay dynamics.
-
characterizing Unstructured Overlay topologies in modern p2p file sharing systems
Internet Measurement Conference, 2005Co-Authors: Daniel Stutzbach, Reza Rejaie, Subhabrata SenAbstract:During recent years, peer-to-peer (P2P) file-sharing systems have evolved in many ways to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the Unstructured Overlay topology formed by these peers. Despite their importance, little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications. This paper presents a detailed characterization of P2P Overlay topologies and their dynamics, focusing on the modern Gnutella network. Using our fast and accurate P2P crawler, we capture a complete snapshot of the Gnutella network with more than one million peers in just a few minutes. Leveraging more than 18,000 recent Overlay snapshots, we characterize the graph-related properties of individual Overlay snapshots and Overlay dynamics across hundreds of back-to-back snapshots. We show how inaccuracy in snapshots can lead to erroneous conclusions--such as a power-law degree distribution. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its Overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, Overlay dynamics lead to an "onion-like" biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite Overlay dynamics.
Kazuhiko Tsuda - One of the best experts on this subject based on the ideXlab platform.
-
cover all query diffusion strategy over Unstructured Overlay network
International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, 2009Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Masakazu Takahashi, Kazuhiko TsudaAbstract:We have studied query diffusion strategy to cover all the nodes over Unstructured Overlay network. Although our previous work [1] covers 80% of nodes over the power-law network, we step further to minimize the number of left-behind nodes. In order to propagate messages to overall network, we assume the best case to choose the shortest path between every node pair. This is aimed for studying the optimal message path as a whole, reducing the query diffusion cost which is equal to the sum of minimum shortest path length. We have studied the characteristics of message propagation behavior, and that our proposed strategy can be applied for contents delivery over Unstructured Overlay network.
-
reverse query diffusion over Unstructured Overlay network for content delivery
Journal of Computer Applications in Technology, 2008Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Daisuke Mori, Kazuhiko TsudaAbstract:When a P2P client requests content it is difficult to diffuse its broadcast without causing a query explosion. By applying percolation theory to diffuse newly defined reverse-query messages over the Unstructured P2P network, we propose a novel information delivery network architecture built over the existing Unstructured P2P network. We analysed our algorithm and examine the validity of our model, which will cover more than 80% of all the clients, by relaying reverse-query messages under a probability as low as 10%. It is proven to be effective in reducing the total traffic generated by query propagation drastically. This architecture can be applied to building content sharing networks over the Unstructured Overlay network.
-
reverse query mechanism for contents delivery management over Unstructured Overlay network
International Conference on Communications, 2006Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Jun Yoshida, Kazuhiko TsudaAbstract:It is difficult to build contents delivery platform over the Unstructured P2P network because the traffic generated by P2P clients are unmanageable. By applying percolation theory to propagate newly defined reverse-query messages over the Unstructured P2P network, we propose novel contents delivery network architecture built over existing Unstructured P2P network. We analyzed our algorithm and examined the validity of our model, that will cover more than 80% of all the clients, with relaying reverse-query messages under probability as low as 10%, being effective to reduce the total traffic generated by query propagation. This architecture can be applicable for quasi-broadcast over the Internet.
-
efficient stream delivery over Unstructured Overlay network by reverse query propagation
Lecture Notes in Computer Science, 2006Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Jun Yoshida, Kazuhiko TsudaAbstract:We propose reverse-query mechanism to deliver broadband contents over Unstructured Overlay network. Due to the nature of scale-free network, newly defined reverse-query message will cover more than 80% of all the clients, with relaying reverse-query message under probability as low as 10%, being effective to reduce the total traffic generated by query propagation. This platform is built on percolation theory to propagate the message and contents, which each agent on P2P client relays reverse-query to randomly selected peers. This can be applied for quasi-broadcast platform on P2P network, and for business application, to flyer delivery over the Internet targeting common attributes such as residential area.
-
rapid information delivery over Unstructured Overlay network
2006Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Jun Yoshida, Kazuhiko TsudaAbstract:Summary It is difficult to propagate disaster management information rapidly among clients when some local network breakdown takes place. By applying percolation theory to propagate newly defined reverse-query messages over the Unstructured P2P network, we propose novel information delivery network architecture built over existing Unstructured P2P network. We analyzed our algorithm and examine the validity of our model, that will cover more than 80% of all the clients ,with relaying reverse-query messages under probability as low as 10%, being effective drastically to reduce the total traffic generated by query propagation. This architecture can be a solution for presenting information to many people in the devastated area over the Internet in case of natural calamity.
Daniel Stutzbach - One of the best experts on this subject based on the ideXlab platform.
-
characterizing Unstructured Overlay topologies in modern p2p file sharing systems
IEEE ACM Transactions on Networking, 2008Co-Authors: Daniel Stutzbach, Reza Rejaie, Subhabrata SenAbstract:In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the Unstructured Overlay topologies formed by these peers. Little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications, despite their importance. This paper presents a detailed characterization of P2P Overlay topologies and their dynamics, focusing on the modern Gnutella network. We present Cruiser, a fast and accurate P2P crawler, which can capture a complete snapshot of the Gnutella network of more than one million peers in just a few minutes, and show how inaccuracy in snapshots can lead to erroneous conclusions-such as a power-law degree distribution. Leveraging recent Overlay snapshots captured with Cruiser, we characterize the graph-related properties of individual Overlay snapshots and Overlay dynamics across slices of back-to-back snapshots. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its Overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, Overlay dynamics lead to an ldquoonion-likerdquo biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite Overlay dynamics.
-
characterizing Unstructured Overlay topologies in modern p2p file sharing systems
Internet Measurement Conference, 2005Co-Authors: Daniel Stutzbach, Reza Rejaie, Subhabrata SenAbstract:During recent years, peer-to-peer (P2P) file-sharing systems have evolved in many ways to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the Unstructured Overlay topology formed by these peers. Despite their importance, little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications. This paper presents a detailed characterization of P2P Overlay topologies and their dynamics, focusing on the modern Gnutella network. Using our fast and accurate P2P crawler, we capture a complete snapshot of the Gnutella network with more than one million peers in just a few minutes. Leveraging more than 18,000 recent Overlay snapshots, we characterize the graph-related properties of individual Overlay snapshots and Overlay dynamics across hundreds of back-to-back snapshots. We show how inaccuracy in snapshots can lead to erroneous conclusions--such as a power-law degree distribution. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its Overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, Overlay dynamics lead to an "onion-like" biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite Overlay dynamics.
Yoshikatsu Fujita - One of the best experts on this subject based on the ideXlab platform.
-
cover all query diffusion strategy over Unstructured Overlay network
International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, 2009Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Masakazu Takahashi, Kazuhiko TsudaAbstract:We have studied query diffusion strategy to cover all the nodes over Unstructured Overlay network. Although our previous work [1] covers 80% of nodes over the power-law network, we step further to minimize the number of left-behind nodes. In order to propagate messages to overall network, we assume the best case to choose the shortest path between every node pair. This is aimed for studying the optimal message path as a whole, reducing the query diffusion cost which is equal to the sum of minimum shortest path length. We have studied the characteristics of message propagation behavior, and that our proposed strategy can be applied for contents delivery over Unstructured Overlay network.
-
reverse query diffusion over Unstructured Overlay network for content delivery
Journal of Computer Applications in Technology, 2008Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Daisuke Mori, Kazuhiko TsudaAbstract:When a P2P client requests content it is difficult to diffuse its broadcast without causing a query explosion. By applying percolation theory to diffuse newly defined reverse-query messages over the Unstructured P2P network, we propose a novel information delivery network architecture built over the existing Unstructured P2P network. We analysed our algorithm and examine the validity of our model, which will cover more than 80% of all the clients, by relaying reverse-query messages under a probability as low as 10%. It is proven to be effective in reducing the total traffic generated by query propagation drastically. This architecture can be applied to building content sharing networks over the Unstructured Overlay network.
-
reverse query mechanism for contents delivery management over Unstructured Overlay network
International Conference on Communications, 2006Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Jun Yoshida, Kazuhiko TsudaAbstract:It is difficult to build contents delivery platform over the Unstructured P2P network because the traffic generated by P2P clients are unmanageable. By applying percolation theory to propagate newly defined reverse-query messages over the Unstructured P2P network, we propose novel contents delivery network architecture built over existing Unstructured P2P network. We analyzed our algorithm and examined the validity of our model, that will cover more than 80% of all the clients, with relaying reverse-query messages under probability as low as 10%, being effective to reduce the total traffic generated by query propagation. This architecture can be applicable for quasi-broadcast over the Internet.
-
efficient stream delivery over Unstructured Overlay network by reverse query propagation
Lecture Notes in Computer Science, 2006Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Jun Yoshida, Kazuhiko TsudaAbstract:We propose reverse-query mechanism to deliver broadband contents over Unstructured Overlay network. Due to the nature of scale-free network, newly defined reverse-query message will cover more than 80% of all the clients, with relaying reverse-query message under probability as low as 10%, being effective to reduce the total traffic generated by query propagation. This platform is built on percolation theory to propagate the message and contents, which each agent on P2P client relays reverse-query to randomly selected peers. This can be applied for quasi-broadcast platform on P2P network, and for business application, to flyer delivery over the Internet targeting common attributes such as residential area.
-
rapid information delivery over Unstructured Overlay network
2006Co-Authors: Yoshikatsu Fujita, Yasufumi Saruwatari, Jun Yoshida, Kazuhiko TsudaAbstract:Summary It is difficult to propagate disaster management information rapidly among clients when some local network breakdown takes place. By applying percolation theory to propagate newly defined reverse-query messages over the Unstructured P2P network, we propose novel information delivery network architecture built over existing Unstructured P2P network. We analyzed our algorithm and examine the validity of our model, that will cover more than 80% of all the clients ,with relaying reverse-query messages under probability as low as 10%, being effective drastically to reduce the total traffic generated by query propagation. This architecture can be a solution for presenting information to many people in the devastated area over the Internet in case of natural calamity.
Reza Rejaie - One of the best experts on this subject based on the ideXlab platform.
-
characterizing Unstructured Overlay topologies in modern p2p file sharing systems
IEEE ACM Transactions on Networking, 2008Co-Authors: Daniel Stutzbach, Reza Rejaie, Subhabrata SenAbstract:In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the Unstructured Overlay topologies formed by these peers. Little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications, despite their importance. This paper presents a detailed characterization of P2P Overlay topologies and their dynamics, focusing on the modern Gnutella network. We present Cruiser, a fast and accurate P2P crawler, which can capture a complete snapshot of the Gnutella network of more than one million peers in just a few minutes, and show how inaccuracy in snapshots can lead to erroneous conclusions-such as a power-law degree distribution. Leveraging recent Overlay snapshots captured with Cruiser, we characterize the graph-related properties of individual Overlay snapshots and Overlay dynamics across slices of back-to-back snapshots. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its Overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, Overlay dynamics lead to an ldquoonion-likerdquo biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite Overlay dynamics.
-
Examining Graph Properties of Unstructured Peer-to-Peer Overlay Topology
2007 IEEE Global Internet Symposium, 2007Co-Authors: Reza RejaieAbstract:During the past few years, Unstructured peer-to- peer (P2P) file-sharing systems have witnessed a significant increase in popularity. However, there lacks a systematic study on graph properties of the Overlay topology. In this paper, we use accurate snapshots of the Gnutella Overlay that span over roughly three years to explore changes in graph properties over long timescale. We investigate the effect of network address translation (NAT) on topology analysis. We examine a wide spectrum of graph properties characterizing the Gnutella top-level Overlay topology and illustrate some interesting results. We find that the connection limit plays an important role in forming the Unstructured Overlay topology.
-
characterizing Unstructured Overlay topologies in modern p2p file sharing systems
Internet Measurement Conference, 2005Co-Authors: Daniel Stutzbach, Reza Rejaie, Subhabrata SenAbstract:During recent years, peer-to-peer (P2P) file-sharing systems have evolved in many ways to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the Unstructured Overlay topology formed by these peers. Despite their importance, little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications. This paper presents a detailed characterization of P2P Overlay topologies and their dynamics, focusing on the modern Gnutella network. Using our fast and accurate P2P crawler, we capture a complete snapshot of the Gnutella network with more than one million peers in just a few minutes. Leveraging more than 18,000 recent Overlay snapshots, we characterize the graph-related properties of individual Overlay snapshots and Overlay dynamics across hundreds of back-to-back snapshots. We show how inaccuracy in snapshots can lead to erroneous conclusions--such as a power-law degree distribution. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its Overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, Overlay dynamics lead to an "onion-like" biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite Overlay dynamics.
