routing algorithms 中文意思是什麼
-
2. presenting banyan network ' s propert, conflict and the neccesary and sufficent condions of conflict. then, three routing algorithms are presented on realizing permutation routing based on time domain approach under the constraint of avoiding crosstalk, and the complexity of the algotithms are analysed
2 、給出了banyan網路的一些性質及實現置換路由的沖突次數及發生沖突的充要條件，並且給出了基於時域法的無串擾的實現置換路由的三種調度演算法，討論了演算法的時間復雜度以及所需要的調度次數的上界。 -
The thesis then studies the emulation modes of routing algorithms with inaccurate network state information, proposes a simulation model based on events for routing algorithms with inaccurate network state information, and develops a routing simulation software r - ns that provides an effective environment for the research of network routing algorithms. randomized routing algorithms based on improved dijkstra and bellman - ford algorithms are proposed for the unicast routing model with inaccurate network state information
本文研究了非精確網路狀態信息的路由演算法模擬模擬方法，提出了非精確網路狀態信息下基於事件的網路路由模擬模擬模型，設計並實現了路由模擬模擬軟體rns ，對網路路由演算法的研究提供了很好的支撐環境。 -
We study the design of routing algorithm. after analyzing the characteristics of message routing in the interconnection network, one new concept " the best network for routing " ( bnr ) is proposed. base on it, we present the framework for designing high performance minimal deadlock - free fully adaptive routing algorithms
基於「最佳尋徑網」框架，以低通信延遲、高通信帶寬和易vlsi實現為目標，設計了自適應性強、可擴展性好、性能優越的bbfam （ bnr - basedfully - adaptivealgorithmonmesh ）完全自適應路由演算法。 -
In wormhole meshes, a reliable routing is supposed to be deadlock - free and fault - tolerant. many routing algorithms are able to tolerate a large number of faults enclosed by rectangular blocks or special convex, none of them, however, is capable of handling two convex fault regions with distance two by using only two virtual networks
在應用蟲孔路由的mesh結構的多處理機系統中，已經有許多基於維數序的容錯的路由演算法被提出，其中大多數路由演算法只能容忍矩型或凸型的故障節點組成的區域，但是，至今還沒有一個演算法能應用兩個虛擬通道處理凸型convex故障區域距離大於和等於2的情況。 -
Table - driven routing protocols and source initialed on - demand routing algorithms are analyzed and compared against each other. our study shows the on - demand protocols are better suited for manet because they generate less control overhead and manage the mobility in a more efficient manner
首先敘述了兩種移動自組網專用路由模式：表驅動路由方式和源啟動按需路由方式，引用cmu的驗證實驗數據指出按需方式更適合於自組網。 -
Research on an isochrone approach and its shortest routing algorithms based on gis
等時線分析方法及其最佳路徑演算法研究 -
It has small diameter, strong expansibility, symmetrical structure and simple path searching algorithms, etc., what more, many interconnection networks with different topologies can be easily embedded in it. so it becomes one of the most important and attractive network models. in this thesis, based on the above two aspects, the fault - tolerance and routing algorithms of the hypercube are studied
超立方體網路是多處理機系統中常見的一種互連網路，這種網路拓撲結構由於具有直徑小、可擴展性強、結構對稱、網路尋路演算法簡單等優點，且多種拓撲結構的互連網路都可以很容易的嵌入其中，因而成為最重要和最具吸引力的網路模型之一。 -
Based on theoretical analysis of switch routing network, we study the relationship between mpls and end - to - end service quality. we propose routing algorithms based on traffic properties measured in time, spatial and service class. we evaluate these algorithms by theoretical analysis and simulation, discover their strength and weakness and compare them with existing algorithms
在深入分析交換路由系統服務特性的基礎上，依據網路負載在時間、空間和服務等級等三個度量坐標上的統計特性，本文提出了幾種高效路由演算法，並進一步使用理論分析和實驗模擬方法對這些演算法進行了深入研究。 -
The thesis starts with an extensive analysis on the current research in network qos and on the routing policies and algorithms based on ip, describes the reason for state information inaccuracy in network and the research status of routing algorithms with inaccurate network state information, and discusses the problems and models of the routing algorithms
本文首先深入分析了基於ip的qos研究體系、路由策略與演算法，論述了網路狀態信息非精確性的原因及其基於非精確網路狀態信息的路由演算法研究現狀，討論了非精確網路狀態信息下路由演算法研究的問題和模型。 -
A major research topic in computer networks is to study how to provide high quality service in the next generation internet. this thesis concentrates on the study of quality of service ( qos ) routing algorithms and related technologies with inaccurate network state information, and the analysis on the influence created by the inaccuracy of network state information on the performance of routing algorithms
在新一代internet網路上提供高水平服務質量保證是目前計算機網路研究的主要課題，本文主要研究基於非精確網路狀態信息下的qos路由演算法及有關技術，分析網路狀態的非精確性對路由演算法性能的影響。 -
First, the paper gives an overview on the basic theory of multicast, including multicast routing algorithms, multicast routing protocols and internet group management protocols. on the basis of this, a new algorithm of selecting multicast route was brought up, which applies in the case that there are only one multicast sender and many receivers. the algorithm is independent of the unicast routing protocol
首先，本文對組播技術的基礎理論，包括組播路由選擇演算法、組播路由協議和網際網路組管理協議等進行了綜述，在此基礎上，提出了一種新的組播路由選擇演算法，它適用於只有一個組播源的組播網路。 -
Among them, routing algorithms are the main difficulty of design and research on self - organized networks
其中，路由協議是自組網設計、研究的主要技術難點。 -
Among all proposed wireless mobile adhoc routing protocols, adhoc on - demand distance vector routing ( aodv ) and dynamic source routing ( dsr ) are the most prominent. we do research on distributed algorithms, mainly the multi - dimensional interval routing scheme on hypercube and the routing algorithms on adhoc network
目前， adhoc無線網路設計的研究主要集中於分散式路由技術，在所有的adhoc請求路由演算法中， adhoc請求距離向量路由和動態源路由是重要的請求路由演算法。 -
Recently, designers developed a new type of package : ball grid array ( bga ) package. the bga package has many i / o pins. because of this merit, this kind of package is used widely now. but the package has a new structrue, and the old routing algorithms are not used
鑒于球柵陣列封裝（ bga ）的優點，這種技術成為目前最廣泛的封裝形式。然而由於球柵陣列封裝（ bga ）結構的特殊性，對于這種封裝上的布線演算法不同於普通的布線演算法。 -
The directed graph model of agvs is used to give a mathematical tool for the research of dispatching methods and routing algorithms of agvs ; the colored tempo - petri net system model of agvs is mainly used to describe the concurrency of agvs and the conflict of agvs
有向圖模型主要于為通過模擬來研究自動導引車的調度方法和路由演算法提供了一個有效的數學工具；而有色時延petri網系統模型則主要用來在計算機模擬系統中描述agv之間的沖撞和agvs的並發特性。 -
Based on the analysis of energy consumption caused by different forces inside network and the influences of different routing algorithms on the net life - time circle, a method was proposed to extend the net lifetime circle by changing the density distribution of net energy distribution under the circumstances of linear uniform distributed wireless sensor networks
摘要在線性均勻分佈的無線傳感器網路中，通過分析網路內各種載荷引起的能量消耗及各類路由演算法對網路生命周期的影響，提出了通過改變網路能量分佈密度來提高網路生命周期的方法。 -
Two works have been studied in this thesis, one is programmable oadm based on fbg, other is routing algorithms. the following is the main content : 1
本論文研究了兩方面內容:一方面構造了一種基於光纖光柵的可編程oadm ;另外，在波長路由方面提出了一種新的選路演算法。 -
Based on how routers gather information about the structure of a network and their analysis of information to specify the best route, we have two major routing algorithms and decentralized routing algorithms
人們基於路由器收集來的關于網路拓撲結構和傳輸信息分析報告來確定最優路由路徑，現有兩種路由選擇演算法，基於中心控制的路由選擇演算法和基於動態分散式的路由選擇演算法。 -
5. study of routing and wavelength assignment. compareing some alorithms ’ performance, one new routing algorithms is described in this thesis, which synthetically considers the effect of hops, network loads and link loads
5 .研究了路由與波長選路問題，對現有rwa演算法的性能進行了比較，提出了一種基於光通道跳數、整個網路負載以及鏈路負載綜合選路的演算法，並對該演算法進行計算機模擬，模擬結果表明，該演算法性能比far 、 fplc演算法好。 -
The system infrastructure of wmsn is firstly described in this paper so that we can understand the environment thoroughly. then a variety of wide - known ad hoc routing algorithms are surveyed in order to find out the strongpoint and weak point of them. a performance comparison between them gives a clue to the design of the osr algorithm
本文從整體的角度介紹了無線移動自組織網際網路絡的系統體系結構，為自組織路由演算法的設計提供了全局的視野，然後對當前具有代表性的自組織演算法做了簡單綜述，從中吸取了很多有益的設計思路和經驗，對按需自組織路由演算法的設計有很大的幫助。
分享友人