@techreport{TD:101764,
	att_abstract={{Background traffic, such as repair, rebalance, backup and recovery traffic, often has large volume and consumes significant network resources in cloud storage systems. While having each application independently schedule its own background traffic can easily generate interference among data flows, causing violation of desired QoS requirements (e.g., latency and deadline), heuristic scheduling algorithms like Earliest-Deadline-First and First-In-First-Out are not able to take into account data center constraints such network topology or data chunk placement, thus resulting in unsatisfactory performance. In this paper, we propose a new algorithm, Linear Programming for Selected Tasks (LPST), which coordinate background traffic of different jobs to meet traffic deadline and optimize system throughput. In particular, our goal is to maximize the number of background traffic flows that meet their target deadlines under bandwidth constraints in data center storage systems. Using realistic traffic trace, our simulation results show that the proposed algorithm significantly improves task processing time and the probability of meeting deadlines.}},
	att_authors={rp267p, mr047v},
	att_categories={C_NSS.4},
	att_copyright={{IEEE}},
	att_copyright_notice={{}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={Background storage traffic,  scheduling},
	att_techdoc={true},
	att_techdoc_key={TD:101764},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:101764_DS1_2016-03-06T20:04:00.299Z.pdf},
	author={Rajesh Panta and Shijing Li and Tian Lan and Moo-ryong Ra},
	institution={{The 50th Annual Conference on Information Sciences and Systems (CISS)}},
	month={March},
	title={{Background Traffic Optimization for Meeting Deadlines in Data Center Storage}},
	year=2016,
}