Sciweavers

206 search results - page 27 / 42
» A Routing Mechanism Based on Social Networks and Betweenness...
Sort
View
IPPS
2008
IEEE
14 years 4 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
ICNP
2002
IEEE
14 years 3 months ago
A Simple and Scalable Fair Bandwidth Sharing Mechanism for Multicast Flows
Despite a decade of research and development, multicast has not yet been deployed on a global scale. Among the difficulties with the current infrastructure are intermulticast fai...
Fethi Filali, Walid Dabbous
ISCC
2008
IEEE
14 years 4 months ago
A sybilproof distributed identity management for P2P networks
Structured P2P networks are vulnerable to the sybil attack. In this attack, a misbehaving person generates a huge number of node identifiers and possibly chooses some of them in ...
François Lesueur, Ludovic Mé, Val&ea...
GLOBECOM
2007
IEEE
14 years 4 months ago
Using Type-of-Relationship (ToR) Graphs to Select Disjoint Paths in Overlay Networks
— Routing policies used in the Internet can be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid ro...
Sameer Qazi, Tim Moors
JNW
2008
173views more  JNW 2008»
13 years 10 months ago
Dominating Set Theory based Semantic Overlay Networks for Efficient and Resilient Content Distribution
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
J. Amutharaj, S. Radhakrishnan