queue packet 中文意思是什麼
queue packet
解釋
隊列包-
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的區別。 -
Based service time distribution difference, we obtain distribution of packet number and queue of frame in system through queue theory
根據服務時間的分佈不同，用排隊論的方法分析了系統中包數的分佈和隊列長度的分佈。 -
This text has analysed load balancing method of existent especially lvs cluster system and recommended the net packet and netfilter ’ s frame structures in the linux operating system ; it has compared the cooperative - type - cluster with tradictional cluster in the net packets ’ queue ways and with active cluster in the load balancing dispatcher way, which has reflected the superiority of cooperation type cluster ; the three major parts of the cooperative - type - cluster have been designed and realized in this text, which includes sync packets ’ priority service for dmcs 、 “ priority and avoid sudden load unbalance ” dispatch way at the cooperation of nodal servers and director and active nodal server which ensure cluster normally running when cluster join or rduce node server ; the cooperative - type - cluster ’ s control frame controlled by homepage has been constructed ; the mulit - services cluster system has been realized ; this text has used the existing server pressure testing tools to test the cooperative - type - cluster and lvs cluster, then has comparaed and analysed the two
本文分析了現有服務器集群特別是lvs集群系統的負載均衡方法，介紹了linux系統下的報文和netfilter的框架結構;將所提出的合作式集群與傳統集群在報文排隊方式上進行比較，與主動式集群在負載均衡調度方式上進行比較，體現了合作式集群的優越性;設計並實現了合作式集群體系結構的三大部分:針對分散式測控系統的加權服務、負載均衡器與節點服務器合作式「加權防突」負載調度、保證集群運行不受加減節點干擾的主動性真實服務器;構建了通過網頁界面控制合作式集群的控制框架;實現了一個可運行的合作式多服務集群系統，運用現有服務器壓力測試工具對合作式集群和lvs集群進行負載測試，並對測試結果進行比較分析，同時通過壓力測試實現加權服務。 -
After these discussions, we ' ll focus on the implementation of traffic control on the linux operating system, including the new queue processing, new packet classify processing, the interface to the traffic control, the modification of network adapter driver. this thesis consists of five chapters. the first chapter analyzes the rapid development and the traffic control requirements of the distributed parallel firewall system, and points out the necessity for the implementation of load balance in distributed parallel firewall system
為了解決以上問題，本文首先描述了整個分散式并行系統的邏輯結構，然後分析了現階段的linux自身的流量控制機制和流量分發技術;接著重點描述了分散式并行防火墻系統的流量控制和分發機制的整體設計以及相關的關鍵技術的研究和實現，主要包括下面的內容: linux自身的流量控制機制的改進、整個系統流量負載均衡的實現、網卡驅動程序的修改等。 -
In this model, the rules of updating the node throughput and the packet queue length is deigned, and the probability of reducing the throughput is also defined for describing the node random behaviors
制定了節點吞吐量和分組隊列長度的更新規則，引入了減速概率來模擬節點發送分組的隨機行為。 -
Ieee standard for mans ( metropolitan area networks ). formerly known as qpsx ( queued packet and synchronous exchange ), now known as dqdb ( distributed queue dual bus ). it was approved in 1990
Ieee關于城域網標準。原來的名稱為qpsx （隊列分組同步交換） ，現名為dqdb （分散式隊列雙總線） ， 1990年獲得批準。 -
The algorithm calculated packet loss rate according to the average queue length and waiting time
這種演算法根據平均隊列長度和等待時間計算數據包的丟棄概率。 -
Make clear the procedure of sending and receiving packet of kernel and the implementation of traffic control. the special mechanism in linux such as wait queue, task queue, time interrupt is also explained. after analyzing the file system of linux at large, we bring forward the design of modifying of file system. since many little file is created during the service of email and file service, we introduce the non volatile random access ram, by modifying the arithmetic of file system, changing the data flow of file system
本文詳細介紹了針對網路專用服務器的專用linux系統的設計，對linux文件系統進行了詳盡的解析，包括vfs的實現， buffercache的作用等；並對塊設備驅動程序在內核中各個介面進行了分析；解析了內核接收和發送數據包的全過程以及流量控制在內核中的全過程；並對linux系統的一些特殊的機制如等待隊列，任務隊列，時鐘中斷等進行了詳細的解釋。 -
The packet unit has a queue into which fetched cache blocks are stored containing instructions
封裝單元中具備了一個佇列，用以儲存讀取到的資料。 -
When congestion occurs, red randomly select sources to notify congestion before queue overflow and once tcp sources receive the notification it will reduce the congestion window to decrease the packet sending rate, and therefore, mitigate the network congestion
Red的基本思想是路由器通過監控隊列的平均長度來探測擁塞。一旦發現擁塞逼近，就隨機地選擇源端來通知擁塞，使他們在隊列溢出導致丟包之前減小擁塞窗口，降低發送數據速度。 -
This thesis analyzes the differentiated service architecture and studies its control mechanisms of realizing ip qos, including packet marking policy, queue scheduling algorithm and packet dropping mechanism etc. after that a diffserv simulation platform is built using the improved diffserv model in ns2 ( network simulation 2 ) developed by u. c. berkeley and simulations have been done on it, which shows that the platform, can service different traffic flows and provide a better solution for realizing point - to - point ip qos. this thesis studies the control mechanisms of realizing ip qos in diffserv and does research work as below : firstly, this thesis studies the packet marking policies
本文通過分析區分服務（ diffserv ）模型的體系結構，研究其實現ipqos的各種控制策略，包括分組標記策略、隊列調度演算法及擁塞時的分組丟棄機制等，利用加州大學伯克萊分校的ns2作為模擬工具，對其已有的區分服務模塊進行了改進和完善，搭建了區分服務模擬實驗平臺，並在該平臺上進行模擬測試，實現了對具有不同qos請求的業務流的區分服務，為實現端到端的ipqos提供了更好的解決方案。 -
Transfer delay analysis and test of the two implementations of resilient packet ring transit queue
自愈分組環傳輸隊列兩種實現方案時延 -
While the rate - based dropping on burst level large time scales determines the packet drop aggressiveness and is responsible for low and stable queuing delay, good robustness and responsiveness, the queue - based modulation of the packet drop probability on packet level small time scales will bring low loss and high throughput
突發行為具有自相似或尺度不變性scale - invariant ，即流量在不同的時間尺度上具有相似的突發特性2局部縮放性。流量過程的局部奇異性使流量在小時間尺度數百ms及以下的突發非常強烈，具有非高斯分佈。 -
In this mode, the packet descriptor queue occupied few chip resource, and made the hiberarchy scheduling module with thousands of queues possible
在這種結構中，採用數據包描述符隊列佔用的晶元資源很少，使上千個隊列的層次化調度設計成為可能。 -
The method adopted the self - discarding packet technique that was a means of determining transfer by comparing the queue length of the transiting router with a specified queue value on the packet
該方法採用數據包丟失技術，通過比較傳送的數據報文中的特殊隊列值和所經過的路由器中數據包的排隊隊列長度值來決定是否對當前數據報文丟棄。
分享友人