Abstract
Recent years have seen dramatic increases of the use of multimedia applications on the Internet, which typically either lack congestion control or use proprietary congestion control mechanisms. This can easily cause congestion collapse or compatibility problems. Datagram Congestion Control Protocol (Dccp) fills the gap betweenUdp andTcp, featuring congestion control rather than reliability for packet-switched rich content delivery with high degree of flexibility. We present aDccp model designed and implemented withOpnet Modeler, and the experiments and evaluation focused on largely the smoothness of the data rates, and the fairness between concurrentDccp flows andTcp flows. We foundDccp-ccid3 demonstrates stable data rates under different scenarios, and the fairness betweenDccp andTcp is only achieved under certain conditions. We also validated that the throughput ofDccp-Ccid3 is proportional to the average packet size, and relatively fixed packet size is critical for the optimal operation ofDccp. Problems in the slow start phase and insufficient receiver buffer size were identified and we hereby proposed solutions on this.
Résumé
Le nombre d’applications multimédias sur l’internet a considérablement augmenté ces dernières années. Ces applications généralement ne gèrent pas les congestions ou bien utilisent des mécanismes de contrôle propriétaires. Il peut en résulter facilement des congestions graves ou des problèmes d’incompatibilité. Le protocoleDccp (Datagram Congestion Control Protocol) se positionne entreUdp etTcp puisqu ’il fournit, pour des paquets multimédias, un contrôle de congestion hautement flexible mais sans la fiabilité de délivrance. Cet article présente un modèleDccp conçu et implémenté avec le simulateurOpnet. Les expérimentations et les analyses portent principalement sur le lissage des débits et l’équité entre des fluxDccp etTcp concurrents. On montre queDccp-Ccid3 affiche des débits stables sous divers scénarios et que l’équité entreDccp etTcp n’est atteinte que sous certaines conditions. On valide également que le débit deDccp-Ccid3 est proportionnel à la taille moyenne des paquets et que le fait d’avoir des paquets de taille relativement constante est un facteur essentiel pour un fonctionnement optimal deDccp. Les problèmes pendant la phase de démarrage lent et ceux dus à une mémoire tampon insuffisante côté récepteur sont également analysés et résolus.
Similar content being viewed by others
References
Kohler (E.),Handley (M.),Floyd (S.), DesigningDccp: Congestion Control without Reliability, May 2003, url: http://citeseer.ist.psu.edu/kohler03designing.html.
Handley (M.),Floyd (S.),Padhye (J.),Widmer (J.),Tcp Friendly Rate Control (Tfrc): Protocol Specification,Rfc 3448,Ietf, Jan. 2003.
Stewart (R.),Xie (Q.),Morneault (K.),Sharp (C),Schwarzbauer (H.),Taylor (T.),Rytina (I.),Kalla (M.),Zhang (L.),Paxson (V.), Stream Control Transmission Protocol),Rfc 2960,Ietf, Oct. 2000.
Yang (Y. R.),Lam (S. S.), General aimd Congestion Control, in Proceedings ofIeee International Conference on Network Protocols (Icnp 2000), Osaka, Japan, pp. 187–198, Nov. 2000.
Rejaie (R.),Handley (M.),Estrin (D.),Rap: An End-to-end Rate-based Congestion Control Mechanism for Real-time Streams in the Internet, in Proceedings ofIeee infocom 1999, New York, USA, pp. 1337–1345, Mar. 1999. [6]|Tang (J.),Morabito (G.),Akyildiz (I.F.),Johnson (M.),Rcs: A Rate Control Scheme For Real-Time Traffic In Networks With High Bandwidth-Delay Products And High Bit Error Rates, in Proceedings ofIeee infocom 2001, Anchorage, usa, pp. 114–122, Apr. 2001.
Aran (Ö. B.), Akyildiz (I. F.), Arc: The Analytical Rate Control Scheme for Real-Time Traffic in Wireless Networks,Ieee/acm Transactions on Networking (Ton),12, no 4, pp. 634–644, Aug. 2004.
Cai (L.), Shen (X.), Pan (J.), Mark (J.W.), Performance Analysis of TCP-Friendly aimd Algorithms For Multimedia Applications,Ieee Transaction on Multimedia,7, no 2, pp. 339–355, Apr. 2005.
Mathis (M.),Semke (J.),Mahdav (J.), The Macroscopic Behavior of theTcp Congestion Avoidance Algorithm,Acm Computer Communication Review, 27, no 3, Jul. 1997.
Padhye (J.),Firoiu (V.),Towsley (D.),Kurose (J.), ModelingTcp Throughput: A Simple Model and its Empirical Validation, in Proceedings of theAcm sigcomm ’98 conference on Applications, technologies, architectures, and protocols for computer communication, Vancouver, Canada, pp. 303–314, Aug. 1998.
Sisalem (D.),Schulzrinne (H.), The Loss-Delay Based Adjustment Algorithm: A TCP-Friendly Adaptation Scheme, in Proceedings of Proc. the 8th International Workshop on Network and Operation System Support for Digital Audio and Video 1998 (Nossdav98), Osaka, Japan, Jul. 1998.
Floyd (S.),Handley (M.),Padhye (J.),Widmer (J.), Equation-based Congestion Control for Unicast Applications, in Proc ofAcm sigcomm 2000, Stockholm, Sweden, pp. 43–56, Aug. 2000.
Li (M.),Lee (C.S.),Agu (E.),Claypool (M.),Kinicki (R.), Performance Enhancement of tfrc in Wireless Ad Hoc Networks, in Proc. of the 10th International Conference on Distributed Multimedia Systems (Dms), San Francisco, usa, Sep. 2004.
Takeuchi (S.),Koga (H.),Iida (K.),Kadobayashi (Y),Yamaguchi (S.), Performance Evaluations ofDccp for Bursty Traffic in Real-time Applications. in Proc. ofIeee/ipsj International Symposium on Applications and the Internet (Saint 2005), Trento, Italy, pp. 142–149, Jan. 2005.
Floyd (S.),Kohler (E.), Profile forDccp Congestion ControlId 2:Tcp-like Congestion Control, Internet Draft (work in progress), 〈draft-ietf-dccp-ccid2-10.txt〉,Ietf, Mar. 2005.
Floyd (S.),Kohler (E.),Padhye (J.), Profile forDccp Congestion ControlId 3:Tfrc Congestion Control, Internet Draft (work in progress), draft-ietf-dccp-ccid3-ll.txt,Ietf, Mar. 2005.
Häggmark (J.),Mattsson (N.E.),Erixzon (M.), KernelDccp for FreeBsd. [Online]. Available: http://www.freebsd.dccp.org/.
McManus (P.), Linux 2.4.18 KernelDccp. [Online]. Available: http://www.ducksong.com:81/dccp/.
Sohn (T.),Zolfaghari (E.),Evlogimenos (A.),Lim (K.H.),Lai (K.), A User-levelDccp from Berkeley. [Online]. Available: http://www.cs.berkeley.edu/~laik/projects/dccp/.
Mattsson (N. E.), ADccp Module for ns-2, Master’s thesis, Luleå University of Technology, Sweden, May 2004.
Opnet Technologies Inc,Opnet Modeler Brochure.Url:http://www.opnet.com/products/modeler/opnet_modeler.pdf.
Kohler (E.),Handley (M.),Floyd (S.),Padhye (J.), Datagram Congestion Control Protocol (Dccp), Internet Draft (work in progress), 〈 draft-ietf-dccp-spec-1l.txt〉,Ietf, Mar. 2005.
Floyd (S.),Kempf (J.),Iab Concerns Regarding Congestion Control for Voice Traffic in the Internet,Rfc 3714,Ietf, Mar. 2004.
Floyd (S.),Kohler (E.),Tcp Friendly Rate Control (Tfrc) for Voice: VoIP Variant Internet Draft (work in progress), 〈 draft-ietf-dccp-tfrc-voip-02.txt 〉,Ietf, Jul. 2005.
Kohler (E.),Floyd (S.), Faster Restart forTcp Friendly Rate Control (Tfrc) Internet Draft (work in progress), 〈draft-ietf-dccp-tfrc-faster-restart-00.txt〉,Ietf, Jul. 2005.
Allman (M.),Paxson (V),Stevens (V),Tcp Congestion Control,Rfc 2581,Ietf, Apr. 1999.
Author information
Authors and Affiliations
Additional information
This work was done during Pengfei’s study at the Technische Universität Braunschweig.
Rights and permissions
About this article
Cite this article
Gu, X., Di, P. & Wolf, L. Performance evaluation of DCCP: A focus on smoothness and TCP-friendliness. Ann. Télécommun. 61, 46–71 (2006). https://doi.org/10.1007/BF03219968
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF03219968
Keywords
- Transmission protocol
- Internet Multimedia
- Congestion control
- Tcp/ip
- Packet transmission
- Modeling
- Simulation
- Performance evaluation