DOC PREVIEW
Berkeley ELENG 122 - Lecture 6

This preview shows page 1-2-21-22 out of 22 pages.

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

Unformatted text preview:

EE 122: Lecture 6High Level ViewMedium Access ProtocolsRandom Access protocolsSlotted AlohaSlotted Aloha EfficiencyCSMA: Carrier Sense Multiple AccessCSMA collisionsCSMA/CD (Collision Detection)CSMA/CD collision detectionEthernetEthernet Frame StructureEthernet Frame Structure (more)Ethernet’s CSMA/CDEthernet’s CSMA/CD (more)Minimum Packet SizeMinimum Packet Size (more)Ethernet Technologies: 10Base210BaseT and 100BaseT10BaseT and 100BaseT (more)Gbit EthernetInterconnecting LANsEE 122: Lecture 6Ion [email protected] 13, 2001(* this talk is based in part on the on-line slides of J. Kurose & K. Rose)[email protected] 2High Level ViewGoal: share a communication medium among multiple hosts connected to itProblem: arbitrate between connected hostsSolution goals:-High resource utilization-Avoid starvation-Simplicity (non-decentralized algorithms)[email protected] 3Medium Access ProtocolsChannel partitioning-Divide channel into smaller “pieces” (time slots, frequency)-Allocate piece to node for exclusive useRandom access-Allow collisions-“recover” from collisions“Taking-turns”-Tightly coordinate shared access to avoid [email protected] 4Random Access protocolsWhen node has packet to send-transmit at full channel data rate R.-no a priori coordination among nodesTwo or more transmitting nodes -> “collision”,Random access MAC protocol specifies: -how to detect collisions-how to recover from collisionsExamples of random access MAC protocols:-slotted ALOHA-CSMA and CSMA/[email protected] 5Slotted AlohaTime is divided into equal size slots (= packet transmission time)Node with new arriving pkt: transmit at beginning of next slot If collision: retransmit pkt in future slots with probability p, until successful.Success (S), Collision (C), Empty (E) [email protected] 6Slotted Aloha EfficiencyWhat is the maximum fraction of successful transmissions? Suppose N stations have packets to send-each transmits in slot with probability p-prob. successful transmission S is: by a single node: S = p (1-p)(N-1) by any of N nodes S = Prob (only one transmits) = N p (1-p)(N-1) <= 1/e = [email protected] 7CSMA: Carrier Sense Multiple AccessCS (Carrier Sense) means that each node can distinguish between an idle and a busy linkSender operations:-If channel sensed idle: transmit entire packet-If channel sensed busy, defer transmission •Persistent CSMA: retry immediately with probability p when channel becomes idle•Non-persistent CSMA: retry after a random time [email protected] 8CSMA collisionsCollisions can occur:propagation delay means two nodes may not hear each other’s transmissionCollision:entire packet transmission time wastedspatial layout of nodes along ethernetNote:role of distance and propagation delay in determining collision [email protected] 9CSMA/CD (Collision Detection)Collisions detected within short timeColliding transmissions aborted, reducing channel wastage Easy in wired LANs: measure signal strengths, compare transmitted, received signalsDifficult in wireless LANs: receiver shut off while [email protected] 10CSMA/CD collision [email protected] 11EthernetDominant LAN technologyCSMA/CD protocolCheap $20 for [email protected] 12Ethernet Frame StructureSending adapter encapsulates IP datagramPreamble: -7 bytes with pattern 10101010 followed by one byte with pattern 10101011-Used to synchronize receiver, sender clock [email protected] 13Ethernet Frame Structure (more)Addresses: 6 bytes, frame is received by all adapters on a LAN and dropped if address does not matchType: 2 bytes, indicates the higher layer protocol-E.g., IP, Novell IPX, AppleTalkCRC: 4 bytes, checked at receiver, if error is detected, the frame is simply droppedData payload: maximum 1500 bytes, minimum 46 [email protected] 14Ethernet’s CSMA/CDSense channel, if idle-If detect another transmission•Abort, send jam signal•Delay, and try again-Else•Send frameReceiver accepts:-Frames addresses to its own address-Frames addressed to the broadcast address (broadcast)-Frames addressed to a multicast address, if it was instructed to listen to that address-All frames (promiscuous mode)[email protected] 15Ethernet’s CSMA/CD (more)Jam signal: make sure all other transmitters are aware of collision; 48 bits; Exponential back-off-Goal: adapt retransmission attempts to estimated current load-Heavy load: random wait will be longer-First collision: choose K from {0,1}; delay is K x 512 bit transmission times-After second collision: choose K from {0,1,2,3}…-After ten or more collisions, choose K from {0,1,2,3,4,…,1023}[email protected] 16Minimum Packet SizeWhy put a minimum packet size?Give a host enough time to detect collisionsIn Ethernet, minimum packet size = 64 bytes (two 6-byte addresses, 2-byte type, 4-byte CRC, and 46 bytes of data)If host has less than 46 bytes to send, the adaptor pads (adds) bytes to make it 46 bytesWhat is the relationship between minimum packet size and the length of the [email protected] 17Minimum Packet Size (more)propagation delay (d)a) Time = t; Host 1 starts to send frameHost 1 Host 2propagation delay (d)Host 1 Host 2b) Time = t + d; Host 2 starts to send a frame just before it hears fromhost 1’s framepropagation delay (d)Host 1 Host 2c) Time = t + 2*d; Host 1 hears Host 2’s frame detects collisionLAN length = (min_frame_size)*(light_speed)/(2*bandwidth) = = (8*64b)*(2.5*108mps)/(2*107 bps) = 6400m [email protected] 18Ethernet Technologies: 10Base210: 10Mbps; 2: under 200 meters max cable lengthThin coaxial cable in a bus topologyRepeaters used to connect up to multiple segmentsRepeater repeats bits it hears on one interface to its other interfaces: physical layer device [email protected] 1910BaseT and 100BaseT10/100 Mbps rate; latter called “fast ethernet”T stands for Twisted PairHub to which nodes are connected by twisted pair, thus “star topology”CSMA/CD implemented at [email protected] 2010BaseT and 100BaseT (more)Max distance from node to Hub is 100 metersHub can disconnect “jabbering adapterHub can gather monitoring information, statistics for display to LAN


View Full Document

Berkeley ELENG 122 - Lecture 6

Documents in this Course
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 Lecture 6
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 Lecture 6 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 Lecture 6 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?