algorithm queue control 中文意思是什麼
algorithm queue control
解釋
控制排隊計算-
Thus, efci algorithm is improved and the oscillation is overcome validly. and further, a linear pid controller is designed to replace the nonlinear component in the standard efci algorithm, it makes flow control system more robust, at same time, controls the queue length to expected value, which is beneficial to decrease delay in queue
為了進一步克服系統振蕩問題，提出採用一種線性的pid控制器來替換標準efci演算法中的非線性環節，增強了系統的魯棒性，並實現了隊列長度的定點控制，有效地減少了排隊延時。 -
An algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising
提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果 -
Abstract : an algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising
文摘:提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果 -
It is found ecn could n ' t solve the problem that the sender responds to congestion slowly, and the average queue length of router is sensitive to the static parameters of ecn. in chapter four we propose an algorithm called fecn, which provides congestion control and indication messages in router, so that the sender could response to congestion in good time. this algorithm can also adjust the max drop probability according to the active conne
Ik的特性，而且平均隊列長度和網路吞吐量對ecn的靜態參數較為敏感，因此本文在第4章中提出了一種fecn演算法，該演算法在路山器處提供擁塞控制和指示機制，使源端能夠快速響應路由器發回的擁塞指示消息，調整發送速率，避兔擁塞的發生，該演算法還可以通過估計鏈路中的活動連接數動態調整最大丟棄概率。 -
The primary works and innovations of this paper include but not limited to : ( 1 ) considering the nonlinear, time - varying and uncertain characteristics of networks, a new active queue management ( aqm ) algorithm, i. e. nnpc - aqm was proposed based on predictive control theory, which requires less model accuracy. in order to realize fast control, a predictor was constructed using two - layer linear neural network to predict the future queue length, and a controller was composed using two layers of nonlinear neural network to optimize the next control volume, i. e. drop probability
本文研究的主要內容及創新點如下： （ 1 ）針對網路的非線性、時滯、不確定特點，結合預測控制理論提出一種新型主動隊列管理（ aqm ）策略nnpc - aqm ，該演算法基於單值預測控制思想，為了實現快速控制，採用兩層神經網路構造預測器，估計未來時刻隊列長度；採用兩層非線性神經網路組成控制器，實現對下一步丟棄概率的優化。 -
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提供了更好的解決方案。 -
Although the simplicity of binary flow control is very attractive, the queue length and allowed cell rate ( acr ) controlled by the standard efci algorithm oscillate with great amplitude, which must have negative impact on the performance, so its applicability was doubted
盡管二進制abr流量控制的簡潔性具有相當的吸引力，但標準的efci演算法控制的隊列長度和允許信元速率（ acr ）卻易出現大幅振蕩的現象，這勢必會降低鏈路的利用率，嚴重影響交換機的性能。
分享友人