隊列優先權 的英文怎麼說

中文拼音 [duìlièyōuxiānquán]
隊列優先權 英文
queue priority
  • 隊 : Ⅰ名詞1 （人排成的行列） a row of people; line 2 （具有某種性質的集體） team; group 3 （特指少年先...
  • 列 : Ⅰ動1 （排列） arrange; form a line; line up 2 （安排到某類事物之中） list; enter in a list Ⅱ名詞1...
  • 先 : 名詞1 （時間或次序在前的） earlier; before; first; in advance 2 （祖先; 上代） elder generation; ...
  • 權 : Ⅰ名詞1 [書面語] （秤錘） counterpoise; weight （of a steelyard）2 （權力） power; authority 3 （...
  1. Compared with traditional cluster, the cooperative - type - cluster has carried the sync net packets from all real server ’ s network cards to director and set up a priority queue of sync net packets for dmcs, then it has transmitted them through the cooperation of nodal servers and directoer, it has made that the nodeal server lost efficiency suddenly or automatically joined or broke away from the cluster not influence the whole system ’ s normal running again ; meanwhile, it can avoid reducing handling capacity even appearing phenomenon of “ living locking ” in high load

    與傳統集群相比，合作式集群從各真實服務器端網卡報文隊列中分離出請求報文移至負載均衡器端，建立針對分散式測控系統的請求任務報文優先權排隊隊列，通過節點服務器與負載均衡器合作進行報文轉發，使得節點服務器突然失效或自動加入脫離集群不再影響整個系統的正常運行;同時，也能避免在高負載下處理能力降低甚至出現「活鎖」的現象。
  2. Since the technique that the priority queue service in the buffer and responding firstly high - priority certificate over others are adopted, the new scheme ensures certificate security, which is applied to important business effectively

    同時，在緩存器的排隊隊列中實施優先權服務，將高優先權證書的crl請求優先響應，這對于保證高額交易證書安全性十分重要。
  3. In ad hoc, based on dcf ( distributed coordination function ) of ieee 802. 11, this paper introduces a new mac, which divides the packet into three kinds : non - periodic real - time information, periodic real time information, and non real - time information. the priority of these three information packets demotes in turn

    針對交換式以太網qos實現問題，按照網路流量分配優先級、實時性信息分配較高優先級的原則，本文提出考慮優先級的加權公平隊列演算法（ wfqp ） ，即對交換機的數據流進行調度處理，降低實時信息的端到端延遲，從而有效提高實時信息的傳輸質量。
  4. We first consider the m / m / s queueing model with two priorities. through the analysis of state transition - rate equations of two priorities, the average queue length at the input or output of communications systems is derived

    首先考慮帶有兩個優先權的m m s排隊模型，通過對兩個隊列的狀態轉移方程的分析，給出了通信系統輸入輸出線上的穩態隊長。
  5. We then consider the n policy m / g / 1 queueing model with two priorities. by using the supplementary variable method to analyze the state probability equations, we derive the generating function of queueing length distribution and the mean queue length in the buffer of the communications network. and through further discussing for the queue with various priorities, we derive the generating function of queueing length distribution and the stationary queueing length in queue models with various priorities

    其次研究帶有兩個優先權的n策略m g 1排隊模型，利用補充變量法對狀態概率方程組進行分析，得出了此排隊系統隊長分佈母函數及通信網緩沖器中的平均隊長，並對不同優先權隊列的進一步討論，得出了不同優先權隊列的隊長分佈母函數及穩態隊長。
  6. Then, a priority message queue is designed, and weighted fair queuing ( wfq ) algorithm is used for messages queuing

    其次，設計了可靠的消息隊列，並採用平均加權演算法對消息進行排隊，支持優先級機制。
  7. Although the congestion control research of host - ends has made great strides, the current queue management mechanism in router is not able to provide end - to - end congestion control mechanism to sustain the above environment, namely, the unfairness of assigned bandwidth or drop - rate for different types of flows and the synchronization of all tcp flows in network. so it is necessary to improve the classical queue management mecnanism such as drop _ tail and red in order to boost the qos ( quality of service ). this article analyzes the main traits of host - ends congestion control and all kinds of fashionable queue management machanism, which include queue mechanism with absolute priority, weighted fair queue mechanism and class - based queue mechanism

    本文分析了主機端的擁塞控制機制和網路中路由器的現有各種隊列管理機制：絕對優先級隊列機制、加權公平隊列（ weightedfairqueue ） [ 1 ]機制、基於類的隊列（ class - basedqueue ） [ 2 ]機制以及red （ randomearlydetection ） [ 3 ]機制的主要特點，並重點針對ietf （ internetengineeringtaskforce ）推薦的把red演算法與明確的擁塞通告ecn （ explicitcongestionnotification ） [ 4 ]結合的方法進行了分析，發現隨著internet流量的日益遞增， red機制的依賴平均隊列長度來管理擁塞控制的演算法並不能有效地阻止包丟失：與drop - tail相比， red確實消除了對陣發流量（ tcp ）的偏見，但是增加了平滑流量（ udp ）的丟包概率。
分享友人
分享到 Line

分享到臉書