Sciweavers

5079 search results - page 322 / 1016
» Hidden-Action in Network Routing
Sort
View
199
Voted
INFOCOM
2006
IEEE
16 years 1 months ago
MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks
— Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little i...
John Burgess, Brian Gallagher, David Jensen, Brian...
213
Voted
PEWASUN
2006
ACM
16 years 1 months ago
Context-aware multicast routing scheme for disruption tolerant networks
: Disruption Tolerant Networks (DTNs) are emerging solutions to networks that experience frequent network partitions and large end-to-end delays. Several schemes have been proposed...
Peng Yang, Mooi Choo Chuah
CONEXT
2008
ACM
15 years 9 months ago
EGOIST: overlay routing using selfish neighbor selection
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals ...
Georgios Smaragdakis, Vassilis Lekakis, Nikolaos L...
234
Voted
ICC
2008
IEEE
144views Communications» more  ICC 2008»
16 years 1 months ago
Meta-Mesh Span Restoration and Increased Lightpath Routing in Sparse Network Topologies
— Prior work has shown that network capacity efficiency decreases significantly as a network’s topology becomes sparse. Meta-mesh restoration was proposed in prior work as a me...
John Doucette, Zhijie Shen
221
Voted
ADHOCNOW
2005
Springer
16 years 1 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta