吞吐遲延 的英文怎麼說

中文拼音 [tūnchíyán]
吞吐遲延 英文
throughput delay
  • : Ⅰ動詞1 (整個兒地或成塊地咽下去) swallow; gobble; gulp; devour 2 (并吞; 吞沒) take possession ...
  • : Ⅰ形容詞1. (緩慢) slow; tardy; dilatory 2. (晚) late; delayed 3. (遲鈍) slow; obtuseⅡ名詞(姓氏) a surname
  • 吞吐 : 1 (大量進出) swallow and spit; take in and send out in large quantities 2 (含混不清) hem and ...
  • 遲延 : delay; retard; postpone; drag on
  1. If the system is stable, the packets loss can be avoided. moreover the system can quickly use the increasing available bandwidth and the throughput of networks is increased. in this paper, chapter one presents a general introduction to the network congestion control

    具體來說,系統穩定性時,可獲得更好的網路量和資源利用率,保持較高的鏈路利用率,同時能夠減少丟包率和排隊,提高整個網路的服務質量( qos ) 。
  2. The goals of internet congestion control are maximization of throughput, minimization of the average delay of packets and fair allocation of resources among users

    擁塞控制的目標就是要達到鏈路量的最大化、分組的最小化和各用戶之間資源分配的合理化。
  3. With the upgrade of integrated avionics system, the requirement of avionics system data network, such as, high bandwidth, high rate, high reliability and low latency, are more urgent than ever

    摘要隨著新一代航空電子系統綜合化程度的不斷提高,航空電子系統對其數據網路傳輸與交換的性能需求也越來越高,不僅要滿足大量、高速率、低等需求,還要滿足容錯、重構等需求。
  4. The protocol opnet models built here could be reused for the simulation of throughput performance of aos bitstream, virtual channel access and other services, for the simulation of delay, channel utilization, and other aos protocol performance metrics, or for the simulation of the performances of high layer protocols ( space network layer, transport layer ) based on the aos space data link protocol

    可以在本課題建立的協議opnet模型基礎上進行aos協議位流、虛擬通道接入等其它業務量性能模擬,或進行、通道利用率等協議其它性能模擬,或將模型應用於基於aos數據鏈路層的高層協議(空間網路層、傳輸層)性能模擬。
  5. Basing on the study of the current routing algorithm, it proposes a new sd - anycast routing protocol algorithm. according to the character of this protocol, it implements this new protocol by adding additional packet header, routing maintaining and node dealing modules. lastly, according to creating prototype system and designing four comparing experiments, it gets the experiment statistical data, and makes a conclusion that this routing protocol algorithm has a better performance on one way delay, output, load balance and etc

    本文首先介紹了anycast服務的概念、特點以及研究現狀;在分析了路由協議的一些相關知識和當今anycast路由協議的研究現狀的基礎上,深入研究了當前的路由協議演算法,提出了一個sd - anycast協議演算法,並在網路模擬軟體ns2設計平臺中根據該協議的特點,通過設計數據包報頭、路由表維護和節點處理等功能模塊,實現了該協議演算法;最後通過建立原型系統並設計四個對比實驗,得出實驗統計數據,定量地測定了該路由協議演算法在單程路徑量和負載平衡等方面所具有的優越性。
  6. Three duplication based task scheduling algorithms are presented. these algorithms have good performance, and its application on a real multi - core and multi - thread processor ( network processor ixp ) are demonstrated. it also show that how a uniform network programming environment could be built through address translation and iterative compilation techniques

    然後結合一種實際的多核多線程處理器(網路處理器ixp )展開了對任務調度實例化研究,並且運用地址轉換和迭代編譯等技術構建了新型統一網路編程環境,又結合實際網路應用提出了量與相結合的網路任務調度演算法。
  7. The mobile internet is becoming hot spot. when a mobile node is far away from home network, registration at its home agent can cause a long handoff delay that leads to significant packet drop and throughput reduction

    根據現有的ietf移動ip規范,當移動節點駐留在遠離家鄉網路的外地網路時,每次切換,將會產生嚴重的注冊,從而引起嚴重的包丟失和通信量下降。
  8. However, " excellent " in this context is not " perfect, " since each time a process is context - switched it stops operating - which then results in throughput delays and performance degradation

    但是,在執行上下文切換時,雖然現代操作系統表現很「出色」 ,卻並非「完美無缺」 ,因為進程在每次進行上下文切換時,它都將停止運行這將導致量出現(和性能下降) 。
  9. To shorten the throughput - constrained latency of data parallel pipelines in grids, an algorithm for optimizing task assignments was proposed

    摘要為了縮短網格中數據并行流水線在率受限下的,提出了一種優化任務指派的演演算法。
  10. As the application of distributed computing is used much more widely , distributed database becomes a significant part of information management it avoids a lot of disadvantages of conventional centralized database , and is applicable to many situations distributed database is a set of data which is the unity logic , but in fact these data is located on different sites it is of high availability , easy expansibility , high concurrency , high efficiency and etc in distributed system , data redundancy is a method to improve the speed of query and the availability of system distributed query should shield the lower level details of data redundancy from end users , distributed transaction should ensure data from disaccord this paper introduces basic conceptions of distributed database firstly , discusses distributed transaction and concurrent control , describes the development prototype mysql ’ s characters , architecture and executive mechanism , then shows the skeleton model of dpsql and exposes the strategy and algorithm of distributed query and distributed transaction , at last analyzes the extra expenses and response delay of distributed processes this paper exposes the implementation mechanism of distributed query and distributed transaction emphatically distributed query uses the strategy of “ read one , write a11 ” s0 in such a system if user ’ s requests are read - - only for the most part and the distribution of data redundancy is plausible , efficiency is very high distributed transaction uses two - 。 phase commit protocol to ensure the consistency of global data , which has less communication overhead

    分散式查詢需要向用戶屏蔽數據冗餘分散的底層細節,分散式事務處理要保證全局數據完整,這都是傳統集中式數據庫不曾面臨的問題。本文首先介紹了分散式數據庫的概念性問題;接著討論了分散式事務涉及的定義及演算法;然後描述了dpsql的原型mysql的特性、結構和執行機制;繼而給出了dpsql的梗概模型,闡述了實現分散式查詢和分散式事務處理的策略及演算法;最後分析了進行分散式處理給系統增加的額外開銷和客戶端的額外響應。本文重點描述了分散式查詢和分散式事務處理的實現機制,分散式查詢採用」讀一個寫全部」的本地優先策略,在讀操作頻繁的系統中,只要庫的分佈合理,單機效率極高,幾乎無任何附加開銷和,而以整個系統的角度看來,量就更是優于單機系統;分散式事務處理採用兩階段提交協議,通信次數較少並能確實保證副本一致。
分享友人