On optimal partitioning of realtime traffic over multiple paths

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. Two key issues in the use of multiple paths are (1) how to minimize the end-to-end 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, our scheme is simpler to implement and enforce. This analysis also greatly simplifies the solution to the path selection problem as compared to previous efforts. Analytical results show that for a given flow and a set of paths, we can choose a minimal subset to achieve the minimum end-to-end delay with O(N) 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.

[1]  Shivendra S. Panwar,et al.  Video transport over ad hoc networks: multistream coding with multipath transport , 2003, IEEE J. Sel. Areas Commun..

[2]  M. Gerla,et al.  CapProbe: a simple and accurate capacity estimation technique , 2004, SIGCOMM.

[3]  Randall R. Stewart,et al.  Stream Control Transmission Protocol , 2000, RFC.

[4]  Eitan Altman,et al.  Non-cooperative routing in loss networks , 2002, Perform. Evaluation.

[5]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[6]  Dhananjay S. Phatak,et al.  A novel mechanism for data streaming across multiple IP links for improving throughput and reliability in mobile environments , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[8]  Dennis Bushmitch,et al.  Thinning, striping and shuffling: traffic shaping and transport techniques for variable bit rate video , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[9]  Zygmunt J. Haas,et al.  Analysis of multipath Routing-Part I: the effect on the packet delivery ratio , 2004, IEEE Transactions on Wireless Communications.

[10]  Srihari Nelakuditi,et al.  On Selection of Paths for Multipath Routing , 2001, IWQoS.

[11]  Shivendra S. Panwar,et al.  On a resequencing model for high speed networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[12]  M. Gerla,et al.  CapProbe: a simple and accurate capacity estimation technique , 2004, SIGCOMM '04.

[13]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[14]  Moshe Sidi,et al.  Estimating one-way delays from cyclic-path delay measurements , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Raghupathy Sivakumar,et al.  A Transport Layer Approach for Achieving Aggregate Bandwidths on Multi-Homed Mobile Hosts , 2005, Wirel. Networks.

[16]  E. Gustafsson,et al.  A literature survey on traffic dispersion , 1997 .

[17]  C. Dovrolis,et al.  End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput , 2002, SIGCOMM '02.

[18]  Ram Krishnan,et al.  Choice of allocation granularity in multipath source routing schemes , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[19]  Donald F. Towsley,et al.  Multicast-based inference of network-internal delay distributions , 2002, TNET.

[20]  A. Banerjea.  Simulation Study of the Capacity Effects of Dispersity Routing for Fault Tolerant Realtime Channels , 1996, SIGCOMM.

[21]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

[22]  Shivendra S. Panwar,et al.  Supporting image and video applications in a multihop radio environment using path diversity and multiple description coding , 2002, IEEE Trans. Circuits Syst. Video Technol..

[23]  Manish Jain,et al.  End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput , 2003, IEEE/ACM Trans. Netw..

[24]  Edward W. Knightly,et al.  Opportunistic traffic scheduling over multiple network paths , 2004, IEEE INFOCOM 2004.

[25]  Raghupathy Sivakumar,et al.  A Receiver-Centric Transport Protocol for Mobile Hosts with Heterogeneous Wireless Interfaces , 2003, MobiCom '03.

[26]  Henning Schulzrinne,et al.  RTP: A Transport Protocol for Real-Time Applications , 1996, RFC.

[27]  John G. Apostolopoulos,et al.  On multiple description streaming with content delivery networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[28]  Sathya Narayanan,et al.  MRTP: a multiflow realtime transport protocol for ad hoc networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[29]  Shivendra S. Panwar,et al.  A reference picture selection scheme for video transmission over ad-hoc networks using multiple paths , 2001, IEEE International Conference on Multimedia and Expo, 2001. ICME 2001..

[30]  Moshe Sidi,et al.  Resequencing considerations in parallel downloads , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[31]  Mark Crovella,et al.  Measuring Bottleneck Link Speed in Packet-Switched Networks , 1996, Perform. Evaluation.

[32]  Avideh Zakhor,et al.  Path diversity with forward error correction (PDF) system for packet switched networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[33]  Anthony Ephremides,et al.  Multiple description coding in networks with congestion problem , 2001, IEEE Trans. Inf. Theory.

[34]  Nachum Shacham,et al.  Distributed algorithms for computing shortest pairs of disjoint paths , 1993, IEEE Trans. Inf. Theory.

[35]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[36]  John G. Apostolopoulos,et al.  Reliable video communication over lossy packet networks using multiple state encoding and path diversity , 2000, IS&T/SPIE Electronic Imaging.

[37]  Ali C. Begen,et al.  Multi-path selection for multiple description video streaming over overlay networks , 2005, Signal Process. Image Commun..

[38]  Ali C. Begen,et al.  Multi-path selection for multiple description encoded video streaming , 2003, IEEE International Conference on Communications, 2003. ICC '03..