join node 中文意思是什麼
join node
解釋
結合節點-
This text has analysed load balancing method of existent especially lvs cluster system and recommended the net packet and netfilter ’ s frame structures in the linux operating system ; it has compared the cooperative - type - cluster with tradictional cluster in the net packets ’ queue ways and with active cluster in the load balancing dispatcher way, which has reflected the superiority of cooperation type cluster ; the three major parts of the cooperative - type - cluster have been designed and realized in this text, which includes sync packets ’ priority service for dmcs 、 “ priority and avoid sudden load unbalance ” dispatch way at the cooperation of nodal servers and director and active nodal server which ensure cluster normally running when cluster join or rduce node server ; the cooperative - type - cluster ’ s control frame controlled by homepage has been constructed ; the mulit - services cluster system has been realized ; this text has used the existing server pressure testing tools to test the cooperative - type - cluster and lvs cluster, then has comparaed and analysed the two
本文分析了現有服務器集群特別是lvs集群系統的負載均衡方法，介紹了linux系統下的報文和netfilter的框架結構;將所提出的合作式集群與傳統集群在報文排隊方式上進行比較，與主動式集群在負載均衡調度方式上進行比較，體現了合作式集群的優越性;設計並實現了合作式集群體系結構的三大部分:針對分散式測控系統的加權服務、負載均衡器與節點服務器合作式「加權防突」負載調度、保證集群運行不受加減節點干擾的主動性真實服務器;構建了通過網頁界面控制合作式集群的控制框架;實現了一個可運行的合作式多服務集群系統，運用現有服務器壓力測試工具對合作式集群和lvs集群進行負載測試，並對測試結果進行比較分析，同時通過壓力測試實現加權服務。 -
Abstract : in this paper, with the support of the qos - based initial route setup algorithms, a destination node initiated and qos - based algorithm, which can support the member to join in the group dynamically, is presented
文摘:文中在基於服務質量的動態組多媒體通信初始路由建立演算法基礎之上，提出了一種由目的節點啟動的基於服務質量的支持成員加入動態組的演算法。 -
In the end, based on the above algorithms, the paper realizes a mobile distributed database prototype system - mddb and gives experiment results and performance analyses on single node query algorithm based on group cach and double node join algorithm
最後，本文基於以上演算法，實現了一個分散式移動數據庫原型系統mddb ，並給出了基於組緩沖的單點查詢演算法和基於代價的兩點連接演算法的實驗結果和性能分析。 -
Abstract in order to solve the problems of conventional resource discovery framework, a hierarchy - based model was discussed, which combined super - peer model and contact node, a membership join protocol was introduced, and a resource discovery algorithm was proposed based on time to live ( ttl ) limit and cache list
摘要為了解決傳統資源發現機制不能很好地適應網路狀態、可擴展性較差等問題，在超級節點模型的基礎上，結合聯系節點，建立了一種基於層次結構的網格模型，設計了成員加入協議，給出了基於跳數限定、緩存列表的資源發現演算法。 -
This paper puts forward two basic querying algorithms : one is single node query algorithm based on cache, and the other is double node join algorithms based on cost model
本文提出基於組緩沖的單點查詢演算法和基於代價的多點連接演算法兩種基本查詢演算法。 -
Then the essay proposes a p / s based 2 - level architecture qos communication solution in crcm, gives the critical technologies of this solution include the establish of the multicast group dynamic reliable mechanism and the node ' s join and leave. at last, the essay simulates and compares the c / s integrate scheme and p / s scheme, analysis the main parameter of the model
然後針對鐵路管控系統，提出了一種採用p s兩級結構，廣域網環境下的qos通信解決方案，並給出了實現這一模型的幾個關鍵技術，包括：動態組播組的建立、可靠性機制、節點的加入和退出。 -
Abstract : the calculation of the minimum route set for network system from input node to output node using the join matrix method was discussed. a computer algorithm for this calculation and a pad were presented. the algorithm is valuable in network system reliability analysis
摘要：討論了用聯絡矩陣法求網路系統從輸入節點到輸出節點的所有最小路集，給出了一種實現此方法的計算機演算法，畫出了實現此演算法的pad圖，此演算法在網路系統可靠性分析方面具有很好的應用價值。
分享友人