self-routing 中文意思是什麼
self-routing
解釋
自選路徑-
Finding a feasible and efficient load balanced strategy for the ultra - scalable multi - plane multi - stage switch architecture is a top of nowadays research. the dissertation proposes a two - stage load balanced scheme for the ultra - scalable multi - plane multi - stage switch architecture based self - routing and non - blocking permutation benes network. the approach uses reasonable and efficient logical queueing strategy and schedule scheme in ingress traffic managers and switch planes to realize the two - stage load balancing of ip traffic which for different destination addresses
本文提出一種適用於基於完全可重排無阻塞benes拓撲構建的多平面多路徑（多級）超大容量交換結構的兩級負載均衡策略，通過在輸入流量管理器和benes交換平面內部實施合理而高效的隊列組織調度方法，有效實現了基於不同目的地址的ip流量在兩個層次上的負載均衡，較好彌補了ciscocrs - 1系統在平面選擇和中間級選擇時所採用的簡單隨機或輪循方案的不足。 -
In the meanwhile, we build a complete simulation model of layered wireless self - organizing routing network and verify feasibility of network architecture and key technologies, including operating mode of wireless interface, addressing and routing in lwsrn we study the performance of wsrn in terms of routing overhead, packet delivery ratio, and the communication capability, and compare these result with that of ad hoc network
同時，構造了完整的分層結構的無線自組織路由網路模擬模型。驗證了網路體系結構和關鍵技術的可行性，包括無線通道工作方式、網路編址技術、網路路由過程。並通過模擬分析了分層結構的無線自組織路由網路的路由負載、網路數據到達率和網路通信容量。 -
For the sake of prolonging the lifespan of nodes and improving the performance of stable and routing, a self - adaptive routing algorithm based on analytic hierarchy process ( ahp ) is proposed. the new algorithm induces ahp to cluster self - adaptively, and then it makes virtual backbone network by clusters and sinks, after that it creates routes in the virtual backbone network
模擬實驗表明新演算法較flooding節能，能較好的克服flooding演算法中報文冗餘度高、能耗大等不足。為了盡可能地延長節點的生存期限，提高網路的穩定性與路由性能，提出了一種基於層次分析法的自適應分簇路由演算法。 -
This paper introduces the routing scheme of the wireless router : include centralized mobile routing technology and dynamic network routing protocol. the simulation model of the network routing protocol is also described, and the model ' s validation is verified. this paper will give a good reference to the routing implementation of the wireless mobile self - organizing network system, and the building of the simulation model lays the foundation for the evaluating of the network performance
根據上述思想，本文介紹了無線移動自組織網路中「無線路由器」的路由設計方案，包括採用集中方式進行用戶尋徑的移動路由技術和用於維護網路拓撲的網路路由協議的設計，對網路路由演算法進行了模擬模型的建立，並驗證其有效性。 -
First, it gives a snapshot of some typical self - organized routing protocols in manet. then the design of self - organized routing algorithm based on ktrp is elaborated as the main part of this dissertation, including the choosing of key nodes, the main algorithm modification of ktrp to accommodate with the interior routing in subnet, the access flow between two layers, primary packet formats, tables, and ip routing algorithm. at last, the simulation model of the self - organized routing algorithm
本文首先分析了現有的manet自組織路由協議;然後針對本信息傳輸分系統的網路結構，詳細分析了基於ktrp的子網內部以及相鄰層間的自組織路由演算法的設計，包括對多個關鍵節點的選取、為適應本課題子網內路由通信而對ktrp做出的主要演算法更改、相鄰層間接入互連的流程、自組織路由演算法中涉及的主要報文格式和表，並且舉例說明了ip選路演算法;最後對所設計的自組織路由演算法進行了模擬，以驗證演算法的有效性。 -
With reference to the bs / ms architecture of gsm system, the network nodes and user nodes are explicitly distinguished in sowmn ' s architecture. the network functions of self - organization, dynamic routing and user management are all completed in the network nodes and the details of network structure are hidden to mobile users, so the burden of network devices and their implementation complexity are distinctly alleviated while the sowmn system still has an excellent compatibility with existing ip networks and wireless terminals according with ieee802. 11 standard
在網路體系結構上借鑒了gsm的bs / ms兩級體制，把網路節點和用戶節點明確區分開，使網路自組織、動態路由和網路管理等網路功能集中在網路節點中完成，並且對移動用戶隱藏了網路組織細節，從而降低了網路設備的負擔和實現復雜度，並使整個系統對現有的ip網路和符合ieee802 . 11標準的無線終端設備具有較強的兼容能力。 -
Among them, routing algorithms are the main difficulty of design and research on self - organized networks
其中，路由協議是自組網設計、研究的主要技術難點。 -
Considering the limited energy and transmission range of sensor nodes in sensor networks, an innovative routing algorithm named self - adaptive flooding based on delay is proposed. in this algorithm, sources deliver route request packets ( rreq ) and sink answers route reply packets ( rrep ) to build routes. in order not to miss optimum routes with the best metrics, the algorithm is to wait a specific amount of time to ensure that almost the rreq near the best metrics is received
為此本文在無線傳感器網路中研究了基於自適應的路由演算法，主要工作如下:針對傳感器節點能量及傳輸范圍有限等特點，提出了一種基於延遲的自適應洪泛路由演算法，首先通過源節點在網內用較小的路由請求報文和路由回復報文來建立路由，路由建立的過程中自適應地確定等待時間以使更優的路由請求報文得到轉發，然後源節點再沿著建立好的路徑轉發較大的數據報文。 -
Kernel tree routing protocol ( ktrp ) is a new wireless self - organizing network protocol
核心樹路由協議（ ktrp ）是一種新的無線自組織網路的自組織無線路由協議。 -
Ad hoc is a dynamic wireless self - organized network, and it has very attractive dynamic character. its routing protocol realized based on linux system
Adhoc網路是一種動態變化的基於無線通道的自組織網路，具有很好的動態特性。 -
Just as its name implies, the osr algorithm is a kind of on - demand distributed algorithms, which greatly reduce the cost of self - organizing in wmsn compared with proactive routing protocols
按需自組織路由演算法，顧名思義，是一種按需方式的演算法，減少了在網路自組織時演算法對網路資源的消耗。 -
The chinese national hi - tech program, wireless self - organizing network technologies and design has proposed a self - organizing algorithm - kernel tree routing protocol ( ktrp ), which has resolved the problem of routing loop in ad hoc networks by a tree - shaped topology of wireless routers ( wr ), furthermore, it has reduced the items of routing tables
863課題「無線移動自組織網際網路技術及實驗系統研製」中提出了一種分層的自組織演算法? ?核心樹路由協議ktrp （ kerneltreeroutingprotocol ） ，通過無線路由器（ wirelessrouter ， wr ）的樹形邏輯拓撲解決了adhoc網路中路由環路的問題，並減少了wr的路由表項。
分享友人