Download now Free registration required
This paper proposes polling based scheduling algorithms for TCP based applications in multipoint-to-point WiMAX networks. The first proposed scheduling algorithm uses TCP Congestion Window (cwnd) size, whereas the second one uses cwnd size and TCP timeouts to allocate time slots among the contending TCP flows. The authors ensure fairness among the users by using a credit based approach in which the user which misses the chance to transmit due to bad channel condition gets more weightage when its channel condition favors scheduling. The paper also proposes a method to compute an optimal polling interval in terms of slot use and TCP throughput due to congestion window dropping as a result of TCP timeouts.
- Format: PDF
- Size: 233.9 KB