Results 1  10
of
1,295
Sizing Router Buffers
, 2004
"... All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algorithm. In particular, the goal is to make sure that when a link is congested, it is busy 100 % of the time; which is equivalen ..."
Abstract

Cited by 352 (17 self)
 Add to MetaCart
routers, we show that a link with n flows requires no more than B = (RT T × C) / √ n, for longlived or shortlived TCP flows. The consequences on router design are enormous: A 2.5Gb/s link carrying 10,000 flows could reduce its buffers by 99 % with negligible difference in throughput; and a 10Gb/s link
A Data Structure for Dynamic Trees
, 1983
"... A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract

Cited by 347 (21 self)
 Add to MetaCart
) time. Using this data structure, new fast algorithms are obtained for the following problems: (1) Computing nearest common ancestors. (2) Solving various network flow problems including finding maximum flows, blocking flows, and acyclic flows. (3) Computing certain kinds of constrained minimum spanning
FAWN: A Fast Array of Wimpy Nodes
, 2008
"... This paper introduces the FAWN—Fast Array of Wimpy Nodes—cluster architecture for providing fast, scalable, and powerefficient keyvalue storage. A FAWN links together a large number of tiny nodes built using embedded processors and small amounts (2–16GB) of flash memory into an ensemble capable of ..."
Abstract

Cited by 212 (26 self)
 Add to MetaCart
This paper introduces the FAWN—Fast Array of Wimpy Nodes—cluster architecture for providing fast, scalable, and powerefficient keyvalue storage. A FAWN links together a large number of tiny nodes built using embedded processors and small amounts (2–16GB) of flash memory into an ensemble capable
Neighborhood Gossip: . . .
, 2009
"... In this paper, we study a gossip algorithm for distributed averaging over a wireless sensor network. The usual assumption is that, through properly chosen codes, the physical layer is reduced to a set of reliable bit pipes for the distributed averaging algorithm. However, with a new channel coding ..."
Abstract
 Add to MetaCart
In this paper, we study a gossip algorithm for distributed averaging over a wireless sensor network. The usual assumption is that, through properly chosen codes, the physical layer is reduced to a set of reliable bit pipes for the distributed averaging algorithm. However, with a new channel coding
Time and cost tradeoffs in gossiping
 SIAM Journal on Discrete Mathematics
, 1998
"... Abstract. Each of n processors has a value which should be transmitted to all other processors. This fundamental communication task is called gossiping. In a unit of time every processor can communicate with at most one other processor and during such a transmission each member of a communicating pa ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
cost of a network which can support the gossiping algorithm. We establish tradeoffs between the time T of gossiping and the number C of transmissions and between the time of gossiping and the number L of links used by the algorithm. For a given T we construct gossiping algorithms working in time T
GoCast: Gossipenhanced Overlay Multicast for Fast and Dependable Group Communication
 in DSN
, 2005
"... We study dependable group communication for largescale and delaysensitive mission critical applications. The goal is to design a protocol that imposes low loads on bottleneck network links and provides both stable throughput and fast delivery of multicast messages even in the presence of frequent n ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
We study dependable group communication for largescale and delaysensitive mission critical applications. The goal is to design a protocol that imposes low loads on bottleneck network links and provides both stable throughput and fast delivery of multicast messages even in the presence of frequent
Fast Gossiping in Meshes/Tori with BoundedSize Packets
, 1997
"... Gossiping is the communication problem in which each node has a unique message (token) to be transmitted to every other node. The nodes exchange their tokens by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the version of th ..."
Abstract
 Add to MetaCart
Gossiping is the communication problem in which each node has a unique message (token) to be transmitted to every other node. The nodes exchange their tokens by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the version
Target atmospheric CO2: where should humanity aim?
 Open Atmospheric Science Journal,
, 2008
"... Paleoclimate data show that climate sensitivity is ~3°C for doubled CO 2 , including only fast feedback processes. Equilibrium sensitivity, including slower surface albedo feedbacks, is ~6°C for doubled CO 2 for the range of climate states between glacial conditions and icefree Antarctica. Decreasi ..."
Abstract

Cited by 148 (6 self)
 Add to MetaCart
Paleoclimate data show that climate sensitivity is ~3°C for doubled CO 2 , including only fast feedback processes. Equilibrium sensitivity, including slower surface albedo feedbacks, is ~6°C for doubled CO 2 for the range of climate states between glacial conditions and icefree Antarctica
FAST AND SLOW FISSION
"... Measurements of alpha particle induced fission of actinide nuclei and fission of the composite system 170 Yb formed in 12 C and 20 Ne bombardment both show significantly greater neutron emission prior to fission than is consistent with current statistical models. Implications of these results are di ..."
Abstract
 Add to MetaCart
Measurements of alpha particle induced fission of actinide nuclei and fission of the composite system 170 Yb formed in 12 C and 20 Ne bombardment both show significantly greater neutron emission prior to fission than is consistent with current statistical models. Implications of these results
Fast Gossiping in Square Meshes/Tori with BoundedSize Packets
 IEEE Transactions on Parallel and Distributed Systems
, 2002
"... AbstractÐGossiping is the communication problem in which each node has a unique message �token) to be transmitted to every other node. The nodes exchange their tokens by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the vers ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
the version of the problem in which smallsize packets �each carrying exactly one token) are used, the links �edges) of the network are halfduplex �only one packet can flow through a link at a time), and the nodes are allport �a node's incident edges can all be active at the same time). This is also
Results 1  10
of
1,295