Sciweavers

683 search results - page 37 / 137
» Graph Annotations in Modeling Complex Network Topologies
Sort
View
PODC
2009
ACM
15 years 10 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
FOCS
2009
IEEE
15 years 4 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
DAIS
2011
14 years 1 months ago
Modeling the Performance of Ring Based DHTs in the Presence of Network Address Translators
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...
John Ardelius, Boris Mejías
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
15 years 4 months ago
Local Probabilistic Models for Link Prediction
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented ...
Chao Wang, Venu Satuluri, Srinivasan Parthasarathy
PADS
2005
ACM
15 years 3 months ago
Simulating Realistic Packet Routing without Routing Protocols
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
George F. Riley, Dheeraj Reddy