Sciweavers

867 search results - page 66 / 174
» Network Robustness and Graph Topology
Sort
View
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
14 years 21 days ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
PDP
2005
IEEE
14 years 1 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
ICS
2010
Tsinghua U.
14 years 5 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
VALUETOOLS
2006
ACM
107views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Thresholds for virus spread on networks
We study how the spread of computer viruses, worms, and other self-replicating malware is affected by the logical topology of the network over which they propagate. We consider a...
Moez Draief, Ayalvadi J. Ganesh, Laurent Massouli&...
INFOCOM
2003
IEEE
14 years 1 months ago
Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...
Frédéric Giroire, Antonio Nucci, Nin...