draft-ietf-p2psip-self-tuning-07.txt		draft-ietf-p2psip-self-tuning-08.txt
	P2PSIP Working Group J. Maenpaa		P2PSIP Working Group J. Maenpaa
	Internet-Draft G. Camarillo		Internet-Draft G. Camarillo
	Intended status: Standards Track Ericsson		Intended status: Standards Track Ericsson
	Expires: July 24, 2013 January 20, 2013		Expires: August 20, 2013 February 16, 2013
	A Self-tuning Distributed Hash Table (DHT) for REsource LOcation And		A Self-tuning Distributed Hash Table (DHT) for REsource LOcation And
	Discovery (RELOAD)		Discovery (RELOAD)
	draft-ietf-p2psip-self-tuning-07.txt		draft-ietf-p2psip-self-tuning-08.txt
	Abstract		Abstract
	REsource LOcation And Discovery (RELOAD) is a peer-to-peer (P2P)		REsource LOcation And Discovery (RELOAD) is a peer-to-peer (P2P)
	signaling protocol that provides an overlay network service. Peers		signaling protocol that provides an overlay network service. Peers
	in a RELOAD overlay network collectively run an overlay algorithm to		in a RELOAD overlay network collectively run an overlay algorithm to
	organize the overlay, and to store and retrieve data. This document		organize the overlay, and to store and retrieve data. This document
	describes how the default topology plugin of RELOAD can be extended		describes how the default topology plugin of RELOAD can be extended
	to support self-tuning, that is, to adapt to changing operating		to support self-tuning, that is, to adapt to changing operating
	conditions such as churn and network size.		conditions such as churn and network size.
	skipping to change at page 1, line 37		skipping to change at page 1, line 37
	Internet-Drafts are working documents of the Internet Engineering		Internet-Drafts are working documents of the Internet Engineering
	Task Force (IETF). Note that other groups may also distribute		Task Force (IETF). Note that other groups may also distribute
	working documents as Internet-Drafts. The list of current Internet-		working documents as Internet-Drafts. The list of current Internet-
	Drafts is at http://datatracker.ietf.org/drafts/current/.		Drafts is at http://datatracker.ietf.org/drafts/current/.
	Internet-Drafts are draft documents valid for a maximum of six months		Internet-Drafts are draft documents valid for a maximum of six months
	and may be updated, replaced, or obsoleted by other documents at any		and may be updated, replaced, or obsoleted by other documents at any
	time. It is inappropriate to use Internet-Drafts as reference		time. It is inappropriate to use Internet-Drafts as reference
	material or to cite them other than as "work in progress."		material or to cite them other than as "work in progress."
	This Internet-Draft will expire on July 24, 2013.		This Internet-Draft will expire on August 20, 2013.
	Copyright Notice		Copyright Notice
	Copyright (c) 2013 IETF Trust and the persons identified as the		Copyright (c) 2013 IETF Trust and the persons identified as the
	document authors. All rights reserved.		document authors. All rights reserved.
	This document is subject to BCP 78 and the IETF Trust's Legal		This document is subject to BCP 78 and the IETF Trust's Legal
	Provisions Relating to IETF Documents		Provisions Relating to IETF Documents
	(http://trustee.ietf.org/license-info) in effect on the date of		(http://trustee.ietf.org/license-info) in effect on the date of
	publication of this document. Please review these documents		publication of this document. Please review these documents
	skipping to change at page 2, line 36		skipping to change at page 2, line 36
	6.2. Determining Routing Table Size . . . . . . . . . . . . . . 13		6.2. Determining Routing Table Size . . . . . . . . . . . . . . 13
	6.3. Estimating Failure Rate . . . . . . . . . . . . . . . . . 13		6.3. Estimating Failure Rate . . . . . . . . . . . . . . . . . 13
	6.3.1. Detecting Failures . . . . . . . . . . . . . . . . . . 14		6.3.1. Detecting Failures . . . . . . . . . . . . . . . . . . 14
	6.4. Estimating Join Rate . . . . . . . . . . . . . . . . . . . 14		6.4. Estimating Join Rate . . . . . . . . . . . . . . . . . . . 14
	6.5. Estimate Sharing . . . . . . . . . . . . . . . . . . . . . 15		6.5. Estimate Sharing . . . . . . . . . . . . . . . . . . . . . 15
	6.6. Calculating the Stabilization Interval . . . . . . . . . . 16		6.6. Calculating the Stabilization Interval . . . . . . . . . . 16
	7. Overlay Configuration Document Extension . . . . . . . . . . . 17		7. Overlay Configuration Document Extension . . . . . . . . . . . 17
	8. Security Considerations . . . . . . . . . . . . . . . . . . . 17		8. Security Considerations . . . . . . . . . . . . . . . . . . . 17
	9. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 17		9. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 17
	9.1. Message Extensions . . . . . . . . . . . . . . . . . . . . 18		9.1. Message Extensions . . . . . . . . . . . . . . . . . . . . 18
	10. References . . . . . . . . . . . . . . . . . . . . . . . . . . 18		10. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 18
	10.1. Normative References . . . . . . . . . . . . . . . . . . . 18		11. References . . . . . . . . . . . . . . . . . . . . . . . . . . 18
	10.2. Informative References . . . . . . . . . . . . . . . . . . 18		11.1. Normative References . . . . . . . . . . . . . . . . . . . 18
			11.2. Informative References . . . . . . . . . . . . . . . . . . 18
	Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 20		Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 20
	1. Introduction		1. Introduction
	REsource LOcation And Discovery (RELOAD) [I-D.ietf-p2psip-base] is a		REsource LOcation And Discovery (RELOAD) [I-D.ietf-p2psip-base] is a
	peer-to-peer signaling protocol that can be used to maintain an		peer-to-peer signaling protocol that can be used to maintain an
	overlay network, and to store data in and retrieve data from the		overlay network, and to store data in and retrieve data from the
	overlay. For interoperability reasons, RELOAD specifies one overlay		overlay. For interoperability reasons, RELOAD specifies one overlay
	algorithm, called chord-reload, that is mandatory to implement. This		algorithm, called chord-reload, that is mandatory to implement. This
	document extends the chord-reload algorithm by introducing self-		document extends the chord-reload algorithm by introducing self-
	skipping to change at page 17, line 37		skipping to change at page 17, line 37
	Probe requests are sent to obtain their network size, join rate,		Probe requests are sent to obtain their network size, join rate,
	and leave rate estimates. The default value is 4.		and leave rate estimates. The default value is 4.
	This new element is formally defined as follows:		This new element is formally defined as follows:
	namespace self-tuning = "urn:ietf:params:xml:ns:p2p:self-tuning"		namespace self-tuning = "urn:ietf:params:xml:ns:p2p:self-tuning"
	parameter &= element self-tuning:number-of-peers-to-probe { xsd:		parameter &= element self-tuning:number-of-peers-to-probe { xsd:
	unsignedInt }		unsignedInt }
	This namespace is added into the <mandatory-extension&rt; element in		This namespace is added into the <mandatory-extension> element in the
	the overlay configuration file.		overlay configuration file.
	8. Security Considerations		8. Security Considerations
	There are no new security considerations introduced in this document.		There are no new security considerations introduced in this document.
	The security considerations of RELOAD [I-D.ietf-p2psip-base] apply.		The security considerations of RELOAD [I-D.ietf-p2psip-base] apply.
	9. IANA Considerations		9. IANA Considerations
	9.1. Message Extensions		9.1. Message Extensions
	This document introduces one additional extension to the "RELOAD		This document introduces one additional extension to the "RELOAD
	Extensions" Registry:		Extensions" Registry:
	+------------------+-------+---------------+		+------------------+-------+---------------+
	| Extension Name | Code | Specification |		| Extension Name | Code | Specification |
	+------------------+-------+---------------+		+------------------+-------+---------------+
	| self_tuning_data | 1 | RFC-AAAA |		| self_tuning_data | 3 | RFC-AAAA |
	+------------------+-------+---------------+		+------------------+-------+---------------+
	The contents of the extension are defined in Section 6.5.		The contents of the extension are defined in Section 6.5.
	10. References		10. Acknowledgments
	10.1. Normative References		The authors would like to thank Jani Hautakorpi for his contributions
			to the document.
			11. References
			11.1. Normative References
	[I-D.ietf-mmusic-ice]		[I-D.ietf-mmusic-ice]
	Rosenberg, J., "Interactive Connectivity Establishment		Rosenberg, J., "Interactive Connectivity Establishment
	(ICE): A Protocol for Network Address Translator (NAT)		(ICE): A Protocol for Network Address Translator (NAT)
	Traversal for Offer/Answer Protocols",		Traversal for Offer/Answer Protocols",
	draft-ietf-mmusic-ice-19 (work in progress), October 2007.		draft-ietf-mmusic-ice-19 (work in progress), October 2007.
	[I-D.ietf-p2psip-base]		[I-D.ietf-p2psip-base]
	Jennings, C., Lowekamp, B., Rescorla, E., Baset, S., and		Jennings, C., Lowekamp, B., Rescorla, E., Baset, S., and
	H. Schulzrinne, "REsource LOcation And Discovery (RELOAD)		H. Schulzrinne, "REsource LOcation And Discovery (RELOAD)
	Base Protocol", draft-ietf-p2psip-base-24 (work in		Base Protocol", draft-ietf-p2psip-base-24 (work in
	progress), January 2013.		progress), January 2013.
	[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate		[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
	Requirement Levels", BCP 14, RFC 2119, March 1997.		Requirement Levels", BCP 14, RFC 2119, March 1997.
	[RFC5389] Rosenberg, J., Mahy, R., Matthews, P., and D. Wing,		[RFC5389] Rosenberg, J., Mahy, R., Matthews, P., and D. Wing,
	"Session Traversal Utilities for NAT (STUN)", RFC 5389,		"Session Traversal Utilities for NAT (STUN)", RFC 5389,
	October 2008.		October 2008.
	10.2. Informative References		11.2. Informative References
	[CAN] Ratnasamy, S., Francis, P., Handley, M., Karp, R., and S.		[CAN] Ratnasamy, S., Francis, P., Handley, M., Karp, R., and S.
	Schenker, "A scalable content-addressable network", In		Schenker, "A scalable content-addressable network", In
	Proc. of the 2001 Conference on Applications,		Proc. of the 2001 Conference on Applications,
	Technologies, Architectures and Protocols for Computer		Technologies, Architectures and Protocols for Computer
	Communications 2001, pp. 161.172.		Communications 2001, pp. 161.172.
	[Chord] Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.,		[Chord] Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.,
	Kaashoek, M., Dabek, F., and H. Balakrishnan, "Chord: A		Kaashoek, M., Dabek, F., and H. Balakrishnan, "Chord: A
	Scalable Peer-to-peer Lookup Service for Internet		Scalable Peer-to-peer Lookup Service for Internet
End of changes. 9 change blocks.
	12 lines changed or deleted		18 lines changed or added
This html diff was produced by rfcdiff 1.41. The latest version is available from http://tools.ietf.org/tools/rfcdiff/