Multipath network flows: Bounded buffers and jitter

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Anjali, Tricha ^a   Fortin, Alexander ^a   Calinescu, Gruia ^b   Kapoor, Sanjiv ^b   Kirubanandan, Nandakiran ^b   Tongngam, Sutep ^c  

^a Illinois Institute of Technology   (United States)

^b Illinois Institute of Technology   (United States)

^c NATIONAL INSTITUTE OF DEVELOPMENT ADMINISTRATION   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER SIZES; DELAY FUNCTION; DELAY VARIANCE; MAXIMUM DELAY; MULTI PATH ROUTING; MULTI-PATH; MULTI-PATH ROUTING SCHEMES; MULTIPATH ROUTING ALGORITHMS; NETWORK FLOWS; NETWORK LINKS; NETWORK TOPOLOGY; NP COMPLETE; PSEUDOPOLYNOMIAL ALGORITHMS;

AD HOC NETWORKS; ELECTRIC NETWORK TOPOLOGY; LINEARIZATION; MULTIPATH PROPAGATION;

JITTER;

EID: 77953313932     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462102     Document Type: Conference Paper

References (12)

1. N. F. Maxemchuk, "Dispersity Routing," in Proceedings of IEEE ICC, 1975.
2. H. Suzuki and F. A. Tobagi, "Fast Bandwidth Reservation with Multiline and Multi-path Routing in ATM Networks," in Proceedings of IEEE Infocom, Florence, Italy, 1992, pp. 2233-2240.
3. I. Cidon, R. Rom, and Y. Shavitt, "Analysis of Multi-Path Routing," IEEE/ACM Trans. on Networking, vol. 7, pp. 885-896, December 1999.
4. S. Bohacek, J. Hespanha, J. Lee, C. Lim, and K. Obraczka., "A New TCP for Persistent Packet Reordering-TCP-PR," IEEE/ACM Trans. on Networking, to appear in April 2006.
5. H. Han, S. Shakkottai, C. V. Hallot, R. Srikant, and D. Towsley, "Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet," IEEE/ACM Trans. on Networking, vol. 14, pp. 1260-1271, December 2006.
6. A. Elwalid, C. Jin, S. Low, and I. Widjaja, "MATE: MPLS Adaptive Traffic Engineering," in Proceedings of IEEE INFOCOM'01, Anchorage, USA, April 2001, pp. 1300-1309.
7. R. Banner and A. Orda, "Multipath routing algorithms for congestion minimization," in Proc. IFIP Networking 2005, Waterloo, Ontario, Canada, May 2005.
8. M. R. Garey and D. S. Johnson, Computers and Intractability, W.H. Freeman and Co., NY, 1979.
9. S.T. McCormick, "The complexity of max flow with bounded-length paths," Working paper, 1006.
10. N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in Proceedings of 39th Annual IEEE Symposium on Foundations of Computer Science, 1997.
11. D. R. Shier, "Iterative Methods for Determining the k Shortest Paths in a Network," Networks, vol. 6, pp. 205-229, 1976.
12. GANT network pan-European backbone, http://www.geant.net/upload/pdf/ Topology-Oct-2004.pdf.