Sciweavers

265 search results - page 24 / 53
» On the number of leaders needed to ensure network connectivi...
Sort
View
SPAA
2003
ACM
14 years 1 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
ICPADS
2005
IEEE
14 years 1 months ago
Routing through Backbone Structures in Sensor Networks
Virtual infrastructures or backbones in wireless sensor networks reduce the communication overhead and energy consumption. In this paper, we present BackBone Routing (BBR), a nove...
Vamsi Paruchuri, Arjan Durresi, Mimoza Durresi, Le...
BROADCOM
2008
IEEE
13 years 10 months ago
Tree Based Flooding Protocol for Multi-hop Wireless Networks
In this paper we propose and analyze an efficient flooding technique for static multi-hop wireless networks. The protocol builds up a routing tree that connects all network nodes....
Raphael Frank, Thomas Scherer, Thomas Engel
IM
2007
13 years 9 months ago
Towards Automatic Composition of Network Management Web Services
— Despite the automation in many domains, network management still requires a lot of manual interaction. With the ongoing rapid growth of the Internet and the number of connected...
Torsten Klie, Felix Gebhard, Stefan Fischer
WWW
2003
ACM
14 years 8 months ago
A Scalable Locality-Aware Event Dispatching Mechanism for Network Servers
Network servers often need to process a large amount of network events asynchronously. They usually use select() or poll() to retrieve events from file descriptors. However, previ...
Hao-Ran Liu, Tien-Fu Chen