1 / 11

Fundamentals of Computer Networks ECE 478/578

Fundamentals of Computer Networks ECE 478/578. Lecture #9: Collision Resolution and Collision Free Protocols Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University of Arizona. Collision Resolution Protocols. Assume collision between only two packets

newton
Download Presentation

Fundamentals of Computer Networks ECE 478/578

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Fundamentals of Computer NetworksECE 478/578 Lecture #9: Collision Resolution and Collision Free Protocols Instructor: LoukasLazos Dept of Electrical and Computer Engineering University of Arizona

  2. Collision Resolution Protocols Assume collision between only two packets All new arrivals defer from transmission Node transmits at the next slot with prob ½ Let X denote the # of slots req to resolve collision Throughput = 2/3

  3. Tree Splitting Algorithm Set S collision Resolution of collision of three stations idle L R collision LL LR collision success collision LRL LRR idle LRRL LRRR success success New arrivals accumulate during contention period Throughput approx 0.43 p/s (need 43 slots for 10 packets)

  4. Improvements Set S collision idle Two collisions in a row, R must have a small number of packets Incorporate to new arrivals L R collision LL LR collision success Guaranteed to have a collision here collision LRL LRR idle LRRL LRRR success success

  5. First Come First Serve Splitting allocation waiting current time Split right away two collisions waiting k allocation current time k+1 allocation current time allocation k+2 current time k+3

  6. Multi-Access Reservations Idea: Use reservation (contention) slots to make reservations for later transmissions Reservations much smaller size than data Any method can be used to contend for reservation slots (or not contend)

  7. Example: Satellite Reservation System Contention lasts N slots (equal to # of stations) Station “i” transmits one bit in slot i if it has a frame to transmit After all the N slots are completed, every station knows who has frames to transmit, start data transmission in that order Example: Assume there are 8 stations Lower numbered stations have to wait for more time Efficiency d/(d + N), d = length of data frame

  8. Inefficiency of Reservation System What if the number of stations N is large? Nodes have to wait for a long time to send data Reservation period grows very large

  9. Binary Countdown Protocol Each station is assigned a binary address of bits Stations broadcast their address one bit at the time, if they have a frame to transmit Take the OR of all bits wanting to transmit (nodes know the outcome of OR based on electric property of medium) If node with higher address transmits, back off Drop off after slot 0 Drop off after slot 0 Drop off after slot 2 Winner Efficiency:

  10. (Un)Fairness of Binary Countdown Stations with highest addresses always win Good for implementing a priority scheme To make the protocol fair, addresses of hosts need to be dynamic

  11. Implementing Fairness After node A transmits, all hosts with address less than A increase their address by one Node’s A address is set to zero All nodes before A get a higher priority Round robin type of protocol

More Related