DOC PREVIEW
Berkeley ELENG 122 - Introduction to Computer Networks

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

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

Unformatted text preview:

EECS 122: Introduction to Computer Networks MulticastBarriers to MulticastApplication Layer Multicast (ALM)Narada: End System MulticastAlgorithmic ChallengeAdvantages of ALMPerformance ConcernsSlide 8Single Sender MulticastExampleWhat’s Wrong with SSM?What Do You Need to Know?EECS 122: Introduction to Computer Networks DNS and WWWInternet Names & AddressesDNS: HistoryBasic DNS FeaturesNaming HierarchyHost names are administered hierarchicallyServer HierarchyDNS Name ServersDNS: Root Name ServersSimple DNS ExampleExample of Recursive DNS QueryExample of Iterated DNS QueryDNS RecordsDNS Records (cont’d)DNS as Indirection ServiceSpecial TopicsImportant Properties of DNSThe WebUniform Record LocatorWeb and DNSHyper Text Transfer ProtocolBig PictureHyper Text Transfer Protocol CommandsResponse CodesClient RequestServer ResponseExample (from Kurose and Ross)HTTP/1.0 ExampleHHTP/1.0 PerformanceHTTP/1.0 CachingWeb ProxiesHTTP/1.1 (1996)Persistent ConnectionsPipelined Requests/ResponsesWhat You Need to KnowWhat’s the Moral of this Story?Katz, Stoica F04EECS 122: Introduction to Computer Networks MulticastComputer Science DivisionDepartment of Electrical Engineering and Computer SciencesUniversity of California, BerkeleyBerkeley, CA 94720-17762Katz, Stoica F04Barriers to MulticastHard to change IP-multicast means change to IP-details of multicast were very hard to get rightNot always consistent with ISP economic model-charging done at edge, but single packet from edge can explode into millions of packets within networkTroublesome security model-Anyone can send to a group-Denial-of-service attacks on known groups3Katz, Stoica F04Application Layer Multicast (ALM)Let the hosts do all the “special” work-only require unicast from infrastructureBasic idea:-hosts do the copying of packets-set up tree between hostsExample: Narada [Yang-hua et al, 2000]-Small group sizes <= hundreds of nodes-Typical application: chat4Katz, Stoica F04Narada: End System MulticastStanfordCMUStan1Stan2Berk2“Overlay” TreeGatechBerk1BerkeleyGatechStan1Stan2CMUBerk1Berk25Katz, Stoica F04Algorithmic ChallengeChoosing replication/forwarding points among hosts-how do the hosts know about each other-and know which hosts should forward to other hosts6Katz, Stoica F04Advantages of ALMNo need for changes to IP or routersNo need for ISP cooperationEnd hosts can prevent other hosts from sendingEasy to implement reliability-use hop-by-hop retransmissions7Katz, Stoica F04Performance ConcernsStretch-ratio of latency in the overlay to latency in the underlying networkStress-number of duplicate packets sent over the same physical link8Katz, Stoica F04Performance ConcernsDuplicate Packets:Bandwidth WastageCMUStan1Stan2Berk2GatechBerk1Delay from CMU to Berk1 increasesStanfordBerkeleyGatechStan1Stan2CMUBerk1Berk29Katz, Stoica F04Single Sender MulticastMany problems with IP multicast disappear if each group is associated with a single sourceHosts joining multicast group can send join messages to source-this sets up delivery tree-no worry about “root” being in wrong placeThis solves several problems:-better security and charging model-simple algorithm10Katz, Stoica F04ExampleGroup members: M1, M2, M3sourceM1M2M3control (join) messagesdata11Katz, Stoica F04What’s Wrong with SSM?Multiple sources?-can set up group per source, or...-source can serve as relay for other sendersAlgorithm?-trivialSo, why isn’t SSM the answer?-multicast no longer serves as “rendezvous”-ok for “broadcast” apps, not good for “meeting” apps12Katz, Stoica F04What Do You Need to Know?DVRMPCBTSSMHow they compareKatz, Stoica F04EECS 122: Introduction to Computer Networks DNS and WWWComputer Science DivisionDepartment of Electrical Engineering and Computer SciencesUniversity of California, BerkeleyBerkeley, CA 94720-177614Katz, Stoica F04Internet Names & AddressesNames: e.g., ariachne.berkeley.edu-human-usable labels for machines-conforms to “organizational” structureAddresses: e.g., 169.229.131.109-router-usable labels for machines-conforms to “network” structureHow do you map from one to another?-Domain Name System (DNS)15Katz, Stoica F04DNS: HistoryInitially all host-addess mappings were in a file called hosts.txt (in /etc/hosts)-Changes were submitted to SRI by email-New versions of hosts.txt ftp’d periodically from SRI-An administrator could pick names at their discretionAs the internet grew this system broke down because:-SRI couldn’t handled the load-Names were not unique-Many hosts had inaccurate copies of hosts.txtInternet growth was threatened!-Domain Name System (DNS) was born16Katz, Stoica F04Basic DNS FeaturesHierarchical namespace-As opposed to original flat namespaceDistributed storage architecture-As opposed to centralized storage (plus replication)Client--server interaction on UDP Port 53-But can use TCP if desired17Katz, Stoica F04Naming Hierarchy“Top Level Domains” are at the topDepth of tree is arbitrary (limit 128)Domains are subtrees-E.g: .edu, berkeley.edu, eecs.berkeley.eduName collisions avoided-E.g. berkeley.edu and berkeley.com can coexist, but uniqueness is job of domainrooteducomgov milorgnet uk frberkeleymiteecssimsargusetc.18Katz, Stoica F04Host names are administered hierarchicallyrooteducomgov milorgnet uk frberkeleymiteecssimsargusrooteducomgov milorgnet uk frberkeleyeecssimsA zone corresponds to an administrative authority that is responsible for that portion of the hierarchyeecs controls names: x.eecs.berkeley.eduberkeley controls names: x.berkeley.edu and y.sims.berkeley.edu19Katz, Stoica F04Server HierarchyEach server has authority over a portion of the hierarchy-A server maintains only a subset of all namesEach server contains all the records for the hosts in its zone-might be replicated for robustnessEach server needs to know other servers that are responsible for the other portions of the hierarchy-Every server knows the root-Root server knows about all top-level domains20Katz, Stoica F04DNS Name ServersLocal name servers:-Each ISP (company) has local default name server-Host DNS query first goes to local name serverAuthoritative name servers:-For a host: stores that host’s (name, IP address)-Can perform name/address translation for that host’s name Can also do IP to name translation, but won’t discuss21Katz, Stoica F04DNS: Root Name


View Full Document

Berkeley ELENG 122 - Introduction to Computer 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 Introduction to Computer 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 Introduction to Computer 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 Introduction to Computer 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?