 A compromise between max-min fairness and maximum throughput scheduling is proportional fairness, where the resources are divided with the goal to achieve the same cost to each user, or to minimize the maximum cost per unit that a dataflow reaches.Expensive data flows achieve lower service quality than others in proportional fairness, but do not suffer from starvation.Max-min fairness results in more stable service quality, and therefore, perhaps, more "happy customers".