翻訳と辞書 Words near each other ・ TDKR ・ TDL ・ TDL-4 ・ TDLR 1 to 3, 6, and 8 ・ TDLR 5 ・ TDLR 7 and 8 ・ TDLS ・ TDM ・ TCP tuning ・ TCP Vegas ・ TCP Westwood ・ TCP Westwood plus ・ TCP window scale option ・ TCP Wrapper ・ TCP-1/cpn60 chaperonin family ・ TCP-Illinois ・ TCP/IP Illustrated ・ TCP/IP stack fingerprinting ・ TCP10L ・ TCP11 ・ TCPA ・ TCPaccess ・ Tcpcrypt ・ TCPDF ・ Tcpdump ・ Tcpkill ・ TCPO ・ Tcptrace ・ TCPware ・ TCPy Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク TCP-Illinois ： ウィキペディア英語版 TCP-Illinois TCP-Illinois is a variant of TCP congestion control protocol, developed at the University of Illinois at Urbana-Champaign. It is especially targeted at high-speed, long-distance networks. A sender side modification to the standard TCP congestion control algorithm, it achieves a higher average throughput than the standard TCP, allocates the network resource fairly as the standard TCP, is compatible with the standard TCP, and provides incentives for TCP users to switch. == Principles of operation == TCP-Illinois is a loss-delay based algorithm, which uses packet loss as the ''primary'' congestion signal to determine the ''direction'' of window size change, and uses queuing delay as the ''secondary'' congestion signal to adjust the ''pace'' of window size change. Similarly to the standard TCP, TCP-Illinois increases the window size W by $\backslash alpha/W$ for each acknowledgment, and decreases $W$ by $\backslash beta\; W$ for each loss event. Unlike the standard TCP, $\backslash alpha$ and $\backslash beta$ are not constants. Instead, they are functions of average queuing delay $d\_a$: $\backslash alpha=f\_1(d\_a),\; \backslash beta=f\_2(d\_a)$, where $f\_1(\backslash cdot)$ is decreasing and $f\_2(\backslash cdot)$ is increasing. There are numerous choices of $f\_1(\backslash cdot)$ and $f\_2(\backslash cdot)$. One such class is: $$ \alpha=f_1(d_a)= \left\ \alpha_ & \mbox d_a \leq d_1 \\ \frac & \mbox \end \right. $$ \beta=f_2(d_a)= \left\ \beta_ & \mbox d_a \leq d_2 \\ \kappa_3+\kappa_4 d_a & \mbox d_2 < d_a < d_3 \\ \beta_ & \mbox \end\right. We let $f\_1(\backslash cdot)$ and $f\_2(\backslash cdot)$ be continuous functions and thus $\backslash frac\; =\; \backslash alpha\_$, $\backslash beta\_=\backslash kappa\_3+\backslash kappa\_4\; d\_2$ and $\backslash beta\_=\backslash kappa\_3+\backslash kappa\_4\; d\_3$. Suppose $d\_m$ is the maximum average queuing delay and we denote $\backslash alpha\_=f\_1(d\_m)$, then we also have $\backslash frac\; =\; \backslash alpha\_$. From these conditions, we have $$ \begin \kappa_1 = \frac }} & \mbox & \kappa_2 = \frac} - d_1 \,, \\ \kappa_3 = \frac d_2} & \mbox & \kappa_4 = \frac} \,. \end This specific choice is demonstrated in Figure 1. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「TCP-Illinois」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.