DOC PREVIEW
U of I CS 525 - P2P Apps

This preview shows page 1-2-3-23-24-25-26-47-48-49 out of 49 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 49 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Slide 1P2P In GeneralP2P AppsSlide 4What is DNS?Environment and WorkloadObserved PerformanceTraditional DNS FailuresWhat is not working?Time Spent on DNS lookupsSuspected Failure ClassificationCoDNS IdeasCoDNS Counter-thoughtsCoDNS ImplementationPeer Management & CommunicationResultsResults: One Day of TrafficObservationsOverheadQuestionsSlide 21PAST IntroductionPastry ReviewPastry Review, continuedPAST – InsertPAST – LookupPAST – ReclaimIs this good enough?The ProblemThe Solution: Storage ManagementReplica DiversionReplica DiversionReplica DiversionReplica DiversionReplica DiversionFile DiversionReplica ManagementReplica ManagementCachingSecurityEvaluationEvaluation (1)Evaluation (2)Evaluation (3)DiscussionSlide 46Background: UsenetUsenetDHTDiscussionP R E S E N T E D BYK E V I N L A R S O N&W I L L D I E T Z1P2P AppsP2P In General2Distributed systems where workloads are partitioned between peersPeer: Equally privileged members of the systemIn contrast to client-server models, peers both provide and consume resources.Classic Examples:NapsterGnutellaP2P Apps3CoDNSDistribute DNS load to other clients in order to greatly reduce latency in the case of local failures PAST Distribute files and replicas across many peers, using diversion and hashing to increase utilization and insertion successUsenetDHTUse peers to distribute the storage and costs of the Usenet serviceO S D I 2 0 0 4P R I N C E T O NK Y O U N G S O O P A R KZ H E W A N GV I V E K P A IL A R R Y P E T E R S O NP R E S E N T E D B Y K E V I N L A R S O N4CoDNSWhat is DNS?5Domain Name SystemRemote serverLocal resolver Translates hostnames into IP addressesEx: www.illinois.edu -> 128.174.4.87Ubiquitous and long-standing: Average user not aware of its existenceDesired Performance, as observed PlanetLab nodes at Rice and University of UtahEnvironment and Workload6PlanetLab Internet scale test-bedVery large scaleGeographically distributedCoDeeNLatency-sensitive content delivery network (CDN)Uses a network of caching Web proxy serversComplex distribution of node accesses + external accessesBuilt on top of PlanetLabWidely used (4 million plus accesses/day)Observed Performance 7CornellUniversity of OregonUniversity of MichiganUniversity of TennesseeTraditional DNS Failures8Comcast DNS failureCyber Monday 2010Complete failure, not just high latencyMassive overloadingWhat is not working?9DNS lookups have high reliability, but make no latency guarantees:Reliability due to redundancy, which drives up latencyFailures significantly skew average lookup timesFailures defined as:5+ second latency – the length of time where the system will contact a secondary local nameserverNo answerTime Spent on DNS lookups10Three classifications of lookup times: Low: <10ms Regular: 10ms to 100ms High: >100msHigh latency lookups account for 0.5% to 12.9% of accesses71%-99.2% of time is spent on high latency lookupsSuspected Failure Classification11CornellUniversity of OregonUniversity of MichiganUniversity of TennesseeLong lasting, continuous failures: - Result from nameserver failures and/or extended overloadingShort sporadic failures: - Result from temporary overloadingPeriodic Failures – caused by cron jobs and other scheduled tasksCoDNS Ideas12Attempt to resolve locally, then request data from peers if too slowDistributed DNS cache - peer may have hostname in cacheDesign questions:How important is locality? How soon should you attempt to contact a peer? How many peers to contact?CoDNS Counter-thoughts13This seems unnecessarily complex – why not just go to another local or root nameserver?Many failures are overload related, more aggressive contact of nameservers would just aggravate the problemIs this worth the increased load on peer’s DNS servers and the bandwidth of duplicating requests?Failure times were not consistent between peers, so this likely will have minimal negative effectCoDNS Implementation14Stand-alone daemon on each nodeMaster & slave processes for resolutionMaster reissues requests if slaves are too slowDoubles delay after first retryHow soon before you contact peers?It dependsGood local performance – Increase reissue delay up to 200msFrequently relying on remote lookups – Reduce reissue delay to as low as 0msPeer Management & Communication15Peers maintain a set of neighborsBuilt by contacting list of all peersPeriodic heartbeats determine livenessReplace dead nodes with additional scanning of node listUses Highest Random Weight (HRW) hashingGenerates ordered list of nodes given a hostnameSorted by a hash of hostname and peer addressProvides request localityResults16Overall, average responses improved 16% to 75%Internal lookups: 37ms to 7msReal traffic: 237ms to 84msAt Cornell, the worst performing node, average response times massively reduced:Internal lookups: 554ms to 21msReal traffic: 1095ms to 79msResults: One Day of Traffic17Local DNSCoDNSObservations18Three observed cases where CoDNS doesn’t provide benefit:Name does not existInitialization problems result in bad neighbor setNetwork prevents CoDNS from contacting peersCoDNS uses peers for 18.9% of lookups34.6% of remote queries return faster than local lookupOverhead19Extra DNS lookups: Controllable via variable initial delay timeNaive 500ms delay adds about 10% overheadDynamic delay adds only 18.9%Extra Network Traffic:Remote queries and heartbeats only account for about 520MB/day across all nodesOnly 0.3% overheadQuestions20The CoDeeN workload has a very diverse lookup set, would you expect different behavior from a less diverse set of lookups?CoDNS proved to work remarkably well in the PlanetLab environment, where else could the architecture prove useful?The authors took a black box approach towards observing and working with the DNS servers, do you think a more integrated method could further improve observations or results? It seems a surprising number of failures result from Cron jobs, should this have been a task for policy or policy enforcement?“ S T O R A G E M A N A G E M E N T A N D C A C H I N G I N P A S T , A L A R G E - S C A L E P E R S I S T E N T P E E R -T O - P E E R S T O R A G E U T I L I T Y ”S O S P 2 0 0 1A N


View Full Document

U of I CS 525 - P2P Apps

Documents in this Course
Epidemics

Epidemics

12 pages

LECTURE

LECTURE

7 pages

LECTURE

LECTURE

39 pages

LECTURE

LECTURE

41 pages

Lecture

Lecture

48 pages

Epidemics

Epidemics

69 pages

GRIFFIN

GRIFFIN

25 pages

Load more
Download P2P Apps
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view P2P Apps and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view P2P Apps 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?