draft-ietf-ippm-owdp-06.txt   draft-ietf-ippm-owdp-07.txt 
Network Working Group Stanislav Shalunov Network Working Group Stanislav Shalunov
Internet Draft Benjamin Teitelbaum Internet Draft Benjamin Teitelbaum
Expiration Date: November 2003 Anatoly Karp Expiration Date: April 2004 Anatoly Karp
Jeff W. Boote Jeff W. Boote
Matthew J. Zekauskas Matthew J. Zekauskas
Internet2 Internet2
May 2003 October 2003
A One-way Active Measurement Protocol (OWAMP) A One-way Active Measurement Protocol (OWAMP)
<draft-ietf-ippm-owdp-06.txt> <draft-ietf-ippm-owdp-07.txt>
1. Status of this Memo 1. Status of this Memo
This document is an Internet-Draft and is in full conformance with This document is an Internet-Draft and is in full conformance with
all provisions of Section 10 of RFC2026. all provisions of Section 10 of RFC2026.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as Internet- other groups may also distribute working documents as Internet-
Drafts. Drafts.
skipping to change at page 31, line 9 skipping to change at page 31, line 9
9. IANA Considerations 9. IANA Considerations
IANA is requested to allocate a well-known TCP port number for OWAMP- IANA is requested to allocate a well-known TCP port number for OWAMP-
Control part of the OWAMP protocol. Control part of the OWAMP protocol.
10. Internationalization Considerations 10. Internationalization Considerations
The protocol does not carry any information in a natural language. The protocol does not carry any information in a natural language.
11. Appendix: Sample Implementation of Exponential Deviate Computation 11. Appendix A: Sample Implementation of Exponential Deviate Computation
/* /*
** Example usage: generate a stream of exponential (mean 1) ** Example usage: generate a stream of exponential (mean 1)
** random quantities (ignoring error checking during initialization). ** random quantities (ignoring error checking during initialization).
** If a variate with some mean mu other than 1 is desired, the output ** If a variate with some mean mu other than 1 is desired, the output
** of this algorithm can be multiplied by mu according to the rules ** of this algorithm can be multiplied by mu according to the rules
** of arithmetic we described. ** of arithmetic we described.
** Assume that a 16-octet 'seed' has been initialized ** Assume that a 16-octet 'seed' has been initialized
** (as the shared secret in OWAMP, for example) ** (as the shared secret in OWAMP, for example)
skipping to change at page 36, line 8 skipping to change at page 36, line 8
V = OWPunif_rand64(next); V = OWPunif_rand64(next);
for (i = 2; i <= k; i++){ for (i = 2; i <= k; i++){
tmp = OWPunif_rand64(next); tmp = OWPunif_rand64(next);
if (tmp < V) if (tmp < V)
V = tmp; V = tmp;
} }
/* Step S4. Return (j+V)*ln2 */ /* Step S4. Return (j+V)*ln2 */
return OWPnum64_mul(OWPnum64_add(J, V), LN2); return OWPnum64_mul(OWPnum64_add(J, V), LN2);
} }
12. Normative References 12. Appendix B: Test Vectors for Exponential Deviates
It is important that the test schedules generated by different
implementations from identical inputs be identical. The non-trivial
part is the generation of pseudo-random exponentially distributed
deviates. To aid implementors in verifying interoperability, several
test vectors are provided. For each of the four given 128-bit values
of SID represented as hexadecimal numbers, 1,000,000 exponentially
distributed 64-bit deviates are generated as described above. As
they are generated, they are all added to each other. The sum of all
1,000,000 deviates is given as a hexadecimal number for each SID. An
implementation MUST produce exactly these hexadecimal numbers. To
aid in the verification of the conversion of these numbers to values
of delay in seconds, approximate values are given (assuming
lambda=1). An implementation SHOULD produce delay values in seconds
that are close to the ones given below.
SID = 0x2872979303ab47eeac028dab3829dab2
SUM[1000000] = 0x000f4479bd317381 (1000569.739036 seconds)
SID = 0x0102030405060708090a0b0c0d0e0f00
SUM[1000000] = 0x000f433686466a62 (1000246.524512 seconds)
SID = 0xdeadbeefdeadbeefdeadbeefdeadbeef
SUM[1000000] = 0x000f416c8884d2d3 (999788.533277 seconds)
SID = 0xfeed0feed1feed2feed3feed4feed5ab
SUM[1000000] = 0x000f3f0b4b416ec8 (999179.293967 seconds)
13. Normative References
[AES] Advanced Encryption Standard (AES), [AES] Advanced Encryption Standard (AES),
http://csrc.nist.gov/encryption/aes/ http://csrc.nist.gov/encryption/aes/
[RFC1305] D. Mills, `Network Time Protocol (Version 3) Specification, [RFC1305] D. Mills, `Network Time Protocol (Version 3) Specification,
Implementation and Analysis', RFC 1305, March 1992. Implementation and Analysis', RFC 1305, March 1992.
[RFC1321] R. Rivest, `The MD5 Message-Digest Algorithm', RFC 1321, [RFC1321] R. Rivest, `The MD5 Message-Digest Algorithm', RFC 1321,
April 1992. April 1992.
skipping to change at page 36, line 41 skipping to change at page 37, line 25
[RFC2679] G. Almes, S. Kalidindi, and M. Zekauskas, `A One-way Delay [RFC2679] G. Almes, S. Kalidindi, and M. Zekauskas, `A One-way Delay
Metric for IPPM', RFC 2679, September 1999. Metric for IPPM', RFC 2679, September 1999.
[RFC2680] G. Almes, S. Kalidindi, and M. Zekauskas, `A One-way Packet [RFC2680] G. Almes, S. Kalidindi, and M. Zekauskas, `A One-way Packet
Loss Metric for IPPM', RFC 2680, September 1999. Loss Metric for IPPM', RFC 2680, September 1999.
[RFC2836] S. Brim, B. Carpenter, F. Le Faucheur, `Per Hop Behavior [RFC2836] S. Brim, B. Carpenter, F. Le Faucheur, `Per Hop Behavior
Identification Codes', RFC 2836, May 2000. Identification Codes', RFC 2836, May 2000.
13. Informative References 14. Informative References
[ZIGG] G. Marsaglia, M. Sibuya and J.H. Ahrens, Communications of [ZIGG] G. Marsaglia, M. Sibuya and J.H. Ahrens, Communications of
ACM, 15 (1972), 876-877 ACM, 15 (1972), 876-877
[KNUTH] D. Knuth, The Art of Computer Programming, vol.2, 3rd [KNUTH] D. Knuth, The Art of Computer Programming, vol.2, 3rd
edition, 1998 edition, 1998
[RIJN] Reference ANSI C implementation of Rijndael [RIJN] Reference ANSI C implementation of Rijndael
http://www.esat.kuleuven.ac.be/~rijmen/rijndael/rijndaelref.zip http://www.esat.kuleuven.ac.be/~rijmen/rijndael/rijndaelref.zip
[RIPE] RIPE NCC Test-Traffic Measurements home, [RIPE] RIPE NCC Test-Traffic Measurements home,
http://www.ripe.net/test-traffic/. http://www.ripe.net/test-traffic/.
[RIPE-NLUUG] H. Uijterwaal and O. Kolkman, `Internet Delay [RIPE-NLUUG] H. Uijterwaal and O. Kolkman, `Internet Delay
Measurements Using Test-Traffic', Spring 1998 Dutch Unix User Measurements Using Test-Traffic', Spring 1998 Dutch Unix User
Group Meeting, http://www.ripe.net/test- Group Meeting, http://www.ripe.net/test-
traffic/Talks/9805_nluug.ps.gz. traffic/Talks/9805_nluug.ps.gz.
skipping to change at page 37, line 22 skipping to change at page 38, line 5
Group Meeting, http://www.ripe.net/test- Group Meeting, http://www.ripe.net/test-
traffic/Talks/9805_nluug.ps.gz. traffic/Talks/9805_nluug.ps.gz.
[SURVEYOR] Surveyor Home Page, http://www.advanced.org/surveyor/. [SURVEYOR] Surveyor Home Page, http://www.advanced.org/surveyor/.
[SURVEYOR-INET] S. Kalidindi and M. Zekauskas, `Surveyor: An [SURVEYOR-INET] S. Kalidindi and M. Zekauskas, `Surveyor: An
Infrastructure for Network Performance Measurements', Infrastructure for Network Performance Measurements',
Proceedings of INET'99, June 1999. Proceedings of INET'99, June 1999.
http://www.isoc.org/inet99/proceedings/4h/4h_2.htm http://www.isoc.org/inet99/proceedings/4h/4h_2.htm
14. Authors' Addresses 15. Authors' Addresses
Stanislav Shalunov <shalunov@internet2.edu> Stanislav Shalunov <shalunov@internet2.edu>
Benjamin Teitelbaum <ben@internet2.edu> Benjamin Teitelbaum <ben@internet2.edu>
Anatoly Karp <karp@math.wisc.edu> Anatoly Karp <karp@math.wisc.edu>
Jeff Boote <boote@internet2.edu> Jeff Boote <boote@internet2.edu>
Matthew J. Zekauskas <matt@internet2.edu> Matthew J. Zekauskas <matt@internet2.edu>
Expiration date: November 2003 Expiration date: April 2004
 End of changes. 

This html diff was produced by rfcdiff 1.23, available from http://www.levkowetz.com/ietf/tools/rfcdiff/