Abstract-We propose a new architecture for efficient network monitoring and measurements in a traditional IP network. This new architecture enables establishment of multiple paths (tunnels) between source-destination pairs without having to modify the underlying routing protocol(s). Based on the proposed architecture we propose a measurement-based multi-path routing algorithm derived from simultaneous perturbation stochastic approximation. The proposed algorithm does not assume that the gradient of analytical cost function is known to the algorithm, but rather relies on noisy estimates from measurements. Using the analytical model presented in the paper we prove the convergence of the algorithm to the optimal solution. Simulation results are presented to demonstrate the advantages of the proposed algorithm under a variety of network scenarios. A comparative study with an existing optimal routing algorithm, MATE, is also provided.

Abstract-In a sensor network, usually a large number of sensors transport data messages to a limited number of sinks. Due to this multipoint-to-point communications pattern in general homogeneous sensor networks, the closer a sensor to the sink, the quicker it will deplete its battery. This unbalanced energy depletion phenomenon has become the bottleneck problem to elongate the lifetime of sensor networks. In this paper, we consider the effects of joint relay node deployment and transmission power control on network lifetime. Contrary to the intuition the relay nodes considered are even simpler devices than the sensor nodes with limited capabilities. We show that the network lifetime can be extended significantly with the addition of relay nodes to the network. In addition, for the same expected network lifetime goal, the number of relay nodes required can be reduced by employing efficient transmission power control while leaving the network connectivity level unchanged. The solution suggests that it is sufficient to deploy relay nodes only with a specific probabilistic distribution rather than the specifying the exact places. Furthermore, the solution does not require any change on the protocols (such as routing) used in the network.

No abstract

Abstract-We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the gradient of the network cost function is not available and needs to be estimated. Multiple paths are provided between a source and a destination using application-layer overlay. We propose a novel algorithm that is based on what is known as simultaneous perturbation stochastic approximation and utilizes only noisy measurements collected and reported to the sources, using an overlay architecture.We consider three network models that reflect different sets of assumptions regarding multicast capabilities of the network. Using an analytical model we first prove the almost sure convergence of the algorithm to a corresponding optimal solution under each network model considered in this paper with decreasing step sizes. Then, we establish the weak convergence (or convergence in distribution) with a fixed step size. In addition, we investigate the benefits acquired from implementing additional multicast capabilities by studying the relative performance of our algorithm under the three network models.

No abstract