arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.0210cs.DCcs.NI
收藏

截止日期还不够:如何通过跨层方法实现重要性感知的以服务器为中心的数据中心

Deadline is not Enough: How to Achieve Importance-aware Server-centric Data Centers via a Cross Layer Approach

Ming-Hung Chen, Shi-Chen Wang, Cheng-Fu Chou

摘要:

提供低延迟、高质量的交互式服务以满足用户的期望是当今互联网服务提供商面临的重要挑战。为了提高应用的吞吐量,近年来的研究工作已经嵌入应用的截止日期信息到网络流调度的设计,以满足延迟的要求。这里,出现了一个关键问题:应用程序级的吞吐量是否意味着提供更高质量的服务?我们注意到,通常有一组语义相关的响应(或流)来回答查询;并且,一些响应与查询高度相关,而另一些则不相关。因此,这种观察促使我们将内容的重要性与应用程序流(或响应)相关联,以提高服务质量。我们首先在一个通用的网络和以服务器为中心的网络模型的应用程序的重要性最大化问题。由于它们都太复杂,无法部署在现实世界中,我们提出了重要性感知的交付协议,这是一个分布式的事件驱动的基于速率的交付控制协议,以服务器为中心的数据中心网络。该协议能够利用服务器为中心的网络的多个不相交路径,并联合考虑流的重要性,流的大小,和最后期限,以最大限度地提高有效吞吐量的最相关的语义数据的查询。通过基于真实数据或合成模拟,结果表明,我们提出的协议显着优于D3和MPTCP在精度K和应用级重要性的总和。

英文摘要:

Today's datacenters face important challenges for providing low-latency high-quality interactive services to meet user's expectation. For improving the application throughput, recent research works have embedded application deadline information into design of network flow schedule to meet the latency requirement. Here, arises a critical question: does application-level throughput mean providing better quality service? We note that there are usually a set of semantic related responses (or flows) for answering a query; and, some responses are highly correlative with the query while others do not. Thus, this observation motivates us to associate the importance of the contents with the application flows (or responses) in order to enhance the service quality. We first model the application importance maximization problem in a generic network and in a server-centric network. Since both of them are too complicated to be deployed in the real world, we propose the importance-aware delivery protocol, which is a distributed event-driven rate-based delivery control protocol, for server-centric datacenter networks. The proposed protocol is able to make use of the multiple disjoin paths of server-centric network, and jointly consider flow importance, flow size, and deadline to maximize the goodput of most-related semantic data of a query. Through real-data-based or synthetic simulations, the results show that our proposed protocol significantly outperforms D3 and MPTCP in terms of the precision at K and the sum of application-level importance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑