On optimal partitioning of realtime traffic over multiple paths

Abstract

Abstruct-Multipath transport provides higher usable bandwidth for a session, It has also been shown to provide load balancing and error resilience for end-to-end multimedia sessions. lbvo key issues in the use of multiple paths are (1) how to minimize the end-bend delay, which now includes the delay along the paths and the resequencing delay at the receiver, and (2) how to select paths. In this paper, we present an analytical framework for the optimal partitioning of realtime multimedia traffic that minimizes the total end-to-end delay. Specifically, we formulate optimal traffic partitioning as a constrained optimization problem using deterministic network calculus, and derive its closed form solution. Compared with previous work, aur scheme is simpler to implement and enforce. This analysis also greatly simplifies the soIution to the path selection problem as compared to previous efforts. Analytical results show that for 8 given flow and a set of paths, we can choose a minimal subset to achieve the minimum end-to-end delay with O ( K ) time, where N is the number of available paths. The selected path set is optimal in the sense that adding any rejected path to the set will only increase the end-to-end delay.

Modelling and Implementation of QoS in Wireless Sensor Networks: A Multiconstrained Traffic Engineering Model

“…We have L d ı = (D − D ı )/h ı as the hop requirement at node ı with D ı the actual delay experienced by a packet at node ı, h ı the hop count from node ı to the sink, and L r ı = hı R ı hop requirement for reliability at node ı, and R ı is the portion of reliability requirement assigned to the path through node ı decided by the upstream node of ı. The Qfunction in (18) is defined by…”

“…Assuming sources transmitting data packets at a constant rate, [17] proposes a multipath routing scheme formulated as a linear programming problem with the objective of maximizing the time until the first sensor node runs out of energy. The work presented in [18] uses a multipath routing algorithm where the routing process is formulated as a constrained optimization problem using deterministic network calculus. Reference [19] highlights the issue of sensor coverage as a major challenge in wireless sensor network through the investigation of two algorithms that address the energy efficient communication in wireless sensor network using multipath routing while preserving coverage.…”