Homework2_Fall_2010_solutions

Homework2_Fall_2010_solutions - CS 132 Discussion HW2...

Info iconThis preview shows pages 1–16. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 132 Discussion HW2 solutions
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 2 ICS 132 #1,2 The MAC sublayer is only used in broadcast or shared channel networks. True or False (MAC layer slides, p4) IEEE 802.3 defines Token Ring protocols. True or False (MAC layer slides, p3)
Background image of page 2
School of ICS, UC Irvine 3 ICS 132 #3 LLC stands for __ Logical Link Control P5, MAC notes
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 4 ICS 132
Background image of page 4
School of ICS, UC Irvine 5 ICS 132 #4 Discuss the differences between the 3 access protocols (Fixed Assignment, Demand Assignment, and Contention Access) under the MAC sublayer P7, 8, 20 MAC slides
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 6 ICS 132 #4 cont’d Fixed Assignment Predetermined channel access Wasteful if idle Demand Assignment Access based on demand Requires method to measure demand Polling, reservation schemes, token passing
Background image of page 6
School of ICS, UC Irvine 7 ICS 132 #4 cont’d Contention Access No coordination between hosts Distributed control
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 8 ICS 132 #5 Discuss the functionalities of the 3 demand assignment protocols: Polling, Reservation Scheme, and Token passing scheme. P9, 10, 28 MAC slides
Background image of page 8
School of ICS, UC Irvine 9 ICS 132 #5 cont’d Polling A central controller interrogates each host and allocates channel capacity to those who need it Reservation Schemes Hosts independently reserve channel for a period of time Reservations piggybacked on data messages Eg. Bit-map protocol, binary countdown protocol
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 10 ICS 132 #5 cont’d Token passing scheme Token circulates around a ring net Grab when need to send Discuss it in more detail later.
Background image of page 10
School of ICS, UC Irvine 11 ICS 132 #6 Discuss how the TDMA protocol works. Create an example transmission sequence and explain how TDMA would allocate the channel for each transmission. Works like any fixed assignment protocol time 1 2 3 4 1 2 host
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 12 ICS 132 #6 cont’d FDMA TDMA sender A sender B sender C t sender A sender B sender C t Fixed frequency Fixed time slot Frequency
Background image of page 12
School of ICS, UC Irvine 13 ICS 132 #7 Discuss how Bit-map protocol and binary countdown protocol work. Create an example transmission sequence and explain how the two protocols work. P12-17, MAC layer notes
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 14 ICS 132 #7 cont’d Bit-map Protocol Contention and data transmission periods alternate The contention period is divided into slots, with 1 bit- wide slot for each host in the network. Set desired action during contention period Send data during data transmission period 1 1 1 1 1 1 2 4 5 6 01234567 01234567 0 4 data frame
Background image of page 14
School of ICS, UC Irvine 15 ICS 132 #7 cont’d Binary Countdown Protocol During contention period, each host broadcasts its binary address one bit at a time, starting with the most significant bit bits transmitted simultaneously are boolean OR’d together Arbitration rule: If a host sent a zero bit but the boolean OR results in a one
Background image of page 15

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 16
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 101

Homework2_Fall_2010_solutions - CS 132 Discussion HW2...

This preview shows document pages 1 - 16. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online