85 search results - page 9 / 17 » Scaling limit of random k-trees |
191
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
—Many scalable reliable multicast protocols use the local repair scheme where certain receivers retransmit packets by other receivers. Such schemes need a mechanism, called messa...
159
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract— It has been claimed that multicast state cannot be aggregated. In this paper, we will debunk this myth and present a simple technique that can be used to aggregate mult...
161
click to vote
WSC
2001
15 years 7 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
169
click to vote
CACM
2010
15 years 6 months ago
2010
Memory scaling is in jeopardy as charge storage and sensing mechanisms become less reliable for prevalent memory technologies, such as dynamic random access memory (DRAM). In cont...
190
click to vote
DEBU
2010
15 years 3 months ago
2010
Solid-state disks are currently based on NAND flash and expose a standard disk interface. To accommodate limitations of the medium, solid-state disk implementations avoid rewritin...