Interposed proportional sharing for a storage service utility

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 ...

• Type: Conference
• Year: 2004
• Where: SIGMETRICS
• Authors: Wei Jin, Jeffrey S. Chase, Jasleen Kaur
• Keywords: Request flows, Scheduling Algorithms, Share-based Scheduling Algorithms, SIGMETRICS 2004