856 search results - page 128 / 172 » On Randomness Measures for Social Networks. |
148
click to vote
MOBICOM
2004
ACM
15 years 11 months ago
2004
ACM
Realistic models for node movement are essential in simulating mobile ad hoc networks. Many MANET scenarios are most realistically represented using group movement, but existing g...
169
click to vote
KAIS
2008
15 years 6 months ago
2008
Abstract. Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining th...
183
click to vote
OPODIS
2007
15 years 7 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
163
click to vote
INFOCOM
2007
IEEE
16 years 12 days ago
2007
IEEE
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
288
Voted
WINET
2002
15 years 5 months ago
2002
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...