Autonomic multi-server distribution in flash crowds alleviation network
Merdan Atajanov,Toshihiko Shimokawa,Norihiko Yoshida +2 more
- 17 Dec 2007
- pp 309-320
TL;DR: A new feature of FCAN is presented to support multiple servers which experience different flash crowds simultaneously, and experiment results with real web log data provided by Live Eclipse 2006 are shown.
read more
Abstract: The Flash crowds are rapid increase in access to contents of web sites, which makes the web sites inaccessible, leaving the clients with unsatisfied requests. The major shortcoming of flash crowds researches is that they do not assist vital resizing feature of a cloud of the surrogates; the surrogates involved in the alleviation process do not change from the start to the end of flash crowds. Our system, FCAN (Flash Crowds Alleviation Network) is a system to provide resources to web sites to overcome flash crowds. A main feature of FCAN is its dynamically resizing feature, which can adapt to request load of flash crowds by enlarging or shrinking a cloud of surrogate servers used by the web sites. In this paper, we present a new feature of FCAN to support multiple servers which experience different flash crowds simultaneously, and show experiment results with real web log data provided by Live Eclipse 2006.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Detecting and confronting flash attacks from IoT botnets
TL;DR: The results show that the adaptive filter can significantly reduce illegitimate botnet requests from variants such as FBOT, ARIS, EXIENDO and APEP and can reduce the instances processing time by 19%, connection time by 34% and the waiting time by 18%.
44
Handling flash-crowd events to improve the performance of web applications
Ubiratam de Paula Junior,Lúcia Maria de A. Drummond,Daniel de Oliveira,Yuri Frota,Valmir C. Barbosa +4 more
- 13 Apr 2015
TL;DR: The Flash Crowd Handling Problem (FCHP) is precisely defined and formulated as an integer programming problem and a new algorithm for handling with a flash crowd named FCHP-ILS is also proposed.
13
Handling Flash-Crowd Events to Improve the Performance of Web Applications
Ubiratam de Paula Junior,Lúcia Maria de A. Drummond,Daniel de Oliveira,Yuri Frota,Valmir C. Barbosa +4 more
TL;DR: In this paper, the Flash Crowd Handling Problem (FCHP) is precisely defined and formulated as an integer programming problem, and a new algorithm for handling with a flash crowd named FCHP-ILS is also proposed.
7
Flash crowd prediction in Twitter
Nitesh Kumar Singh,C. U. Om Kumar,Rajeshwari Sridhar +2 more
- 01 Jan 2017
TL;DR: A generic model is developed that tracks trending topics in Twitter by extracting features through sentiment analysis, sarcasm analysis, trend analysis, emotional divergence, hash tag processing and predicts flash crowd through Naïve bayes classifier that addresses the bottleneck's caused to server(s) by flash crowd.
5
References
•Proceedings Article
Democratizing content publication with coral
Michael J. Freedman,Eric Freudenthal,David Mazières +2 more
- 29 Mar 2004
TL;DR: CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broadband Internet connection.
A lightweight, robust P2P system to handle flash crowds
TL;DR: This work presents peer-to-peer (P2P) randomized overlays to obviate flash-crowd symptoms (PROOFS), a simple, lightweight, P2P approach that uses randomized overlay construction and randomized, scoped searches to locate and deliver objects efficiently under heavy demand to all users that desire them.
FCAN: Flash Crowds Alleviation Network Using Adaptive P2P Overlay of Cache Proxies
TL;DR: FCAN as mentioned in this paper is an adaptive network that dynamically optimizes the system structure between peer-to-peer (P2P) and client-server (C/S) configurations to alleviate flash crowds effect.
17
A lightweight, robust P2P system to handle flash crowds
Angelos Stavrou,Dan Rubenstein,Sambit Sahu +2 more
- 12 Nov 2002
TL;DR: It is shown that randomized approaches like PROOFS should effectively relieve flash crowd symptoms in dynamic, limited-participation environments.
A lightweight, robust P2P system to handle flash crowds
Angelos Stavrou,Dan Rubenstein,Sambit Sahu +2 more
- 01 Jul 2002
TL;DR: This work presents peer-to-peer (P2P) randomized overlays to obviate flash-crowd symptoms (PROOFS), a simple, lightweight, P2P approach that uses randomized overlay construction and randomized, scoped searches to locate and deliver objects efficiently under heavy demand to all users that desire them.