queueing network 中文意思是什麼

queueing network 解釋
排隊網路模型, 公共服務網
  • network : n. 1. 網眼織物。2. （鐵路、河道等的）網狀系統，網狀組織，廣播網，電視網，廣播[電視]聯播公司。3. 【無線電】網路，電路。4. 【計算機】電腦網路，網。
  1. Finding a feasible and efficient load balanced strategy for the ultra - scalable multi - plane multi - stage switch architecture is a top of nowadays research. the dissertation proposes a two - stage load balanced scheme for the ultra - scalable multi - plane multi - stage switch architecture based self - routing and non - blocking permutation benes network. the approach uses reasonable and efficient logical queueing strategy and schedule scheme in ingress traffic managers and switch planes to realize the two - stage load balancing of ip traffic which for different destination addresses

    本文提出一種適用於基於完全可重排無阻塞benes拓撲構建的多平面多路徑（多級）超大容量交換結構的兩級負載均衡策略，通過在輸入流量管理器和benes交換平面內部實施合理而高效的隊列組織調度方法，有效實現了基於不同目的地址的ip流量在兩個層次上的負載均衡，較好彌補了ciscocrs - 1系統在平面選擇和中間級選擇時所採用的簡單隨機或輪循方案的不足。
  2. The basic thought of the csapfba algorithm is : the edge routers perform the state management per flow, and the edge routers differentiate between the marked flows and the non - marked flows, and the edge routers insert the relevant information into the packet header by using dynamic packet state ; the core routers divide the output link bandwidth into two parts in the light of the state information of the packet header by using class - based queueing, and the core routers allocate proportionally the bandwidth to the marked flows according to their service profiles and the current network load, and the core routers allocate the bandwidth to the non - marked flows according to the principle of max - min fairness, and the csapfba algorithm can adaptively dynamically adjust the bandwidth allocation between the marked flows and the non - marked flows

    本文在csfq演算法的基礎上，提出了一種核心無狀態的自適應的成比例公平帶寬分配csapfba （ core - statelessadaptiveproportionalfairbandwidthallocation ）演算法。 csapfba演算法的基本思想是：在邊界路由器完成基於每個流的狀態處理，將所有的流分成標記流和非標記流兩種類型，採用dps技術將有關信息編碼進分組頭；在核心路由器根據分組頭中攜帶的狀態信息採用cbq策略，將輸出鏈路帶寬分成兩部分，對標記流根據當前的網路負荷按照服務規格成比例地分配帶寬，對非標記流按照最大最小公平性原則分配帶寬，並且能自適應地動態調整帶寬分配的比例。
  3. At first, we introduced the origination of communication, the behaviours of real - time communication as an important part of real - time system, then described the current status of the research on this subject, atm network and queueing network model

    本文首先簡要地介紹了通信的起源，實時通信作為實時系統的重要組成部分其特性和目前實時通信的主要研究方向，以及atm網路和排隊網路模型。
  4. The performances of various queueing models in the virtual channel connection of atm communications network are analyzed in the second part of this paper

    文中第二部分分析了atm通信網虛通道連接中不同排隊模型的性能。
  5. Hierarchical reinforcement learning scheduling ofopen re - entrant queueing network

    開環可重入排隊網路的遞階增強型學習調度
  6. 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排隊模型，利用補充變量法對狀態概率方程組進行分析，得出了此排隊系統隊長分佈母函數及通信網緩沖器中的平均隊長，並對不同優先權隊列的進一步討論，得出了不同優先權隊列的隊長分佈母函數及穩態隊長。
  7. In network performance, queueing performance is an important indicator

    在網路性能分析中，排隊性能是一個重要的指標。
  8. In the internet, packet - dropping - based buffer mangement algorithm is an important module in a packet - forwarding device. by employing the buffer management algorithms, ( 1 ) tcp flows can be protected, ( 2 ) without per - flow queueing, the bandwidth of unresponsive and responsive flows can be balanced even with fcfs ( first - come - first - served ) scheduler, ( 3 ) based on per - flow queueing, the bandwidth of unresponsive and responsive flows, as well as that of pure responsive flows can be balanced at the same time, and ( 4 ) in a multi - priority network, different bandwidth can be allocated according to a predetermined proportion

    Internet中，基於分組丟棄技術的緩存管理演算法是分組轉發設備的一個重要的功能模塊，利用它， （ 1 ）可以保護tcp流， （ 2 ）可以在採用fcfs （先到先服務）調度演算法時較公平地分配響應流和非響應流的帶寬， （ 3 ）可以在按流排隊的基礎上同時較公平地分配響應流和非響應流、以及響應流之間的帶寬， （ 4 ）還可以在多優先級的網路環境中，根據預定的比例分配帶寬。
分享友人
分享到 Line

分享到臉書