4-randomization.ppt

3. Randomization randomization used in many protocols we’ll study examples: Ethernet multiple access protocol avoiding (unwanted) synchronization active queue management BitTorrent load balancing power of two (random) choices: load balancing randomized two-hop routing Ethernet single shared broadcast channel 2+ simultaneous transmissions by nodes: interference only one node can send successfully at a time multiple access protocol: distributed algorithm that determines how nodes share channel, i.e., determine when node can transmit Ethernet: uses CSMA/CD A: sense channel, if idle then { transmit and monitor channel; If detect another transmission then { abort and send jam signal; update # collisions; delay as required by exponential backoff algorithm; goto A } else {done with frame; set collisions to zero} } else {wait until ongoing transmission over, goto A} Ethernet’s CSMA/CD (more) Exponential Backoff: first collision for given packet: choose K randomly from {0,1}; delay is K x 512 bit transmission times after second collision: choose K randomly from {0,1,2,3}… after next collision double K (and keep doubling on collisions until…..) after ten or more collisions, choose K randomly from {0,1,2,3,4,…,1023} Ethernet’s use of randomization resulting behavior: probability of retransmission attempt (equivalently length of randomization interval) adapted to current load simple, load-adaptive, multiple access Ethernet comments upper bounding at 1023 = k limits max size could remember last value of K when we were successful (analogy: TCP remembers last values of congestion window size) Q: why use binary backoff rather than something more sophisticated such as TCP’s AIMD: simplicity note: Ethernet does multiplicative-increase-complete-decrease Analyzing the CSMA/CD Protocol Goal: quantitative understanding of performance of CSMA protocol fixed length pkts pkt transmission time is unit of time throughput S - number of pkts successfully (wit