114 search results - page 2 / 23 » Optimal Routing in Binomial Graph Networks |
101
click to vote
ACIIDS
2009
IEEE
15 years 3 months ago
2009
IEEE
Inter domain service routing is an element in the success of Next Generation Network. Service requests, such as the INVITE request in Session Initiation Protocol [21] may need to ...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
SODA
2004
ACM
15 years 29 days ago
2004
ACM
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
IPTPS
2004
Springer
15 years 5 months ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...