NAME poptrie_init -- initialize a poptrie control data structure SYNOPSIS struct poptrie * poptrie_init(struct poptrie *poptrie, int sz1, int sz0); DESCRIPTION The poptrie_init() function initializes a poptrie control data structure specified by the poptrie argument with two memory allocation parameters sz1 and sz0. If the poptrie argument is NULL, a new data structure is allocated and initialized
今更ながら，GoogleのMaglev論文で提案されているMaglev Hashingを手元で実装してみた． Maglev: A Fast and Reliable Software Network Load Balancer Maglev Hashingとは 所謂Consitent Hashの一種．Maglevロードバランサにおけるリアルサーバ選択に使用されている． 上記論文のSection 3.4で詳細が説明されている．NSDI'16での発表スライドも併せて眺めると分かりやすい． Maglev: A Fast and Reliable Software Network Load Balancer | USENIX Slide: https://www.usenix.org/sites/default/files/conference/protected-files/nsdi16_sli
May 6, 2012 Volume 10, issue 5 PDF Controlling Queue Delay A modern AQM is just one piece of the solution to bufferbloat. Kathleen Nichols, Pollere Inc. Van Jacobson, PARC Nearly three decades after it was first diagnosed, the “persistently full buffer problem,” recently exposed as part of bufferbloat,6,7 is still with us and made increasingly critical by two trends. First, cheap memory and a “mor
The kernel's "timer wheel" data structure has served it well for some time; it has changed little since it was described in this article in 2005. There are, however, some shortcomings in its original design that have become more costly over time, and the timer wheel has not adapted well to other changes in the scheduler code. So, after many years, this venerable data structure may soon be replaced
"Bufferbloat" can be thought of as the buffering of too many packets in flight between two network end points, resulting in excessive delays and confusion of TCP's flow control algorithms. It may seem like a simple problem, but the simple solution—make buffers smaller—turns out not to work. A true solution to bufferbloat requires a deeper understanding of what is going on, combined with improved s
Hi. The RSCODE project is an implementation of a Reed-Solomon error correction algorithm. Error correcting codes are marvelous jewels of mathematics and algorithms, providing an almost supernatural ability to recover good data from a corrupted channel. This implementation of the Reed-Solomon codes provide convenient 'byte-sized' block coding which is convenient for adding protection to data which
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
