DOC PREVIEW
Berkeley ELENG 122 - Multiaccess Protocols

This preview shows page 1-2-3-19-20-39-40-41 out of 41 pages.

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

Unformatted text preview:

EECS 122: Introduction to Computer Networks Multiaccess ProtocolsISO OSI Reference Model for LayersUp Until Now...This LectureMedium Access ProtocolsProblem StatementWhat Layer?Focus of LectureWhere it all Started: AlohaNetAloha Transmission StrategySimple, but Radical in Concept!Why Better than Time Slot Schemes?Variation: Slotted AlohaPerformance of Slotted AlohaEfficiency of Slotted AlohaEthernetCSMA and CSMA/CDCSMA: Carrier Sense Multiple AccessCSMA collisionsCSMA/CD (Collision Detection)CSMA/CD Collision DetectionEthernet Frame StructureEthernet Frame Structure (more)Ethernet’s CSMA/CDEthernet’s CSMA/CD (more)Next Few SlidesMinimum Packet SizeMinimum Packet Size (more)Ethernet Technologies: 10Base210BaseT and 100BaseT10BaseT and 100BaseT (more)GigaBit EthernetInterconnecting LANsEthernet vs 802.11802.11Physical LinkCollision Avoidance: The ProblemsMultiple Access with Collision Avoidance (MACA)Other NodesSummaryWhat You Need to KnowKatz, Stoica F04EECS 122: Introduction to Computer Networks Multiaccess ProtocolsComputer Science DivisionDepartment of Electrical Engineering and Computer SciencesUniversity of California, BerkeleyBerkeley, CA 94720-17762Katz, Stoica F04ISO OSI Reference Model for LayersApplicationPresentationSessionTransportNetworkDatalinkPhysicalService: -Framing (attach frame separators) -Send data frames between peers-Others:•Arbitrate the access to common physical media•Per-hop reliable transmission•Per-hop flow controlMedia Access3Katz, Stoica F04Up Until Now...Short-term contention is lossless: just wait-Main resource (link bandwidth) is controlled by router-Router deals with short-term contention by queueing packets-Switch algorithms and router buffers ensure no packets are dropped due to short-term contentionHave focused on managing long-term contention-Queueing schemes (FQ, FIFO, RED, etc.)-End-to-end congestion control (TCP)4Katz, Stoica F04This LectureShort-term contention for media yields losses!Focus on networking over shared media-Ethernet-Short-range radio (e.g., wireless LANs)-Long-range radio (e.g., packet radio, satellite)AKA “multiple-access” problem-Don’t go through central router to get access to link-Instead, multiple users can access shared medium5Katz, Stoica F04Medium Access ProtocolsChannel partitioning-Divide channel into smaller “pieces” (e.g., time slots, frequency, code selection)-Allocate a piece to given node for exclusive useRandom access-Allow collisions-“Recover” from collisions“Taking-turns”-Tightly coordinate shared access to avoid collisions6Katz, Stoica F04Problem StatementManaging shared media-If two users send at the same time, collision results in no packet being received (e.g., interference)-If no users send, channel goes idle-Thus, want to have only one user send at a timeAchieve high network utilization-TDMA doesn’t give high utilizationBut also use a simple distributed algorithm-No fancy token-passing schemes to avoid collisions7Katz, Stoica F04What Layer?Where should short-term contention be handled?Network layer?Application layer?Link layer?8Katz, Stoica F04Focus of LectureUnderstanding basic algorithmic choicesSimple performance analysisWill not stress the practical details-Framing, packet formats, etc.9Katz, Stoica F04Where it all Started:AlohaNetNorm Abramson left Stanford in search of surfingSet up first radio-based data communication system connecting the Hawaiian islands-Hub at Alohanet HQ (Univ. Hawaii, Oahu)-Other sites spread among the islandsHad two radio channels:-Random access: sites sent data on this channel-Broadcast: only used by hub to rebroadcast incoming data10Katz, Stoica F04Aloha Transmission StrategyWhen new data arrived at site, send to hub for transmissionSite listened to broadcast channel-If it heard data repeated, knew transmission was rec’d-If it didn’t hear data correctly, it assumed a collisionIf collision, site waited random delay before retransmitting11Katz, Stoica F04Simple, but Radical in Concept!Aloha is to multiple access what Internet is to telephony, i.e., revolutionary!Previous attempts all partitioned channel-TDMA, FDMA, CDMA, etc.Aloha optimized the common case (few senders) and dealt with collisions through retries-Sound familiar?12Katz, Stoica F04Why Better thanTime Slot Schemes?In TDMA, you have to wait your turn-Delay proportional to number of participating sitesIn Aloha, can send immediatelyAloha gives much lower delays, at the price of lower utilization (as we will see)13Katz, Stoica F04Variation: Slotted AlohaDivide time into slots-Requires some way to synchronize geographically distributed sites (non-trivial problem!)Contend for transmission only at the beginning of slots, never in the middle of slotsEffect is to decreases chance of “partial collisions”14Katz, Stoica F04Performance of Slotted AlohaTime is divided into equal size slots (packet transmission time)Node with new arriving packet: transmit at beginning of next slot If collision: retransmit packet in future slots with probability p, until successful.Success (S), Collision (C), Empty (E) slots15Katz, Stoica F04Efficiency of Slotted AlohaWhat is the maximum fraction of successful transmissions? Suppose N stations have packets to send-Each transmits in slot with probability p-Probability of successful transmission S is(very approximate analysis!): by a particular node i: Si = p (1-p)(N-1)by exactly one of N nodesS = Prob (only one transmits) = N p (1-p)(N-1) <= 1/e = 0.37but must have p proportional to 1/N16Katz, Stoica F04EthernetBob Metcalfe, Xerox PARC, visits Hawaii and gets an idea!Shared medium (coax cable)Can “sense” carrier to see if other nodes are broadcasting at the same time-Sensing is subject to time-lag-Only detect those sending a short while beforeMonitor channel to detect collisions-Once sending, can tell if anyone else is sending too17Katz, Stoica F04CSMA and CSMA/CDCarrier sense multiple access: CSMA-Listen before you start sendingCSMA with collision detect: CSMA/CD-Stop sending when you detect another station is sending18Katz, Stoica F04CSMA: Carrier Sense Multiple AccessCS (Carrier Sense) implies 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•Various retry


View Full Document

Berkeley ELENG 122 - Multiaccess 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 Multiaccess 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 Multiaccess 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 Multiaccess 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?