idnits 2.17.1 draft-dreibholz-rserpool-score-04.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 7, 2009) is 5581 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-03 == Outdated reference: A later version (-31) exists of draft-dreibholz-rserpool-enrp-takeover-00 == Outdated reference: A later version (-33) exists of draft-dreibholz-rserpool-delay-02 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 University of Duisburg-Essen 4 Intended status: Informational M. Tuexen 5 Expires: July 11, 2009 Univ. of Applied Sciences Muenster 6 January 7, 2009 8 Reliable Server Pooling (RSerPool) Bakeoff Scoring 9 draft-dreibholz-rserpool-score-04.txt 11 Status of this Memo 13 This Internet-Draft is submitted to IETF in full conformance with the 14 provisions of BCP 78 and BCP 79. 16 Internet-Drafts are working documents of the Internet Engineering 17 Task Force (IETF), its areas, and its working groups. Note that 18 other groups may also distribute working documents as Internet- 19 Drafts. 21 Internet-Drafts are draft documents valid for a maximum of six months 22 and may be updated, replaced, or obsoleted by other documents at any 23 time. It is inappropriate to use Internet-Drafts as reference 24 material or to cite them other than as "work in progress." 26 The list of current Internet-Drafts can be accessed at 27 http://www.ietf.org/ietf/1id-abstracts.txt. 29 The list of Internet-Draft Shadow Directories can be accessed at 30 http://www.ietf.org/shadow.html. 32 This Internet-Draft will expire on July 11, 2009. 34 Copyright Notice 36 Copyright (c) 2009 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. 46 Abstract 48 This memo describes some of the scoring to be used in the testing of 49 Reliable Server Pooling protocols ASAP and ENRP at upcoming bakeoffs. 51 Table of Contents 53 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3 54 2. Aggregate Server Access Protocol . . . . . . . . . . . . . . . 3 55 2.1. Pool Element Communication . . . . . . . . . . . . . . . . 3 56 2.2. Pool User Communication . . . . . . . . . . . . . . . . . . 4 57 2.3. ENRP Server Communication . . . . . . . . . . . . . . . . . 4 58 3. Endpoint Handlespace Redundancy Protocol . . . . . . . . . . . 5 59 3.1. Peer Management . . . . . . . . . . . . . . . . . . . . . . 5 60 3.2. Update . . . . . . . . . . . . . . . . . . . . . . . . . . 6 61 3.3. Synchronization . . . . . . . . . . . . . . . . . . . . . . 6 62 3.4. Takeover . . . . . . . . . . . . . . . . . . . . . . . . . 7 63 4. Bonus Points . . . . . . . . . . . . . . . . . . . . . . . . . 7 64 5. Reference Implementation . . . . . . . . . . . . . . . . . . . 7 65 6. Security Considerations . . . . . . . . . . . . . . . . . . . . 8 66 7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . . 8 67 8. References . . . . . . . . . . . . . . . . . . . . . . . . . . 8 68 8.1. Normative References . . . . . . . . . . . . . . . . . . . 8 69 8.2. Informative References . . . . . . . . . . . . . . . . . . 9 70 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 9 72 1. Introduction 74 This document will be used as a basis for point scoring at upcoming 75 RSerPool bakeoffs. Its purpose is similar to that described in 76 RFC1025. It is hoped that a clear definition of where and how to 77 score points will further the development of RSerPool. 79 Note that while attending a bakeoff no one else will score your 80 points for you. We trust that all implementations will faithfully 81 record their points that are received honestly. Note also that these 82 scores are NOT to be used for marketing purposes. They are for the 83 use of the implementations to know how well they are doing. The only 84 reporting that will be done is a basic summary to the Reliable Server 85 Pooling Working Group but please note that NO company or 86 implementation names will be attached. 88 2. Aggregate Server Access Protocol 90 The ASAP protocol is described in the follwing documents: 92 o [RFC5352] 94 o [RFC5354] 96 o [I-D.dreibholz-rserpool-asap-hropt] 98 o [I-D.dreibholz-rserpool-delay] 100 2.1. Pool Element Communication 102 These points will be scored for EACH peer implementation that you 103 successfully communicate with. 105 o 2 Successful ASAP Registration Request of a PE in a pool using 106 Round Robin policy and handling of ASAP Registration Response. 108 o 2 Failing ASAP Registration Request of a PE requesting Least Used 109 policy in a pool using Round Robin policy and appropriate handling 110 of ASAP Registration Response (e.g. printing error message, but 111 not retrying registration). 113 o 2 Successful re-registration of a PE in a pool using Round Robin 114 policy. 116 o 2 Successful ASAP Deregistration Request of the PE from its pool 117 and handling of ASAP Deregistration Response. 119 o 2 Successful handling of ASAP Endpoint Keep-Alive without Home bit 120 set, i.e. answering with ASAP Endpoint Keep-Alive Ack. 122 o 5 Successful handling of ASAP Endpoint Keep-Alive with Home bit 123 set: respond with ASAP Endpoint Keep-Alive Ack and use new ENRP 124 server for re-registration. 126 o 5 Successful connection to and registration at an ENRP server 127 announcing itself via multicast ASAP Announces. 129 o 1 Successful registration into pool using Least Used policy. 131 o 1 Successful registration into pool using Weighted Round Robin 132 policy. 134 o 1 Successful registration into pool using Random policy. 136 o 1 Successful registration into pool using Weighted Random policy. 138 2.2. Pool User Communication 140 These points will be scored for EACH peer implementation that you 141 successfully communicate with. 143 o 5 Successful ASAP Handle Resolution in a pool using Round Robin 144 policy, correct handling of ASAP Handle Resolution Response. 146 o 2 Successful failure reporting using ASAP Endpoint Unreachable. 148 o 5 Successful connection to and handle resolution at ENRP server 149 announcing itself via multicast ASAP Announces. 151 o 1 Successful handle resolution in a pool using Least Used policy. 153 o 1 Successful handle resolution in a pool using Weighted Round 154 Robin policy. 156 o 1 Successful handle resolution in a pool using Random policy. 158 o 1 Successful handle resolution in a pool using Weighted Random 159 policy. 161 2.3. ENRP Server Communication 163 These points will be scored for EACH peer implementation that you 164 successfully communicate with. 166 o 2 Successful handling of an ASAP Registration Request into a pool 167 using Round Robin policy (ENRP server answers with successful ASAP 168 Registration Response). 170 o 2 Rejecting registration of a PE requesting Round Robin policy 171 into a pool using Least Used policy. 173 o 5 Rejecting registration of a PE with all addresses *not* being 174 part of the ASAP association. 176 o 5 Successful registration of a PE with some addresses *not* being 177 part of the ASAP association. The invalid addresses may *not* go 178 into the handlespace. 180 o 5 Successful handling of ASAP Endpoint Unreachable messages. The 181 ENRP server must remove the given PE after MAX-BAD-PE-REPORTS=3 182 unreachability reports. 184 o 2 Sending regular ASAP Endpoint Keep-Alives to its PEs. 186 o 2 Removing PE not answering to ASAP Endpoint Keep-Alive. 188 3. Endpoint Handlespace Redundancy Protocol 190 The ENRP protocol is described in the follwing documents: 192 o [RFC5353] 194 o [RFC5354] 196 o [I-D.dreibholz-rserpool-enrp-takeover] 198 3.1. Peer Management 200 These points will be scored for EACH peer implementation that you 201 successfully communicate with. 203 o 2 Sending ENRP Presence to a new ENRP server. 205 o 2 Sending ENRP Presences in the interval given by PEER-HEARTBEAT- 206 CYCLE. 208 o 5 Requesting peer list from new ENRP server using ENRP Peer List 209 Request, handling ENRP Peer List Response and adding entries to 210 its own peer list. 212 o 2 Handling ENRP Peer List Request and replying with own peer list 213 in ENRP Peer List Response. 215 o 5 Requesting handlespace from new ENRP server using ENRP Handle 216 Table Request, handling ENRP Handle Table Response (without M-bit 217 set) and inserting entries into its own handlespace copy. 219 o 5 Requesting handlespace from new ENRP server using ENRP Handle 220 Table Request, handling ENRP Handle Table Response with M-bit set, 221 requesting more entries and inserting entries into its own 222 handlespace copy. 224 o 2 Handling ENRP Handle Table Request and replying own handlespace 225 in ENRP Handle Table Response (without M-bit). 227 o 10 Handling ENRP Handle Table Request and replying own handlespace 228 in ENRP Handle Table Response with M-bit set, remembering point to 229 continue from, responding next block of handlespace entries upon 230 following ENRP Handle Table Request, etc. until transfer of 231 handlespace data is complete. 233 o 5 Successful addition of new ENRP server announcing itself via 234 multicast ENRP Presence (including association establishment as 235 well as download of peer list and handlespace). 237 3.2. Update 239 These points will be scored for EACH peer implementation that you 240 successfully communicate with. 242 o 2 Handling an ENRP Handle Update adding a PE. 244 o 2 Handling an ENRP Handle Update updating a PE. The changes must 245 be entered into the local handlespace copy. 247 o 2 Handling an ENRP Handle Update removing a PE. 249 3.3. Synchronization 251 These points will be scored for EACH peer implementation that you 252 successfully communicate with. 254 o 5 Successful detection of different handlespace checksums upon 255 reception of ENRP Presence (due to additional PE), request of 256 Handle Table with W-bit set, integration of missing PE into local 257 handlespace copy and reporting the correct checksum in own ENRP 258 Presence. 260 o 5 Successful detection of different handlespace checksums upon 261 reception of ENRP Presence (due to out-of-date PE), request of 262 Handle Table with W-bit set, removal of PE from local handlespace 263 copy and reporting the correct checksum in own ENRP Presence. 265 o 10 Successful detection of different handlespace checksums upon 266 reception of ENRP Presence (due to multiple new and out-of-date PE 267 identities; size of PE identities is larger than maximum ENRP 268 message size), request of Handle Table with W-bit set, handling of 269 ENRP Handle Table Responses with M-bit set, removal of out-of-date 270 PEs, integration of new PEs into the local handlespace copy and 271 reporting correct checksum in own ENRP Presence. 273 3.4. Takeover 275 These points will be scored for EACH peer implementation that you 276 successfully communicate with. The setup contains your ENRP server 277 plus a set of peers running another implementation. 279 o 5 Successfully detecting the failure of a remote peer and 280 initiating a takeover procedure. 282 o 5 Acknowledging another peer's takeover and aborting own takeover 283 procedure. 285 o 10 Correctly handling a remote peer's Takeover Server message, 286 including ownership change for the remote peer's PEs. 288 o 10 Successfully taking over a dead peer, including ownership 289 change and informing the PEs taken over. 291 4. Bonus Points 293 You can also earn Bonus Points: 295 o 20 points for the ENRP server handling the largest number of PEs. 297 o 20 points for the ENRP server achieving the highest handle 298 resolution throughput for a pool containing 100 (should this be 299 larger?) PEs. 301 Please note that the whole period of the bakeoff is relevant. 303 5. Reference Implementation 305 The RSerPool reference implementation RSPLIB can be found at 307 [RSerPoolPage]. It supports the functionalities defined by 308 [RFC5351], [RFC5352], [RFC5353], [RFC5354] and [RFC5356] as well as 309 the options [I-D.dreibholz-rserpool-asap-hropt], 310 [I-D.dreibholz-rserpool-enrp-takeover] and 311 [I-D.dreibholz-rserpool-delay]. An introduction to this 312 implementation is provided in [Dre2006]. 314 6. Security Considerations 316 This document does only describe test scenarios and therefore does 317 not introduce any new security issues. 319 For security considerations of the RSerPool protocols see [RFC3237], 320 [RFC5351], [RFC5352], [RFC5353], [RFC5354]. [RFC5356] and in 321 particular [RFC5355]. 323 7. IANA Considerations 325 This document introduces no additional considerations for IANA. 327 8. References 329 8.1. Normative References 331 [RFC3237] Tuexen, M., Xie, Q., Stewart, R., Shore, M., Ong, L., 332 Loughney, J., and M. Stillman, "Requirements for Reliable 333 Server Pooling", RFC 3237, January 2002. 335 [RFC5351] Lei, P., Ong, L., Tuexen, M., and T. Dreibholz, "An 336 Overview of Reliable Server Pooling Protocols", RFC 5351, 337 September 2008. 339 [RFC5352] Stewart, R., Xie, Q., Stillman, M., and M. Tuexen, 340 "Aggregate Server Access Protocol (ASAP)", RFC 5352, 341 September 2008. 343 [RFC5353] Xie, Q., Stewart, R., Stillman, M., Tuexen, M., and A. 344 Silverton, "Endpoint Handlespace Redundancy Protocol 345 (ENRP)", RFC 5353, September 2008. 347 [RFC5354] Stewart, R., Xie, Q., Stillman, M., and M. Tuexen, 348 "Aggregate Server Access Protocol (ASAP) and Endpoint 349 Handlespace Redundancy Protocol (ENRP) Parameters", 350 RFC 5354, September 2008. 352 [RFC5355] Stillman, M., Gopal, R., Guttman, E., Sengodan, S., and M. 353 Holdrege, "Threats Introduced by Reliable Server Pooling 354 (RSerPool) and Requirements for Security in Response to 355 Threats", RFC 5355, September 2008. 357 [RFC5356] Dreibholz, T. and M. Tuexen, "Reliable Server Pooling 358 Policies", RFC 5356, September 2008. 360 [I-D.dreibholz-rserpool-asap-hropt] 361 Dreibholz, T., "Handle Resolution Option for ASAP", 362 draft-dreibholz-rserpool-asap-hropt-03 (work in progress), 363 October 2008. 365 [I-D.dreibholz-rserpool-enrp-takeover] 366 Dreibholz, T. and X. Zhou, "Takeover Suggestion Flag for 367 the ENRP Handle Update Message", 368 draft-dreibholz-rserpool-enrp-takeover-00 (work in 369 progress), December 2008. 371 [I-D.dreibholz-rserpool-delay] 372 Dreibholz, T. and X. Zhou, "Definition of a Delay 373 Measurement Infrastructure and Delay-Sensitive Least-Used 374 Policy for Reliable Server Pooling", 375 draft-dreibholz-rserpool-delay-02 (work in progress), 376 July 2008. 378 8.2. Informative References 380 [RSerPoolPage] 381 Dreibholz, T., "Thomas Dreibholz's RSerPool Page", 382 URL: http://tdrwww.iem.uni-due.de.de/dreibholz/rserpool/. 384 [Dre2006] Dreibholz, T., "Reliable Server Pooling -- Evaluation, 385 Optimization and Extension of a Novel IETF Architecture", 386 Ph.D. Thesis University of Duisburg-Essen, Faculty of 387 Economics, Institute for Computer Science and Business 388 Information Systems, URL: http:// 389 duepublico.uni-duisburg-essen.de/servlets/DerivateServlet/ 390 Derivate-16326/Dre2006-final.pdf, March 2007. 392 Authors' Addresses 394 Thomas Dreibholz 395 University of Duisburg-Essen, Institute for Experimental Mathematics 396 Ellernstrasse 29 397 45326 Essen, Nordrhein-Westfalen 398 Germany 400 Phone: +49-201-1837637 401 Fax: +49-201-1837673 402 Email: dreibh@iem.uni-due.de 403 URI: http://www.iem.uni-due.de/~dreibh/ 405 Michael Tuexen 406 University of Applied Sciences Muenster 407 Stegerwaldstrasse 39 408 48565 Steinfurt, Nordrhein-Westfalen 409 Germany 411 Email: tuexen@fh-muenster.de