745 search results - page 51 / 149 » On Generating Random Network Structures: Connected Graphs |
117
click to vote
SIGMETRICS
2008
ACM
15 years 14 days ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
97
Voted
GD
1998
Springer
15 years 4 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
135
click to vote
MSWIM
2006
ACM
15 years 6 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
105
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
123
Voted
TON
2008
15 years 13 days ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...