• DocumentCode
    2336764
  • Title

    Channel-based Unidirectional Stream Protocol (CUSP)

  • Author

    Terpstra, Wesley W. ; Leng, Christof ; Lehn, Max ; Buchmann, Alejandro

  • Author_Institution
    Databases & Distrib. Syst., Tech. Univ. Darmstadt, Darmstadt, Germany
  • fYear
    2010
  • fDate
    14-19 March 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    This paper presents a novel transport protocol, CUSP, specifically designed with complex and dynamic network applications in mind. Peer-to-peer applications benefit in particular, as their requirements are met by neither UDP nor TCP. While other modern transports like SCTP or SST have also tried to combine the advantages of TCP and UDP, CUSP overcomes their technical and conceptual shortcomings. CUSP makes it possible to directly express application logic in the message flow. Modern applications need a mixture of request-response, request-multiple-response, publish-subscribe, and message-passing. All of these operations can be conveniently implemented using CUSP´s unidirectional streams. We separate low-level packet management from streams into reusable channels. A channel connects two applications providing negotiation, congestion control, and cryptography. Developers operate on the stream level, sending messages as reliable and ordered byte-streams. Although they may share a common channel, a stall or loss in one stream does not block the others.
  • Keywords
    cryptography; telecommunication congestion control; transport protocols; CUSP; channel-based unidirectional stream protocol; congestion control; cryptography; low-level packet management; message flow; message passing; request-multiple-response; transport protocol; Communications Society; Cryptographic protocols; Cryptography; Delay; Distributed databases; Logic; Peer to peer computing; Privacy; Publish-subscribe; Transport protocols;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2010 Proceedings IEEE
  • Conference_Location
    San Diego, CA
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-5836-3
  • Type

    conf

  • DOI
    10.1109/INFCOM.2010.5462238
  • Filename
    5462238