DTL: Dynamic Transport Library for Peer-to-Peer Applications

  • Riccardo Reale
  • Roberto Roverso
  • Sameh El-Ansary
  • Seif Haridi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7129)


This paper presents the design and implementation of the Dynamic Transport Library (DTL), a UDP-based reliable transport library, initially designed for - but not limited to - peer-to-peer applications. DTL combines many features not simultaneously offered by any other transport library including: i) Wide scope of congestion control levels starting from less-than-best-effort to high-priority, ii) Prioritization of traffic relative to other non-DTL traffic, iii) Prioritization of traffic between DTL connections, iv) NAT-friendliness, v) Portability, and vi) Application level implementation. Moreover, DTL has a novel feature, namely, the ability to change the level of aggressiveness of a certain connection at run-time. All the features of the DTL were validated using a controlled environment as well as the Planet Lab testbed.


Packet Loss Congestion Control Congestion Window Bottleneck Link Slow Start 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
  3. 3.
    Allman, M., Paxson, V., Blanton, E.: Tcp congestion control (September 2009),
  4. 4.
    Carbone, M., Rizzo, L.: Dummynet revisited. Computer Communication Review 40(2), 12–20 (2010)CrossRefGoogle Scholar
  5. 5.
    Carofiglio, G., Muscariello, L., Rossi, D., Testa, C.: A hands-on assessment of transport protocols with lower than best effort priority. CoRR abs/1006.3017 (2010)Google Scholar
  6. 6.
    Carofiglio, G., Muscariello, L., Rossi, D., Valenti, S.: The quest for ledbat fairness. CoRR abs/1006.3018 (2010)Google Scholar
  7. 7.
    Chiu, D.M., Jain, R.: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks 17, 1–14 (1989)zbMATHGoogle Scholar
  8. 8.
    De Cicco, L., Mascolo, S., Palmisano, V.: An Experimental Investigation of the Congestion Control Used by Skype VoIP. In: Boavida, F., Monteiro, E., Mascolo, S., Koucheryavy, Y. (eds.) WWIC 2007. LNCS, vol. 4517, pp. 153–164. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Crowcroft, J., Oechslin, P.: Differentiated end-to-end internet services using a weighted proportional fair sharing tcp. CoRR cs.NI/9808004 (1998)Google Scholar
  10. 10.
    Damjanovic, D., Welzl, M.: Multfrc: providing weighted fairness for multimediaapplications (and others too!). Computer Communication Review 39(3), 5–12 (2009)CrossRefGoogle Scholar
  11. 11.
    Guha, S., Francis, P.: Characterization and measurement of tcp traversal through nats and firewalls. In: Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement, IMC 2005, p. 18. USENIX Association, Berkeley (2005), Google Scholar
  12. 12.
    Handley, M., Floyd, S., Padhye, J., Widmer, J.: Tcp friendly rate control (tfrc): Protocol specification (2003)Google Scholar
  13. 13.
    Kuzmanovic, A., Knightly, E.W.: Tcp-lp: low-priority service via end-point congestion control. IEEE/ACM Trans. Netw. 14(4), 739–752 (2006)CrossRefGoogle Scholar
  14. 14.
    Nabeshima, M.: Performance evaluation of multcp in high-speed wide area networks. IEICE Transactions 88-B(1), 392–396 (2005)CrossRefGoogle Scholar
  15. 15.
    Paxson, V., Allman, M.: Computing tcp’s retransmission timer (2000)Google Scholar
  16. 16.
    Rossi, D., Testa, C., Valenti, S., Veglia, P., Muscariello, L.: News from the internet congestion control world. CoRR abs/0908.0812 (2009)Google Scholar
  17. 17.
    Roverso, R., El-Ansary, S., Haridi, S.: Natcracker: Nat combinations matter. In: Proceedings of the 2009 Proceedings of 18th International Conference on Computer Communications and Networks, ICCCN 2009, pp. 1–7. IEEE Computer Society, Washington, DC (2009), CrossRefGoogle Scholar
  18. 18.
    Venkataramani, A., Kokku, R., Dahlin, M.: Tcp nice: A mechanism for background transfers. In: OSDI (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Riccardo Reale
    • 1
  • Roberto Roverso
    • 1
    • 2
  • Sameh El-Ansary
    • 1
  • Seif Haridi
    • 2
  1. 1.Peerialism IncStockholmSweden
  2. 2.KTH-Royal Institute of TechnologyStockholmSweden

Personalised recommendations