ACM Home Page
Please provide us with feedback. Feedback
A model, analysis, and protocol framework for soft state-based communication
Full text PdfPdf (1.37 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication table of contents
Cambridge, Massachusetts, United States
Pages: 15 - 25  
Year of Publication: 1999
ISBN:1-58113-135-6
Also published in ...
Authors
Suchitra Raman  Department of EECS, University of California, Berkeley
Steven McCanne  Department of EECS, University of California, Berkeley
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 80,   Citation Count: 24
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/316188.316202
What is a DOI?

ABSTRACT

"Soft state" is an often cited yet vague concept in network protocol design in which two or more network entities intercommunicate in a loosely coupled, often anonymous fashion. Researchers often define this concept operationally (if at all) rather than analytically: a source of soft state transmits periodic "refresh messages" over a (lossy) communication channel to one or more receivers that maintain a copy of that state, which in turn "expires" if the periodic updates cease. Though a number of crucial Internet protocol building blocks are rooted in soft state-based designs --- e.g., RSVP refresh messages, PIM membership updates, various routing protocol updates, RTCP control messages, directory services like SAP, and so forth --- controversy is building as to whether the performance overhead of soft state refresh messages justify their qualitative benefit of enhanced system "robustness". We believe that this controversy has risen not from fundamental performance tradeoffs but rather from our lack of a comprehensive understanding of soft state. To better understand these tradeoffs, we propose herein a formal model for soft state communication based on a probabilistic delivery model with relaxed reliability. Using this model, we conduct queueing analysis and simulation to characterize the data consistency and performance tradeoffs under a range of workloads and network loss rates. We then extend our model with feedback and show, through simulation, that adding feedback dramatically improves data consistency (by up to 55%) without increasing network resource consumption. Our model not only provides a foundation for understanding soft state, but also induces a new fundamental transport protocol based on probabilistic delivery. Toward this end, we sketch our design of the "Soft State Transport Protocol" (SSTP), which enjoys the robustness of soft state while retaining the performance benefit of hard state protocols like TCP through its judicious use of feedback.


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
2
3
 
4
5
6
 
7
 
8
BOLOT, J.-C., AND TURLETTI, T. A Rate Control Mechanism for Packet Video in the Internet. In Proceedings IEEE lnfocom '94 (Toronto, Canada, June 1994), ACM.
9
 
10
CHANDY, K. M., RIFKIN, A., AND SCHOOL~n, E. Using Announce-Listen with Global Events to Develop Distributed Control Systems. Concurrency: Practice and Experience (1998), 1021-1027.
 
11
CHESSON, G. XTP/Protocol Engine Design. In Proceedings of the IFIP WG6.1/6.~ Workshop (Riischlikon, May 1989).
12
13
 
14
15
 
16
17
 
18
FAI,K, A., AND PAXSON, V. Minutes of the "RUTS" IETF BOF, Dec. 1998. ftp://ftp.ee.lb!.gov/ietf/ruts-98-minutes.
 
19
20
 
21
HANOLEY, M. SAP: Session Announcement Protocol. Internet Draft, Nov 19, 1996.
22
23
 
24
HANDLEY, M., AND JACOBSON, V. sdr- A Multicast Session Directory. University College London.
 
25
HEORICK, C. Routing Information Protocol. Rutgers University, June 1988. RFC-1058.
 
26
JACOBSON, V. Session Directory. Lawrence Berkeley Laboratory, ftp://ftp.ee.lbl.gov/conferencing/sd.
27
 
28
JACOBSON, V. SIGCOMM '94 Tutorial: Multimedia conferencing on the Internet, Aug. 1994.
 
29
JACOBSON, V., AND MCCANNE, S. LBL Whiteboard. Lawrence Berkeley Laboratory ftp://ftp.ee.lbl.gov/conferencing/wb.
 
30
JACOBSON, V., AND MCCANNE, S. Visual Audio Tool. Lawrence Berkeley Laboratory. ftp://ftp.ee.lbl.gov/conferencing/vat.
 
31
JAIN, R. Congestion Control in Computer Networks: Issues and Trends. IEEE Network Magazine (May 1990), 24-30.
 
32
JAIN, R., P~AMAKRISHNAN, K., AND CH{U, D.-M. Congestion Avoidance in Computer Networks With a Connectionless Network Layer. Tech. Rep. DEC-TR-506, Digital Equipment Corporation, Aug. 1987.
 
33
LOUGHEED, K., AND REKHTER, Y. A Border Gateway Protocol (BGP). Cisco Systems and T. J. Watson Research Center, IBM Corp., June 1989. RFC-II05.
 
34
MCCAN~'E, S. Receiver-driven Layered Multicast. PhD thesis, University of California, Berkeley, Dec. 1996.
35
 
36
McQumr. AN, J., ET AL. A New Routing Algorithm for the ARPANET. IEEE 7h~nscations on Networking (May 1980).
 
37
MOCKAPETRIS, P. Domain Names - Implementation and Specification. SRI International, Menlo Park, CA, Nov. 1987. RFC-1035.
38
 
39
POINTCAST INC. PointCast Home Page. http://www.p oint cast. com.
40
 
41
REALNETWORKS, INC. RealPlayer. http://www.real.com/.
 
42
REJAm, R., HANDLZY, M., AND ESTR~N, D. RAP: An Endto-end Rate-based Congestion Control Mechanism for Realtime Streams in the lnternet. IEEE lnfocom (1999).
 
43
PdVEST, R. The MD5 Message-Digest Algorithm. MIT Laboratory for Computer Science and RSA Data Security, Inc., 1992. RFC-1321.
44
 
45
SCHULZRINNE, H., CASNE,~, S., FREDERICK, R., AND JACOB- SON, V. RTP: A Transport Protocol for Real-Time Applications. Internet Engineering Task Force, Audio-Video Transport Working Group, Jan. 1996. I~FC-1889.
 
46
47
 
48
TURLETTI, T., AND BOLOT, J.-C. Issues with Multicast Video Distribution in Heterogeneous Packet Networks. In Proceedings of the Sixth International Workshop on Packet Video (Portland, OR., Sept. 1994).
 
49
Digital Subscriber Signalling System No. 1 (DSS I) - ISDN User-Network Interface Layer 3 Specification for Basic Call Control, 1993. ITU-T Recommendation Q.931.
 
50
Procedures for Establishing Communication between Three or more Audiovisual Terminals using Digital Channels up to 1920 kbit/s, 1997. ITU-T Recommendation H.243.
 
51
WALDSPUR(}ER, C. A., AND WEIHL, W. E. Lottery Scheduling: Flexible Proportional-Share Resource Management. In First Symposium on Operating Systems Design and Implementation (OSDI) (1995), USENIX Association, pp. 1-11.
 
52
 
53
ZHANG, L., DEF, RIN~, S., ESTRIN, D., SHENKER, S., AND ZAPPALA, D. R. SVP: A New Resource ReSerVation Protocol. IEEE Network Magazine (Sept. 1993), 8-18.

CITED BY  25

Collaborative Colleagues:
Suchitra Raman: colleagues
Steven McCanne: colleagues