destination node 中文意思是什麼

destination node 解釋
目的地節點
  • destination : n. 1. 〈罕用語〉指定，預定，註定。2. 目的地，指定地。3. 目的，目標。
  • node : n 1 節；結；瘤；【蟲類】結脈。2 【植物；植物學】莖節；【醫學】硬結腫；結，節結；【天文學】交點。3...
  1. A security enhancement scheme is proposed to encounter the black hole attacks in aodv protocol. this scheme may solve the black hole problem and prevent personating the destination node to some degree. 3

    針對移動adhoc網路aodv協議中所存在的黑洞攻擊，提出了一種增強安全性的解決方案，該方案能在一定程度上解決黑洞問題並可防止假冒目的節點攻擊。
  2. We discuss the formation of the unidirectional links and their influence on the manet routing protocols such as dsr, dsdv, aodv. solutions are given to overcom e the problems, we analyze some of they and point out their limitations. in the third part, we show a new on - demand routing strategy supported unidirectional links, it use the two circuits route search algorithms to establish the route from the source node to the destination and backward with directions ; it transfer the route error messages from the backward positions to the forward positions one by one ; it apply the packet encapsulation technique to forward the packets through the unidirectional links and introduced the circuit path to transmit information from the forward node to the backward node

    接著，指出在移動自組網環境中，單向鏈路的普遍存在，分析了它的產生原因、它對目前協議棧的影響；然後，我們給出了一種按需路由的自組網單向鏈路路由演算法，它只有在需要路徑的時候才維護路由，使用二循環路由尋徑演算法以建立節點間的路徑，使用逐跳逆向傳遞的方式報告路由終斷，使用封裝廣播的方式沿單向鏈路正向傳輸，使用報文封裝方式支持單向鏈路下游節點向上游節點傳遞信息。
  3. The multipath olsr protocol will calculate all of possible paths from the source node to destination node. then, it should select one of paths with less congestion nodes for the second path. the paper has designed an effective algorithm of load assigned, to avoid overwhelming some central nodes in the network

    多路徑將選擇一條擁塞程度更輕的路徑作為備用路徑，這樣可以減輕中間部分擁塞節點的處理負擔，將網路負載分配到全網所有節點，即達到負載均衡的效果;二是為了提供qos業務而改進的olsr約束路由協議。
  4. According to the mil - std - 188 - 220b protocol of american army, data packets can be relayed and forwarded automatically by nodes in network. the network can detect the change of topology in internal system and assure the information to be sent to the destination node in connective network. furthermore, it comprises of the radio data transmitting network for some equipments such as tactical data terminal and computer so on

    本質上，它屬于無中心的自組織分組無線網，按照美軍戰術網際網路「數字消息傳輸設備子系統互操作標準」 （ mil - std - 188 - 220b協議） ，通過節點對數據分組的自動中繼轉發，使網路能夠自動探測到系統內部拓撲結構發生的變化，保證信息能達到網路中所有連通的節點，為戰術數據終端和計算機等設備提供無線數據傳輸網路。
  5. Combined with the qos based initial route setup algorithms and destination node leaving algorithms, the qos guarantees for distributed multimedia dynamic group applications could be supported

    該演算法同初始路由建立演算法及目的節點退出演算法相結合，可以提供對分散式多媒體動態組應用服務質量保證的支持。
  6. 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

    文摘:文中在基於服務質量的動態組多媒體通信初始路由建立演算法基礎之上，提出了一種由目的節點啟動的基於服務質量的支持成員加入動態組的演算法。
  7. With regard to the flow regulation of the best - effort traffic, the controllable traffic in high speed computer communication networks, the present paper proposes a novel control theoretic approach that designs a proportional - integrative ( pi ) controller based on multi - rate sampling for congestion controlling. based on the traffic model of a single node and on system stability criterion, it is shown that this pi controller can regulate the source rate on the basis of the knowledge of buffer occupancy of the destination node in such a manner that the congestion - controlled network is asymptotically stable without oscillation in terms of the buffer occupancy of the destionation node ; and the steady value of queue length is consistent with the specified threshold value

    本文從控制理論的角度出發，針對計算機高速網際網路中最大服務交通流即能控交通流的調節問題提出了一種基於多速率采樣的具有比例積分（ pi ）控制器結構的擁塞控制理論和方法，在單個節點的交通流的模型基礎上，運用控制理論中的系統穩定性分析方法，討論如何利用信終端節點緩沖佔有量的比例加積分的反饋形式來調節信源節點的能控交通流的輸入速率，從而使被控網路節點的緩沖佔有量趨于穩定;同時使被控網路節點的穩定隊列長度逼近指定的門限值。
  8. To analyze the factors of impacting load balancing of links, which is including the number of routes between source node and destination node, the number of routes through every link, the maximum flow between source node and destination node, the maximum flow through every link, the free bandwidth of every link and so on, we present the fast dynamic routing algorithm ( fdra ) and the critical link routing algorithm ( clra ). simulation results show presented algorithms in the paper are better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost

    通過分析影響網路的鏈路負載均衡的因素，比如源-目的節點間的最大流，通過每條鏈路的最大流，源-目的節點間的路徑數目，通過每條鏈路的路徑數目，以及鏈路的剩餘容量等，提出了快捷動態路由演算法fdra和關鍵性鏈路路由演算法clra ，通過模擬，與最小跳演算法（ mha ） 、最寬最短路徑（ wsp ）演算法、最小干擾路由演算法（ mira ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。
  9. Messages are transmitted from node to node within specific networks until they reach their final destination

    在到達最終目的地之前，消息會在特定網路內，從一個節點傳送到另一個節點。
  10. Given the multicast request, the optimal object of the problem is to minimize total number of conversions required. in wavelength assignment, we should consider the requirements that the number of needed converters along the path from multicast source node to any member cannot be larger than specified value because of the signal distortion introduced by wavelength converters. at last, we present several dynamic programming to get the exact optimal wavelength assignment scheme under session blocking policy and destination blocking policy

    考慮到波長轉換器引入的信號失真和噪聲，引進了失真約束，即要求從組播源結點到每個組播成員的路徑上使用的波長轉換器數目均在指定的范圍之內;對于給定的組播需求，優化目標是在滿足失真約束的基礎上使整個組播樹上使用波長轉換器的數目最少;並使用動態規劃給出了sbp和dbp兩種連接建立策略下精確的最優波長分配演算法。
  11. Firstly, by selecting and defining the resource load indexes rationally, lbmr take into consideration the effect on the resource usage of source node and destination node by the migrant. by means of vector operations, lbmr can use multiply resources in harmony. secondly, lbmr adopts the smallest k - subset random algorithin, and the load index information is provided by the information cache

    Lbmr演算法的主要思想有三點：第一，基於合理選擇和定義的資源負載向量，綜合考慮進程遷移對源節點和目標節點資源利用率的影響，通過向量運算協調多種資源的平衡使用；第二，基於最小k子集隨機演算法，採用信息cache提供的負載信息作為負載平衡演算法位置策略的選擇依據；第三，基於進程生命時間的概率分佈，根據遷移進程減速（ slowdown ）數學期望值的改善程度，選擇適合於遷移的進程。
  12. If the node is the destination, we ' ve successfully finished ( quit )

    如果所在節點為目標點，任務成功完成（退出） 。
  13. Where one hop represents one gateway on the datagram s path to the destination node

    衡量，其中一個跳躍點表示數據報通向目的地節點路徑上的一個網關。
  14. Two sequence numbers are used by the sender and the receiver to ensure that no packets get lost, that there is no duplication, and that the packets can be reassembled in the right order at the destination node

    發送方和接收方使用兩個序列號來確保包沒有丟失、沒有重復以及可以在目的地節點以正確順序重新組裝。
  15. The test is then moved or copied to the destination node, such as all loaded tests, or test list

    這樣該測試就會被移動或復制到目標節點（如「所有已加載的測試」 ）或測試列表。
  16. Then, either switch to the destination node or test list and click paste, or click the name of the node or test list in the test list pane and then click

    然後，切換到目標節點或測試列表並單擊「粘貼」 ，或者在測試列表窗格中單擊目標節點或測試列表的名稱，然後單擊「粘貼」 。
  17. Openmosix transparently migrates a process to another node if the load - leveling algorithm thinks the destination has a smaller work load and it is feasible to migrate the process

    如果負載均衡演算法認為另一個節點的工作負載較小，而且適于遷移進程，那麼openmosix會透明地將進程遷移到目標節點。
  18. In this thesis, routing protocol and wireless resource management are combined for the voice service in the communication network. session triggers the source node to build the bandwidth reserved routing to the destination. for the data service, aodv protocol is used to find the shortest route between source and destination, and the data is transmitted hop by hop

    本文將路由協議與無線資源管理相結合，對于通信網路中的話音業務，每次會話觸發源節點發起建立預留帶寬的路由;對于數據業務，採用aodv路由演算法按需尋找從源節點到目的節點的最短路徑，然後逐跳進行預約傳送數據。
  19. Using modern control theory and method, we show how the controller can regulate the source rate on the basis of the knowledge of buffer occupancy of the destination node in such a manner that the rate of source node is stable, and the congestion controlled network is asymptotically stable without oscillation in terms of the buffer occupancy of the destination node

    並且運用現代控制理論和方法，討論如何利用基於組播的單速率擁塞控制方法來對組播篡碩士學位論文mas ; ter 』 5thesis發送節點的發送速率進行調節，從而使得發送節點的發送速率和接收節點的緩沖佔有量均趨于穩定。
分享友人
分享到 Line

分享到臉書