Sciweavers

1162 search results - page 203 / 233
» Requirements for Routing in the Application Layer
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
How to Select a Good Alternate Path in Large Peer-to-Peer Systems?
Abstract— When multiple paths are available between communicating hosts, application quality can be improved by switching among them to always use the best one. The key to such a...
Teng Fei, Shu Tao, Lixin Gao, Roch Guérin
MOBICOM
2006
ACM
14 years 2 months ago
Localized algorithm for aggregate fairness in wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
Shigang Chen, Zhan Zhang
TRIDENTCOM
2005
IEEE
14 years 1 months ago
TBI: End-to-End Network Performance Measurement Testbed for Empirical Bottleneck Detection
— Recent advances in networking include new bandwidth-intensive applications, sophisticated protocols that enable real-time data and multimedia delivery and aspects of network se...
Prasad Calyam, Dima Krymskiy, Mukundan Sridharan, ...
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
14 years 1 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
FSTTCS
2004
Springer
14 years 1 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi