Peer-peer and Applicat ion-level Net working CS 218 Fall 2003 Mult - - PowerPoint PPT Presentation

peer peer and applicat ion level net working cs 218 fall
SMART_READER_LITE
LIVE PREVIEW

Peer-peer and Applicat ion-level Net working CS 218 Fall 2003 Mult - - PowerPoint PPT Presentation

Peer-peer and Applicat ion-level Net working CS 218 Fall 2003 Mult icast Overlays P2P applicat ions Napst er, Gnut ella, Robust Overlay Net works Dist ribut ed Hash Tables (DHT) Chord CAN Much of t his mat erial comes f rom UMASS class


slide-1
SLIDE 1

Peer-peer and Applicat ion-level Net working CS 218 Fall 2003

Mult icast Overlays P2P applicat ions Napst er, Gnut ella, Robust Overlay Net works Dist ribut ed Hash Tables (DHT) Chord CAN Much of t his mat erial comes f rom UMASS class slides

slide-2
SLIDE 2

Resilient Overlay Net works

Overlay net work:

applicat ions, running at various sit es creat e “logical” links (e.g., TCP

  • r UDP

connect ions) pairwise bet ween each ot her

each logical link: mult iple physical links, rout ing

def ined by nat ive I nt ernet rout ing

let ’s look at an example:

slide-3
SLIDE 3

I nt ernet Rout ing

BGP def ines rout es bet ween st ub net works

UCLA Noho.net Berkeley.net UMass.net I nt ernet 2 Mediaone C&W

slide-4
SLIDE 4

I nt ernet Rout ing

BGP def ines rout es bet ween st ub net works

UCLA Noho.net Berkeley.net UMass.net I nt ernet 2 Mediaone C&W

Noho-t o-UMass

slide-5
SLIDE 5

I nt ernet Rout ing

BGP def ines rout es bet ween st ub net works

UCLA Noho.net Berkeley.net UMass.net I nt ernet 2 Mediaone C&W

Noho-t o-Berkeley

slide-6
SLIDE 6

I nt ernet Rout ing

Congest ion or f ailure: Noho t o Berkely BGP- det ermined rout e may not change (or will change slowly)

UCLA Noho.net Berkeley.net UMass.net I nt ernet 2 Mediaone C&W

Noho-t o-Berkeley

slide-7
SLIDE 7

I nt ernet Rout ing

Congest ion or f ailure: Noho t o Berkely BGP- det ermined rout e may not change (or will change slowly)

UCLA Noho.net Berkeley.net UMass.net I nt ernet 2 Mediaone C&W

Noho-t o-Berkeley Noho t o UMass t o Berkeley

rout e not visible or

available via BGP!

MediaOne can’t rout e t o

Berkeley via I nt ernet 2

slide-8
SLIDE 8

RON: Resilient Overlay Net works

Premise: by building applicat ion overlay net work, can increase perf ormance, reliabilit y of rout ing

Two-hop (applicat ion-level) noho-t o-Berkeley rout e applicat ion-layer rout er

slide-9
SLIDE 9

RON Experiment s

Measure loss, lat ency, and t hroughput wit h and

wit hout RON

13 host s in t he US and Europe 3 days of measurement s f rom dat a collect ed in

March 2001

30-minut e average loss rat es

A 30 minut e out age is very serious!

Not e: Experiment s done wit h “No-I nt ernet 2-f or-

commercial-use” policy

slide-10
SLIDE 10

An or der-of -magnit ude f ewer f ailures

10 100% 14 80% 20 50% 32 30% 15 4 127 20% 47 57 479 10% RON Worse No Change RON Bet t er Loss Rat e

30-minute average loss rates

6,825 “path hours” represented here 12 “path hours” of essentially complete outage 76 “path hours” of TCP outage RON routed around all of these! One indirection hop provides almost all the benefit! 6,825 “path hours” represented here 12 “path hours” of essentially complete outage 76 “path hours” of TCP outage RON routed around all of these! One indirection hop provides almost all the benefit!

slide-11
SLIDE 11

RON Research I ssues

  • How t o design overlay net works?
  • Measur ement and self -conf igur at ion
  • Under st anding per f or mance of under lying net .
  • Fast f ail-over.
  • Sophist icat ed met r ics.
  • applicat ion-sensit ive (e.g., delay ver sus t hr oughput ) pat h

select ion.

  • Ef f ect of RON on underlying net work
  • I f ever yone does RON, ar e we bet t er of f ?