Codes Can Reduce Queueing Delay in Data Centers

Details Codes Can Reduce Queueing Delay in Data Centers Codes Can Reduce Queueing Delay in Data Centers

2012-02-07

arxiv.org/abs/1202.1359v1

Mathematics

Optimization and Control

Scientific paper

In this paper, we quantify how much codes can reduce the data retrieval latency in storage systems. By combining a simple linear code with a novel request scheduling algorithm, which we call Blocking-one Scheduling (BoS), we show analytically that it is possible to reduce data retrieval delay by up to 17% over currently popular replication-based strategies. Although in this work we focus on a simplified setting where the storage system stores a single content, the methodology developed can be applied to more general settings with multiple contents. The results also offer insightful guidance to the design of storage systems in data centers and content distribution networks.

Affiliated with

Also associated with

No associations

Rating

Codes Can Reduce Queueing Delay in Data Centers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Codes Can Reduce Queueing Delay in Data Centers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Codes Can Reduce Queueing Delay in Data Centers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578928