Maximum Throughput for CSMa The optimal value of g(n can again be obtained: g(n)≈√2月 < l+√2B Tradeoff between idle slots and time wasted on collisions High throughput when B is small Stability issues similar to aloha (less critical) Departure rate Arrival rate 入β+Maximum Throughput for CSMA • The optimal value of g(n) can again be obtained: 1 g ( n ) ≈ 2 β λ < 1 + 2 β • Tradeoff between idle slots and time wasted on collisions • High throughput when β is small • Stability issues similar to Aloha (less critical) 1-¦2 β Arrival rate Departure rate g(n) = λβ r + nq Eytan Modiano ¦2 β Slide 7