flow routing 中文意思是什麼

flow routing 解釋
流量演算
  • flow : vi 1 流,流動。2 (血液等)流通,循環。3 流過;川流不息;(時間)飛逝;(言語等)流暢。4 (衣服、...
  • routing : 安排程序
  1. Computing low flow routing coefficient of the lower yellow river by least - squares optimization method

    最小二乘優化法解黃河下游枯水流量演進系數
  2. What flow is that, we use model simulation to analyze the em algorithm contraction ratio. through network simulating, we analyze the factors which can influence loss inference algorithm accuracy like measurement strategy or routing algorithm. we analyze the accuracy and contraction characteristic of multicast - based direct algorithm and em algorithm, and compare the error factor between them

    實驗中通過網路模擬模型,確定了em演算法的收斂速率;研究了不同測量策略和路由器擁塞避免演算法對丟包率推理演算法準確率的影響;分析了單點多播的de和em演算法準確性、收斂性等特徵,通過比較兩種演算法的統計誤差,得出em演算法略優于de演算法的結論。
  3. Decrease congestion by reducing the number of traffic incidents, clearing them more quickly when they occur, re - routing traffic flow around them

    減少交通事故次數、事故發生時更迅速地清理現場,以及於現場一帶進行交通改道,從而減少交通擠塞;
  4. This modeling prototype system is based on message flow. the server offers the functions of managing and routing message. the client explains the message and finishes modeling functions via local modeling module interface in order to achieve collaberative operations

    這是一個基於消息通信的系統,服務器端提供消息路由處理的功能,客戶端對消息進行解釋后通過ug介面調用本地造型模塊功能,以實現同步的造型操作。
  5. This paper deals with the problem of crosstalk mitigation at both methodological and algorithmic levels. noting that intermediate operations between global routing and detailed routing are very effective in crosstalk estimation and reduction, the authors propose to incorporate several intermediate steps that are separated in traditional design flow into an integrated routing resource assignment stage, so that the operations could easily cooperate to fully exert their power on crosstalk reduction. an efficient priority - based heuristic algorithm is developed, which works slice by slice

    在布線的各階段中,總體布線有較大的靈活性,但對各區域或信號線上的串擾難以估計詳細布線可以精確地計算串擾,但靈活性太小,往往出現反復拆線重布,難以達到設計收斂相比之下,總體布線和詳細布線中間的階段既有一定的靈活性,又可以相對準確地計算噪聲,是解決串擾問題的理想時機。
  6. 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選路演算法;最後對所設計的自組織路由演算法進行了模擬,以驗證演算法的有效性。
  7. Based on the mfc ( multicast forwarding cache ) formed by multicast protocol such as dvmrp ( distance vector multicast routing protocol ), pim ( protocol independent multicast ), we can build special lsp ( lable switch path ) for certain source group couple to transport multicast data flow using ldp ( lable distribute protocol ) or cr - ldp. based on the zxb10 switching router of zte co. we can now support dvmrp within the context of mpls networks

    本文主要研究mpls網路對ip組播業務的支持,根據現有的ip組播協議如dvmrp 、 pim等所生成的組播轉發表(轉發樹) ,利用mpls網路的ldp (標記分發協議) cr - ldp (顯式路由標記分發協議)為特定的源組對確立lsp (標記交換路徑) 。
  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. 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
  10. The commonly used designing flow and basic technology of integrated circuit, such as the cell layout, synthesis, simulation, fpga verification, automatic layout & routing of the digital circuit, are introduced and analyzed in detail. the layout designing and simulation of the analog circuit are also introduced and analyzed in detail

    論文對集成電路常用設計流程和基本技術作了詳細介紹和分析,其中包括數字電路的基本單元版圖、綜合、模擬、 fpga驗證和自動布局布線,也包括常用模擬電路的版圖設計和模擬。
  11. Choosing of regional railway network car flow routing

    區域性路網車流徑路的選擇
  12. In the system, dss integrates relative kb together, especially the train routing kb, approval experience kb. at the same time, the paper constructs the relative model of the claimed train approval optimization model in railroad bureau and uses the minimal cost and maximal flow algorithm based on queueing theory to solve the problem

    在本系統中, dss中集成了相關的知識庫系統,特別是車流徑路知識庫、審批經驗知識庫。同時,對鐵路請求車審批優化中的請求車審批優化問題建立了相應的模型,並利用基於排隊論的最小費用最大流求解了該問題。
  13. Tcp flow clustering based on routing information

    流聚類方法
  14. Then the functions of ismg are confirmed, namely protocol conversion, routing, store - and - forward, feeing and so on. finally according to short message service signaling flow specification, this thesis focuses on the design of the software structure, which completes ismg basic functions

    在此基礎上,明確了簡訊網關的功能,即協議轉換、路由、存儲轉發和計費,並根據簡訊信令流程的具體要求,設計了完成網關基本功能的軟體構架。
  15. Mail probes that verify local mail routing by sending a message to a known destination and verifying its delivery, that notify you if the router cannot keep up with mail flow, and that alert you if too much mail is pending to a particular destination or if mail to that destination is failing

    郵件探測器,該探測器通過向未知目的地發送消息並驗證其傳送來驗證本地郵件發送,如果路由器不能與郵件流保持一致,探測器會向您發出通知,如果對于某一特定目的地而言,有太多郵件處于待決狀態,或者發送到這個目的地的郵件發送失敗,那麼探測器也會向您發出警告。
  16. Interval routing scheme was introduced to reduce the size of routing tables, multi - dimensional routing scheme is the extension of interval routing scheme and it can represent all shortest paths between each pair of nodes, which turns out to be convenient when problems related to flow control aspects such as fault tolerance and traffic load balancing are considered

    區間路由方法是使用簡明路由表的一種路由方案,多維區間路由方法是區間路由方法的擴充,它能夠表示網路中每兩個結點之間所有的最短路徑。當我們需要考慮容錯、通信與計算量的負載平衡問題時,這將是很有用的。
  17. It analyzes the factors such as the partition of all the same layer, net power flow and distribution level to optimized routing adjustment of reactive power and voltage regulation of all power plants and substations, including local and globe. it makes power flow available and meet the need of the reactive power balancing and the reverse voltage regulation by combining the reactive power balancing principle of voltage - grading & district - dividing and local reactive power compensation with feasible power flow regulation, the reverse voltage regulation of central point voltage

    該方法將無功的分層分區平衡與就地補償原則以及中樞點電壓的逆調壓原則引入到潮流的可行解調整策略之中,通過全網同層區的劃分及其網路潮流和負荷水平的計算分析,來實施對各發電廠和變電站的電壓與無功的全局或者局部的試探調整,以保證潮流的可行,並盡可能滿足無功的合理平衡與電壓的逆調壓要求。
  18. According to ants ' routing behavior model and its resemblance to hybrid flow shop scheduling, an ant - like scheduling algorithm for hybrid flow shop is put forward

    摘要根據螞蟻路逕尋優行?模型及其與混流車間調度的相似性,提出混流車間的螞蟻調度演算法。
  19. The design flow includes the construction of basic cell libraries, placing & routing, layout verification and post - layout simulation, etc. moreover, the layout design of basic cells and functional modules, the measures of circuit protection and methods to reduce the parasitic effect are also been discussed

    這個流程介紹了與intelm80c287協處理器完全兼容的協處理器的後端設計過程。介紹了協處理器設計過程中基本單元和一些主要功能模塊的設計,以及設計中的保護措施和減少寄生效應的設計方法。
  20. Then it introduced the effect validation and flow redirection technology. finally, this paper designed the frame of the isolation system based on ospf routing protocol, and implemented it, got the conclusion

    最後在以上工作的基礎上,設計了基於ospf路由協議的末端隔離系統框架,並進行了實現,得出了結論。
分享友人