Sciweavers

132 search results - page 11 / 27
» Efficient and deadlock-free reconfiguration for source route...
Sort
View
TON
2008
107views more  TON 2008»
14 years 9 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
LCN
2002
IEEE
15 years 2 months ago
Scalable Multicast Routing Protocol Using Anycast and Hierarchical-Trees
A novel efficiency and effectiveness Internet multicast routing protocol is presented with short delay, high throughput, resource utilization and scalability for a single multicas...
Weijia Jia, Pui-on Au, Gaochao Xu, Wei Zhao
SODA
2000
ACM
102views Algorithms» more  SODA 2000»
14 years 11 months ago
Escaping a grid by edge-disjoint paths
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
ANSS
2005
IEEE
15 years 3 months ago
Route Recovery Mechanisms for Ad Hoc Networks Equipped with Switched Single Beam Antennas
In this paper we propose a novel three phase route recovery mechanism for routing over switched single beam directional antennas. We enhance the popular Dynamic Source Routing (DS...
Tarun Joshi, Hrishikesh Gossain, Carlos de M. Cord...
ANCS
2006
ACM
15 years 3 months ago
Design of a web switch in a reconfigurable platform
The increase of the web traffic has created the need for web switches that are able to balance the traffic to the server farms based on their contents (e.g. layer 7 switching). In...
Christoforos Kachris, Stamatis Vassiliadis