routing approach 中文意思是什麼

routing approach 解釋
路徑選擇法
  • routing : 安排程序
  • approach : vt 1 向…接近，走近；使接近。2 探討；看待，對待，處理。3 向…接洽[提議]。4 〈美國〉企圖收買。vi 臨...
  1. 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系統在平面選擇和中間級選擇時所採用的簡單隨機或輪循方案的不足。
  2. 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網路的一些性質及實現置換路由的沖突次數及發生沖突的充要條件，並且給出了基於時域法的無串擾的實現置換路由的三種調度演算法，討論了演算法的時間復雜度以及所需要的調度次數的上界。
  3. It adopts dht - based approach, but solves the problem of long latency and inefficient routing of lookup messages

    它基於dht方法但是解決了其延時長和效率低等問題。
  4. Research on an isochrone approach and its shortest routing algorithms based on gis

    等時線分析方法及其最佳路徑演算法研究
  5. Utilizeing the iterative approach to improve the density of anchor nodes gradually, and taking advantage of the concept of dv routing, a novel distributed, hop - by - hop, simple positioning algorithm, referred to as hop - euclidean, is presented and simulated. the results show that it has the good positioning accuracy and coverage 4

    3 、以euclidean演算法為基礎，融入距離矢量路由和迭代循環的思想，設計出一種新的定位演算法，稱為hop - euclidean ，對其核心思想和演算法進行討論，並進行模擬驗證。
  6. Tree construction is a commonly used approach in solving the multicast and group multicast routing problem

    本文主要研究多播和群播路由演算法，即建立滿足各種業務服務質量需求的多播樹。
  7. Abstract : an efficient parallel global router using random optimization that is independent of net ordering is roposed. parallel approaches are described and strategies guaranteeing the routing quality are discussed. the wire length model is implemented on multiprocessor, which enables the algorithm to approach feasibility of large - scale problems. timing - driven model on multiprocessor and wire length model on distributed processors are also presented. the parallel algorithm greatly reduces the run - time of routing. the experimental results show good speedups with no degradation of the routing quality

    文摘:設計實現了一個高效的線長模式下基於多處理機的并行總體布線器.通過對非時延驅動模式下串、并行演算法的總運行時間和求解時間的比較，表明該并行演算法能夠在保證求解質量無明顯變化的前提下大大加快總體布線演算法的求解速度.同時，也提出了基於分散式體系結構的并行總體布線演算法
  8. 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
  9. For optical - layering approach, we propose an ant - based algorithm, which uses the ants " capability of finding shortest or near - shortest paths between a food source and their nests, to solve the logical topology reconfiguration problem. we give the ants routing formula based on dynamic load balancing and short path on the assumption that some conditions hold

    前者適合於業務矩陣變化不是太頻繁的網路，提出利用螞蟻演算法解決業務的再路由問題，即利用螞蟻具有找到最短徑及不同種類螞蟻具有互斥的天然特性來進行邏輯拓撲重配置，從而保證了鏈路負載分佈的平衡性。
  10. It reframes the traceback problem as a polynomial reconstruction problem, and uses techniques from algebraic coding theory to provide robust methods of transmission and restriction. the scheme is a new solution to the traceback problem during a dos attack ; the honeypot for ddos, which is a tool of traceback, lures the attacker to believe that he successfully compromised a slave for his needs, convincingly simulating the architecture of a potential ddos attack ; the source - based approach to ddos defense, which is a useful adjunt to traceback systems, deploys a ddos defense system at source - end networks. attacks are detected by monitoring two - way traffic flows, and the attacks originating from source networks are stopped by rate - limiting ; the routing mechanism based on pushback treats ddos attacks as a congestion - control problem

    最後，就有關ddos攻擊反向追蹤問題，從四個方面對其解決方案進行了研究：在分析比較幾種反向追蹤演算法的基礎上，著重研究了代數方法編碼反向追蹤信息的方案，該方案把追蹤重構問題當作多項式重構問題，使用代數編碼理論技術提供魯棒的傳送和重構方法，是dos攻擊過程中的反向追蹤問題的一種新的解決方法； ddos陷阱作為反向追蹤的工具，引誘攻擊者相信自己成功與所需的傀儡主機通話，令人信服地模擬出潛在ddos攻擊體系結構；基於源的ddos防禦方法作為反向追蹤有用的補充，將防禦系統部署在源網路，通過監控雙向流量檢測攻擊和限制速率終止來自源的攻擊；基於向後倒推的防禦ddos的路由機制把ddos攻擊看作擁塞控制問題，添加功能到每個路由器來檢測並優先丟棄可能屬于攻擊的包，通過向後倒推上級路由器也得到通知而把這樣的包丟棄。
  11. Tree construction is a commonly used approach in solving the multicast routing problem with constraints

    帶約束的多播路由演算法就是要尋求一棵滿足給定約束且費用最小的多播樹。
  12. A fundamental issue in multicast communication is how to determine an efficient message route ( multicast routing ). tree construction is a commonly used approach in solving the multicast routing problem

    本文主要研究多播路由演算法，即建立滿足媒體傳輸服務質量（ qos ： qualityofservice ）需求的多播樹。
  13. Tree construction is a commonly used approach in solving the multicast routing problem. one advantage of multicast tree is that data are distributed to different multicasting destinations along the branches in parallel, which reduces the delay. the other is that message need only be replicated at forking nodes, which minimizes the data replication, spares the network bandwidth, reduces the network load and lessens the congestion

    實現組播的一般方式是建立組播樹，組播樹的優點在於：首先，信息以并行方式沿著樹枝發送到不同的組播終點，從而降低了信息傳遞的時延；其次，信息的復制只在樹的分支處進行，因此網路中需要傳送的復制信息量最少，能夠節約網路帶寬資源，降低網路負載，減少擁塞。
  14. Under this background the dissertation is intended to develop some algorithms for vlsi physical design detailed routing. the main contributions of this dissertation are summarized as follows : a novel multi - layer detailed routing approach based on a new combined layer assignment model is proposed in section 3

    本文完成的主要工作如下: 1 、在第3章提出了一種新的多層詳細布線模型? ?復合分層布線模型，作為對傳統詳細布線模型的補充，從一個新的角度對詳細布線問題進行了研究。
  15. Destination - based approach for routing traffic flows in traffic assignment problems

    基於終點的路徑交通量求解方法
  16. The direct consumer routing approach, on the other hand, assumes dynamic routing and, consequently, dynamic processing of the service definition files

    從客戶直接路由的方法相反，期望動態路由，因此需要服務定義文件的動態處理。
  17. This paper points out some flaws and restriction of existing multicast routing algorithms through the research and analysis of existing multicast routing algorithm ? improves the operators of genetic algorithm, and brings forward a qos multicast routing approach with good point set based genetic algorithm. this is a main research work of this paper

    本文通過對現有組播路由演算法的研究與分析，指出了現有的一些演算法的缺點及局限性，並且對遺傳演算法的遺傳運算元進行了改進，提出了一種新的基於遺傳演算法的qos組播路由選擇方法，這是本文的一個創新點，試驗表明，該演算法性能較好，效率較高。
  18. Secondly, unlike previous approaches that concentrated on reducing forwarding states to improve multicast scalability after constructing multicast trees, our approach is to include forwarding state scalability as one of the optimal objectives when constructing new multicast trees. that is, we make the underlying routing algorithms aware of the scalability requirement. this is scalability - aware approach can be applied to many exiting multicast state reduction methods

    第二，針對現有多播可擴展性方法的不足（現有的方法大都在已有多播路由的基礎上進行改進，效率較低） ，將多播可擴展性作為一個最優化目標引入到多播路由演算法的設計中，有效地提高了多種多播可擴展性方法的效率，是多播可擴展性研究的一個新思路。
  19. As far as the vlsi physical design is concerned, many problems have been proved to be np - complete, such as placement, global routing and detailed routing. on the other hand, the computational intelligence, a novel approach of optimization techniques have showing its great capacity and potential in solving large - scale complex problems, hence the study of computational intelligence methods to solve existing problems is very necessary for high performance physical design in the deep sub - micron technology

    Vlsi物理設計中的布局、總體布線和詳細布線是典型的np問題，計算智能方法為解決np復雜度的大規模問題展示了廣闊前景，因此研究各種計算智能演算法求解這類問題，對于滿足深亞微米工藝下高性能物理設計中的諸多要求是十分重要的。
  20. Wavelength - division multiplexing ( wdm ) is a promising approach that can use the enormous bandwidth of the optical fiber. a single fiber can be employed for multiple data streams simultaneously. all - optical networks employing the concept of wdm and wavelength routing are considered as the transport networks for the future

    由於wdm網路關鍵部件目前還較昂貴，在這樣的網路上運行ip業務，既要考慮到網路的魯棒性和對資源利用的有效性，又要考慮網路的可升級性能，這常常是互為矛盾的。
分享友人
分享到 Line

分享到臉書