idnits 2.17.1 draft-liu-anima-grasp-distribution-01.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 the recommended RFC 2119 boilerplate, even if it appears to use RFC 2119 keywords. (The document does seem to have the reference to RFC 2119 which the ID-Checklist requires). -- The document date (March 22, 2016) is 2956 days in the past. Is this intentional? Checking references for intended status: Proposed Standard ---------------------------------------------------------------------------- (See RFCs 3967 and 4897 for information about using normative references to lower-maturity documents in RFCs) == Missing Reference: 'TBD' is mentioned on line 147, but not defined == Unused Reference: 'RFC2119' is defined on line 299, but no explicit reference was found in the text == Unused Reference: 'I-D.du-anima-an-intent' is defined on line 321, but no explicit reference was found in the text == Unused Reference: 'I-D.irtf-nmrg-autonomic-network-definitions' is defined on line 326, but no explicit reference was found in the text == Unused Reference: 'I-D.pritikin-anima-bootstrapping-keyinfra' is defined on line 333, but no explicit reference was found in the text == Outdated reference: A later version (-15) exists of draft-ietf-anima-grasp-04 ** Obsolete normative reference: RFC 2629 (Obsoleted by RFC 7749) == Outdated reference: A later version (-05) exists of draft-du-anima-an-intent-02 Summary: 1 error (**), 0 flaws (~~), 9 warnings (==), 1 comment (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 2 Network Working Group B. Liu 3 Internet-Draft S. Jiang 4 Intended status: Standards Track Huawei Technologies 5 Expires: September 23, 2016 March 22, 2016 7 Information Distribution over GRASP 8 draft-liu-anima-grasp-distribution-01 10 Abstract 12 This document discusses the requirement of information distribution 13 capability in autonomic networks. Ideally, the autonomic network 14 should support distributing some information which is generated/ 15 injected at an arbitrary autonomic node and be distributed among the 16 whole autonomic domain. This docuemnt specifically proposes to 17 achive this goal based on the GRASP (A Generic Autonomic Signaling 18 Protocol), and specifies additional node behavior. 20 Status of This Memo 22 This Internet-Draft is submitted in full conformance with the 23 provisions of BCP 78 and BCP 79. 25 Internet-Drafts are working documents of the Internet Engineering 26 Task Force (IETF). Note that other groups may also distribute 27 working documents as Internet-Drafts. The list of current Internet- 28 Drafts is at http://datatracker.ietf.org/drafts/current/. 30 Internet-Drafts are draft documents valid for a maximum of six months 31 and may be updated, replaced, or obsoleted by other documents at any 32 time. It is inappropriate to use Internet-Drafts as reference 33 material or to cite them other than as "work in progress." 35 This Internet-Draft will expire on September 23, 2016. 37 Copyright Notice 39 Copyright (c) 2016 IETF Trust and the persons identified as the 40 document authors. All rights reserved. 42 This document is subject to BCP 78 and the IETF Trust's Legal 43 Provisions Relating to IETF Documents 44 (http://trustee.ietf.org/license-info) in effect on the date of 45 publication of this document. Please review these documents 46 carefully, as they describe your rights and restrictions with respect 47 to this document. Code Components extracted from this document must 48 include Simplified BSD License text as described in Section 4.e of 49 the Trust Legal Provisions and are provided without warranty as 50 described in the Simplified BSD License. 52 Table of Contents 54 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 55 2. Information Distribution Scenarios . . . . . . . . . . . . . 3 56 2.1. Whole Domain Distribution . . . . . . . . . . . . . . . . 3 57 2.2. Selective Distribution . . . . . . . . . . . . . . . . . 3 58 2.3. Incremental Distribution . . . . . . . . . . . . . . . . 3 59 3. Distribution Requirements . . . . . . . . . . . . . . . . . . 3 60 3.1. Identifying Autonomic Domain Boundary . . . . . . . . . . 3 61 3.2. Arbitrary Injecting Point . . . . . . . . . . . . . . . . 4 62 3.3. Avoiding Loops . . . . . . . . . . . . . . . . . . . . . 4 63 3.4. Selective Flooding . . . . . . . . . . . . . . . . . . . 4 64 3.5. Point-to-Point Distribution . . . . . . . . . . . . . . . 4 65 3.6. Verification of Distributed Information . . . . . . . . . 4 66 3.7. Conflict Handling . . . . . . . . . . . . . . . . . . . . 4 67 4. Distribution Function and Behavior Specification . . . . . . 5 68 4.1. Using GRASP Flood Synchronization Message . . . . . . . . 5 69 4.2. Using GRASP Synchronization Message . . . . . . . . . . . 5 70 4.3. Selective Flooding . . . . . . . . . . . . . . . . . . . 5 71 4.3.1. Selecting Cretiria . . . . . . . . . . . . . . . . . 5 72 4.3.2. Node Behavior . . . . . . . . . . . . . . . . . . . . 6 73 4.4. Conflict Handling . . . . . . . . . . . . . . . . . . . . 6 74 4.5. Distribution Source Authentication . . . . . . . . . . . 6 75 5. Security Considerations . . . . . . . . . . . . . . . . . . . 6 76 6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 6 77 7. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 7 78 8. References . . . . . . . . . . . . . . . . . . . . . . . . . 7 79 8.1. Normative References . . . . . . . . . . . . . . . . . . 7 80 8.2. Informative References . . . . . . . . . . . . . . . . . 7 81 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 8 83 1. Introduction 85 In an autonomic network, sometimes the nodes need to share a set of 86 common information. One typical case is the Intent Distribution 87 which is briefly discussed in Section 4.5 of 88 [I-D.behringer-anima-reference-model]. However, the distribution 89 should be a general function that one autonomic node should support, 90 rather than a specific mechanism dedicated for Intent. This document 91 firstly analyzes several basic information distribution scenarios 92 (Section 2), and then discusses the technical requirements 93 (Section 3) that one autonomic node needs to fulfill. 95 This document proposes to achieve distribution function based on the 96 GRASP (A Generic Autonomic Signaling Protocol) [I-D.ietf-anima-grasp] 97 . GRASP already provides some capability to support part of the 98 distribution function. Along with that, this document also proposes 99 some additional functionality. Detailed design is described in 100 Section 4. 102 2. Information Distribution Scenarios 104 2.1. Whole Domain Distribution 106 Once the information is input to the autonomic network, the node that 107 firstly handle the information MUST be able to distribute it to all 108 the other nodes in the autonomic domain. 110 The distributed information might not relevant to every autonomic 111 node, but it is flooded to all the devices. 113 2.2. Selective Distribution 115 When one node receive the information, it only replicates it to the 116 neighbors that fit for a certain of conditions. This could reduce 117 some unnecessary signaling amplification. 119 However, this scenario implies there needs to be corresponding 120 mechanisms to represent the conditions and to judge which neighbors 121 fit for the conditions. Please refer to Section 4.3.2 (selective 122 flooding behavior). 124 2.3. Incremental Distribution 126 The distribution only goes to the nodes that newly get online. This 127 might mostly happen between neighbors. 129 The incremental distribution could also be a sub scenario of the 130 whole domain distribution. When one node is doing the whole domain 131 distribution, it is possible that some of its neighbors are sleeping/ 132 off-line, so when the neighbors get online again, the node should do 133 incremental distribution of the previous whole domain distributed 134 information. 136 3. Distribution Requirements 138 3.1. Identifying Autonomic Domain Boundary 140 The domain boundary devices are supposed to know themselves as 141 boundary. When the distribution messages come to the devices, they 142 do not distribute them outside the domain. 144 3.2. Arbitrary Injecting Point 146 The distributed information SHOULD be injected at any autonomic node 147 within the domain (or within a specific set of nodes [TBD]). 149 3.3. Avoiding Loops 151 There should be a mechanism to prevent the distributed information to 152 travel around the domain again and again, so that there would not be 153 a large amount of redundant packets troubling the network. 155 3.4. Selective Flooding 157 When one node receive the information, it only floods it to the 158 neighbors that fit for a certain of rules. 160 3.5. Point-to-Point Distribution 162 One node only distributes the information to another node. This is 163 for the incremental distribution scenario. 165 3.6. Verification of Distributed Information 167 o Information integrity verification 169 The receiving node SHOULD be able to verify whether the 170 distributed information is from the certain node. In other 171 words, it needs to make sure the information hasn't been 172 modified. 174 o Source authorization verification 176 Even the information integrity was verified, the distributed 177 information might still be invalid, since the distribution 178 source might not have the right to distribute such information 179 that it just exceeds its authority. 181 3.7. Conflict Handling 183 As long as it supports arbitrary point of injecting distribution, 184 there is possibility that two nodes advertise the same information 185 but with conflict attribute(s). Hence, there should be a mechanism 186 to handle the conflict. 188 4. Distribution Function and Behavior Specification 190 This section specifies using certain GRASP messages for distribution, 191 and also specifies the distribution behavior in an autonomic node. 193 4.1. Using GRASP Flood Synchronization Message 195 It is natural to use the GRASP Flood Synchronization message for 196 distribution, since the Flood Synchronization behavior specified in 197 GRASP is identical to the the whole domain distribution scenario 198 described in Section 2.1. And the Flood Synchronization naturally 199 fits for "Arbitrary Injection Point" and "Avoiding Loops" 200 requirements. 202 4.2. Using GRASP Synchronization Message 204 It is natural to use the GRASP Synchronization message for Point-to- 205 Point distribution. The two behavior is identical. 207 4.3. Selective Flooding 209 4.3.1. Selecting Cretiria 211 When doing selective flooding, the distributed information needs to 212 contain the cretiria for nodes to judge which interfaces should be 213 sent the distributed information and which are not. Specifically, 214 the indication information needs to include following attributes/ 215 meta-data: 217 o Matching condition: which represents the cretiria of the 218 selection. 220 o Matching objective: the matching objective is either the node 221 itself or the neighbors. 223 o Action: the action is eithor continueing the distribution or 224 terminating it. 226 Example: 228 o Matching condition: "Device role=IPRAN_RSG" 230 o Matching objective: "Neighbors" 232 o Action: "Distribute" 234 This example means: only distributing the information to the 235 neighbors who are IPRAN_RSG. 237 4.3.2. Node Behavior 239 1) The distribution initial node Includes the Selecting Cretiria as 240 attributes/meta-data in the distributed information. 242 2) The recieving node does the matching indicated by the Selecting 243 Cretiria. 245 2-1 When the Matching Objective is "Neighbors", then the node only 246 distributes the information to the neighbors who match the 247 Matching Condition. 249 2-2 When the Matching Objective is "Self", if matched, the node 250 terminates the distribution (not flooding it to any of the 251 neighbor). 253 4.4. Conflict Handling 255 The distribution information needs to include timestamps or version 256 information. When conflict happens, the node only accepts the latest 257 information. 259 4.5. Distribution Source Authentication 261 The distribution source authentication could be done at multiple 262 layers: 264 o Outer layer authentication: the GRASP communication is within ACP 265 (Autonomic Control Plane, 266 [I-D.behringer-anima-autonomic-control-plane] ). This is the 267 default GRASP behavior. 269 o Inner layer authentication: the GRASP communication might not be 270 within a protected channel, then there should be embedded 271 protection in distribution information itself. Public key 272 infrastructure might be involved in this case. 274 5. Security Considerations 276 TBD. 278 6. IANA Considerations 280 No IANA assignment is needed. 282 7. Acknowledgements 284 This document is inherited from [I-D.ietf-anima-grasp] and 285 [I-D.behringer-anima-reference-model]. So thanks all the 286 contributors of the two work items. 288 This document was produced using the xml2rfc tool [RFC2629]. 290 8. References 292 8.1. Normative References 294 [I-D.ietf-anima-grasp] 295 Bormann, C., Carpenter, B., and B. Liu, "A Generic 296 Autonomic Signaling Protocol (GRASP)", draft-ietf-anima- 297 grasp-04 (work in progress), March 2016. 299 [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate 300 Requirement Levels", BCP 14, RFC 2119, 301 DOI 10.17487/RFC2119, March 1997, 302 . 304 [RFC2629] Rose, M., "Writing I-Ds and RFCs using XML", RFC 2629, 305 DOI 10.17487/RFC2629, June 1999, 306 . 308 8.2. Informative References 310 [I-D.behringer-anima-autonomic-control-plane] 311 Behringer, M., Bjarnason, S., BL, B., and T. Eckert, "An 312 Autonomic Control Plane", draft-behringer-anima-autonomic- 313 control-plane-03 (work in progress), June 2015. 315 [I-D.behringer-anima-reference-model] 316 Behringer, M., Carpenter, B., Eckert, T., Ciavaglia, L., 317 Liu, B., Jeff, J., and J. Strassner, "A Reference Model 318 for Autonomic Networking", draft-behringer-anima- 319 reference-model-04 (work in progress), October 2015. 321 [I-D.du-anima-an-intent] 322 Du, Z., Jiang, S., Jeff, J., and L. Ciavaglia, "Autonomic 323 Network Intent and Format", draft-du-anima-an-intent-02 324 (work in progress), October 2015. 326 [I-D.irtf-nmrg-autonomic-network-definitions] 327 Behringer, M., Pritikin, M., Bjarnason, S., Clemm, A., 328 Carpenter, B., Jiang, S., and L. Ciavaglia, "Autonomic 329 Networking - Definitions and Design Goals", draft-irtf- 330 nmrg-autonomic-network-definitions-07 (work in progress), 331 March 2015. 333 [I-D.pritikin-anima-bootstrapping-keyinfra] 334 Pritikin, M., Richardson, M., Behringer, M., and S. 335 Bjarnason, "Bootstrapping Key Infrastructures", draft- 336 pritikin-anima-bootstrapping-keyinfra-02 (work in 337 progress), July 2015. 339 Authors' Addresses 341 Bing Liu 342 Huawei Technologies 343 Q14, Huawei Campus 344 No.156 Beiqing Road 345 Hai-Dian District, Beijing 100095 346 P.R. China 348 Email: leo.liubing@huawei.com 350 Sheng Jiang 351 Huawei Technologies 352 Q14, Huawei Campus 353 No.156 Beiqing Road 354 Hai-Dian District, Beijing 100095 355 P.R. China 357 Email: jiangsheng@huawei.com