CLC number: TN919.8
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 0000-00-00
Cited: 1
Clicked: 3310
Chen Cheng, Li Zheng-Guo, Soh Yeng-Chai. TCP-friendly source adaptation for multimedia applications over the Internet[J]. Journal of Zhejiang University Science A, 2006, 7(100): 1-6.
@article{title="TCP-friendly source adaptation for multimedia applications over the Internet",
author="Chen Cheng, Li Zheng-Guo, Soh Yeng-Chai",
journal="Journal of Zhejiang University Science A",
volume="7",
number="100",
pages="1-6",
year="2006",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2006.AS0001"
}
%0 Journal Article
%T TCP-friendly source adaptation for multimedia applications over the Internet
%A Chen Cheng
%A Li Zheng-Guo
%A Soh Yeng-Chai
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 100
%P 1-6
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.AS0001
TY - JOUR
T1 - TCP-friendly source adaptation for multimedia applications over the Internet
A1 - Chen Cheng
A1 - Li Zheng-Guo
A1 - Soh Yeng-Chai
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 100
SP - 1
EP - 6
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.AS0001
Abstract: In this paper, we propose a simply TCP-friendly source adaptation framework to provide a proportional bandwidth sharing service. Our scheme is based on the framework of Monotonic Response Function (MRF), can be used to bound the sending rate of a source within a predefined interval and provide very smooth traffic, and is suitable for multimedia applications over the Internet. As our scheme is also very simple and TCP-friendly, it is easy to be deployed over the current Internet. We verify our scheme with experimental studies.
[1] Bansal, D., Balakrishnan, H., 2001. Binomial Congestion Control Algorithms. IEEE INFOCOMM, p.631-640.
[2] Chen, C., Li, Z.G., Soh, Y.C., 2005. MRF: A framework for source and destination based bandwidth differentiation service. IEEE/ACM Trans. on Networking, in Press.
[3] Chiu, D.M., Jain, R., 1989. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN Systems, 17:1-14.
[4] Crowcroft, J., Oechslin, P., 1998. Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP. ACM SIGCOMM Computer Communication Review, 28(3):53-67.
[5] Floyd, S., Handley, M., Padhye, J., 2000. A Comparison of Equation-Based and Aimd Congestion Control. http://www.aciri.org/trfc/.
[6] Handley, M., Floyd, S., Padhye, J., Widmer, J., 2003. TCP Friendly Rate Control (TFRC): Protocol Specification. RFC 3448.
[7] Jacobson, V., Karels, M., 1990. Congestion avoidance and control. ACM Comput. Commun. Rev., 18(4):314-329.
[8] Jain, R., Ramakrishnan, K., Chiu, D., 1987. Congestion Avoidance in Computer Networks with a Connectionless Netowrk Layer. Tech. Rep. DEC-TR-506~34, Digital Equipment Corporation.
[9] Low, S.H., Lapsley, D.E., 1999. Optimization flow control—I: Basic algorithm and convergence. IEEE/ACM Trans. on Networking, 7(6):861-874.
[10] Wang, X., Schulxrinne, H., 2005. Incentive-compatible adaptation of Internet real-time multimedia. IEEE Journal on Selected Areas in Communications, 23(2):417-436.
[11] Yang, Y.R., Lam, S.S., 2000. General AIMD Congestion Control. IEEE Int. Conf. Network Protocols. Osaka, Japan, p.187-198.
Open peer comments: Debate/Discuss/Question/Opinion
<1>