Finding candidate spots for replica servers based on demand fluctuation

Asahara, Masato; Shimada, Akio; Yamada, Hiroshi; Kono, Kenji

doi:10.1109/icpads.2007.4447737

“…Before explaining our mechanism, we summarize the ExaPeer [1] architecture. In the following section, we explain the case study using ExaPeer to demonstrate the effectiveness of speculative update.…”

Section: Exapeermentioning

confidence: 99%

“…We applied the speculative update to ExaPeer [1], a P2P-based CDN, and evaluated it on two synthetic networks simulating the Internet. Simulation results demonstrate that speculative update propagates updates to all replicas faster than gossip protocols and random walks.…”

Section: Introductionmentioning

confidence: 99%

Efficient Update Propagation by Speculating Replica Locations on Peer-to-Peer Networks

Hayakawa

¹

,

Asahara

²

,

Kono

³

et al. 2009

2009 15th International Conference on Parallel and Distributed Systems

1

0

View full text Add to dashboard Cite

As demand for high fidelity multimedia content has soared, content distribution has emerged as a critical application. Large multimedia files require effective content distribution services such as content distribution networks (CDNs). A recent trend in CDN development is the use of peer-to-peer (P2P) techniques to enhance scalability, fault resilience, and cost-effectiveness. Unfortunately, P2P-based content distribution poses a crucial problem in that update propagation is quite difficult to accomplish. This is because peers cannot obtain a global view of replica locations on the network. In this paper, we propose speculative update, which quickly propagates an update to all replicas in a pure P2P fashion. Each server attempts to determine the directions in which there will be replicas with high probability based on server's local state used for replica repositioning. Then, it relays update messages speculatively in those directions. Simulation results demonstrate that our mechanism propagates an update to all replicas faster than the current pure P2P-based approaches.

show abstract

“…We compare the speculative update with the simple gossip-based update propagation and convergence-guaranteed random walks 24) . We apply the speculative update to ExaPeer 23) , which is implemented on Overlay Weaver 31) . Overlay Weaver is a toolkit that enables to easily construct a large-scale overlay network and to emulate its behavior.…”

Section: Discussionmentioning

confidence: 99%

“…Before explaining our mechanism, we summarize the ExaPeer 23) architecture. In the following section, we explain the case study using ExaPeer to demonstrate the effectiveness of the speculative update.…”

Section: Exapeermentioning

confidence: 99%

A Strategy for Efficient Update Propagation on Peer-to-Peer Based Content Distribution Networks

Hayakawa

¹

,

Asahara

²

,

Kono

³

et al. 2010

IPSJ Online Transactions

0

View full text Add to dashboard Cite

As demand for high fidelity multimedia content has soared, content distribution has emerged as a critical application. Large multimedia files require effective content distribution services such as content distribution networks (CDNs). A recent trend in CDN development is the use of peer-to-peer (P2P) techniques. P2P-based CDNs have several advantages over conventional non-P2P-based CDNs in scalability, fault resilience, and cost-effectiveness. Unfortunately, P2P-based content distribution poses a crucial problem in that update propagation is quite difficult to accomplish. This is because peers cannot obtain a global view of replica locations on the network. There are still several issues in conventional approaches to update propagation. They degrade the scalability, the fault resilience, and the cost-effectiveness of P2P-based content distribution, they also consume the network bandwidth, or take a long time. In this paper, we propose the speculative update, which quickly propagates an update to replicas with less bandwidth consumption in a pure P2P fashion. The speculative update enables a fast update propagation on structured P2P-based CDNs. Each server attempts to determine the directions in which there will be replicas with a high probability and speculatively relays update messages in those directions. Simulation results demonstrate that our mechanism quickly propagates an update to replicas with less bandwidth consumption. The The speculative update completes update propagation as fast as the simple gossipbased update propagation even with up to 69% fewer messages per second. Compared to the convergence-guaranteed random walk, the speculative update completes an update propagation faster by up to 92%.

show abstract

“…EPSR extends our previous mechanism [15], [16]. Our previous mechanism focuses on locating high-demand areas and lacks the ability of estimating the number of replica servers required to deal with flash crowds.…”

Section: Introductionmentioning

confidence: 99%

P2P-Based Approach to Finding Replica Server Locations for Alleviating Flash Crowds

Asahara

¹

,

Kono

²

,

Kojima

³

et al. 2010

IEICE Trans. Inf. & Syst.

0

View full text Add to dashboard Cite

SUMMARYMany services rely on the Internet to provide their customers with immediate access to information. To provide a stable service to a large number of customers, a service provider needs to monitor demand fluctuations and adjust the number and the location of replica servers around the world. Unfortunately, flash crowds make it quite difficult to determine good number and locations of replica servers because they must be repositioned very quickly to respond to rapidly changing demands. We are developing ExaPeer, an infrastructure for dynamically repositioning replica servers on the Internet on the basis of demand fluctuations. In this paper we introduce ExaPeer Server Reposition (EPSR), a mechanism that quickly finds appropriate number and locations of replica servers. EPSR is designed to be lightweight and responsive to flash crowds. EPSR enables us to position replica servers so that no server becomes overloaded. Even though no dedicated server collects global information such as the distribution of clients or the load of all servers over the Internet, the peer-to-peer approach enables EPSR to find number and locations of replica servers quickly enough to respond to flash crowds. Simulation results demonstrate that EPSR locates high-demand areas, estimates their scale correctly and determines appropriate number and locations of replica servers even if the demand for a service increases/decreases rapidly.

show abstract

Finding candidate spots for replica servers based on demand fluctuation

Cited by 3 publications

References 27 publications

Efficient Update Propagation by Speculating Replica Locations on Peer-to-Peer Networks

Efficient Update Propagation by Speculating Replica Locations on Peer-to-Peer Networks

A Strategy for Efficient Update Propagation on Peer-to-Peer Based Content Distribution Networks

P2P-Based Approach to Finding Replica Server Locations for Alleviating Flash Crowds

Contact Info

Product

Resources

About