idnits 2.17.1 draft-dreibholz-rserpool-score-18.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 lack a disclaimer for pre-RFC5378 work, but may have content which was first submitted before 10 November 2008. If you have contacted all the original authors and they are all willing to grant the BCP78 rights to the IETF Trust, then this is fine, and you can ignore this comment. If not, you may need to add the pre-RFC5378 disclaimer. (See the Legal Provisions document at https://trustee.ietf.org/license-info for more information.) -- The document date (January 09, 2016) is 3023 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-15 == Outdated reference: A later version (-33) exists of draft-dreibholz-rserpool-delay-14 == Outdated reference: A later version (-31) exists of draft-dreibholz-rserpool-enrp-takeover-12 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 12, 2016 Univ. of Applied Sciences Muenster 6 January 09, 2016 8 Reliable Server Pooling (RSerPool) Bakeoff Scoring 9 draft-dreibholz-rserpool-score-18.txt 11 Abstract 13 This memo describes some of the scoring to be used in the testing of 14 Reliable Server Pooling protocols ASAP and ENRP at upcoming bakeoffs. 16 Status of This Memo 18 This Internet-Draft is submitted in full conformance with the 19 provisions of BCP 78 and BCP 79. 21 Internet-Drafts are working documents of the Internet Engineering 22 Task Force (IETF). Note that other groups may also distribute 23 working documents as Internet-Drafts. The list of current Internet- 24 Drafts is at http://datatracker.ietf.org/drafts/current/. 26 Internet-Drafts are draft documents valid for a maximum of six months 27 and may be updated, replaced, or obsoleted by other documents at any 28 time. It is inappropriate to use Internet-Drafts as reference 29 material or to cite them other than as "work in progress." 31 This Internet-Draft will expire on July 12, 2016. 33 Copyright Notice 35 Copyright (c) 2016 IETF Trust and the persons identified as the 36 document authors. All rights reserved. 38 This document is subject to BCP 78 and the IETF Trust's Legal 39 Provisions Relating to IETF Documents 40 (http://trustee.ietf.org/license-info) in effect on the date of 41 publication of this document. Please review these documents 42 carefully, as they describe your rights and restrictions with respect 43 to this document. Code Components extracted from this document must 44 include Simplified BSD License text as described in Section 4.e of 45 the Trust Legal Provisions and are provided without warranty as 46 described in the Simplified BSD License. 48 Table of Contents 50 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 51 2. Aggregate Server Access Protocol . . . . . . . . . . . . . . 2 52 2.1. Pool Element Communication . . . . . . . . . . . . . . . 3 53 2.2. Pool User Communication . . . . . . . . . . . . . . . . . 3 54 2.3. ENRP Server Communication . . . . . . . . . . . . . . . . 4 55 3. Endpoint Handlespace Redundancy Protocol . . . . . . . . . . 4 56 3.1. Peer Management . . . . . . . . . . . . . . . . . . . . . 5 57 3.2. Update . . . . . . . . . . . . . . . . . . . . . . . . . 5 58 3.3. Synchronization . . . . . . . . . . . . . . . . . . . . . 6 59 3.4. Takeover . . . . . . . . . . . . . . . . . . . . . . . . 6 60 4. Bonus Points . . . . . . . . . . . . . . . . . . . . . . . . 7 61 5. Reference Implementation . . . . . . . . . . . . . . . . . . 7 62 6. Testbed Platform . . . . . . . . . . . . . . . . . . . . . . 7 63 7. Security Considerations . . . . . . . . . . . . . . . . . . . 7 64 8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 7 65 9. References . . . . . . . . . . . . . . . . . . . . . . . . . 8 66 9.1. Normative References . . . . . . . . . . . . . . . . . . 8 67 9.2. Informative References . . . . . . . . . . . . . . . . . 9 68 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 9 70 1. Introduction 72 This document will be used as a basis for point scoring at upcoming 73 RSerPool bakeoffs. Its purpose is similar to that described in 74 RFC1025. It is hoped that a clear definition of where and how to 75 score points will further the development of RSerPool. 77 Note that while attending a bakeoff no one else will score your 78 points for you. We trust that all implementations will faithfully 79 record their points that are received honestly. Note also that these 80 scores are NOT to be used for marketing purposes. They are for the 81 use of the implementations to know how well they are doing. The only 82 reporting that will be done is a basic summary to the Reliable Server 83 Pooling Working Group but please note that NO company or 84 implementation names will be attached. 86 2. Aggregate Server Access Protocol 88 The ASAP protocol and useful extensions are described in the follwing 89 documents: 91 o [RFC5352] 93 o [RFC5354] 95 o [I-D.dreibholz-rserpool-asap-hropt] 96 o [I-D.dreibholz-rserpool-delay] 98 2.1. Pool Element Communication 100 These points will be scored for EACH peer implementation that you 101 successfully communicate with. 103 o 2 Successful ASAP Registration Request of a PE in a pool using 104 Round Robin policy and handling of ASAP Registration Response. 106 o 2 Failing ASAP Registration Request of a PE requesting Least Used 107 policy in a pool using Round Robin policy and appropriate handling 108 of ASAP Registration Response (e.g. printing error message, but 109 not retrying registration). 111 o 2 Successful re-registration of a PE in a pool using Round Robin 112 policy. 114 o 2 Successful ASAP Deregistration Request of the PE from its pool 115 and handling of ASAP Deregistration Response. 117 o 2 Successful handling of ASAP Endpoint Keep-Alive without Home bit 118 set, i.e. answering with ASAP Endpoint Keep-Alive Ack. 120 o 5 Successful handling of ASAP Endpoint Keep-Alive with Home bit 121 set: respond with ASAP Endpoint Keep-Alive Ack and use new ENRP 122 server for re-registration. 124 o 5 Successful connection to and registration at an ENRP server 125 announcing itself via multicast ASAP Announces. 127 o 1 Successful registration into pool using Least Used policy. 129 o 1 Successful registration into pool using Weighted Round Robin 130 policy. 132 o 1 Successful registration into pool using Random policy. 134 o 1 Successful registration into pool using Weighted Random policy. 136 2.2. Pool User Communication 138 These points will be scored for EACH peer implementation that you 139 successfully communicate with. 141 o 5 Successful ASAP Handle Resolution in a pool using Round Robin 142 policy, correct handling of ASAP Handle Resolution Response. 144 o 2 Successful failure reporting using ASAP Endpoint Unreachable. 146 o 5 Successful connection to and handle resolution at ENRP server 147 announcing itself via multicast ASAP Announces. 149 o 1 Successful handle resolution in a pool using Least Used policy. 151 o 1 Successful handle resolution in a pool using Weighted Round 152 Robin policy. 154 o 1 Successful handle resolution in a pool using Random policy. 156 o 1 Successful handle resolution in a pool using Weighted Random 157 policy. 159 2.3. ENRP Server Communication 161 These points will be scored for EACH peer implementation that you 162 successfully communicate with. 164 o 2 Successful handling of an ASAP Registration Request into a pool 165 using Round Robin policy (ENRP server answers with successful ASAP 166 Registration Response). 168 o 2 Rejecting registration of a PE requesting Round Robin policy 169 into a pool using Least Used policy. 171 o 5 Rejecting registration of a PE with all addresses *not* being 172 part of the ASAP association. 174 o 5 Successful registration of a PE with some addresses *not* being 175 part of the ASAP association. The invalid addresses may *not* go 176 into the handlespace. 178 o 5 Successful handling of ASAP Endpoint Unreachable messages. The 179 ENRP server must remove the given PE after MAX-BAD-PE-REPORTS=3 180 unreachability reports. 182 o 2 Sending regular ASAP Endpoint Keep-Alives to its PEs. 184 o 2 Removing PE not answering to ASAP Endpoint Keep-Alive. 186 3. Endpoint Handlespace Redundancy Protocol 188 The ENRP protocol and useful extensions are described in the follwing 189 documents: 191 o [RFC5353] 192 o [RFC5354] 194 o [I-D.dreibholz-rserpool-enrp-takeover] 196 3.1. Peer Management 198 These points will be scored for EACH peer implementation that you 199 successfully communicate with. 201 o 2 Sending ENRP Presence to a new ENRP server. 203 o 2 Sending ENRP Presences in the interval given by PEER-HEARTBEAT- 204 CYCLE. 206 o 5 Requesting peer list from new ENRP server using ENRP Peer List 207 Request, handling ENRP Peer List Response and adding entries to 208 its own peer list. 210 o 2 Handling ENRP Peer List Request and replying with own peer list 211 in ENRP Peer List Response. 213 o 5 Requesting handlespace from new ENRP server using ENRP Handle 214 Table Request, handling ENRP Handle Table Response (without M-bit 215 set) and inserting entries into its own handlespace copy. 217 o 5 Requesting handlespace from new ENRP server using ENRP Handle 218 Table Request, handling ENRP Handle Table Response with M-bit set, 219 requesting more entries and inserting entries into its own 220 handlespace copy. 222 o 2 Handling ENRP Handle Table Request and replying own handlespace 223 in ENRP Handle Table Response (without M-bit). 225 o 10 Handling ENRP Handle Table Request and replying own handlespace 226 in ENRP Handle Table Response with M-bit set, remembering point to 227 continue from, responding next block of handlespace entries upon 228 following ENRP Handle Table Request, etc. until transfer of 229 handlespace data is complete. 231 o 5 Successful addition of new ENRP server announcing itself via 232 multicast ENRP Presence (including association establishment as 233 well as download of peer list and handlespace). 235 3.2. Update 237 These points will be scored for EACH peer implementation that you 238 successfully communicate with. 240 o 2 Handling an ENRP Handle Update adding a PE. 242 o 2 Handling an ENRP Handle Update updating a PE. The changes must 243 be entered into the local handlespace copy. 245 o 2 Handling an ENRP Handle Update removing a PE. 247 3.3. Synchronization 249 These points will be scored for EACH peer implementation that you 250 successfully communicate with. 252 o 5 Successful detection of different handlespace checksums upon 253 reception of ENRP Presence (due to additional PE), request of 254 Handle Table with W-bit set, integration of missing PE into local 255 handlespace copy and reporting the correct checksum in own ENRP 256 Presence. 258 o 5 Successful detection of different handlespace checksums upon 259 reception of ENRP Presence (due to out-of-date PE), request of 260 Handle Table with W-bit set, removal of PE from local handlespace 261 copy and reporting the correct checksum in own ENRP Presence. 263 o 10 Successful detection of different handlespace checksums upon 264 reception of ENRP Presence (due to multiple new and out-of-date PE 265 identities; size of PE identities is larger than maximum ENRP 266 message size), request of Handle Table with W-bit set, handling of 267 ENRP Handle Table Responses with M-bit set, removal of out-of-date 268 PEs, integration of new PEs into the local handlespace copy and 269 reporting correct checksum in own ENRP Presence. 271 3.4. Takeover 273 These points will be scored for EACH peer implementation that you 274 successfully communicate with. The setup contains your ENRP server 275 plus a set of peers running another implementation. 277 o 5 Successfully detecting the failure of a remote peer and 278 initiating a takeover procedure. 280 o 5 Acknowledging another peer's takeover and aborting own takeover 281 procedure. 283 o 10 Correctly handling a remote peer's Takeover Server message, 284 including ownership change for the remote peer's PEs. 286 o 10 Successfully taking over a dead peer, including ownership 287 change and informing the PEs taken over. 289 4. Bonus Points 291 You can also earn Bonus Points: 293 o 20 points for the ENRP server handling the largest number of PEs. 295 o 20 points for the ENRP server achieving the highest handle 296 resolution throughput for a pool containing 100 (should this be 297 larger?) PEs. 299 Please note that the whole period of the bakeoff is relevant. 301 5. Reference Implementation 303 The RSerPool reference implementation RSPLIB can be found at 304 [RSerPool-Website]. It supports the functionalities defined by 305 [RFC5351], [RFC5352], [RFC5353], [RFC5354] and [RFC5356] as well as 306 the options [I-D.dreibholz-rserpool-asap-hropt], 307 [I-D.dreibholz-rserpool-enrp-takeover] and 308 [I-D.dreibholz-rserpool-delay]. The MIB module is defined in 309 [RFC5525]. An introduction to this implementation is provided in 310 [Dre2006]. 312 6. Testbed Platform 314 A large-scale and realistic Internet testbed platform with support 315 for the multi-homing feature of the underlying SCTP protocol is 316 NorNet. A description of NorNet is provided in [PAMS2013-NorNet], 317 some further information can be found on the project website 318 [NorNet-Website]. 320 7. Security Considerations 322 This document does only describe test scenarios and therefore does 323 not introduce any new security issues. 325 For security considerations of the RSerPool protocols see [RFC3237], 326 [RFC5351], [RFC5352], [RFC5353], [RFC5354]. [RFC5356] and in 327 particular [RFC5355]. 329 8. IANA Considerations 331 This document introduces no additional considerations for IANA. 333 9. References 335 9.1. Normative References 337 [RFC3237] Tuexen, M., Xie, Q., Stewart, R., Shore, M., Ong, L., 338 Loughney, J., and M. Stillman, "Requirements for Reliable 339 Server Pooling", RFC 3237, January 2002. 341 [RFC5351] Lei, P., Ong, L., Tuexen, M., and T. Dreibholz, "An 342 Overview of Reliable Server Pooling Protocols", RFC 5351, 343 September 2008. 345 [RFC5352] Stewart, R., Xie, Q., Stillman, M., and M. Tuexen, 346 "Aggregate Server Access Protocol (ASAP)", RFC 5352, 347 September 2008. 349 [RFC5353] Xie, Q., Stewart, R., Stillman, M., Tuexen, M., and A. 350 Silverton, "Endpoint Handlespace Redundancy Protocol 351 (ENRP)", RFC 5353, September 2008. 353 [RFC5354] Stewart, R., Xie, Q., Stillman, M., and M. Tuexen, 354 "Aggregate Server Access Protocol (ASAP) and Endpoint 355 Handlespace Redundancy Protocol (ENRP) Parameters", RFC 356 5354, September 2008. 358 [RFC5355] Stillman, M., Gopal, R., Guttman, E., Sengodan, S., and M. 359 Holdrege, "Threats Introduced by Reliable Server Pooling 360 (RSerPool) and Requirements for Security in Response to 361 Threats", RFC 5355, September 2008. 363 [RFC5356] Dreibholz, T. and M. Tuexen, "Reliable Server Pooling 364 Policies", RFC 5356, September 2008. 366 [RFC5525] Dreibholz, T. and J. Mulik, "Reliable Server Pooling MIB 367 Module Definition", RFC 5525, April 2009. 369 [I-D.dreibholz-rserpool-asap-hropt] 370 Dreibholz, T., "Handle Resolution Option for ASAP", draft- 371 dreibholz-rserpool-asap-hropt-15 (work in progress), July 372 2014. 374 [I-D.dreibholz-rserpool-delay] 375 Dreibholz, T. and X. Zhou, "Definition of a Delay 376 Measurement Infrastructure and Delay-Sensitive Least-Used 377 Policy for Reliable Server Pooling", draft-dreibholz- 378 rserpool-delay-14 (work in progress), July 2014. 380 [I-D.dreibholz-rserpool-enrp-takeover] 381 Dreibholz, T. and X. Zhou, "Takeover Suggestion Flag for 382 the ENRP Handle Update Message", draft-dreibholz-rserpool- 383 enrp-takeover-12 (work in progress), July 2014. 385 9.2. Informative References 387 [Dre2006] Dreibholz, T., "Reliable Server Pooling - Evaluation, 388 Optimization and Extension of a Novel IETF Architecture", 389 March 2007, . 393 [PAMS2013-NorNet] 394 Dreibholz, T. and E. Gran, "Design and Implementation of 395 the NorNet Core Research Testbed for Multi-Homed Systems", 396 Proceedings of the 3nd International Workshop on Protocols 397 and Applications with Multi-Homing Support (PAMS) Pages 398 1094-1100, ISBN 978-0-7695-4952-1, DOI 10.1109/ 399 WAINA.2013.71, March 2013, 400 . 404 [RSerPool-Website] 405 Dreibholz, T., "Thomas Dreibholz's RSerPool Page", Online: 406 http://www.iem.uni-due.de/~dreibh/rserpool/, 2016, 407 . 409 [NorNet-Website] 410 Dreibholz, T., "NorNet -- A Real-World, Large-Scale Multi- 411 Homing Testbed", Online: https://www.nntb.no/, 2016, 412 . 414 Authors' Addresses 416 Thomas Dreibholz 417 Simula Research Laboratory, Network Systems Group 418 Martin Linges vei 17 419 1364 Fornebu, Akershus 420 Norway 422 Phone: +47-6782-8200 423 Fax: +47-6782-8201 424 Email: dreibh@simula.no 425 URI: http://www.iem.uni-due.de/~dreibh/ 426 Michael Tuexen 427 University of Applied Sciences Muenster 428 Stegerwaldstrasse 39 429 48565 Steinfurt, Nordrhein-Westfalen 430 Germany 432 Email: tuexen@fh-muenster.de