idnits 2.17.1 draft-dreibholz-rserpool-score-12.txt: Checking boilerplate required by RFC 5378 and the IETF Trust (see https://trustee.ietf.org/license-info): ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/1id-guidelines.txt: ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/checklist : ---------------------------------------------------------------------------- No issues found here. Miscellaneous warnings: ---------------------------------------------------------------------------- == The copyright year in the IETF Trust and authors Copyright Line does not match the current year -- The document seems to contain a disclaimer for pre-RFC5378 work, and may have content which was first submitted before 10 November 2008. The disclaimer is necessary when there are original authors that you have been unable to contact, or if some do not wish to grant the BCP78 rights to the IETF Trust. If you are able to get all authors (current and original) to grant those rights, you can and should remove the disclaimer; otherwise, the disclaimer is needed and you can ignore this comment. (See the Legal Provisions document at https://trustee.ietf.org/license-info for more information.) -- The document date (January 2, 2013) is 4131 days in the past. Is this intentional? Checking references for intended status: Informational ---------------------------------------------------------------------------- == Outdated reference: A later version (-34) exists of draft-dreibholz-rserpool-asap-hropt-11 == Outdated reference: A later version (-33) exists of draft-dreibholz-rserpool-delay-10 == Outdated reference: A later version (-31) exists of draft-dreibholz-rserpool-enrp-takeover-08 Summary: 0 errors (**), 0 flaws (~~), 4 warnings (==), 2 comments (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 2 Network Working Group T. Dreibholz 3 Internet-Draft Simula Research Laboratory 4 Intended status: Informational M. Tuexen 5 Expires: July 6, 2013 Univ. of Applied Sciences 6 Muenster 7 January 2, 2013 9 Reliable Server Pooling (RSerPool) Bakeoff Scoring 10 draft-dreibholz-rserpool-score-12.txt 12 Abstract 14 This memo describes some of the scoring to be used in the testing of 15 Reliable Server Pooling protocols ASAP and ENRP at upcoming bakeoffs. 17 Status of this Memo 19 This Internet-Draft is submitted in full conformance with the 20 provisions of BCP 78 and BCP 79. 22 Internet-Drafts are working documents of the Internet Engineering 23 Task Force (IETF). Note that other groups may also distribute 24 working documents as Internet-Drafts. The list of current Internet- 25 Drafts is at http://datatracker.ietf.org/drafts/current/. 27 Internet-Drafts are draft documents valid for a maximum of six months 28 and may be updated, replaced, or obsoleted by other documents at any 29 time. It is inappropriate to use Internet-Drafts as reference 30 material or to cite them other than as "work in progress." 32 This Internet-Draft will expire on July 6, 2013. 34 Copyright Notice 36 Copyright (c) 2013 IETF Trust and the persons identified as the 37 document authors. All rights reserved. 39 This document is subject to BCP 78 and the IETF Trust's Legal 40 Provisions Relating to IETF Documents 41 (http://trustee.ietf.org/license-info) in effect on the date of 42 publication of this document. Please review these documents 43 carefully, as they describe your rights and restrictions with respect 44 to this document. Code Components extracted from this document must 45 include Simplified BSD License text as described in Section 4.e of 46 the Trust Legal Provisions and are provided without warranty as 47 described in the Simplified BSD License. 49 This document may contain material from IETF Documents or IETF 50 Contributions published or made publicly available before November 51 10, 2008. The person(s) controlling the copyright in some of this 52 material may not have granted the IETF Trust the right to allow 53 modifications of such material outside the IETF Standards Process. 54 Without obtaining an adequate license from the person(s) controlling 55 the copyright in such materials, this document may not be modified 56 outside the IETF Standards Process, and derivative works of it may 57 not be created outside the IETF Standards Process, except to format 58 it for publication as an RFC or to translate it into languages other 59 than English. 61 Table of Contents 63 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3 64 2. Aggregate Server Access Protocol . . . . . . . . . . . . . . . 3 65 2.1. Pool Element Communication . . . . . . . . . . . . . . . . 3 66 2.2. Pool User Communication . . . . . . . . . . . . . . . . . 4 67 2.3. ENRP Server Communication . . . . . . . . . . . . . . . . 4 68 3. Endpoint Handlespace Redundancy Protocol . . . . . . . . . . . 5 69 3.1. Peer Management . . . . . . . . . . . . . . . . . . . . . 5 70 3.2. Update . . . . . . . . . . . . . . . . . . . . . . . . . . 6 71 3.3. Synchronization . . . . . . . . . . . . . . . . . . . . . 6 72 3.4. Takeover . . . . . . . . . . . . . . . . . . . . . . . . . 7 73 4. Bonus Points . . . . . . . . . . . . . . . . . . . . . . . . . 7 74 5. Reference Implementation . . . . . . . . . . . . . . . . . . . 7 75 6. Testbed Platform . . . . . . . . . . . . . . . . . . . . . . . 8 76 7. Security Considerations . . . . . . . . . . . . . . . . . . . 8 77 8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 8 78 9. References . . . . . . . . . . . . . . . . . . . . . . . . . . 8 79 9.1. Normative References . . . . . . . . . . . . . . . . . . . 8 80 9.2. Informative References . . . . . . . . . . . . . . . . . . 9 81 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 10 83 1. Introduction 85 This document will be used as a basis for point scoring at upcoming 86 RSerPool bakeoffs. Its purpose is similar to that described in 87 RFC1025. It is hoped that a clear definition of where and how to 88 score points will further the development of RSerPool. 90 Note that while attending a bakeoff no one else will score your 91 points for you. We trust that all implementations will faithfully 92 record their points that are received honestly. Note also that these 93 scores are NOT to be used for marketing purposes. They are for the 94 use of the implementations to know how well they are doing. The only 95 reporting that will be done is a basic summary to the Reliable Server 96 Pooling Working Group but please note that NO company or 97 implementation names will be attached. 99 2. Aggregate Server Access Protocol 101 The ASAP protocol and useful extensions are described in the follwing 102 documents: 104 o [RFC5352] 106 o [RFC5354] 108 o [I-D.dreibholz-rserpool-asap-hropt] 110 o [I-D.dreibholz-rserpool-delay] 112 2.1. Pool Element Communication 114 These points will be scored for EACH peer implementation that you 115 successfully communicate with. 117 o 2 Successful ASAP Registration Request of a PE in a pool using 118 Round Robin policy and handling of ASAP Registration Response. 120 o 2 Failing ASAP Registration Request of a PE requesting Least Used 121 policy in a pool using Round Robin policy and appropriate handling 122 of ASAP Registration Response (e.g. printing error message, but 123 not retrying registration). 125 o 2 Successful re-registration of a PE in a pool using Round Robin 126 policy. 128 o 2 Successful ASAP Deregistration Request of the PE from its pool 129 and handling of ASAP Deregistration Response. 131 o 2 Successful handling of ASAP Endpoint Keep-Alive without Home bit 132 set, i.e. answering with ASAP Endpoint Keep-Alive Ack. 134 o 5 Successful handling of ASAP Endpoint Keep-Alive with Home bit 135 set: respond with ASAP Endpoint Keep-Alive Ack and use new ENRP 136 server for re-registration. 138 o 5 Successful connection to and registration at an ENRP server 139 announcing itself via multicast ASAP Announces. 141 o 1 Successful registration into pool using Least Used policy. 143 o 1 Successful registration into pool using Weighted Round Robin 144 policy. 146 o 1 Successful registration into pool using Random policy. 148 o 1 Successful registration into pool using Weighted Random policy. 150 2.2. Pool User Communication 152 These points will be scored for EACH peer implementation that you 153 successfully communicate with. 155 o 5 Successful ASAP Handle Resolution in a pool using Round Robin 156 policy, correct handling of ASAP Handle Resolution Response. 158 o 2 Successful failure reporting using ASAP Endpoint Unreachable. 160 o 5 Successful connection to and handle resolution at ENRP server 161 announcing itself via multicast ASAP Announces. 163 o 1 Successful handle resolution in a pool using Least Used policy. 165 o 1 Successful handle resolution in a pool using Weighted Round 166 Robin policy. 168 o 1 Successful handle resolution in a pool using Random policy. 170 o 1 Successful handle resolution in a pool using Weighted Random 171 policy. 173 2.3. ENRP Server Communication 175 These points will be scored for EACH peer implementation that you 176 successfully communicate with. 178 o 2 Successful handling of an ASAP Registration Request into a pool 179 using Round Robin policy (ENRP server answers with successful ASAP 180 Registration Response). 182 o 2 Rejecting registration of a PE requesting Round Robin policy 183 into a pool using Least Used policy. 185 o 5 Rejecting registration of a PE with all addresses *not* being 186 part of the ASAP association. 188 o 5 Successful registration of a PE with some addresses *not* being 189 part of the ASAP association. The invalid addresses may *not* go 190 into the handlespace. 192 o 5 Successful handling of ASAP Endpoint Unreachable messages. The 193 ENRP server must remove the given PE after MAX-BAD-PE-REPORTS=3 194 unreachability reports. 196 o 2 Sending regular ASAP Endpoint Keep-Alives to its PEs. 198 o 2 Removing PE not answering to ASAP Endpoint Keep-Alive. 200 3. Endpoint Handlespace Redundancy Protocol 202 The ENRP protocol and useful extensions are described in the follwing 203 documents: 205 o [RFC5353] 207 o [RFC5354] 209 o [I-D.dreibholz-rserpool-enrp-takeover] 211 3.1. Peer Management 213 These points will be scored for EACH peer implementation that you 214 successfully communicate with. 216 o 2 Sending ENRP Presence to a new ENRP server. 218 o 2 Sending ENRP Presences in the interval given by PEER-HEARTBEAT- 219 CYCLE. 221 o 5 Requesting peer list from new ENRP server using ENRP Peer List 222 Request, handling ENRP Peer List Response and adding entries to 223 its own peer list. 225 o 2 Handling ENRP Peer List Request and replying with own peer list 226 in ENRP Peer List Response. 228 o 5 Requesting handlespace from new ENRP server using ENRP Handle 229 Table Request, handling ENRP Handle Table Response (without M-bit 230 set) and inserting entries into its own handlespace copy. 232 o 5 Requesting handlespace from new ENRP server using ENRP Handle 233 Table Request, handling ENRP Handle Table Response with M-bit set, 234 requesting more entries and inserting entries into its own 235 handlespace copy. 237 o 2 Handling ENRP Handle Table Request and replying own handlespace 238 in ENRP Handle Table Response (without M-bit). 240 o 10 Handling ENRP Handle Table Request and replying own handlespace 241 in ENRP Handle Table Response with M-bit set, remembering point to 242 continue from, responding next block of handlespace entries upon 243 following ENRP Handle Table Request, etc. until transfer of 244 handlespace data is complete. 246 o 5 Successful addition of new ENRP server announcing itself via 247 multicast ENRP Presence (including association establishment as 248 well as download of peer list and handlespace). 250 3.2. Update 252 These points will be scored for EACH peer implementation that you 253 successfully communicate with. 255 o 2 Handling an ENRP Handle Update adding a PE. 257 o 2 Handling an ENRP Handle Update updating a PE. The changes must 258 be entered into the local handlespace copy. 260 o 2 Handling an ENRP Handle Update removing a PE. 262 3.3. Synchronization 264 These points will be scored for EACH peer implementation that you 265 successfully communicate with. 267 o 5 Successful detection of different handlespace checksums upon 268 reception of ENRP Presence (due to additional PE), request of 269 Handle Table with W-bit set, integration of missing PE into local 270 handlespace copy and reporting the correct checksum in own ENRP 271 Presence. 273 o 5 Successful detection of different handlespace checksums upon 274 reception of ENRP Presence (due to out-of-date PE), request of 275 Handle Table with W-bit set, removal of PE from local handlespace 276 copy and reporting the correct checksum in own ENRP Presence. 278 o 10 Successful detection of different handlespace checksums upon 279 reception of ENRP Presence (due to multiple new and out-of-date PE 280 identities; size of PE identities is larger than maximum ENRP 281 message size), request of Handle Table with W-bit set, handling of 282 ENRP Handle Table Responses with M-bit set, removal of out-of-date 283 PEs, integration of new PEs into the local handlespace copy and 284 reporting correct checksum in own ENRP Presence. 286 3.4. Takeover 288 These points will be scored for EACH peer implementation that you 289 successfully communicate with. The setup contains your ENRP server 290 plus a set of peers running another implementation. 292 o 5 Successfully detecting the failure of a remote peer and 293 initiating a takeover procedure. 295 o 5 Acknowledging another peer's takeover and aborting own takeover 296 procedure. 298 o 10 Correctly handling a remote peer's Takeover Server message, 299 including ownership change for the remote peer's PEs. 301 o 10 Successfully taking over a dead peer, including ownership 302 change and informing the PEs taken over. 304 4. Bonus Points 306 You can also earn Bonus Points: 308 o 20 points for the ENRP server handling the largest number of PEs. 310 o 20 points for the ENRP server achieving the highest handle 311 resolution throughput for a pool containing 100 (should this be 312 larger?) PEs. 314 Please note that the whole period of the bakeoff is relevant. 316 5. Reference Implementation 318 The RSerPool reference implementation RSPLIB can be found at 320 [RSerPoolPage]. It supports the functionalities defined by 321 [RFC5351], [RFC5352], [RFC5353], [RFC5354] and [RFC5356] as well as 322 the options [I-D.dreibholz-rserpool-asap-hropt], 323 [I-D.dreibholz-rserpool-enrp-takeover] and 324 [I-D.dreibholz-rserpool-delay]. The MIB module is defined in 325 [RFC5525]. An introduction to this implementation is provided in 326 [Dre2006]. 328 6. Testbed Platform 330 A large-scale and realistic Internet testbed platform with support 331 for the multi-homing feature of the underlying SCTP protocol is 332 NorNet. A description of NorNet is provided in [PAMS2013-NorNet], 333 some further information can be found on the project website 334 [NorNet-Website]. 336 7. Security Considerations 338 This document does only describe test scenarios and therefore does 339 not introduce any new security issues. 341 For security considerations of the RSerPool protocols see [RFC3237], 342 [RFC5351], [RFC5352], [RFC5353], [RFC5354]. [RFC5356] and in 343 particular [RFC5355]. 345 8. IANA Considerations 347 This document introduces no additional considerations for IANA. 349 9. References 351 9.1. Normative References 353 [RFC3237] Tuexen, M., Xie, Q., Stewart, R., Shore, M., Ong, L., 354 Loughney, J., and M. Stillman, "Requirements for Reliable 355 Server Pooling", RFC 3237, January 2002. 357 [RFC5351] Lei, P., Ong, L., Tuexen, M., and T. Dreibholz, "An 358 Overview of Reliable Server Pooling Protocols", RFC 5351, 359 September 2008. 361 [RFC5352] Stewart, R., Xie, Q., Stillman, M., and M. Tuexen, 362 "Aggregate Server Access Protocol (ASAP)", RFC 5352, 363 September 2008. 365 [RFC5353] Xie, Q., Stewart, R., Stillman, M., Tuexen, M., and A. 366 Silverton, "Endpoint Handlespace Redundancy Protocol 367 (ENRP)", RFC 5353, September 2008. 369 [RFC5354] Stewart, R., Xie, Q., Stillman, M., and M. Tuexen, 370 "Aggregate Server Access Protocol (ASAP) and Endpoint 371 Handlespace Redundancy Protocol (ENRP) Parameters", 372 RFC 5354, September 2008. 374 [RFC5355] Stillman, M., Gopal, R., Guttman, E., Sengodan, S., and M. 375 Holdrege, "Threats Introduced by Reliable Server Pooling 376 (RSerPool) and Requirements for Security in Response to 377 Threats", RFC 5355, September 2008. 379 [RFC5356] Dreibholz, T. and M. Tuexen, "Reliable Server Pooling 380 Policies", RFC 5356, September 2008. 382 [RFC5525] Dreibholz, T. and J. Mulik, "Reliable Server Pooling MIB 383 Module Definition", RFC 5525, April 2009. 385 [I-D.dreibholz-rserpool-asap-hropt] 386 Dreibholz, T., "Handle Resolution Option for ASAP", 387 draft-dreibholz-rserpool-asap-hropt-11 (work in progress), 388 July 2012. 390 [I-D.dreibholz-rserpool-delay] 391 Dreibholz, T. and X. Zhou, "Definition of a Delay 392 Measurement Infrastructure and Delay-Sensitive Least-Used 393 Policy for Reliable Server Pooling", 394 draft-dreibholz-rserpool-delay-10 (work in progress), 395 July 2012. 397 [I-D.dreibholz-rserpool-enrp-takeover] 398 Dreibholz, T. and X. Zhou, "Takeover Suggestion Flag for 399 the ENRP Handle Update Message", 400 draft-dreibholz-rserpool-enrp-takeover-08 (work in 401 progress), July 2012. 403 9.2. Informative References 405 [Dre2006] Dreibholz, T., "Reliable Server Pooling - Evaluation, 406 Optimization and Extension of a Novel IETF Architecture", 407 March 2007. 409 [RSerPoolPage] 410 Dreibholz, T., "Thomas Dreibholz's RSerPool Page", 2012. 412 [NorNet-Website] 413 Xiang, J., "NorNet -- A Programmable Testbed for 414 Measurements and Experimental Networking Research", 2013. 416 [PAMS2013-NorNet] 417 Dreibholz, T. and E. Gran, "Design and Implementation of 418 the NorNet Core Research Testbed for Multi-Homed Systems", 419 Proceedings of the 3nd International Workshop on Protocols 420 and Applications with Multi-Homing Support (PAMS) , 421 March 2013. 423 Authors' Addresses 425 Thomas Dreibholz 426 Simula Research Laboratory, Network Systems Group 427 Martin Linges vei 17 428 1364 Fornebu, Akershus 429 Norway 431 Phone: +47-6782-8200 432 Fax: +47-6782-8201 433 Email: dreibh@simula.no 434 URI: http://www.iem.uni-due.de/~dreibh/ 436 Michael Tuexen 437 University of Applied Sciences Muenster 438 Stegerwaldstrasse 39 439 48565 Steinfurt, Nordrhein-Westfalen 440 Germany 442 Email: tuexen@fh-muenster.de