Interposed proportional sharing for a storage service utility

Published

Journal Article

This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resource control makes it possible to share a server among multiple request flows with probabilistic assurance that each flow receives a specified minimum share of a server's capacity to serve requests. This assurance is important for safe outsourcing of services to shared utilities such as Storage Service Providers. Our approach interposes share-based request dispatching on the network path between the server and its clients. Two new scheduling algorithms are designed to run within an intermediary (e.g., a network switch), where they enforce fair sharing by throttling request flows and reordering requests; these algorithms are adaptations of Start-time Fair Queuing (SFQ) for servers with a configurable degree of internal concurrency. A third algorithm, Request Windows (RW), bounds the outstanding requests for each flow independently; it is amenable to a decentralized implementation, but may restrict concurrency under light load. The analysis and experimental results show that these new algorithms can enforce shares effectively when the shares are not saturated, and that they provide acceptable performance isolation under saturation. Although the evaluation uses a storage service as an example, interposed request scheduling is non-intrusive and views the server as a black box, so it is useful for complex services with no internal support for differentiated service quality.

Full Text

Duke Authors

Cited Authors

  • Jin, W; Chase, JS; Kaur, J

Published Date

  • January 1, 2004

Published In

Volume / Issue

  • 32 / 1

Start / End Page

  • 37 - 48

International Standard Serial Number (ISSN)

  • 0163-5999

Digital Object Identifier (DOI)

  • 10.1145/1012888.1005694

Citation Source

  • Scopus