ACM Home Page
Please provide us with feedback. Feedback
Upgrading transport protocols using untrusted mobile code
Full text PdfPdf (249 KB)
Source ACM Symposium on Operating Systems Principles archive
Proceedings of the nineteenth ACM symposium on Operating systems principles table of contents
Bolton Landing, NY, USA
SESSION: Safely executing untrusted code table of contents
Pages: 1 - 14  
Year of Publication: 2003
ISBN:1-58113-757-5
Also published in ...
Authors
Parveen Patel  University of Utah, Salt Lake City, UT
Andrew Whitaker  University of Washington, Seattle, WA
David Wetherall  University of Washington, Seattle, WA
Jay Lepreau  University of Utah, Salt Lake City, UT
Tim Stack  University of Utah, Salt Lake City, UT
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 17
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/945445.945447
What is a DOI?

ABSTRACT

In this paper, we present STP, a system in which communicating end hosts use untrusted mobile code to remotely upgrade each other with the transport protocols that they use to communicate. New transport protocols are written in a type-safe version of C, distributed out-of-band, and run in-kernel. Communicating peers select a transport protocol to use as part of a TCP-like connection setup handshake that is backwards-compatible with TCP and incurs minimum connection setup latency. New transports can be invoked by unmodified applications. By providing a late binding of protocols to hosts, STP removes many of the delays and constraints that are otherwise commonplace when upgrading the transport protocols deployed on the Internet. STP is simultaneously able to provide a high level of security and performance. It allows each host to protect itself from untrusted transport code and to ensure that this code does not harm other network users by sending significantly faster than a compliant TCP. It runs untrusted code with low enough overhead that new transport protocols can sustain near gigabit rates on commodity hardware. We believe that these properties, plus compatibility with existing applications and transports, complete the features that are needed to make STP useful in practice.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Aggarwal, S. Savage, and T. Anderson. Understanding the Performance of TCP Pacing. In Proc. of IEEE INFOCOM, pages 1157--1165, Mar. 2000.
 
2
M. Allman. TCP Congestion Control with Appropriate Byte Counting. RFC 3465, IETF, Feb. 2002.
 
3
M. Allman, H. Balakrishnan, and S. Floyd. Enhancing TCP's Loss Recovery Using Limited Transmit. RFC 3042, IETF, Jan. 2001.
 
4
M. Allman, D. Glover, and L. Sanchez. Enhancing TCP Over Satellite Channels using standard Mechanisms. RFC 2488, IETF, Jan. 1999.
 
5
M. Allman, V. Paxson, and W. Stevens. TCP Congestion Control. RFC 2581, IETF, Apr. 1999.
 
6
D. Andersen, D. Bansal, D. Curtis, S. Seshan, and H. Balakrishnan. System Support for Bandwidth Management and Content Adaptation in Internet Applications. In Proc. of the Fourth Symposium on Operating Systems Design and Implementation, pages 213--226, Oct. 2000.
 
7
G. Back, W. C. Hsieh, and J. Lepreau. Processes in KaffeOS: Isolation, Resource Management, and Sharing in Java. In Proc. of the Fourth Symposium on Operating Systems Design and Implementation, pages 333--346, Oct. 2000.
8
 
9
D. J. Bernstein and E. Schenk. TCP Syn Cookies. 1996, 2002; http://cr.yp.to/syncookies.html.
10
 
11
 
12
H. Bos and B. Samwel. Safe Kernel Programming in the OKE. In Proc. of the Fifth IEEE Conference on Open Architectures and Network Programming, June 2002.
 
13
R. Braden. T/TCP -- TCP Extensions for Transactions Functional Specification. RFC 1644, IETF, July 1994.
 
14
L. S. Brakmo and L. L. Peterson. TCP Vegas: End to End Congestion Avoidance on a Global Internet. IEEE Journal on Selected Areas in Communication, 13(8):1465--1480, Oct. 1995.
15
 
16
 
17
18
 
19
M. E. Fiuczynski and B. N. Bershad. An Extensible Protocol Architecture for Application-Specific Networking. In Proc. of the USENIX Annual Technical Conference, pages 55--64, Jan. 1996.
 
20
S. Floyd. The NewReno Modification to TCP's Fast Recovery Algorithm. RFC 2582, IETF, Apr. 1999.
 
21
S. Floyd. Congestion Control Principles. RFC 2914, IETF, Sept. 2000.
 
22
S. Floyd. Questions about TCP deployment, 2000. http://www.icir.org/floyd/questions.html.
 
23
S. Floyd. HighSpeed TCP for Large Congestion Windows, July 2003. IETF, Internet Draft.
24
 
25
S. Floyd, J. Mahdavi, M. Mathis, and M. Podolsky. An Extension to the Selective Acknowledgement (SACK) Option for TCP. RFC 2883, IETF, July 2000.
26
 
27
M. Handley, S. Floyd, J. Padhye, and J. Widmer. TCP Friendly Rate Control (TFRC): Protocol Specification. RFC 3448, IETF, Jan. 2003.
 
28
29
 
30
V. Jacobson. 4BSD TCP Header Prediction. ACM Computer Communication Review, 20(2):13--15, Apr. 1990.
 
31
V. Jacobson, R. Braden, and D. Borman. TCP Extensions for High Performance. RFC 1323, IETF, May 1992.
 
32
 
33
C. Jin, D. X. Wei, and S. H. Low. FAST TCP for High-Speed Long-Distance Networks, June 2003. IETF, Internet Draft.
34
35
36
 
37
E. Kohler, M. Handley, S. Floyd, and J. Padhye. Datagram Congestion Control Protocol (DCCP), Oct. 2002. http://www.icir.org/kohler/dccp/.
38
39
40
 
41
M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP Selective Acknowledgement Options. RFC 2018, IETF, Oct. 1996.
 
42
S. O'Malley and L. Peterson. TCP Extensions Considered Harmful. RFC 1263, IETF, Oct. 1991.
43
44
 
45
P. Patel and J. Lepreau. Hybrid Resource Control for Active Extensions. In Proc. of the Sixth IEEE Conference on Open Architectures and Network Programming, pages 23--31, Apr. 2003.
 
46
P. Patel, D. Wetherall, J. Lepreau, and A. Whitaker. TCP Meets Mobile Code. In Proc. of the Ninth Workshop on Hot Topics in Operating Systems. IEEE Computer Society, May 2003.
 
47
 
48
Pittsburgh Supercomputing Center. The TCP-Friendly Website, 2003. http://www.psc.edu/networking/tcp friendly.html.
 
49
J. Postel. Transmission Control Protocol. RFC 793, IETF, Sept. 1981.
 
50
K. Ramakrishnan, S. Floyd, and D. Black. The Addition of Explicit Congestion Notification (ECN) to IP. RFC 3168, IETF, Sept. 2001.
 
51
K. Ratnam and I. Matta. WTCP: An Efficient Transmission Control Protocol for Networks with Wireless Links. In Proc. of the Third IEEE Symposium on Computers and Communications, pages 74--78, June 1998.
 
52
R. Rejaie, M. Handley, and D. Estrin. RAP: An End-to-End Rate-Based Congestion Control Mechanism for Realtime Streams in the Internet. In Proc. of IEEE INFOCOM, pages 1337--1345, Mar. 1999.
53
54
 
55
W. Stevens. TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. RFC 2001, IETF, Jan. 1997.
 
56
R. Stewart, Q. Xie, K. Morneault, C. Sharp, H. Schwarzbauer, T. Taylor, I. Rytina, M. Kalla, L. Zhang, and V. Paxson. Stream Control Transmission Protocol. RFC 2960, IETF, Oct. 2000.
 
57
J. Stone, R. Stewart, and D. Otis. Stream Control Transmission Protocol (SCTP) Checksum Change. RFC 3309, IETF, Sept. 2002.
 
58
D. L. Tennenhouse, J. M. Smith, W. D. Sincoskie, D. J. Wetherall, and G. J. Minden. A Survey of Active Network Research. IEEE Communications Magazine, 35(1):80--86, Jan. 1997.
59
60
 
61
R. Wang, M. Valla, M. Y. Sanadidi, and M. Gerla. Adaptive Bandwidth Share Estimation in TCP Westwood. In Proc. of IEEE Globecom, Nov. 2002.
62
63
 
64
J. Widmer. Equation-based Congestion Control, 2000. Diploma Thesis. University of Mannheim.
 
65
M. Zhang, B. Karp, S. Floyd, and L. Peterson. RR-TCP: A Reordering-Robust TCP with DSACK. TR 006, International Computer Science Institute, July 2002.

CITED BY  17

Collaborative Colleagues:
Parveen Patel: colleagues
Andrew Whitaker: colleagues
David Wetherall: colleagues
Jay Lepreau: colleagues
Tim Stack: colleagues