A Formal Validation Model for the Netconf Protocol
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate and commit, which currently lack a clear description and an information model. We propose in this paper a model for valida...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 158 |
|---|---|
| container_issue | |
| container_start_page | 147 |
| container_title | |
| container_volume | |
| creator | Hallé, Sylvain Deca, Rudy Cherkaoui, Omar Villemaire, Roger Puche, Daniel |
| description | Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate and commit, which currently lack a clear description and an information model. We propose in this paper a model for validation based on XML schema trees. By using an existing logical formalism called TQL, we express important dependencies between parameters that appear in those information models, and automatically check these dependencies on sample XML trees in reasonable time. We illustrate our claim by showing different rules and an example of validation on a Virtual Private Network. |
| doi_str_mv | 10.1007/978-3-540-30184-4_13 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16334967</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16334967</sourcerecordid><originalsourceid>FETCH-LOGICAL-p228t-b3f7dfd33076e924182bc6664b80b4817f236b8a69458840064b4e54ae91e8473</originalsourceid><addsrcrecordid>eNotkE1PwzAMhsOXxBj7Bxxy4RhIYjdJj9PEAGl8HIBrlLYpFLpmSnrh35Nu-GLJ7yPLfgi5EvxGcK5vS20YsAI5Ay4MMrQCjsgF5Ml-gMdkJpQQDADLE7LI_JRJUCDglMwyJVmpEc7JIqVvnksqBYWaEbmk6xC3rqcfru8aN3ZhoE-h8T1tQ6Tjl6fPfqzD0NLXGMZQh_6SnLWuT37x3-fkfX33tnpgm5f7x9Vyw3ZSmpFV0OqmbQC4Vr6UKIysaqUUVoZXaIRu832VcarEwhjkPCfoC3S-FN6ghjm5PuzduVS7vo1uqLtkd7HbuvhrhZq-VRMnD1zK0fDpo61C-ElWcDvZs9mGBZt92L0sO9mDP_NbWnk</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Formal Validation Model for the Netconf Protocol</title><source>Springer Books</source><creator>Hallé, Sylvain ; Deca, Rudy ; Cherkaoui, Omar ; Villemaire, Roger ; Puche, Daniel</creator><contributor>Sahai, Akhil ; Wu, Felix</contributor><creatorcontrib>Hallé, Sylvain ; Deca, Rudy ; Cherkaoui, Omar ; Villemaire, Roger ; Puche, Daniel ; Sahai, Akhil ; Wu, Felix</creatorcontrib><description>Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate and commit, which currently lack a clear description and an information model. We propose in this paper a model for validation based on XML schema trees. By using an existing logical formalism called TQL, we express important dependencies between parameters that appear in those information models, and automatically check these dependencies on sample XML trees in reasonable time. We illustrate our claim by showing different rules and an example of validation on a Virtual Private Network.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540236313</identifier><identifier>ISBN: 3540236317</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540301844</identifier><identifier>EISBN: 9783540301844</identifier><identifier>DOI: 10.1007/978-3-540-30184-4_13</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Common Information Model ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Remote Procedure Call ; Semistructured Data ; Software ; Tree Rule ; Virtual Private Network</subject><ispartof>Lecture notes in computer science, 2004, p.147-158</ispartof><rights>IFIP International Federation for Information Processing 2004</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30184-4_13$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30184-4_13$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16334967$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Sahai, Akhil</contributor><contributor>Wu, Felix</contributor><creatorcontrib>Hallé, Sylvain</creatorcontrib><creatorcontrib>Deca, Rudy</creatorcontrib><creatorcontrib>Cherkaoui, Omar</creatorcontrib><creatorcontrib>Villemaire, Roger</creatorcontrib><creatorcontrib>Puche, Daniel</creatorcontrib><title>A Formal Validation Model for the Netconf Protocol</title><title>Lecture notes in computer science</title><description>Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate and commit, which currently lack a clear description and an information model. We propose in this paper a model for validation based on XML schema trees. By using an existing logical formalism called TQL, we express important dependencies between parameters that appear in those information models, and automatically check these dependencies on sample XML trees in reasonable time. We illustrate our claim by showing different rules and an example of validation on a Virtual Private Network.</description><subject>Applied sciences</subject><subject>Common Information Model</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Remote Procedure Call</subject><subject>Semistructured Data</subject><subject>Software</subject><subject>Tree Rule</subject><subject>Virtual Private Network</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540236313</isbn><isbn>3540236317</isbn><isbn>3540301844</isbn><isbn>9783540301844</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkE1PwzAMhsOXxBj7Bxxy4RhIYjdJj9PEAGl8HIBrlLYpFLpmSnrh35Nu-GLJ7yPLfgi5EvxGcK5vS20YsAI5Ay4MMrQCjsgF5Ml-gMdkJpQQDADLE7LI_JRJUCDglMwyJVmpEc7JIqVvnksqBYWaEbmk6xC3rqcfru8aN3ZhoE-h8T1tQ6Tjl6fPfqzD0NLXGMZQh_6SnLWuT37x3-fkfX33tnpgm5f7x9Vyw3ZSmpFV0OqmbQC4Vr6UKIysaqUUVoZXaIRu832VcarEwhjkPCfoC3S-FN6ghjm5PuzduVS7vo1uqLtkd7HbuvhrhZq-VRMnD1zK0fDpo61C-ElWcDvZs9mGBZt92L0sO9mDP_NbWnk</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Hallé, Sylvain</creator><creator>Deca, Rudy</creator><creator>Cherkaoui, Omar</creator><creator>Villemaire, Roger</creator><creator>Puche, Daniel</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>A Formal Validation Model for the Netconf Protocol</title><author>Hallé, Sylvain ; Deca, Rudy ; Cherkaoui, Omar ; Villemaire, Roger ; Puche, Daniel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p228t-b3f7dfd33076e924182bc6664b80b4817f236b8a69458840064b4e54ae91e8473</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Common Information Model</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Remote Procedure Call</topic><topic>Semistructured Data</topic><topic>Software</topic><topic>Tree Rule</topic><topic>Virtual Private Network</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hallé, Sylvain</creatorcontrib><creatorcontrib>Deca, Rudy</creatorcontrib><creatorcontrib>Cherkaoui, Omar</creatorcontrib><creatorcontrib>Villemaire, Roger</creatorcontrib><creatorcontrib>Puche, Daniel</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hallé, Sylvain</au><au>Deca, Rudy</au><au>Cherkaoui, Omar</au><au>Villemaire, Roger</au><au>Puche, Daniel</au><au>Sahai, Akhil</au><au>Wu, Felix</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Formal Validation Model for the Netconf Protocol</atitle><btitle>Lecture notes in computer science</btitle><date>2004</date><risdate>2004</risdate><spage>147</spage><epage>158</epage><pages>147-158</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540236313</isbn><isbn>3540236317</isbn><eisbn>3540301844</eisbn><eisbn>9783540301844</eisbn><abstract>Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate and commit, which currently lack a clear description and an information model. We propose in this paper a model for validation based on XML schema trees. By using an existing logical formalism called TQL, we express important dependencies between parameters that appear in those information models, and automatically check these dependencies on sample XML trees in reasonable time. We illustrate our claim by showing different rules and an example of validation on a Virtual Private Network.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30184-4_13</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2004, p.147-158 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16334967 |
| source | Springer Books |
| subjects | Applied sciences Common Information Model Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Remote Procedure Call Semistructured Data Software Tree Rule Virtual Private Network |
| title | A Formal Validation Model for the Netconf Protocol |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T22%3A01%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Formal%20Validation%20Model%20for%20the%20Netconf%20Protocol&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Hall%C3%A9,%20Sylvain&rft.date=2004&rft.spage=147&rft.epage=158&rft.pages=147-158&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540236313&rft.isbn_list=3540236317&rft_id=info:doi/10.1007/978-3-540-30184-4_13&rft_dat=%3Cpascalfrancis_sprin%3E16334967%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540301844&rft.eisbn_list=9783540301844&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |