Sciweavers

867 search results - page 120 / 174
» Network Robustness and Graph Topology
Sort
View
BERTINORO
2005
Springer
14 years 1 months ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
TMC
2010
104views more  TMC 2010»
13 years 6 months ago
On Nodal Encounter Patterns in Wireless LAN Traces
—In this paper we analyze multiple wireless LAN (WLAN) traces from university and corporate campuses. In particular, we consider an important event between mobile nodes in wirele...
Wei-jen Hsu, Ahmed Helmy
LCN
2007
IEEE
14 years 2 months ago
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
Sunoh Choi, Sang-Seon Byun, Chuck Yoo
INFOCOM
2003
IEEE
14 years 1 months ago
Static and Dynamic Analysis of the Internet's Susceptibility to Faults and Attacks
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
Seung-Taek Park, Alexy Khrabrov, David M. Pennock,...
CEC
2009
IEEE
14 years 19 days ago
Conformity and network effects in the Prisoner's Dilemma
— We study the evolution of cooperation using the Prisoner’s Dilemma as a metaphor of the tensions between cooperators and non-cooperators, and evolutionary game theory as the ...
José María Peña, Enea Pestela...