本文選題：發(fā)布/訂閱 + 分布式緩存�。� 參考：《上海交通大學(xué)》2013年碩士論文

【摘要】：發(fā)布訂閱網(wǎng)絡(luò)是一種靈活的通信模型，它能根據(jù)消息的內(nèi)容而非通信雙方的地址信息來進(jìn)行消息傳輸，因而能很好地滿足大規(guī)模網(wǎng)絡(luò)的數(shù)據(jù)通信需求。在傳統(tǒng)的發(fā)布訂閱網(wǎng)絡(luò)中，消息不會存儲在網(wǎng)絡(luò)，，訂閱用戶只能收到其在線時(shí)系統(tǒng)發(fā)布的消息。然而，在一些動態(tài)的場景中，用戶動態(tài)地加入退出系統(tǒng)，新加入的用戶可能會對系統(tǒng)過去產(chǎn)生的消息感興趣。 本論文在保持發(fā)布訂閱網(wǎng)絡(luò)原有的松耦合、異步通信特性的基礎(chǔ)之上，提出了一種在發(fā)布訂閱網(wǎng)絡(luò)中的消息持久化算法，使得發(fā)布的消息能在發(fā)布訂閱網(wǎng)絡(luò)中存儲，并支持用戶對歷史消息的訂閱獲取。通過與另外兩種消息持久化算法進(jìn)行對比實(shí)驗(yàn)，本文的消息持久化算法顯示出其在消息持久化能力、歷史消息查找開銷和系統(tǒng)擴(kuò)展性上都具有良好的性能。 同時(shí)，本文提出了在發(fā)布訂閱網(wǎng)絡(luò)中的消息部署算法，利用關(guān)于用戶的先驗(yàn)知識對消息進(jìn)行預(yù)轉(zhuǎn)移存儲，使消息部署在離可能用戶最近的位置，以使用戶能更快地獲取歷史消息。同樣，通過與另外二種消息部署算法進(jìn)行對比實(shí)驗(yàn)，本文的消息部署算法顯示出其在響應(yīng)用戶請求上具有良好的性能。 最后，本文利用所提出的消息緩存算法擴(kuò)展了傳統(tǒng)的發(fā)布訂閱系統(tǒng)，實(shí)現(xiàn)了一種支持歷史消息的發(fā)布訂閱系統(tǒng)，支持消息在網(wǎng)絡(luò)中持久化，并提供了用戶訂閱歷史消息的功能。
[Abstract]:Publish / subscribe network is a flexible communication model, which can transmit messages according to the content of messages rather than the address information of both parties, so it can meet the data communication needs of large scale networks. In a traditional publish / subscribe network, messages are not stored on the network, and subscribers can only receive messages published by the system when they are online. However, in some dynamic scenarios where the user dynamically joins the exit system, the new user may be interested in the messages generated by the system in the past. Based on the loose coupling and asynchronous communication characteristics of publish / subscribe network, this paper proposes a message persistence algorithm in publish / subscribe network, which can store the published message in the publish / subscribe network. It also supports the user's subscription to the history message. By comparing with the other two message persistence algorithms, this paper shows that the message persistence algorithm has good performance in message persistence, historical message lookup overhead and system expansibility. At the same time, this paper proposes a message deployment algorithm in publish / subscribe network, which makes use of the prior knowledge of users to pre-transfer the messages, so that the messages are deployed in the nearest location to the possible users. To enable users to access historical messages faster. In the same way, by comparing with the other two message deployment algorithms, the message deployment algorithm in this paper shows that it has good performance in responding to user requests. Finally, this paper extends the traditional publish / subscribe system by using the proposed message caching algorithm, implements a publish / subscribe system that supports historical messages, supports the persistence of messages in the network, and provides the function of users subscribing to historical messages.
【學(xué)位授予單位】：上海交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2013
【分類號】：TP333

【參考文獻(xiàn)】

中國期刊全文數(shù)據(jù)庫 前1條

1 馬建剛;黃濤;汪錦嶺;徐罡;葉丹;;面向大規(guī)模分布式計(jì)算發(fā)布訂閱系統(tǒng)核心技術(shù)[J];軟件學(xué)報(bào);2006年01期

本文編號：2048478