Multipath network flows: bounded buffers and jitter

Authors:
Tricha Anjali;Alexander Fortin;Gruia Calinescu;Sanjiv Kapoor;Nandakiran Kirubanandan;Sutep Tongngam
Affiliations:
Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, Illinois;Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, Illinois;Department of Computer Science, Illinois Institute of Technology, Chicago, Illinois;Department of Computer Science, Illinois Institute of Technology, Chicago, Illinois;Department of Computer Science, Illinois Institute of Technology, Chicago, Illinois;School of Applied Statistics, National Institute of Development Administration, Bangkok, Thailand
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 5
Cited 0

Fast bandwidth reservation scheme with multi-line & multi-path routing in ATM networks

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Analysis of multi-path routing

IEEE/ACM Transactions on Networking (TON)
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A new TCP for persistent packet reordering

IEEE/ACM Transactions on Networking (TON)
Multi-path TCP: a joint congestion control and routing scheme to exploit path diversity in the internet

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address the issue of designing multipath routing algorithms. Multi-path routing has the potential of improving the throughput but requires buffers at the destination. Our model assumes a network with capacitated edges and a delay function associated with the network links (edges). We consider the problem of establishing a specified throughput from source to destination in the network, given bounds on the buffer size available at the destination and a bound on the maximum delay paths are allowed to have. A related problem which we consider is to establish bounds on the delay variance (which we call jitter) amongst the paths chosen for the multi-path routing scheme. We show that the problems are NP-complete and present pseudo-polynomial algorithms based on linear programming. We also propose practical heuristics and present the experimental results on an existing network topology. The results are promising.