queue buffer 中文意思是什麼

queue buffer 解釋
隊列緩沖器
  • queue : n 1 發辮，辮子。2 〈英國〉（順序等車、購物的）行列，長隊；車隊。vt 把（頭發）梳成辮子。vi 〈英國...
  • buffer : n 1 【機械工程】緩沖器，緩沖墊；阻尼器，減震器；消聲器。2 【化學】緩沖，緩沖劑。3 緩沖者；緩沖物...
  1. After that, qos management methods are introduced, including packet classification, congestion control and buffer queue management. several queuing principles are compared such as fifo queuing, prioritized queuing and weighted fair queuing. tail drop and active queue management are also introduced in this part

    同時對epon系統採用的qos管理策略做了詳細的闡述，分析了報文分類方法、擁塞管理策略、緩沖隊列管理策略，對比了fifo隊列、 pq隊列和wfq隊列等幾種主要的隊列特點，以及尾丟棄和主動隊列管理aqm的區別。
  2. Making use of asymptotic analysis of a queue handling many traffic sources, a method for estimating qos parameters based on measurement is presented, which takes into account the effects of the finite buffer space on the multiplexing performance

    利用大數量業務源復用漸近分析理論提出了一種基於測量的qos參數估計方法，該方法考慮了有限容量緩沖區對復用性能的影響。
  3. However, with many burst traffic simultaneously arriving at a node, the queue length may become larger and buffer overflow in a moment, or high - speed link is emerged into slower one, there will be in congestion

    然而，當多個突發業務同時到達一個節點時，緩存隊列長度迅速增加，在極短的時間內出現緩沖溢出，或高速鏈路接入慢速網路中引起輸入鏈路速率大於輸出鏈路速率，則導致網路擁塞。
  4. Socket function mainly realizes setting up and initializing service unit socket, initializing service unit and service unit serial and so on. bind funcion primarily binds local address and port for the socket. listen function is to evaluate the max length of server ’ s listening queue. connect function and accept function set aside rate ahead, infrom user ’ s request of establishing virtual circuit to suna, cooperate with suna to establish the connection between client and server, return the result. we make use of three handshake with data protocol and virtual circuit mode, in this way, when we translate data, we can look up communication course according to virtual circuit number, at the same time, there aren ’ t source ip address and port, end ip address and port in the head of data package, the speed of translating data advances in a certain extent. send function and recv function is to send data collaborating with suna, and copy data from the receiving queue of socket to user ’ s buffer. close function cooperate

    Socket （ ）函數實現創建、初始化服務元套接字，初始化服務元及服務元序列等。 bind （ ）函數為套接字綁定本地地址和埠號。 connect （ ）和accept （ ）函數主要是根據用戶要求預留帶寬，將用戶的建立虛電路請求轉達給服務元網路體系，協作服務元網路體系採用捎帶數據的三次握手協議建立虛電路，並告訴用戶處理結果，一方面，捎帶數據的三次握手協議在一定程度上可提高數據傳輸速度;另一方面，採用虛電路方式，使得數據通信可直接根據虛電路號查找相應的通信進程，而且數據包的包頭中省去了源ip地址、埠號和目的ip地址、埠號，提高了數據傳輸速率。
  5. With regard to the flow regulation of the best - effort traffic, the controllable traffic in high speed computer communication networks, the present paper proposes a novel control theoretic approach that designs a proportional - integrative ( pi ) controller based on multi - rate sampling for congestion controlling. based on the traffic model of a single node and on system stability criterion, it is shown that this pi controller can regulate the source rate on the basis of the knowledge of buffer occupancy of the destination node in such a manner that the congestion - controlled network is asymptotically stable without oscillation in terms of the buffer occupancy of the destionation node ; and the steady value of queue length is consistent with the specified threshold value

    本文從控制理論的角度出發，針對計算機高速網際網路中最大服務交通流即能控交通流的調節問題提出了一種基於多速率采樣的具有比例積分（ pi ）控制器結構的擁塞控制理論和方法，在單個節點的交通流的模型基礎上，運用控制理論中的系統穩定性分析方法，討論如何利用信終端節點緩沖佔有量的比例加積分的反饋形式來調節信源節點的能控交通流的輸入速率，從而使被控網路節點的緩沖佔有量趨于穩定;同時使被控網路節點的穩定隊列長度逼近指定的門限值。
  6. 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請求優先響應，這對于保證高額交易證書安全性十分重要。
  7. 4. putting forward a data compression means, which reducing data transfer volume and adding data transfer efficiency. resolving the data transfer buffer problem by adopting the sending or receiving round - robin queue technique

    （ 4 ）設計了一種針對開關量的數據壓縮方法，減少了數據傳送量，提高了數據傳輸效率，並採用發送/接收循環隊列技術，解決了數據傳輸時的緩沖問題。
  8. 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排隊模型，利用補充變量法對狀態概率方程組進行分析，得出了此排隊系統隊長分佈母函數及通信網緩沖器中的平均隊長，並對不同優先權隊列的進一步討論，得出了不同優先權隊列的隊長分佈母函數及穩態隊長。
  9. The novel olt - based polling scheme has a fixed polling cycle ( 2ms ). onu ’ s buffer receives different data packets from user, and these packets are classified and then placed into their corresponding appropriate priority queue

    新演算法採用olt端集中統籌控制並以固定周期2ms輪詢各個onu ， onu端主要控制分類緩存用戶端來的不同類別業務流。
  10. Under this kind of buffer, to assure different qos cells queue according to their service type. additionally using this kiand of buffer could solve head blocked, shape the output flow, enhance channel utilization and decrease the cost of atm switch

    這種緩沖結構根據信元所屬的服務類型排隊，切實保障了不同類型服務的qos ，另外還能夠解決頭阻塞問題，緩和突發通信量，提高資源利用率，並且降低成本。
  11. Wsaenobufs 10055 : an operation on a socket could not be performed because the system lacked sufficient buffer space or because a queue was full

    意思上一說系統緩沖區不夠或隊列已滿。是不是你埠開的太多了？
  12. Through the analysis of the three kinds of queue model switches, the throughput, average delay and mean waiting cell numbers in the buffer are given for different models of queueing switches in this paper

    文中通過對這三種排隊模型交換機的分析，給出了不同排隊模型交換機的吞吐率、信元的平均延時及緩沖器中平均等待信元數。
  13. Our new idea makes the users queue in the buffer at the time of peak access to avoid the economic losses for the sake of refusing client - side access in the case that no buffer is available at the repository " s side. as argued in this report, the new method reduces the peak loads of repository effectively

    該方法在存儲庫的峰值訪問期間，讓大量並發訪問用戶在緩存器中排隊，避免了crl請求因無緩沖而被立即拒絕帶來的經濟損失，而且，有效降低存儲庫的峰值負荷。
  14. The swap chain might include multiple back buffers and is essentially a circular queue that includes the front buffer

    交換鏈可能包括多個后臺緩沖區，它本質上是一個包括前臺緩沖區的循環隊列。
  15. This thesis also initially proposes and implements a circular queue to save compressed data and buffer the transmitting

    論文還提出和實現了基於雙指針循環隊列的緩沖區，以實現數據壓縮暫存和傳輸緩沖。
分享友人
分享到 Line

分享到臉書