Sciweavers

45 search results - page 5 / 9
» Dynamic Packet Routing on Arrays with Bounded Buffers
Sort
View
INFOCOM
2003
IEEE
14 years 25 days ago
Dynamic Power Allocation and Routing for Time Varying Wireless Networks
—We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless l...
Michael J. Neely, Eytan Modiano, Charles E. Rohrs
TPDS
1998
73views more  TPDS 1998»
13 years 7 months ago
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
Ming-Jer Tsai, Sheng-De Wang
ICALP
2003
Springer
14 years 22 days ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...
ICRA
2003
IEEE
133views Robotics» more  ICRA 2003»
14 years 25 days ago
Connectivity-through-time protocols for dynamic wireless networks to support mobile robot teams
—Mobile robot teams are increasingly deployed in various applications involving remote operations in unstructured environments that do not support wireless network infrastructure...
Nageswara S. V. Rao, Qishi Wu, S. Sitharama Iyenga...
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
13 years 11 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna