2808 search results - page 104 / 562 » Routing betweenness centrality |
151
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
Our aim is to investigate reliable transmission for multicast communication and explore its relationship to multicast routing. We derive two characterizations that enable the comp...
158
click to vote
AINTEC
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Proactive routing protocols for mobile ad hoc networks currently offer few mechanisms to detect and/or counter malevolent nodes. Stability and performance of most, if not...
145
Voted
GD
2008
Springer
15 years 7 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
150
click to vote
MST
2010
15 years 4 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
160
click to vote
ICN
2009
Springer
16 years 19 days ago
2009
Springer
Recent works on modeling the Internet topology [8, 9] have highlighted how the complexity of relationships between Autonomous Systems (ASes) can not be oversimplified without sac...