Sciweavers

4037 search results - page 158 / 808
» Routing without ordering
Sort
View
AINA
2009
IEEE
14 years 4 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
NOSSDAV
2009
Springer
14 years 3 months ago
A delaunay triangulation architecture supporting churn and user mobility in MMVEs
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...
Mohsen Ghaffari, Behnoosh Hariri, Shervin Shirmoha...
GLOBECOM
2006
IEEE
14 years 3 months ago
Integrated Scheduling of Application- and Network-Layer Tasks in Delay-Tolerant MANETs
Abstract— Natural or man-made disasters can partition networks while threatening human lives. Because conventional Mobile Ad-Hoc Networks (MANETs) cannot route messages across pa...
José Carlos Brustoloni, Sherif M. Khattab, ...
CORR
2011
Springer
170views Education» more  CORR 2011»
13 years 4 months ago
Performance Comparison and Analysis of Preemptive-DSR and TORA
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. Preemptiv...
V. Ramesh, P. Subbaiah, N. Koteswar Rao, N. Subhas...
CLUSTER
2008
IEEE
14 years 3 months ago
Multistage switches are not crossbars: Effects of static routing in high-performance networks
Abstract—Multistage interconnection networks based on central switches are ubiquitous in high-performance computing. Applications and communication libraries typically make use o...
Torsten Hoefler, Timo Schneider, Andrew Lumsdaine