Abstract
The problem of achieving fairness in the allocation of the bandwidth resource on a link shared by multiple flows of traffic has been extensively researched over the last decade. However, with the increasing pervasiveness of optical networking and the occasional trend toward using over-provisioning as the solution to congestion, a router’s processor also becomes a critical resource to which, ideally speaking, all competing flows should have fair access. For example, if the network is not fair in allocating processing resources, denial of service attacks based on an excessive use of the router processor (such as by using unnecessary optional headers) become possible. In this paper, we investigate the issue of achieving fairness in the joint allocation of the processing and bandwidth resources. We first present a simple but powerful general principle for defining fairness in such systems based on any of the classic notions of fairness such as max-min fairness, proportional fairness and utility max-min fairness defined for a single resource. We apply our principle to a system with a shared processor and a shared link with max-min fairness as the desired goal. We then propose a practical and provably fair packet-by-packet algorithm for the joint allocation of processing and bandwidth resources. We demonstrate the fairness achieved by our algorithm through simulation results using real gateway traffic traces. The principles and the algorithm detailed in this paper may also be applied in the allocation of other kinds of resources such as power, a critical resource in mobile systems.
This work was supported in part by NSF CAREER Award CCR-9984161 and U.S. Air Force Contract F30602-00-2-0501.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bertsekas, D.P., Gallager, R.: Data Networks. 2nd edn. Prentice Hall, Upper Saddle River, NJ (1991)
Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. In: Proc. ACM SIGCOMM, Austin, TX (1989) 1–12
Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated service networks — the single node case. In: Proc. IEEE INFOCOM, Florence, Italy (1992) 915–924
Keshav, S.: An Engineering Approach to Computer Networking: ATM Network, the Internet, and the Telephone Network. Addison-Wesley, Reading, MA (1997)
Kelly, F.: Charging and rate control for elastic traffic. Europ. Trans. Telecom. 8 (1997) 33–37
Cao, Z., Zegura, E.W.: Utility max-min: An application-oriented bandwidth allocation scheme. In: Proc. IEEE INFOCOM, New York, NY (1999) 793–801
Kleinrock, L.: Queueing System. Volume 2, Computer Applications. Wiley, New York, NY (1976)
Golestani, S.J.: A self-clocked fair queueing scheme for broadband applications. In: Proc. IEEE INFOCOM, Toronto, Canada (1994) 636–646
Shreedhar, M., Varghese, G.: Efficient fair queuing using deficit round-robin. IEEE/ACM Trans. Networking 4 (1996) 375–385
Bennett, J.C.R., Zhang, H.: WF2Q: Worst-case fair weighted fair queueing. In: Proc. IEEE INFOCOM, San Francisco, CA (1996) 120–128
Kanhere, S.S., Sethu, H., Parekh, A.B.: Fair and efficient packet scheduling using elastic round robin. IEEE Trans. Parall. Distr. Syst. 13 (2002) 324–336
Blanquer, J.M., Özden, B.: Fair queuing for aggregated multiple links. In: Proc. ACM SIGCOMM, San Diego, CA (2001) 189–197
Mochalski, K., Micheel, J., Donnelly, S.: Packet delay and loss at the Auckland Internet access path. In: Proc. Passive Active Measure. Workshop, Fort Collins, CO (2002)
Raghunathan, V., Ganeriwal, S., Schurgers, C., Srivastava, M.: E2WFQ: An energy efficient fair scheduling policy for wireless systems. In: Proc. Int. Symp. Low Power Electr. Design, Monterey, CA (2002) 30–35
Zhou, Y., Sethu, H.: Toward end-to-end fairness: A framework for the allocation of multiple prioritized resources. In: Proc. IEEE Perf. Comput. Commun. Conf., Phoenix, AZ (2003)
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services. (1998) IETF RFC 2475, http://www.ietf.org/rfc/rfc2475.txt
Lu, S., Bhargavan, V., Srikant, R.: Fair scheduling in wireless packet networks. IEEE/ACM Trans. Networking 7 (1999) 473–489
WAND Research Group: Auckland-VI trace data. http://pma.nlanr.net/Traces/long
Lu, S., Bharghavan, V., Srikant, R.: Fair scheduling in wireless packet networks. In: Proc. ACM SIGCOMM, Cannes, France (1997) 63–74
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, Y., Sethu, H. (2003). On Achieving Fairness in the Joint Allocation of Processing and Bandwidth Resources. In: Jeffay, K., Stoica, I., Wehrle, K. (eds) Quality of Service — IWQoS 2003. IWQoS 2003. Lecture Notes in Computer Science, vol 2707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44884-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-44884-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40281-7
Online ISBN: 978-3-540-44884-6
eBook Packages: Springer Book Archive