請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64373
標題: | 於資料中心網路針對類Bcube拓樸以資料重要性為基礎之傳輸通訊協定 Importance-aware Transport Protocol for Bcube-liked Datacenter |
作者: | Shi-Chen Wang 王璽承 |
指導教授: | 周承復(Cheng-Fu Chou) |
關鍵字: | 大規模網路服務,資料中心網路,速率控制,資料重要性,資料時效性, large-scale web services,data center network,rate-control mechanism,importance-aware delivery,deadline-aware delivery, |
出版年 : | 2012 |
學位: | 碩士 |
摘要: | 由於網路蓬勃發展以及熱門的雲端計算,隨之出現的是一系列大規模的網路服務,如:社群網路、搜尋引擎、推薦系統等等,而這些服務都存在以下特性:1.) 由於大規模以及高計算量,需要建置於雲端的環境中。2.) 具有軟性的即時特性,即在特定時間之內,即使資料並不完整,也會將結果傳回給使用者。3.) 資料準確性直接地影響使用者的使用感受,因而影響到服務提供者的收入。但傳統的TCP傳輸協定並無考慮到資料時效性和重要性,因此,在資料中心中TCP傳輸無法滿足這些服務的特性,而造成這些服務效能不佳。
在本篇論文中,我們設計一個全新的資料傳輸通訊協定於資料中心環境。針對資料時效性,採取分散式的傳輸速率控制機制,使得資料能在時限前傳送完畢;再針對資料重要性,賦予每條資料流一個傳輸順序,使重要資料可以優先回傳至使用者;最後,利用資料中心中固有的拓樸特性─多路徑 ─進行傳輸,以有效率地使用資料中心網路的資源。 Today's data centers face serious challenges in providing low-latency high-quality services to meet user's expectations for interactivity. In such environment, a network flow is useful, and contributes to application-level throughput if and only if it is delivered before its deadline.Therefore, in recently years,some researchers have employed application-level deadline information for satisfying the latency requirement. A fundamental question arises: does high application-level throughput mean providing high-quality service? We investigate behaviour of users and the content of the flow, which consists of many responses to the query. We found that each flow may contribute a few highly correlative responses to the query and the rest are less-important responses. This observation motivates us to associate the importance of the flow contents with the application traffic for further improving the service quality.We model the application importance maximization problem in a generic and a server-centric network. Because both of them are too complex, we propose the importance-aware delivery protocol, which is a novel distributed event-driven rate-based delivery control protocol, for server-centric data center networks. The proposed protocol utilizes the multiple disjoin paths of server-centric network, and jointly considers flow importance, flow size, and deadline to maximize the importance contribution of flows in the network. Through real-data-based or synthetic simulations, we demonstrate that the proposed protocol significantly outperforms deadline-aware protocol and MPTCP in terms of the precision at K and the sum of application-level importance. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64373 |
全文授權: | 有償授權 |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-101-1.pdf 目前未授權公開取用 | 1.87 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。