Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems, 2009
In the present paper, through simulations, we examine whether the evolutionary peer-to-peer (P2P)... more In the present paper, through simulations, we examine whether the evolutionary peer-to-peer (P2P) networking technique can provide reliable search capability in dynamic P2P environments. The evolutionary P2P networking technique optimizes several P2P network topologies, to which all of the nodes belong at the same time, in an evolutionary manner according to given evaluation criteria. In simulations, we assume dynamic P2P environments in which each node leaves and joins the network with its own probability and in which search objects vary with time. The simulation results show (1) that random topology reconstruction is better than topology reconstruction by the evolutionary P2P networking technique in terms of reliable search capability when several types of search objects are present in the network at any moment and replicas of these search objects are created in the nodes and (2) that topology reconstruction by the evolutionary P2P networking technique is better than random topology reconstruction when only a few types of search objects are present in the network at any moment and these search objects are not replicated.
This paper presents a file replication scheme with analogy to thermal diffusion for storage load ... more This paper presents a file replication scheme with analogy to thermal diffusion for storage load balancing in unstructured peer-to-peer (P2P) file sharing networks. The proposed scheme is intended to balance storage load among peers in a dynamic, distributed, and autonomous manner, as in thermal diffusion. Theoretical analysis results show that the presented scheme actually has a statistical analogy with a
ABSTRACT SE: Space Elevator is going to be a realistic candidate of transportation from the groun... more ABSTRACT SE: Space Elevator is going to be a realistic candidate of transportation from the ground to the outer space. However, the digital information network to be employed for communication, monitoring, and control between the elevator and the ground facilities in an efficient manner (i.e. at low cost) have not been fully discussed so far. While there already exist various well-established technologies for satellite communications and networks, SE has its own issues unsolved by the existing networking. In this paper, we focus on DTN (Delay, Disruption, and Disconnection Tolerant Network)-related technology, which originally emerged in IPN (Inter-PlaNetary Internet) to asynchronously exchange huge non-realtime data but has been considered as more a general framework to cope with inefficiency of the existing networking due to huge delay, huge error rate, and/or intermittent connectivity. We discuss applicability of DTN technology in SE environments.
In this paper we propose a file replication scheme inspired by a thermal diffusion phenomenon for... more In this paper we propose a file replication scheme inspired by a thermal diffusion phenomenon for storage load balancing in unstructured peer-to-peer (P2P) file sharing networks. The proposed scheme is designed such that the storage utilization ratios of peers will be uniform, in the same way that the temperature in a field becomes uniform in a thermal diffusion phenomenon. The proposed scheme creates replicas of files in peers probabilistically, where the probability is controlled by using parameters that can be used to find the trade-off between storage load balancing and search performance in unstructured P2P file sharing networks. First, we show through theoretical analysis that the statistical behavior of the storage load balancing controlled by the proposed scheme has an analogy with the thermal diffusion phenomenon. We then show through simulation that the proposed scheme not only has superior performance with respect to balancing the storage load among peers (the primary objective of the present proposal) but also allows the performance trade-off to be widely found. Finally, we qualitatively discuss a guideline for setting the parameter values in order to widely find the performance trade-off from the simulation results.
In the present paper, through simulations, we examine whether the evolutionary peer-to-peer (P2P)... more In the present paper, through simulations, we examine whether the evolutionary peer-to-peer (P2P) networking technique can provide reliable search capability in dynamic P2P environments. The evolutionary P2P networking technique optimizes several P2P network topologies, to which all of the nodes belong at the same time, in an evolutionary manner according to given evaluation criteria. In simulations, we assume dynamic P2P environments in which each node leaves and joins the network with its own probability and in which search objects vary with time. The simulation results show (1) that random topology reconstruction is better than topology reconstruction by the evolutionary P2P networking technique in terms of reliable search capability when several types of search objects are present in the network at any moment and replicas of these search objects are created in the nodes and (2) that topology reconstruction by the evolutionary P2P networking technique is better than random topology reconstruction when only a few types of search objects are present in the network at any moment and these search objects are not replicated.
Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems, 2009
In the present paper, through simulations, we examine whether the evolutionary peer-to-peer (P2P)... more In the present paper, through simulations, we examine whether the evolutionary peer-to-peer (P2P) networking technique can provide reliable search capability in dynamic P2P environments. The evolutionary P2P networking technique optimizes several P2P network topologies, to which all of the nodes belong at the same time, in an evolutionary manner according to given evaluation criteria. In simulations, we assume dynamic P2P environments in which each node leaves and joins the network with its own probability and in which search objects vary with time. The simulation results show (1) that random topology reconstruction is better than topology reconstruction by the evolutionary P2P networking technique in terms of reliable search capability when several types of search objects are present in the network at any moment and replicas of these search objects are created in the nodes and (2) that topology reconstruction by the evolutionary P2P networking technique is better than random topology reconstruction when only a few types of search objects are present in the network at any moment and these search objects are not replicated.
This paper presents a file replication scheme with analogy to thermal diffusion for storage load ... more This paper presents a file replication scheme with analogy to thermal diffusion for storage load balancing in unstructured peer-to-peer (P2P) file sharing networks. The proposed scheme is intended to balance storage load among peers in a dynamic, distributed, and autonomous manner, as in thermal diffusion. Theoretical analysis results show that the presented scheme actually has a statistical analogy with a
ABSTRACT SE: Space Elevator is going to be a realistic candidate of transportation from the groun... more ABSTRACT SE: Space Elevator is going to be a realistic candidate of transportation from the ground to the outer space. However, the digital information network to be employed for communication, monitoring, and control between the elevator and the ground facilities in an efficient manner (i.e. at low cost) have not been fully discussed so far. While there already exist various well-established technologies for satellite communications and networks, SE has its own issues unsolved by the existing networking. In this paper, we focus on DTN (Delay, Disruption, and Disconnection Tolerant Network)-related technology, which originally emerged in IPN (Inter-PlaNetary Internet) to asynchronously exchange huge non-realtime data but has been considered as more a general framework to cope with inefficiency of the existing networking due to huge delay, huge error rate, and/or intermittent connectivity. We discuss applicability of DTN technology in SE environments.
In this paper we propose a file replication scheme inspired by a thermal diffusion phenomenon for... more In this paper we propose a file replication scheme inspired by a thermal diffusion phenomenon for storage load balancing in unstructured peer-to-peer (P2P) file sharing networks. The proposed scheme is designed such that the storage utilization ratios of peers will be uniform, in the same way that the temperature in a field becomes uniform in a thermal diffusion phenomenon. The proposed scheme creates replicas of files in peers probabilistically, where the probability is controlled by using parameters that can be used to find the trade-off between storage load balancing and search performance in unstructured P2P file sharing networks. First, we show through theoretical analysis that the statistical behavior of the storage load balancing controlled by the proposed scheme has an analogy with the thermal diffusion phenomenon. We then show through simulation that the proposed scheme not only has superior performance with respect to balancing the storage load among peers (the primary objective of the present proposal) but also allows the performance trade-off to be widely found. Finally, we qualitatively discuss a guideline for setting the parameter values in order to widely find the performance trade-off from the simulation results.
In the present paper, through simulations, we examine whether the evolutionary peer-to-peer (P2P)... more In the present paper, through simulations, we examine whether the evolutionary peer-to-peer (P2P) networking technique can provide reliable search capability in dynamic P2P environments. The evolutionary P2P networking technique optimizes several P2P network topologies, to which all of the nodes belong at the same time, in an evolutionary manner according to given evaluation criteria. In simulations, we assume dynamic P2P environments in which each node leaves and joins the network with its own probability and in which search objects vary with time. The simulation results show (1) that random topology reconstruction is better than topology reconstruction by the evolutionary P2P networking technique in terms of reliable search capability when several types of search objects are present in the network at any moment and replicas of these search objects are created in the nodes and (2) that topology reconstruction by the evolutionary P2P networking technique is better than random topology reconstruction when only a few types of search objects are present in the network at any moment and these search objects are not replicated.
Uploads
Papers by Kento Ichikawa