源路由演算法 的英文怎麼說

中文拼音 [yuánlùyóuyǎnsuànfǎ]
源路由演算法 英文
source-route algorithm
  • 源 : 名詞1. （水流起頭的地方） source （of a river）; fountainhead 2. （來源） source; cause 3. （姓氏） a surname
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 由 : causereason
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. A new algorithm is proposed that promises to deliver solutions to both the problems mentioned above, by using dual cluster head, which is very useful to minimize the use of epidemic algorithms of any sort, thereby saving a lot of resources and also making mute discovery more easier

    本文提出一種能解決以上兩種問題的新演算法，即在演算法中使用雙簇首，可以減少任何形式的流行演算法的使用，因而節約了許多資源並且使得路由發現更容易。
  2. To analyze some key technologies of optical network relative with rwa in detail, such as transmission, switching and internetworking ; to emphasize on the research of function, fabric and performance of optical cross - connection ; to carry out numerical simulations for crosstalk introduced by optical cross connect and to present measurements for suppressing it such as doubly filtering, fixing optimum decision threshold and appropriately choosing the number of multiplexed wavelengths ; 3. to research the fundamental principle and some problems relative with rwa, including the type of optical network, the type of traffic, the type of service, the survivability of optical network ; to classify and compare rwa algorithms and particularly research some dynamic rwa algorithms ; 4. to present reserved light - path and classify network resource such as used, unused and reserved status, to emulate establishment of all - optical connection in optical network through modified rwa algorithm and show effectively reducing setup time of all - optical connection utilizing reserved light - path ; to research rwa algorithms of multi - fiber network, to present new link weight functions dependent on node degree, unused fiber ( s ) per wavelength - layer and routing policies, to perform emulation of rwa based wavelength layer graph applying new link weight functions and show them make algorithms better performance and network lower blocking rate ; 5

    詳細分析了與rwa相關的光網路關鍵技術，包括傳輸、交換、組網等，重點研究了光交叉連接的功能和結構、性能，對其引入的串擾進行了詳細分析，選擇恰當的器件參數進行了數值模擬，並提出了抑制措施（如雙重濾波、優化判決門限、選擇恰當的復用波長數） ; 3 .研究了光網路的r認叭的基本原理、與r認叭的幾個相關問題（光網路類型、業務類型、流量類型、光網路生存性） 、 r認人演算法的分類和比較，具體研究了幾種動態r場人演算法; 4 .研究了以全光連接建立時間為優化目標的r認認演算法，提出預置光路的概念，對網路資源進行狀態分類（佔用、未佔用、預置） ，利用改進的r認叭演算法模擬，預置光路可為部分新到的連接請求快速建立連接，從而提高網路性能;研究了以多光纖網路連接阻塞率為優化目標的r認城演算法，提出了以節點度數、每個波長分層的空閑光纖數以及路由策略決定的幾種鏈路權重函數，利用基於波長分層圖模型的并行r場人演算法模擬，利用新的鏈路權重函數使得演算法具有更優的性能，使網路具有更低的連接阻塞率。
  3. Then, an improved genetic algorithm is proposed to solve this problem. this algorithm makes trees with the source and all destinations are the space of operation and filter operation. with hybrid selection operator, competition among brothers, greedy operation, filter operation

    然後給出了一種基於遺傳演算法的實時多播路由選擇方法，並用改進的遺傳演算法進行了求解，該演算法採用包含源節點和目的節點的樹作為交叉和變異的空間的方法，通過加入混合選擇、小范圍競爭擇優的交叉變異操作，提高了全局搜索能力和收斂速度。
  4. Extensive experimental simulations are performed based on the above proposed algorithms and the considered routing models. the simulation results show that our algorithms effectively get higher request acceptance ratio and more balanced network load, and improve the availability of network resource

    通過模擬測試表明，我們所提出的演算法比以前所提出的關于相關問題的qos路由演算法具有更高的請求接受率，並更加有效地均衡了網路負載，提高了網路資源利用率。
  5. As to the applications, since the web nodes and pages can be labeled using url, these algorithms are used to analyze the authoritative resources on the web

    在應用方面，由於網際網路上的節點可以被唯一標定，唯一標號圖分析演算法就被成功地用於對web權威資源的分析工作中。
  6. Because internet is based on the bandwidth statistical multiplexing principle so there are lots of active flows competing limited bandwidth resource in a link. when network congestion occurs aqm must send congestion notification to adequate sources to reduce the traffic load and avoid queue overflow

    由於網際網路是基於帶寬統計復用的，一條鏈路上有很多活躍流（ activeflows ）在競爭有限的帶寬資源，因此，進行擁塞通知時應充分考慮到瓶頸鏈路上流的數量，而red演算法並沒有考慮到這一點。
  7. It can be used in any complex environment, can locate all paths from transmitter to receiver which avoid redundant calculation, and it is a standard 3 - d forecast model ; in addition, it is a point to point ray tracing method based on specular theory which do n ' t carry out the receive test ; furthermore the model adopt the reverse arithmetic which exert the tree concept in data frame and establish a virtual fountain tree permanently, the proagmme can back - search the virtual fountain tree when it is running. these operation increase the calculate speed and it result in the higher receive efficiency and precision. the thesis design a programme to compare the prediction results based on ray tracing method of virtual fountain tree between the measurement results and prediction results based on the other transmittion models. the comparsion result indicate the new model is a better model

    它可應用於任何復雜的傳播環境中，能找到發射機到接收機之間的所有電波傳播路徑而無須冗餘的計算，是一種準三維的預測模型；另外，從本質上講，它仍然是一種基於鏡像理論的點對點的射線跟蹤法，所以它無須進行接收測試；而且由於採用了反向演算法，運用數據結構中多叉樹的概念，先確定需要計算的場點位置，找出所有能從源點到達場點的射線，並且可一次性建立一個虛擬源樹，以後每次的計算只要通過對該樹進行後序遍歷即可，大大提高了運算速度，因而有較高的接收效率與精度。本文對該模型進行了相應的模擬，並將其預測結果與實測結果以及基於cost231經驗性模型和基於強力射線跟蹤確定性模型的預測結果進行了比較，結果表明了該模型的優越性。
  8. The main purpose of multicast routing is to construct a tree rooted at the source and spanning all destinations, while the quality of services ( qos ) be satisfied

    組播路由演算法的目標是尋找一棵連接源節點和多個目的節點的組播樹，同時滿足各種服務質量需求。
  9. 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請求距離向量路由和動態源路由是重要的請求路由演算法。
  10. 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 ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。
  11. A source routing framework is proposed to route traffic flows proactively over multiple paths, which tries to optimize routes for long - lived flows based on dispersity routing ; based on mathematical analysis, our approach disperses incoming traffic flows onto multiple paths according to path qualities. long - lived flows are detected and migrated to the shortest path if their qos could be guaranteed there. suggesting non - disjoint path set, four types of dispersion policies are analyzed, and flow classification policy which relates flow trigger with link state update period is investigated

    提出一種以業務量內在特性為基礎的前攝式多路路由演算法：以對業務量的內在特性分析為基礎，該方法在多路發送數據流的同時檢測非最短路徑上的長流，而後在保證服務質量的前提下將長流遷移到最短路徑上傳輸；前攝式多路路由使用以路徑質量評價為基礎的業務流分佈方法有效提高網路吞吐量，通過周期性的路徑質量評價適應時變網路狀況；模擬實驗表明，該方法可以有效提高「盡力而為」方式下的網路服務質量和資源利用率；浙江大學博士學位論文3
  12. 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

    為此本文在無線傳感器網路中研究了基於自適應的路由演算法，主要工作如下:針對傳感器節點能量及傳輸范圍有限等特點，提出了一種基於延遲的自適應洪泛路由演算法，首先通過源節點在網內用較小的路由請求報文和路由回復報文來建立路由，路由建立的過程中自適應地確定等待時間以使更優的路由請求報文得到轉發，然後源節點再沿著建立好的路徑轉發較大的數據報文。
  13. Source - route algorithm

    源路由演算法
  14. Through the analysis of the reliability and the validity of rdab algorithm, we can affirm that the rdab algorithm is a valid flooding broadcast algorithm. simulation results show that rdab strategy outperforms the ordinary flooding broadcast method ( obm ) for the ad hoc networks

    該演算法是一種典型的按需路由演算法，它利用路由回復分組給源節點反饋回正向路徑上總的排隊分組數，動態的選擇最佳路徑。
  15. 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

    按需自組織路由演算法，顧名思義，是一種按需方式的演算法，減少了在網路自組織時演算法對網路資源的消耗。
  16. At last, we will propose some new methods and ideas. firstly, aiming at the improving of the ratio of internet resource and optimization of internet scheme, we propose multi - objective optimization singlecast routing algorithm based on the differentiated service, which can provide different quality transmission services for different rank network data. the model can balance the network load and reduce the network congestion effectively

    首先，本文針對如何為不同等級的數據提供不同質量的傳輸服務，如何提高網路資源利用率，優化網路配置等問題，在分析和對比常見的兩種qos服務模型:綜合服務模型和區分服務模型的基礎上，提出了基於區分服務模型的多目標最優化單播路由演算法。
  17. A differentiated routing algorithm is proposed to route network traffic based on rdm bandwidth allocation model. advertising rdm model parameters and bandwidth utilization statics, different routing path is computed and established for different traffic class by using corresponding logical view of network. it is shown that diffroute can improve service quality in differentiated network effectly while improving resource utilization

    提出一種多路區分路由演算法：針對區分服務網路中存在的「類間效應」 ，以rdm鏈路帶寬分配模型為基礎，通過為不同類負載計算不同的傳輸通路，區分路由可以在確保資源分配公平性的基礎上有效改善各類網路負載的分佈狀況，提高區分服務網路的服務質量； 4
  18. Then the result of certain k - shortest path algorithm is introduced as a set to be chosen by both the simulated anneal algorithm and heuristic algorithm, concerning the end - to - end traffic requirement and restriction on link bandwidth. afterwards, the effect of the value k on the outcome of the simulated anneal algorithm is researched. the network resource is allocated, while the study of link protection problem on traffic routing is introduced and two types of protection, shared protection and dedicated

    首先考察實際的網路模型，根據業務需求，引入k路由演算法的結果作為模擬退火演算法和啟發性演算法備選路由集合，在鏈路帶寬有限的約束下對網路資源進行分配，同時引入業務路由的通路保護問題的研究，實現了共享保護和專用保護兩種通路保護方式;針對全波長轉換網路和無波長轉換能力網路，根據為所有連接請求所分配的總資源最少和滿足請求的業務數目最多兩種優化目標對資源分配進行優化，研究了備選路由集大小對模擬退火演算法結果的影響;對模擬退火演算法與啟發性演算法的
  19. 3. resource management algorithm of guarantee qos routing is given, which has proposed a new algorithm with gloal minimum jitter under the weighted fair queue

    給出了保證qos路由演算法的網路資源管理演算法，並重點給出了在加權公平意義下的隊列的數據傳輸的全局抖動最小演算法。
  20. 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路由演算法按需尋找從源節點到目的節點的最短路徑，然後逐跳進行預約傳送數據。
分享友人
分享到 Line

分享到臉書