Shopping Cart

No products in the cart.

BS EN 14908-1:2014

$215.11

Open Data Communication in Building Automation, Controls and Building Management. Control Network Protocol – Protocol Stack

Published By Publication Date Number of Pages
BSI 2014 420
Guaranteed Safe Checkout
Category:

If you have any questions, feel free to reach out to our online customer service team by clicking on the bottom right corner. We’re here to assist you 24/7.
Email:[email protected]

This European Standard applies to a communication protocol for networked control systems in commercial Building Automation, Controls and Building Management. The protocol provides peer-topeer communication for networked control and is suitable for implementing both peer-to-peer and master-slave control strategies. This specification describes services in layers 2 to 7. In the layer 2 (data link layer) specification, it also describes the MAC sub-layer interface to the physical layer. The physical layer provides a choice of transmission media. The interface described in this specification supports multiple transmission media at the physical layer. In the layer 7 specification, it includes a description of the types of messages used by applications to exchange application and network management data.

PDF Catalog

PDF Pages PDF Title
4 Contents
7 Foreword
8 Introduction
9 1 Scope
2 Normative references
3 Terms and definitions
11 4 Symbols and abbreviations
4.1 Symbols and graphical representations
12 Figure 1 — Network topology & symbols
Figure 2 — Protocol terminology
4.2 Abbreviations
13 5 Overview of protocol layering
14 Figure 3 — Protocol layering
15 6 MAC sublayer
6.1 General
6.2 Service provided
6.3 Interface to the link layer
16 Figure 4 — Interface between the MAC and the link layers
6.4 Interface to the physical layer
17 6.5 MPDU format
Figure 5 — MPDU/LPDU format
6.6 Predictive p-persistent CSMA — overview description
18 Figure 6 — Predictive p-persistent CSMA concepts and parameters
6.7 Idle channel detection
19 6.8 Randomising
6.9 Backlog estimation
20 6.10 Optional priority
Figure 7 — Allocation of priority slots within the Busy Channel Packet Cycle
21 6.11 Optional collision detection
22 6.12 Beta1, Beta2 and Preamble Timings
24 7 Link layer
7.1 Assumptions
7.2 Service provided
7.3 CRC
25 Figure 8 — CRC register state behaviour example
7.4 Transmit algorithm
7.5 Receive Algorithm
8 Network layer
8.1 Assumptions
26 Figure 9 — Single channel topologies
27 Figure 10 — Typical tree-like domain topology
8.2 Service provided
8.3 Service interface
28 Figure 11 — Network service interface
8.4 Internal structuring of the network layer
Figure 12 — Network layer—internal structure
8.5 NPDU format
Figure 13 — NPDU format
29 8.6 Address recognition
8.7 Routers
30 8.8 Routing algorithm
8.9 Learning algorithm — subnets
9 Transaction control sublayer
9.1 Assumptions
31 9.2 Service provided
9.3 Service interface
Figure 14 — Transaction control service interface
32 9.4 State variables
9.5 Transaction control algorithm
33 10 Transport layer
10.1 Assumptions
10.2 Service provided
10.3 Service interface
Figure 15 — Transport interface to upper layers
34 10.4 TPDU types and formats
Figure 16 — TPDU types and formats
35 10.5 Protocol diagram
36 Figure 17 — Transport protocol diagram for multicast message with a loss of both the message and the ACK TPDUs
10.6 Transport protocol state variables
10.7 Send algorithm
Figure 18 — Transport protocol—Send FSM
10.8 Receive algorithm
Figure 19 — Transport protocol—Receive FSM
10.9 Receive transaction record pool size and configuration engineering
10.9.1 General
37 10.9.2 Number of retries
38 Figure 20 — Probability of transaction completion in k Retries
10.9.3 Transport layer timers
39 Figure 21 — Methodology for calculating timer values
11 Session layer
11.1 Assumptions
11.2 Service Provided
40 11.3 Service interface
Figure 22 — Session layer interface to application layer
11.4 Internal structure of the session layer
Figure 23 — Session layer—internal structuring
41 11.5 SPDU types and formats
Figure 24 — SPDU types and formats
42 11.6 Protocol timing diagrams
43 Figure 25 — Non-Idempotent request with multiple SPDU losses
44 Figure 26 — Secure idempotent request with multiple SPDU losses
45 11.7 Request-response state variables
11.8 Request-response protocol — client part
Figure 27 — Request-response protocol—client FSM
11.9 Request-response protocol — server part
Figure 28 — Request-response protocol—simplified server FSM
46 11.10 Request-response protocol timers
11.11 Authentication protocol
11.12 Encryption algorithm
11.13 Retries and the role of the checksum function
47 11.14 Random Number Generation
11.15 Using Authentication
12 Presentation/application layer
12.1 Assumptions
12.2 Service provided
48 12.3 Service interface
Figure 29 — Application layer interface
Table 1 — Application layer primitives
49 12.4 APDU types and formats
50 Figure 30 — APDU format
12.5 Protocol diagrams
51 Figure 31 — Application protocol diagram for multicast acknowledged transaction
52 Figure 32 — Application protocol diagram for multicast request/response transaction
12.6 Application protocol state variables
12.7 Request – response messaging in offline state
53 12.8 Network variables
12.8.1 General
12.8.2 Network variable processing
54 12.9 Error notification to the application program
12.9.1 General
12.9.2 Error notification for messages
12.9.3 Error notification for network variables
55 13 Network management & diagnostics
13.1 Assumptions
13.2 Services provided
13.3 Network management and diagnostics application structure
13.4 Node states
56 13.5 Using the network management services
13.5.1 General
57 13.5.2 Addressing considerations
13.5.3 Making network configuration changes
13.5.4 Downloading an Application Program
58 13.5.5 Error handling conditions (informative)
60 13.6 Using router network management commands
61 13.7 NMPDU formats and types
13.7.1 General
62 13.7.2 Query ID
13.7.3 Respond to query
13.7.4 Update domain
13.7.5 Leave domain
63 13.7.6 Update key
13.7.7 Update address
13.7.8 Query address
13.7.9 Query network variable configuration
13.7.10 Update group address
13.7.11 Query domain
13.7.12 Update network variable configuration
64 13.7.13 Set node mode
13.7.14 Read memory
13.7.15 Write memory
65 13.7.16 Checksum recalculate
13.7.17 Install
66 Table 2 —Resource codes
67 Table 3 —Space of the property ID
79 13.7.18 Memory refresh
13.7.19 Query SI
80 13.7.20 Network variable value fetch
13.7.21 Manual service request message
13.7.22 Network management escape code
81 13.7.23 Router mode
13.7.24 Router clear group or subnet table
13.7.25 Router group or subnet table download
13.7.26 Router group forward
13.7.27 Router subnet forward
13.7.28 Router Do Not forward group
13.7.29 Router Do Not forward subnet
82 13.7.30 Router group or subnet table report
13.7.31 Router status
13.7.32 Router half escape code
13.8 DPDU types and formats
13.8.1 General
13.8.2 Query status
85 13.8.3 Proxy status
13.8.4 Clear status
86 13.8.5 Query transceiver status
87 Annex A (normative) Reference implementation
A.1 General
A.2 Predictive CSMA algorithm
141 A.3 LPDU transmit algorithm
143 A.4 LPDU receive algorithm
144 A.5 Routing algorithm
145 A.6 Learning algorithm
A.7 Transaction control algorithm
152 A.8 Network layer algorithm
168 A.9 TPDU and SPDU send algorithm with authentication
221 A.10 Application Layer
276 A.11 Network Management Commands
312 A.12 Configuration data structures
331 A.13 Include files for the reference implementation
360 A.14 Application protocol state variables and address recognition Structures
363 A.15 Query-id data structures
A.16 Respond to query data structure
A.17 Update somain data structures
A.18 Leave domain data structures
364 A.19 Update key data structures
A.20 Update address data structures
365 A.21 Query address data structures
A.22 Query NV Cnfg data structures
A.23 Update group address data structures
366 A.24 Query domain data structures
A.25 Update network variable configuration data structures
A.26 Set node mode data structures
367 A.27 Read memory data structures
A.28 Write memory data structures
A.29 Checksum recalculate data structures
368 A.30 Install command data structures
376 A.31 Memory refresh data structures
A.32 Query SI data structures
A.33 NV fetch data structures
377 A.34 Manual service request message ddata structures
A.35 Product query data structures
A.36 Router mode data structures
A.37 Router table clear group or subnet table data structures
378 A.38 Router group or subnet download data structures
A.39 Router group forward data structures
A.40 Router subnet forward data structures
A.41 Router group No-Forward data structures
379 A.42 Router subnet No-Forward data structures
A.43 Group / subnet table report data structures
A.44 Router status data structures
A.45 Query status data structures
380 A.46 Proxy status data structures
A.47 Clear status data structures
A.48 Query transceiver status data structures
382 Annex B (normative) Additional Data Structures
B.1 General
B.1.1 System image
B.1.2 Application image
383 B.1.3 Network image
B.2 Read-only structures
B.2.1 Fixed read-only data structures
384 B.2.2 Read-only structure field descriptions
386 Table B. 1 — Buffer size encodings
387 Table B. 2 — Buffer Count Encodings
388 B.3 Domain table
B.3.1 Domain table field descriptions
B.4 Address table
389 B.4.1 Declaration of group address format
B.4.2 Group address field descriptions
390 B.4.3 Declaration of subnet/node address format
B.4.4 Subnet/node address field descriptions
B.4.5 Declaration of broadcast address format
391 B.4.6 Broadcast address field descriptions
B.4.7 Declaration of turnaround address format
B.4.8 Turnaround address field descriptions
B.4.9 Declaration of protocol processor’s address format
392 B.4.10 Protocol processor address field descriptions
B.4.11 Timer field descriptions
393 Table B. 3 — Encoding of timer field values
B.5 Network variable tables – informative
394 B.5.1 Network variable configuration table field descriptions – informative
B.5.2 Network variable alias table field descriptions – informative
395 B.5.3 Network variable fixed table field descriptions – informative
B.6 Self-Identification structures
396 B.6.1 SI Structure field descriptions
397 B.6.2 NV descriptor table field descriptions
B.6.3 SNVT table extension records
398 B.6.4 SNVT alias field descriptions
B.6.5 Version 2 SI data
399 Figure B. 1 —SI data
B.6.5.1 Alias record (alias_field Annex B.6.4 above)
B.6.5.2 SI Extended header record (si_header_ext)
B.6.5.3 Clarification of the use of existing fields in the snvt_struct (Annex B.6)
400 B.6.5.4 Capability info record (snvt_capability_info)
401 B.6.5.5 Read-Only Data Structure
402 B.7 Configuration structure
B.7.1 General
403 B.7.2 Configuration structure field descriptions
404 Table B. 4 — Buffer timeout encoding
B.8 Statistics relative structure
406 Annex C (informative) Behavioral characteristics
C.1 Channel capacity and throughput
407 Table C. 1 — Key throughput parameters
C.2 Network metrics
408 Figure C. 1 — Probability of successful delivery over k hops
C.3 Transaction metrics
409 C.4 Boundary conditions — power-up
C.5 Boundary conditions — high load
410 Annex D (normative) PDU summary
411 Figure D. 1 — Protocol PDU summary
412 Annex E (normative) Naming and addressing
E.1 Address types and formats
E.2 Domains
413 E.3 Subnets and nodes
E.4 Groups
414 Figure E. 1 — Physical topology and logical addressing (single domain)
E.5 Unique_Node_ID and node address assignment
415 E.6 NPDU addressing
Table E. 1 — NPDU/TPDU/SPDU addressing – logical address formats
Figure E. 2 — NPDU/TPDU/SPDU addressing—physical address formats
417 Bibliography
BS EN 14908-1:2014
$215.11