Sciweavers

5140 search results - page 117 / 1028
» Complex Network of Earthquakes
Sort
View
MASCOTS
2001
15 years 7 months ago
Minimizing Routing State for Light-Weight Network Simulation
We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
Polly Huang, John S. Heidemann
SPAA
2010
ACM
15 years 11 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
ITSL
2008
15 years 7 months ago
A Randomized Complexity-theoretic Model of Bio-inspired Mobile Epidemics via Close Contact
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
Zhen Cao, Jiejun Kong, Mario Gerla, Dapeng Wu
ECAL
2007
Springer
16 years 18 days ago
Information-Cloning of Scale-Free Networks
In this paper1 , we introduce a method, Assortative Preferential Attachment, to grow a scale-free network with a given assortativeness value. Utilizing this method, we investigate ...
Piraveenan Mahendra, Mikhail Prokopenko, Albert Y....
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
15 years 12 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...