 In case of equally sized data packets, round-robin scheduling is max-min fair.Generally, policies for sharing resources that are characterized by low level of fairness (see fairness measures) provide high average throughput but low stability in the service quality, meaning that the achieved service quality is varying in time depending on the behavior of other users.If this instability is severe, it may result in unhappy users who will choose another more stable communication service.