Upload
sol
View
24
Download
2
Tags:
Embed Size (px)
DESCRIPTION
Overhaul: Extending HTTP to Combat Flash Crowds. Jay A. Patel & Indranil Gupta Distributed Protocols Research Group Department of Computer Science University of Illinois at Urbana-Champaign (UIUC) Urbana, Illinois, USA. Introduction. Flash crowd: A stampede of unexpected visitors - PowerPoint PPT Presentation
Citation preview
Overhaul: Extending HTTP to Combat Flash CrowdsJay A. Patel & Indranil Gupta
Distributed Protocols Research GroupDepartment of Computer ScienceUniversity of Illinois at Urbana-Champaign (UIUC)Urbana, Illinois, USA
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 2
Introduction Flash crowd: A stampede of unexpected
visitors Occurs regularly due to linkage from popular
news feeds, web logs, etc. Popularly termed “Slashdot effect”
Victim sites become unresponsive Perception of dysfunction
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 3
Example: MSNBC
MSNBC home pageDecember 14, 2003
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 4
Motivation Problem
Unpredictable, yet frequent Brief period of time Thousand-fold increase in traffic
Two naïve solutions Overly insure on resources Shut down web site
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 5
Current Solutions Architectural Changes
SEDA Capriccio ESI
Protocol Modifications DHTTP Web Booster
Cooperative Sharing Squirrel Kache Backslash BitTorrent
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 7
Overhaul: Overview Protocol change
HTTP extension, no modification 5 new tags added, 1 slightly modified
Backwards compatible Key concept: chunking
Characteristic of the web applied to individual documents m chunks per document
P2P distribution framework Voluntary Ad hoc, not DHT based Key benefit: parallel resource discovery
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 8
Overhaul: Design
Client
Server
Client
Client
Client#1
#2
#4 #3
HTTP Request with Overhaul support tag
Chunked Responsewith Overhaul headers
Peers exchange chunksto fetch the complete document
Ad hoc peer network
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 9
Details: Client/Server Interaction Initial request by client
Supports: Overhaul $port $speed Response by server in Overhaul mode
ith chunk transmitted in sequential order Signatures of other m-1 chunks for verification Initial Overhaul network membership list
n most-recent Overhaul clients List maintained at server (updated with every request)
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 10
Details: Peer Clients’ Interaction Clients contact other peer members
To fetch remaining chunks To discover new peers
Aggregate membership list by swapping information 1-hop random walk discovery process
Resource discovery Lookup documents on a busy Overhaul server
Contact peers randomly on membership list INFO $host.tld
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 11
Implementation Server
Apache/2.0 HTTP server Module: mod_overhaul
Client Java HTTP Proxy Cross platform Universal client support
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 12
Testing Methodology: Server Server machine
2.5 GHz AMD Athlon XP+ 1 GB RAM
Client machine 650 MHz Pentium III 320 MB RAM
Same network equipment 25 concurrent fetches ApacheBench utility
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 13
Results: Chunking (Fixed Size)Document: 10 KBConcurrency: 25
Regular HTTP512-byte chunks2048-byte chunks
• Overhaul mode requires the server to send only a single chunk
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 14
Results: Chunking (Maximum Count)
Regular HTTP6 chunks12 chunks24 chunks
Document: 50 KBConcurrency: 25
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 15
Results: Overhaul vs. Regular
Regular HTTP6 chunks12 chunks
Concurrency: 25Minimum chunk size: 512-bytes
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 16
Testing Methodology: Client Cluster of workstations
25 homogenous PCs 2.8 GHz Intel Pentium 4 1 GB RAM
Same network equipment Two experiments
Concurrent: single document Staggered: multiple documents
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 17
Results: Single Document Large document: 50
KB (12 chunks) Server condition: 150-
250 concurrent fetches + competition
Overhaul requests: concurrently only using 24
Overhaul-aware clients
Regular requests
Overhaul mode
Fastest 1 sec 6 secs
Slowest 32 secs 9 secs
Average 9 secs 7 secs
Server bandwidth usage in Overhaul mode: 1/12th of regular requests
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 18
Results: Multiple Documents 8 documents: 110 KB total
(12 chunks) Server condition: 150-250
concurrent fetches + competition
Overhaul requests staggered 1st stage: 12 concurrent
fetches, fetch all documents 2nd stage: 12 concurrent
fetches, fetch index document only
Regular requests
Overhaul mode
Fastest 1 sec 14 secs
Slowest ∞ 28 secs
Average 23 secs* 18 secs
Server bandwidth usage in Overhaul mode : 1/18th of regular requests
* indicates completed requests
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 19
Limitations Both client and server must be Overhaul
aware Requires critical mass to be maintained to
remain effective n clients > m chunks
More responsibilities for the client Possible security implications
Distributed Protocols Research Group, Department of Computer Science, University of Illinois at Urbana-Champaign 20
Conclusion Saves resources
Bandwidth The bigger the crowd, the lower the per capita usage
Response time Faster turnaround for both server and client
Getting wide spread acceptance Marginal cost Protocol extension requires industry and
standards push