Sciweavers

414 search results - page 12 / 83
» Minimizing Routing State for Light-Weight Network Simulation
Sort
View
MUE
2008
IEEE
218views Multimedia» more  MUE 2008»
15 years 6 months ago
I-SEAD: A Secure Routing Protocol for Mobile Ad Hoc Networks
Ad hoc networks are highly dynamic routing networks cooperated by a collection of wireless mobile hosts without any assistance of centralized access point. Secure Efficient Ad hoc...
Chu-Hsing Lin, Wei-Shen Lai, Yen-Lin Huang, Mei-Ch...
DEBS
2003
ACM
15 years 5 months ago
Peer-to-peer overlay broker networks in an event-based middleware
Overlay broker networks are an important part of an eventbased middleware. In this paper, we investigate the requirements of overlay broker networks and argue that using peer-to-p...
Peter R. Pietzuch, Jean Bacon
WCW
2004
Springer
15 years 5 months ago
ShortCuts: Using Soft State to Improve DHT Routing
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
Kiran Tati, Geoffrey M. Voelker
MSWIM
2006
ACM
15 years 5 months ago
Routing in intermittent network topologies
The topic of this paper is the algorithmic development of routing techniques for Delay Tolerant Networks (DTNs). Assuming a store and forward type of network transfers, our main o...
Padma Mundur, Sookyoung Lee, Matthew Seligman
ADHOCNOW
2005
Springer
15 years 5 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