Efficiency and late data choice in a user-kernel interface for congestion-controlled datagrams

Junwen Lai; Eddie Kohler

doi:10.1117/12.592281

17 January 2005 Efficiency and late data choice in a user-kernel interface for congestion-controlled datagrams

Junwen Lai, Eddie Kohler

Proceedings Volume 5680, Multimedia Computing and Networking 2005; (2005) https://doi.org/10.1117/12.592281
Event: Electronic Imaging 2005, 2005, San Jose, California, United States

Abstract

Streaming media servers send many datagrams, very quickly, on many different connections, hopefully without congesting the network. In addition, in order to adapt to constantly changing network conditions, they often demand the capability of late data choice, where they choose which data to send immediately before transmission. In this paper, we present a novel user-kernel interface for congestion-controlled datagram protocols that is both efficient and flexible. Our API consists of a packet ring located in shared memory. Applications enqueues packet descriptors directly onto the ring, without crossing the user-kernel boundary, and the kernel dequeues packets from the ring and sends them. This minimizes control and data transfers and gives good throughput. In addition, our API provides a mechanism that allows the application to go back and safely change, remove or even reorder previously-enqueued packets, right up until the kernel sends them. This design separates the mechanism for achieving QoS support from any particular QoS policy. We describe the interface and evaluate its performance. By reducing control transfers, the packet ring can even send zero-length packets through the kernel faster than conventional send()-based UDP. Furthermore, on a congested network, an MPEG-like application using our DCCP API can deliver more than twice as many important "I-frames" than a CBR UDP sender in the same network conditions.

Citation Download Citation

Junwen Lai and Eddie Kohler "Efficiency and late data choice in a user-kernel interface for congestion-controlled datagrams", Proc. SPIE 5680, Multimedia Computing and Networking 2005, (17 January 2005); https://doi.org/10.1117/12.592281

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available