DOC PREVIEW
Berkeley ELENG 122 - Networks and Protocols

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

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

Unformatted text preview:

11Networks and ProtocolsEE 122: Intro to Communication NetworksFall 2006 (MW 4-5:30 in Donner 155)Vern PaxsonTAs: Dilip Antony Joseph and Sukun Kimhttp://inst.eecs.berkeley.edu/~ee122/Materials with thanks to Jennifer Rexford, Ion Stoica,and colleagues at Princeton and UC Berkeley2Some Questions & Answers• Q: Will there be reserved Lab times?A: We asked for these, but the scheduling folks areresisting.• Q: Can we do the projects in groups?A: The first two projects are to be done individually.We haven’t yet decided about the third project.• Q: What about the scheduling conflict with thefinals for CS 162 and CS 194?A: The instructors are aware of these and aretrying to work out a general solution. If need be,we will have an alternative time for those students.3Goals for Today’s Class• Type of Networks– And the key concept of multiplexing• What’s a Protocol?• Clients & Servers & Peer-to-Peer (time permitting)4• Communication networks can be classified based onthe way in which the nodes exchange information:Taxonomy of Communication NetworksCo m m u nic at ionNe t wo rk5• Communication networks can be classified based onthe way in which the nodes exchange information:Taxonomy of Communication NetworksCo m m u nic at ionNe t wo rkBro a dca s tCo m m u nic at ionNe t wo rk6• Information transmitted by any node isreceived by every other node in the network– Examples?– Usually in LANs (Local Area Networks) E.g., Ethernet, WiFi E.g., lecture!• What problems does this raise?• Problem #1: limited range.• Problem #2: coordinating access to the sharedcommunication medium (Multiple AccessProblem)Broadcast Communication Networks27• Communication networks can be classified based onthe way in which the nodes exchange information:Taxonomy of Communication NetworksCo m m u nic at ionNe t wo rkSwit c he dCo m m u nic at ionNe t wo rkBro a dca s tCo m m u nic at ionNe t wo rk8• Information transmitted along a path ofintermediary nodes (“switches” or “routers”)• Basic issue: how the switches figure out thenext hop along the path• Example and properties of a global switchedcommunication network that you and millionsof others use every day?• Another example?Switched Communication Networks9• Communication networks can be classified based onthe way in which the nodes exchange information:Taxonomy of Communication NetworksCo m m u nic at ionNe t wo rkSwit c he dCo m m u nic at ionNe t wo rkBro a dca s tCo m m u nic at ionNe t wo rkCirc u it -Swit c h e dCo m m u nic at ionNe t wo rk10Circuit Switching (e.g., Phone Network)• Establish: source creates circuit to destination– Node along the path store connection info– Nodes generally reserve resources for the connection– If circuit not available: “Busy signal”• Transfer: source sends data over the circuit– No destination address, since nodes know path• Teardown: source tears down circuit when done11Circuit Switching• Node (switch) in a circuit switching networkincoming links outgoing linksNodeHow does the node connect the incoming link tothe outgoing?Telephone Network• Alexander Graham Bell– 1876: Demonstrates the telephone at USCentenary Exhibition in Philadelphia313Circuit Switching With Human OperatorTelephone Network• Almon Brown Strowger (1839 - 1902)– 1889: Invents the “girl-less, cuss-less” telephone system-- the mechanical switching system15Timing in Circuit SwitchingHost 1 Host 2Switch 1 Switch 2time16Timing in Circuit SwitchingCircuit Establishment Host 1 Host 2Switch 1 Switch 2propagation delay between Host 1 and Switch1time17Timing in Circuit SwitchingCircuit Establishment Host 1 Host 2Switch 1 Switch 2propagation delay between Host 1 and Switch1Transmission delaytime18Timing in Circuit SwitchingCircuit Establishment Host 1 Host 2Switch 1 Switch 2propagation delay between Host 1 and Switch1Transmission delaytime419Timing in Circuit SwitchingCircuit Establishment Host 1 Host 2Switch 1 Switch 2propagation delay between Host 1 and Switch1propagation delay between Host 1 and Host 2Transmission delaytime20Timing in Circuit SwitchingInformationCircuit Establishment Transfer Host 1 Host 2Switch 1 Switch 2propagation delay between Host 1 and Switch1propagation delay between Host 1 and Host 2Transmission delaytime21Timing in Circuit SwitchingInformationCircuit Establishment Transfer Circuit Teardown Host 1 Host 2Switch 1 Switch 2propagation delay between Host 1 and Switch1propagation delay between Host 1 and Host 2Transmission delaytime22Circuit Switching• Node (switch) in a circuit switching networkincoming links outgoing linksNodeHow do the black and orange circuits share theoutgoing link?23Circuit Switching: Multiplexing a Link• Time-division– Each circuit allocatedcertain time slots• Frequency-division– Each circuit allocatedcertain frequenciestimefrequencytime24Time-Division Multiplexing/Demultiplexing• Time divided into frames; frames into slots• Relative slot position inside a frame determines to whichconversation data belongs– E.g., slot 0 belongs to orange conversation• Requires synchronization between sender andreceiver—surprisingly difficult!• In case of non-permanent conversations– Need to dynamically bind a slot to a conversation– How to do this?• If a conversation does not use its circuit the capacity is lost!Frames0 1 2 3 4 5 0 1 2 3 4 5Slots =525• Communication networks can be classified based onthe way in which the nodes exchange information:Taxonomy of Communication NetworksCo m m u nic at ionNe t wo rkSwit c he dCo m m u nic at ionNe t wo rkBro a dca s tCo m m u nic at ionNe t wo rkCirc u it -Swit c h e dCo m m u nic at ionNe t wo rkPa c ke t -Swit che dCo m m u nic at ionNe t wo rk26Packet Switching• Data sent as chunks of formatted bit-sequences (Packets)• Packets have following structure: Header and Trailer carry control information(e.g., destination address, checksum)• Each packet traverses the network from node to nodealong some path (Routing)• Once a node receives the entire packet, it stores it (briefly)and then forwards it to the next node (Store-and-ForwardNetworks)• Typically no capacity is allocated for packetsHeader DataTrailer (sometimes)27Packet Switching• Node in a packet switching networkincoming links outgoing linksNodeMemory28Packet Switching: Multiplexing/Demultiplexing• Data from


View Full Document

Berkeley ELENG 122 - Networks and Protocols

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 Networks and Protocols
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 Networks and Protocols 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 Networks and Protocols 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?