| DC 欄位 |
值 |
語言 |
| DC.contributor | 通訊工程學系 | zh_TW |
| DC.creator | 吳旻晏 | zh_TW |
| DC.creator | WU, MIN-YAN | en_US |
| dc.date.accessioned | 2015-7-30T07:39:07Z | |
| dc.date.available | 2015-7-30T07:39:07Z | |
| dc.date.issued | 2015 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=102523022 | |
| dc.contributor.department | 通訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 由於使用社群服務(Social Service)的用戶數急遽上升，如何提供穩定的服務成為一個服務要點。對於社群服務而言，雲端環境可以提供靈活的運算能力及彈性的儲存資源。社群雲端資料中心必須儲存用戶的資料，供運算及互相存取，這些造成雲端資料中心巨大的網路流量，如何在存放相同資料的情形下改善內部網路瓶頸成為雲端資料中心網路優化的一個議題。
本論文主要包括利用社群平台Facebook提供的認證與授權介面實作出社群服務-Cyber Search Engine，提供以”人”為搜尋對象的服務，進而探討如何使用資料類別間的相依程度決定資料在雲端的放置位置; 利用k-means演算法提出配合雲端虛擬機之資料分群與放置方法，並透過模擬驗證其減少網路傳輸成本之效能。在社群服務實作方面，詳述使用到的技術及完整系統架構; 在資料放置方面，我們分別就虛擬機已固定在伺服器上，及虛擬機可任意放置於伺服主機上，分別提出資料放置方法。兩種方法均先將資料類型依相依關係及其被存取的次數轉為資料類型拓樸圖，拓樸圖中的點(node)代表資料的分類，線(link)代表資料分類間的相依關係程度，使用k-means演算法將此資料類型拓樸圖做資料分群以決定資料所適合放置的伺服器及虛擬機。模擬實驗結果顯示所提方法之網路傳送成本，皆比平均放置方法要來得節省。
| zh_TW |
| dc.description.abstract | It is challenge to provide a stable social service that can deal with a huge amount of information and users. Social cloud data center stores social related information generated by users and it causes processing bottleneck during operating the data flow of these data. Therefore, it becomes one of the critical issues to study the data placement issue so that the performance of the cloud data center can be optimized.
In this thesis, a social service, which named “Cyber Serch Engine”, is developed by using Facebook login API and takes efforts to propose two k-means based data placement schemes to achieve better transmission performance in cloud environment. The social graph is adopted to represent the data dependencies and access frequencies. Thus, the link weight denotes the correlation degree between data types and the node weight represents the frequency of a data type being accessed.These proposes two data placement schemes, which are names as the pre-configured LXC scheme and dynamic LXC scheme, allocate social data in proper virtual machine and physical server depend on the relationship between data types to minimize the transmission cost.
The architecture and technology of social service cyber search engine will be mentioned in detailed description. Then, simulations of the proposed two k-means based data placement schemes are provided. The simulation results show that both schemes illustrate better performance than the balance scheme.
| en_US |
| DC.subject | 社群服務 | zh_TW |
| DC.subject | 雲端資料中心 | zh_TW |
| DC.subject | k-means 演算法 | zh_TW |
| DC.subject | 資料放置策略 | zh_TW |
| DC.subject | Social Service | en_US |
| DC.subject | Cloud Data Center | en_US |
| DC.subject | k-means algorithm | en_US |
| DC.subject | Data Placement | en_US |
| DC.title | 社群服務系統實作及其資料在雲端布署之研究 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Implementation of Social Service System and Its Data Placement in Cloud Environment | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |