Sciweavers

429 search results - page 5 / 86
» Group Routing without Group Routing Tables
Sort
View
INFOCOM
2006
IEEE
14 years 22 days ago
Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks
— Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing strategy p...
Vincent Lenders, Martin May, Bernhard Plattner
P2P
2007
IEEE
132views Communications» more  P2P 2007»
14 years 29 days ago
The Design and Evaluation of Techniques for Route Diversity in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough
PADS
2003
ACM
13 years 12 months ago
Enabling Large-Scale Multicast Simulation by Reducing Memory Requirements
The simulation of large–scale multicast networks often requires a significant amount of memory that can easily exceed the capacity of current computers, both because of the inh...
Donghua Xu, George F. Riley, Mostafa H. Ammar, Ric...
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 1 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
HICSS
2005
IEEE
137views Biometrics» more  HICSS 2005»
14 years 9 days ago
Sliding Window Protocol for Group Communication in Ad-Hoc Networks
Existing ad hoc routing protocols are either unicast or multicast. In this paper we propose a simple extension to the Dynamic Source Routing Protocol (DSR) to cater for group comm...
In Joe Khor, Johnson P. Thomas, Istvan Jonyer