Best-effort versus reservations revisited

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we walk in the footsteps of the stimulating paper by Lee Breslau and Scott Shenker entitled "Best-effort vs. Reservations: A Simple Comparative Analysis"[1]. In fact, we finally follow their invitation to use their models as a starting point and extend them to reason about the very basic but still very much debated architectural issue whether quality of service (QoS) mechanisms like admission control and service differentiation are necessary or if overprovisioning with a single service class does the job just as well at lower system complexity. We analytically compare two QoS systems: a QoS system using admission control and a reservation mechanism that can guarantee bandwidth for flows respectively offers service differentiation based on priority queueing for two service classes and a system with no admission control and a single best-effort service class. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Heckmann, O., & Schmitt, J. B. (2005). Best-effort versus reservations revisited. In Lecture Notes in Computer Science (Vol. 3552, pp. 151–163). Springer Verlag. https://doi.org/10.1007/11499169_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free