tail of the queue 中文意思是什麼

tail of the queue 解釋
隊尾
  • tail : n 1 尾巴。2 尾狀物，垂下物；（西服的）垂尾，燕尾；〈pl 〉燕尾服。3 辮子；風箏尾巴。4 末端；結尾，...
  • of : OF ＝Old French 古法語。
  • the : 〈代表用法〉…那樣的東西，…那種東西。1 〈用單數普通名詞代表它的一類時（所謂代表的單數）〉 （a） 〈...
  • queue : n 1 發辮，辮子。2 〈英國〉（順序等車、購物的）行列，長隊；車隊。vt 把（頭發）梳成辮子。vi 〈英國...
  1. We were at the tail of the bus queue

    我們立在公共汽車候車隊伍的末尾。
  2. 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 ）的丟包概率。
  3. The traditional technique for managing router queue in internet usually adopts first in first out ( fifo ) scheduling and " drop tail " queue management algorithms, which have no provision for the detection of incipient congestion when the queue is full

    Internet中傳統的路由器通常採用先來先服務的調度演算法以及「棄尾」緩沖管理方法，在指示和控制擁塞方面不提供任何顯式的支持。
  4. Consequently a new cac scheme for cbr traffic, lv ~ ? { ~ l ~ : atm ~ iija ~ jlijf ~ linear approximation cac scheme based on the lowest rate replacing, is presented. instead of using the tail of the infinite queue length distribution as an estimate to clr, this cac scheme obtains clr by the upper bound on it, and qos can be well guaranteed in our scheme

    在此基礎上，提出了一種新的cbr業務連接允許控制機制；基於最小速率替換的線性近似cac機制，該機制能夠提供服務質量保證，並且採用了有限容量緩沖區情況下cbr業務信元丟失率的上界，而不是將clr用無限容量緩沖區排隊系統的隊長尾部分佈來近似。
分享友人
分享到 Line

分享到臉書