162 search results - page 16 / 33 » Minimizing Average Finish Time in P2P Networks |
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider a two-hop wireless network where a transmitter communicates with a receiver via M relays with an amplify-and-forward (AF) protocol. Recent works have shown that sophis...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
CIIT
2007
13 years 10 months ago
2007
Given a list of filtering rules with individual hitting probabilities, it is known that the average processing time of a linear-search based firewall can be minimized by searchi...