Sciweavers

540 search results - page 47 / 108
» Competitive Routing over Time
Sort
View
GLOBECOM
2006
IEEE
15 years 7 months ago
Disjoint Multipath Routing in Dual Homing Networks using Colored Trees
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
Preetha Thulasiraman, Srinivasan Ramasubramanian, ...
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
15 years 7 months ago
Evolving En-Route Caching Strategies for the Internet
Nowadays, large distributed databases are commonplace. Client applications increasingly rely on accessing objects from multiple remote hosts. The Internet itself is a huge network ...
Jürgen Branke, Pablo Funes, Frederik Thiele
SPAA
1996
ACM
15 years 6 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
INFOCOM
2003
IEEE
15 years 7 months ago
A Dynamic RWA Algorithm in a Wavelength-Routed All-Optical Network with Wavelength Converters
—Existing research demonstrated that an effective Routing and Wavelength Assignment (RWA) scheme and a wavelength converter placement algorithm are the two primary vehicles for i...
Xiaowen Chu, Bo Li
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 10 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely