Norihiko Yoshida

Learn More
Pure peer-to-peer (P2P) networks is widely used, however they broadcast query packets, and cause excessive network traffic in particular. Addressing this issue, we propose a new strategy for content replication which prioritizes popular and attracting contents. Our strategy is based on replication adjustment, being cooperated with index caching, as well as(More)
Many service providers prepare multiple servers to cope with over loading. In such cases, the problem is how to select the best server. Existing mechanisms impose user extra eeort or have less exibility. In this paper, we describes exible and wide applicable server selection mechanism. We add server selection function to DNS. It can coordinate various(More)
Received Revised ABSTRACT Modeling environment is essential for agents to cooperate with each other in a distributed system. In this paper, we propose two strategies for selecting agents' communication structures in a cooperative search using their local histories as a model of their computational environment. Under the assumption of homogeneity of agents,(More)
With the rapid spread of information and ubiquitous access of browsers, flash crowd, a sudden, unanticipated surge in the volume of request rates, has become the bane of many Internet websites. This paper models and presents FCAN, an adaptive CDN network that dynamically optimizes the system structure between peer-to-peer (P2P) and client-server(C/S)(More)
SUMMARY With the rapid spread of information and ubiquitous access of browsers, flash crowds, a sudden, unanticipated surge in the volume of request rates, have become the bane of many Internet websites. This paper models and presents FCAN, an adaptive network that dynamically optimizes the system structure between peer-to-peer (P2P) and client-server (C/S)(More)
— Many service providers on the Internet use multiple mirror servers to cope with request congestion. Here, the problem is how to select the best server out of them. We propose a DNS-based mechanism for server selection with preferred policies. DNS (Domain Name System) is used in almost all services and implementations. Therefore, our approach is generally(More)
In open and dynamic environments, where an access pattern to shared resources cannot be predicted statically, or is even changed dynamically, a distributed shared memory system must be adaptive to minimize communication overhead over network. The system must adjust parameters or even switch protocols according to situations which is monitored dynamically.(More)
Given the increase in frequency and overall unpredictability, flash crowds have been the bane on internet website. This paper introduces FCAN, a flexibly adaptive network built on cache proxy server layer, transiting architecture between C/S and P2P mode according to the real-time network traffics, as a possible approach to address the flash crowds. The(More)