Skip Navigation

IEICE Transactions on Communications 2008 E91-B(3):722-732; doi:10.1093/ietcom/e91-b.3.722
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by OKUYAMA, T.
Right arrow Articles by YAMAOKA, K.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Papers -- Network

Nearly Equal Delay Path Set Configuration (NEED-PC) for Multipath Delay Jitter Reduction

Takafumi OKUYAMA1, Kenta YASUKAWA1 and Katsunori YAMAOKA1

1 The authors are with Tokyo Institute of Technology, Tokyo, 152-8552 Japan. E-mail: takafumi{at}net.ss.titech.ac.jp; knt{at}net.ss.titech.ac.jp; yamaoka{at}ss.titech.ac.jp

Delay jitter degrades the quality of delay-sensitive live media streaming. We investigate the use of multipath transmission with two paths to reduce delay jitter and, in this paper, propose a nearly equal delay path set configuration (NEED-PC) scheme that further improves the performance of the multipath delay jitter reduction method for delay-sensitive live media streaming. The NEED-PC scheme configures a pair of a maximally node-disjoint paths that have nearly equal path delays and satisfy a given delay constraint. The results of our simulation experiments show that path sets configured by the NEED-PC scheme exhibit better delay jitter reduction characteristics than a conventional scheme that chooses the shortest path as the primary path. We evaluate the performance of path sets configured by the NEED-PC scheme and find that the NEED-PC scheme reduces delay jitter when it is applied to a multipath delay jitter reduction method. We also investigate the trade-off between reduced delay jitter and the increased traffic load incurred by applying multipath transmission to more flows. The results show that the NEED-PC scheme is practically effective even if the amount of additional redundant traffic caused by using multipath transmission is taken into account.

Key Words: QoS, multipath, delay jitter, delay-sensitive live media streaming


Manuscript received April 18, 2007. Manuscript revised August 22, 2007.

Reference

[1] ITU-T Rec. Y.1541, "Network performance objectives for IP-Based services," May 2002.

[2] N. Seitz, "ITU-T QoS standards for IP-based networks," IEEE Commun. Mag., vol.41, no.6, pp.82–89, June 2003.

[3] Y. Sakai and S. Yamamoto, "Protection method of high priority packet for video packet transmission," IEICE Trans. Commun. (Japanese Edition), vol.J75-B-I, no.3, pp.173–179, March 1992.

[4] I. Cidon, R. Rom, and Y. Shavitt, "Analysis of multi-path routing," IEEE/ACM Trans. Netw., vol.7, no.6, pp.885–896, Dec. 1999.

[5] J.G. Apostolopoulos, "Reliable video communication over lossy packet networks using multiple state encoding and path diversity," Proc. Visual Communication and Image Processing, VCIP'01, pp.392–409, Jan. 2001.

[6] S.J. Lee and M. Gerla, "Split multipath routing with maximally disjoint paths in ad hoc networks," Proc. IEEE ICC'01, vol.10, pp.3201–3205, June 2001.

[7] Y.J. Liang, E.G. Steinbach, and B. Girod, "Real-time voice communication over the Internet using packet path diversity," Proc. ACM Multimedia'01, pp.431–440, Ottawa, Canada, Oct. 2001.

[8] T. Nguyen and A. Zakhor, "Path diversity with forward error correction (pdf) system for packet switched networks," Proc. IEEE INFOCOM, pp.663–672, April 2003.

[9] D.G. Andersen, H. Balakrishnan, M.F. Kaashoek, and R. Morris, "The case for resilient overlay networks," Proc. HotOSVIII, pp.152–157, May 2001.

[10] A. Akella, B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman, "A measurement-based analysis of multihoming," Proc. ACM SIGCOMM, pp.353–364, Karlsruhe, Germany, Aug. 2003.

[11] J.R. Iyengar, P.D. Amer, and R. Stewart, "Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths," IEEE/ACM Trans. Netw., vol.14, no.5, pp.951–964, Oct. 2006.

[12] Skype, http://www.skype.com/

[13] J.G. Apostolopoulos and M.D. Trott, "Path diversity for enhanced media streaming," IEEE Commun. Mag., vol.42, no.8, pp.80–87, Aug. 2004.

[14] B. Braden, D. Clark, and S. Shenker, "Integrated services in the internet architecture: An overview," Internet Engineering Task Force, RFC1633, June 1994.

[15] S. Blake, D. Black, M. Carson, E. Davis, Z. Wang, and W. Weiss, "An architecture for differentiated services," Internet Engineering Task Force, RFC2475, Dec. 1998.

[16] J. Suurballe and R. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol.14, pp.325–336, 1984.

[17] N. Taft-Plotkin, B. Bellur, and R. Ogier, "Quality-of-service routing using maximally disjoint paths," Proc. IEEE/IFIP IWQoS, pp.119–128, London, UK, June 1999.

[18] A. Orda and A. Sprintson, "Efficient algorithms for computing disjoint QoS paths," Proc. IEEE INFOCOM, pp.727–738, 2004.

[19] Z. Ma, H.-R. Shao, and C. Shen., "A new multi-path selection scheme for video streaming on overlay networks," Proc. IEEE ICC, vol.3, pp.1330–1334, June 2004.

[20] D. Xu, Y. Chen, Y. Xiong, C. Qiao, and X. He, "On finding disjoint paths in single and dual link cost networks," Proc. IEEE INFOCOM, pp.705–715, 2004.

[21] M. Zhang, J. Lai, A. Krishnamurthy, L. Peterson, and R. Wang, "A transport layer approach for improving end-to-end performance and robustness using redundant paths," Proc. USENIX 2004 Annual Technical Conference, pp.99–112, Boston, MA, June 2004.

[22] T. Nunome and S. Tasaka, "An audio-video multipath streaming scheme with media synchronization control: Application-level qos assessment in a wireless ad hoc network," IEICE Trans. Commun., vol.E88-B, no.9, pp.3623–3634, Sept. 2005.

[23] P. Erdös and A. Rényi, "On the evolution of random graphs," Publications of the Mathematical Institute of the Hungarian Academy of Sciences, vol.5, pp.17–61, 1960.

[24] M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the Internet topology," Proc. ACM SIGCOMM'99, vol.29, pp.251–262, Cambridge, Massachusetts, USA, Oct. 1999.

[25] A.L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol.286, pp.509–512, Oct. 1999.

[26] W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson, "On the self-similar nature of Ethernet traffic (extended version)," IEEE/ACM Trans. Netw., vol.2, pp.1–15, Feb. 1994.

[27] M.E. Crovella and A. Bestavros, "Self-similarity in world wide web traffic: Evidence and possible causes," IEEE/ACM Trans. Netw., vol.5, no.6, pp.835–846, Dec. 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by OKUYAMA, T.
Right arrow Articles by YAMAOKA, K.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?