DOC PREVIEW
Berkeley ELENG 122 - Overlay Networks

This preview shows page 1-2-3 out of 9 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 9 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 9 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 9 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 9 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

1    Department of Electrical Engineering and Computer SciencesUniversity of CaliforniaBerkeley  !"  #$# $!$ #%&  A network defined over another set of networksThe overlay addresses its own nodesLinks on one layer are network segments of lower layersRequires lower layer routing to be utilizedOverlaying mechanism is called tunnelingA’' !$ $ (AA  !"  #$# $!$ #%&   $ )$*+3121210131167854ABCOverlay Network Nodes  !"  #$# $!$ #%&  , $ )$*+3121210131167854ABC Overlay Networks are extremely popular MBONE, Akamai, Virtual Private Networks, Napster, Gnutella Overlay Networks may even peer!  !"  #$# $!$ #%&  - $ )$*.$3121210131167854  !"  #$# $!$ #%&  /0  !  13121210131167854abdcATM links can be the “physical layer” for IP2  !"  #$# $!$ #%&  20  !  3121210131167854abdcVirtual Circuit under Datagram!  !"  #$# $!$ #%&  UnderlyingNetwork"$*$!    !"  #$# $!$ #%&  3UnderlyingNetwork"$*$!  The underlying network induces a complete graph of connectivityNo routing required!  !"  #$# $!$ #%&  "$*$!  The underlying network induces a complete graph of connectivityNo routing required!ButOne virtual hop may be many underlying hops away. Latency and cost vary significantly over the virtual linksState information may grow with E (n^2)101002001009010010102090  !"  #$# $!$ #%&  UnderlyingNetwork"$*0 The underlying network induces a complete graph of connectivityNo routing required!ButOne virtual hop may be many underlying hops away. Latency and cost vary significantly over the virtual linksState information may grow with E (n^2)  !"  #$# $!$ #%&  "$*0 25431The underlying network induces a complete graph of connectivityNo routing required!ButOne virtual hop may be many underlying hops away. Latency and cost vary significantly over the virtual linksState information may grow with E (n^2)3  !"  #$# $!$ #%&  " $*! *! $# $*$ 25431Message from 4 1  !"  #$# $!$ #%&  ," $*! *! $# $*$ 25431 25431Message from 4 14 3 2 14 1 3 1 5 2 5 1Extreme Inefficiencies Possible  !"  #$# $!$ #%&  -"$*0 25431The underlying network induces a complete graph of connectivityNo routing required!ButOne virtual hop may be many underlying hops away. Latency and cost vary significantly over the virtual linksState information may grow with E (n^2)At any given time, the overlay network picks a connected sub-graph based on nearest neighborsHow often can varyAlso, structured (Chord) v/sunstructured (Gnutella)  !"  #$# $!$ #%&  /$# 4564 a) Physical Topologyb) Naive unicast transmissionc) IP multicastd) Application level multicastFrom “Computer Networks”, by Peterson & Davie  !"  #$# $!$ #%&  2 Three kinds of Overlays1.Only Hosts: Peer to Peer Networks (P2P)Example: Gnutella, Napster2.Only Gateway nodes: Infrastructure OverlaysContent Distribution Networks (CDNs)Example: Akamai3.Host and Gateway Nodes: Virtual Private Networks Overlay


View Full Document

Berkeley ELENG 122 - Overlay Networks

Documents in this Course
Lecture 6

Lecture 6

22 pages

Wireless

Wireless

16 pages

Links

Links

21 pages

Ethernet

Ethernet

10 pages

routing

routing

11 pages

Links

Links

7 pages

Switches

Switches

30 pages

Multicast

Multicast

36 pages

Switches

Switches

18 pages

Security

Security

16 pages

Switches

Switches

18 pages

Lecture 1

Lecture 1

56 pages

OPNET

OPNET

5 pages

Lecture 4

Lecture 4

16 pages

Ethernet

Ethernet

65 pages

Models

Models

30 pages

TCP

TCP

16 pages

Wireless

Wireless

48 pages

Load more
Download Overlay Networks
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 Overlay Networks 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 Overlay Networks 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?