Skip to main content

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

  • Conference paper
Distributed Computing and Networking (ICDCN 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7129))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ledbat ietf draft (July 2010), http://tools.ietf.org/html/draft-ietf-ledbat-congestion-03

  2. Multfrc ietf draft (July 2010), http://tools.ietf.org/html/draft-irtf-iccrg-multfrc-01

  3. Allman, M., Paxson, V., Blanton, E.: Tcp congestion control (September 2009), http://www.ietf.org/rfc/rfc5681.txt

  4. Carbone, M., Rizzo, L.: Dummynet revisited. Computer Communication Review 40(2), 12–20 (2010)

    Article  Google Scholar 

  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. Carofiglio, G., Muscariello, L., Rossi, D., Valenti, S.: The quest for ledbat fairness. CoRR abs/1006.3018 (2010)

    Google Scholar 

  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)

    MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Damjanovic, D., Welzl, M.: Multfrc: providing weighted fairness for multimediaapplications (and others too!). Computer Communication Review 39(3), 5–12 (2009)

    Article  Google Scholar 

  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), http://portal.acm.org/citation.cfm?id=1251086.1251104

    Google Scholar 

  12. Handley, M., Floyd, S., Padhye, J., Widmer, J.: Tcp friendly rate control (tfrc): Protocol specification (2003)

    Google Scholar 

  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)

    Article  Google Scholar 

  14. Nabeshima, M.: Performance evaluation of multcp in high-speed wide area networks. IEICE Transactions 88-B(1), 392–396 (2005)

    Article  Google Scholar 

  15. Paxson, V., Allman, M.: Computing tcp’s retransmission timer (2000)

    Google Scholar 

  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. 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), http://dx.doi.org/10.1109/ICCCN.2009.5235278

    Chapter  Google Scholar 

  18. Venkataramani, A., Kokku, R., Dahlin, M.: Tcp nice: A mechanism for background transfers. In: OSDI (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reale, R., Roverso, R., El-Ansary, S., Haridi, S. (2012). DTL: Dynamic Transport Library for Peer-to-Peer Applications. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds) Distributed Computing and Networking. ICDCN 2012. Lecture Notes in Computer Science, vol 7129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25959-3_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25959-3_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25958-6

  • Online ISBN: 978-3-642-25959-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics