User Manual
`.~- . . _. -_ ... __ . -
`
`-
`
`...--.
`
`.
`
`'Network 300(:)
`
`_"'~
`
`J
`
`_
`
`_<' .,;_~:...~~.,
`
`',. Conlf1lunlcations USerS Guide,
`
`Bristol Babcock
`
`&
`
`.---,-~-----
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`User Manual
`.~- . . _. -_ ... __ . -
`
`-
`
`...--.
`
`.
`
`'Network 300(:)
`
`_"'~
`
`J
`
`_
`
`_<' .,;_~:...~~.,
`
`',. Conlf1lunlcations USerS Guide,
`
`Bristol Babcock
`
`&
`
`.---,-~-----
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`
`f: I ~ I ,
`nx'rgtwvtflm?‘‘~'
`I I
`I
`I
`I I
`
`
`
`|PR2017-00216
`
`SIPCO, LLC
`,WWNEXbiPit, 2019
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`NETWORK-3000 COMMUNICATIONS
`USER's GUIDE
`
`Table of Contents
`
`0
`
`0
`
`0
`
`0
`
`•
`
`0
`
`0
`
`•
`
`0
`
`0
`
`0
`
`0
`
`•
`
`0
`
`0
`
`•
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0 • • 0
`
`•
`
`0
`
`0 • • 0
`
`0
`
`•
`
`..
`
`0
`
`..
`
`•
`
`0
`
`....
`
`3
`3
`3
`4
`4
`4
`5
`7
`B
`9
`10
`11
`
`•
`
`0
`
`0
`
`0
`
`•
`
`1
`1.1
`1.2
`2
`2.1
`2.2
`2.3
`2.4
`2.5
`2.6
`2.7
`3
`3.1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`•
`
`•
`
`0
`
`•
`
`0
`
`0
`
`0
`
`•
`
`•
`
`•
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`•
`
`•
`
`INTRODUCTION • • • 0
`Scope
`................. ..
`Reference Documents •••
`BSAPCOMMUNICATIONS OVERVIEW
`Introduction 0
`Network Hierarchical Structure 0
`Relationship Of Nodes On The Network
`Protocol Layers
`Polling Philosophy •• 0
`Failure Recovery 0
`..
`..
`..
`..
`..
`Pseudomaster ..
`..
`..
`COMMUNICATION MESSAGE ,STRUCTURE
`Protocol Messages {POLL, ACK, ACK-NODATA. NAK,
`UP-ACK.
`............
`..
`.... ..
`Data Message (Global And Local)
`DATA TRANSFER
`Alarm Handling • • • • • 0
`Alarm Message Formats
`• 0
`Peer To Peer • • • 0
`PEER TO PEER RETURN ERROR CODES
`Remote Data Base Access
`• 0
`Immediate Response Mode
`Time Synchronization/Node Routing Table
`Global Address Calculation
`Download
`Diagnostics
`TRANSMISSION MODES
`Asynchronous 0
`Synchronous
`Data Highway
`ON-LINE STATISTICS
`Asynchronous 0
`Data Highway
`USER NOTES • 0
`Selecting The Poll Period
`•
`Selecting peer-<to',..,]':~er Rate
`Communincation Har'dware Timing Considerations
`Default Network Configuration Files
`Interfacing To Foreign Hosts
`Stand-alone Systems
`ACCOL PROM-based Units 0
`Additional Buffers •• 0
`Common Trouble Shooting Techniques
`Remote Diagnosis For System 3000
`Standards For Drawing Network Diagrams
`Tuning 3380 systems For Maximum Throughput
`Notes On Modems And Radios 0
`Port Interaction •• 0
`COMMUNICATION CODE DEFINITIONS
`
`0 • • 0
`
`0
`
`0
`
`0
`
`0
`
`'0
`
`0
`
`•
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`•
`
`0,
`
`•
`
`0
`
`•
`
`0
`
`0
`
`•
`
`0
`
`0
`
`0
`
`0
`
`•
`
`0
`
`0
`
`•
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0 • • 0
`
`0
`
`0
`
`•
`
`0
`
`0
`
`0
`
`•
`
`0
`
`0
`
`0
`
`•
`
`•
`
`0
`
`0
`
`0
`
`0
`
`0 • • 0
`
`•
`
`0
`
`0
`
`0
`
`•
`
`3.2
`4
`4.1
`4.1.1
`4.2
`4.2.1
`4.3
`4.4
`4.5
`4.5.1
`4.6
`4.7
`5
`5.1
`5.2
`5.3
`6
`6.1
`6.2
`7
`7.1
`7.2
`7.3
`7.4
`7.5
`7.6
`7.7
`7.8
`7.9
`7.10
`7.11
`7.12
`7.13
`7.14
`8
`
`11
`13
`14
`14
`16
`24
`31
`32
`34
`34
`38
`39
`43
`44
`44
`44
`44
`46
`47
`49
`52
`52
`55
`56
`57
`60
`61
`62
`62
`63
`64
`65
`65
`66
`66
`67
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Guide
`
`communication Function Codes . • •
`Communication Error Codes ••••
`Sample communication/Transactions
`Node Status Byte
`.
`G LOSSAR Y • • • • •
`..
`
`Page 2
`
`67
`68
`68
`72
`73
`
`•
`
`• •
`
`..
`
`8.1
`8.2
`8.3
`8.4
`9
`
`APPENDIX A
`
`APPENDIX B
`
`APPENDIX C
`
`..
`
`..
`
`..
`
`..
`
`..
`
`BRISTOL STANDARD ASYNCHRONOUS PROTOCOL
`
`REMOTE DATA BASE ACCESS
`
`REPORT BY EXCEPTION
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Guide
`INTRODUCTION
`
`Page 3
`5 February 1993
`
`1
`
`INTRODUCTION
`
`1.1 Scope
`
`reader with a
`the
`to provide
`is
`this manual
`The objective of
`comprehensive guide to Network-3000 communications. The intent is to
`make this manual as self-contained as possible. To this end, detailed
`information pertaining
`to the Bristol Standard Asynchronous Protocol
`and the Remote Data Base Access message formats has been
`included
`in
`the appendices.
`This will enable user to troubleshoot Network 3000
`communication
`systems and/or
`interface
`his
`computer
`to
`the
`Network-3000
`family.
`A
`detailed
`discussion
`of
`the network
`hierarchical structure,
`the communication protocol,
`and
`interface
`issues follow in subsequent chapters. This document will refer to the
`RDC-3350/3380
`software
`in describing
`the Network-3000
`interface
`requirements.
`
`1.2 Reference Documents
`
`Network Topology (NETTOP) User's GUide, 04057.
`
`ROC 3350 User Manual, D4040.
`
`UCS 3380 and CFE 3385 User Manual, D4050.
`
`DPC 3330 Instruction Manual, CI-3330.
`
`OPC 3335 Instruction Manual, CI-3335.
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Guide
`BSAP COMMUNICATIONS OVERVIEW
`
`Page 4
`5 February 1993
`
`2 BSAP COMMUNICATIONS OVERVIEW
`
`2.1· Introduction
`
`The Bristol Babcock Synchronous/Asynchronous Communication Protocol
`(BSAP)
`is
`the
`foundation
`for a proprietary network that has a tree
`structured topology. This open-ended topology supports a variety of
`configurations which may
`include one or more nodes at each of up to
`six levels. Messages can be sent between nodes on the same
`level or
`on different
`levels. Each message is uniquely identified and has an
`error checking code associated with it.
`
`is
`the network
`BSAP operates in a polled environment. Each link in
`The rate selected
`capable of supporting a different poll
`rate.
`depends on a variety of application-dependent factors and is discussed
`in detail in Section 7.
`.
`
`functional
`the
`to
`BSAP has been designed and implemented according
`layers of the International Standards Organization (ISO) model. Since
`each layer is independent of its adjacent layers. both synchronous and
`asynchronous transmission modes can be supported.
`
`2.2 Network Hierarchical Structure
`
`BSAP supports a simple tree topology. As a matter of terminology. the
`network master computer is defined as the root of the tree. Emanating
`from the root is the first level of node(s) or branch. From the first
`level there may be a second level; and from the second a third; and so
`forth up to a maximum of six levels.
`There
`is no
`requirement
`for
`symmetry within the tree structure.
`
`two
`The limit to the number of nodes on a branch is imposed by one of
`limiting·. factors:
`(1)
`the application-dependent allowable response
`time for critical messages; or (2) the physical size of a node address
`(7 bits = 128 nodes).
`in a polled
`that BSAP operates
`remember
`As for response
`times.
`environment.
`For each link in a network that a message must traverse
`there is a potential time lag associated with the polling cycle
`for
`that link.
`In addition. Alarm Repoit messages are given priority over
`other types of messages •. The cumula~ive effect is a function of
`the
`number of
`levels within
`the network and could very easily become a
`determining factor (in conjunction with poll
`rates)
`in configuring
`your network.
`A complete discussion of poll rates is contained in
`Section 7.
`
`is node
`in network configuration
`limitation
`The other practical
`addressing.
`Each node has
`a unique address which is based on the
`node's sequential position within
`its
`level
`and
`its
`level
`number
`within
`the network.
`At
`any given node. the allowable sequential
`pOSitions are in the range of 1 to 127 and are defined as
`the node's
`local address. Local addresses do not have to be consecutive; you can
`configure your network with holes (address gaps) today
`and
`fill
`the
`holes with additional nodes in the future Without having to renumber
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Guide
`BSAP COMMUNICATIONS OVERVIEW
`
`Page 5
`5 Febru'ary 1993
`
`the older nodes. However, bear in min'J'that 1t is the highest number
`used
`(not
`the actual number of nodes) that determines the amount of
`space required to define the node's address
`internally.
`Gaps will
`impose
`a burden in the form of dead node handling unless the #NDARRAY
`is used. This will be discussed in a later section.
`
`Levels of local addresses are concatenated to yield a unique address
`for each node within
`the network. This network-unique address is
`known as the global address. The numeric value of a global
`address
`may not exceed 32,767.
`A detailed explanation of global address
`computation can be found in Section 4.5.
`
`2.3 Relationship Of Nodes On The Network
`
`serves a
`Any given node within the network (except the extremities)
`dual purpose.
`It
`is master to the node(s) immediately below it and
`slave to the node immediately above it. These two
`relationships are
`defined
`as
`local because
`the nodes
`involved are adjacent to each
`other. Messages between a master and
`slave
`(with no
`intervening
`nodes)
`are def1ned as
`local messages. Messages wh1ch must pass
`through one or more intervening nodes to reach the1r dest1nation are
`defined as global messages.
`
`r\'etw~~k and
`local
`and
`the global
`simple
`Figure 1 1llustrates a
`relat10nsh1ps between 1ts nodes.
`To assist you in developing your
`particular network configuration, Bristol Babcock has a program called
`NETTOP available.
`
`' - - - - - -
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Commun1cations User's Guide
`BSAP COMMUNICATIONS OVERVIEW
`
`Page 6
`5 February 1993
`
`A
`I
`-------------------~~~---------I
`I
`I
`D
`C
`B
`I
`I
`I
`-----------
`-----------
`------------
`I
`I I
`I
`
`I
`
`E
`
`F
`
`G
`
`H
`
`I
`
`I I
`
`J
`
`I
`
`K
`
`L
`
`I
`
`M
`
`GLOBAL ADDRESSES
`
`J K L M
`I
`A B C D E F G H
`-----------------------------------------
`L G G G G G G G G G
`L
`L
`A
`L G G G G G G
`L
`G G L
`B L
`L G G G
`l
`G G G G L
`C L G
`L
`L
`G G G G G G L
`D L G G
`G G G G G G G G
`E G L G G
`G G G G G G G
`F G L G G G
`G G G G G G
`G G L G G G G
`G G G G G
`H G G L G G G G
`G G G G
`I G G L G G G G G
`~G-.,t· _ G G G
`J G G L G G G G G
`G G
`K G G G L G G G G G G
`G
`L G G G L G G G G G G G
`M G G G L G G G G G G G G
`L=Local Message
`G=Global Message
`
`Figure 1
`
`'.1
`
`! ,
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Guide
`BSAP COMMUNICATIONS OVERVIEW
`
`Page 7
`5 February 1993
`
`2;4 Protocol Layers
`
`International
`BSAP is designed and implemented in accordance with the
`Standards Organization
`(ISO) model for Open System Interconnection.
`This model consists of seven layers, each of which provides a certain
`subset of
`functionality within
`the network.
`The
`layers may be
`traversed in an upward or downward fashion, depending on whether
`a
`message
`is being
`transmitted
`(downward) or received (upward). The
`bottom four layers, which Network-3000 uses, are described below. The
`description traces a typical message transmission through each layer.
`
`the
`transmission of
`The Transport Layer is responsible for accurate
`message on a first-in/first-out basis at a functional level. When the
`transport layer determines it is ready to transmit, control is passed
`to the next layer.
`.
`
`It
`The Network Control Layer is the primary transmission manipulator.
`has the responsibility of determining how to route the message through
`the network, what addresses to use. and to establish the communication
`path.
`
`for enhancing
`responsible
`is
`The Data Link Layer
`include error checking and correction mechanisms.
`access to the physical channel over which the message
`
`to
`the message
`It also control s
`is sent.
`
`layer consists
`This
`The bottom layer is the Physical Link Layer.
`primarily of hardware and the software necessary to control it. This
`layer is totally independent of the final format of the message being
`transmitted.
`
`in
`is provided
`the BSAP protocol
`A more detailed description of
`Appendix
`A.
`While
`BSAP was originally
`intended
`for use on
`a~ynchronous links, it has been extended
`to operate on
`synchronous
`links by either replacing the link level section with the appropriate
`synchronous link level or by including BSAP's link
`level within
`the
`link
`level :information required by the synchronous level.
`In either
`case. operation of the link level f~r synchronous links is hidden from
`users of the communication facilityV their access is normally via the
`transport layer.
`Interfacing to ~rocessors other
`than Bristol's
`is
`via
`asynchronous
`connection
`only.
`so detailed
`information on
`synchronous link level operation need not be provided in this manual.
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Guide
`BSAP COMMUNICATIONS OVERVIEW
`
`Page 8
`5 February 1993
`
`!L
`
`I
`
`2.5 Polling Philosophy
`
`With the exception of the extremities, each n~de within the network is
`both
`a master to the nodes below it and a slave to the node above it.
`As a master, a node is responsible for periodically polling its slaves
`to determine
`their status and collect any available messages. As a
`slave, each node must respond to its master's poll. The poll period
`or
`rate at which each master polls its slaves, is user-selectable and
`independent of all the other masters' polling
`rates.
`The polling
`philosophy used attempts to maximize message throughput by minimizing
`extraneous polls. This is accomplished by maintaining four
`types of
`poll s:
`the main poll loop, the reactivation poll, the preferred poll
`loop, and the dead poll loop.
`
`The main poll loop interrogates each slave which is alive to determine
`if it
`is dead or still alive and, if still alive, whether or not it
`has a data message to send. This poll is executed at
`the start of
`each polling cycle.
`A
`live slave which does not respond to three
`successive polls (in three successive polling periods) is assumed
`to
`a candidate for the reactivation poll. A live
`be dead
`and
`becomes
`slave which responds with a data mes~age becomes a cand1date
`for
`the
`preferred poll. A 11ve slave with ~o data message is ignored until
`the next main polling cycle.
`
`Its
`The reactivation poll is attempted only once per polling cycle.
`purpose
`is
`to determine if a known dead slave has become live. The
`choice of which dead slave to poll (assuming there is more
`than one)
`is made
`on
`a
`rotating basis from one poll cycle to the next. This
`ensures that every dead slave gets an equal chance
`to
`respond.
`The
`polling
`technique used is similar to the main poll loop. However, if
`the polling node has a valid NRT,
`then the Time Synchronization/Node
`Routing Table message
`is sent instead of the POLL message.
`If the
`polled slave responds, its status 1s changed to live.
`
`round-robin
`a
`interrogate, on
`to
`The preferred poll loop is used
`basis, all of
`the slaves
`that
`responded to the main poll loop or
`reactivation poll with a data message. As
`long as a slave responds to
`the preferred poll w1th
`a data message, it remains a candidate; as
`soon as it responds with no data, it is
`removed
`from
`the preferred
`poll
`loop.
`The
`candidate slaves are polled sequentially, in local
`address order, until the polling period expires or all candidates have
`no more data messages.
`If
`there
`is not enough time left in the
`poll~ng cycle to receive all
`the candidates' data,
`the
`subsequent
`preferred poll
`loop
`(in
`the next polling cycle) resumes where the
`previous one ended.
`~. n
`the dead poll
`loop,
`If there is time left after the preferred poll
`loop is used to give any remaining dead nodes an opportunity to inform
`the master that they are again candidates for the main poll. Unlike
`the preferred poll
`loop,
`the dead poll loop is executed only once
`during a polling cycle. There are two ways in which
`the master may
`effect
`the dead poll
`loop.
`If it has a valid Node Routing Table
`(NRT), the master will send each dead slave a Time Synchronization/NRT
`message.
`This message is described in Section 4.5 and is essentially
`the first step in getting a dead node back in .step with
`the
`rest of
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Guide
`BSAP COMMUNICATIONS OVERVIEW
`
`Page 9
`5 February 1993
`
`If a dead slave acknowledges this message, it becomes
`the network.
`eligible for the main poll loop in the next ~olling cycle.
`If
`the
`master does not have a valid NRT, it will interrogate each of the dead
`slaves with a normal poll message.
`If the dead
`slave
`responds,
`it
`becomes eligible
`for
`the main poll loop, ~nd if it responds with a
`data message, ft becomes a candidate ;for the preferred poll
`loop
`(in
`the next polling cycle) as well.
`
`2.6 Failure Recovery
`
`Failures within the network can occur for a variety of reasons and the
`recovery procedure used will vary accordingly.
`In all cases except
`discarded global messages an error code
`is assigned
`to
`the
`failed
`message.
`These error codes are listed in section B.2.
`In general
`there are
`three
`types of
`failures:
`routing,
`buffering
`and
`transmission.
`
`(1) a local receiving node
`Routing failures can occur in three ways:
`is
`incapable of handling a global message whi.ch must pass through it;
`(2) a node incapable of originating a global message attempts to
`send
`one; and (3) a local receiving node is dead.
`
`The ability of a particular node to handle global messages is based on
`the presence or abs~nce of a Network Routing Table (NRT) within the
`node. The NRT must be present in order to process global messages.
`The NRT originates at
`the Network Master and is passed on to each
`succeeding level. Since each node receives its copy of the NRT
`from
`Its master,
`the master is aware,of .. fiits slaves' status regarding the
`NRT. Thus if a slave node has not accepted the NRT (the node is dead
`or
`the network master has not supplied the NRT yet), its master will
`discard any global message which must pass
`through
`that
`slave.
`Likewise, If the master receives a global message from a sla.e with no
`NRT (or if the global address is invalid) the master will discard that
`message as well.
`
`is discarded
`It is important to note here that when a global message
`because of a
`routing error, there Is no error code returned to the
`originator.
`It is assumed that the application which originated
`the
`message will
`use a timeout mechanism to detect that its messages are
`being discarded.
`
`it obviously cannot accept any
`If a local receivtng node is dead
`messages.
`The master is aware of its dead slaves as a result of the
`main poll loop. Should a message destined for a dead node arrive, the
`master will reject it and generate the appropriate error code.
`
`Buffering failures occur when a node does not have sufficient space to
`accept
`a data message.
`The
`slave node informs its master of this
`condition via the NAK protocol message
`(described
`in
`section 3.1).
`Upon
`receipt of a NAK
`for
`a
`lpcal message, the master makes two
`additional attempts to transmit the ~e~sage. If these attempts also
`fail,
`the master will
`inform the'of4gipator (via appropriate error
`code) of the condition and reject the~ message.
`This will
`cause a
`throttling down of messages
`to the clogged node which in turn will
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Guide
`BSAP COMMUNICATIONS OVERVIEW
`
`Page 10
`5 February 1993
`
`give the node an opportunity to clear Itself. A global message which
`is NAK'ed Is discarded without returning an error to the originator.
`
`the
`on
`noise
`result of
`the
`Transmission errors are usually
`transmission
`line.
`Should
`this occur,
`the receiving node will be
`incapable of decoding the message and will therefore not acknowledge
`it. A
`timeout
`facility
`Is provided
`to allow for the unsolicited
`retransmission of such messages if they are local. Two such
`attempts
`are made before the master informs the originator (via an appropriate
`error code) of the condition.
`If
`the message
`is global,
`it
`is
`discarded.
`
`2.7 Pseudomaster
`
`(, ,.
`
`as Pseudomaster
`Network-3000 also supports subnodes which are known
`devices
`and are connected to Pseudo Slave ports. These devices are
`ancillary to the network and typically consist of a portable Personal
`Computer executin~ the ACCOL Interactive Compiler (AIC) program. The
`Pseudomaster device Is not a part of the network
`since
`it does not
`have
`a global
`address and as such does not appear as a node in the
`network as described in the NETTOP file.
`The main purpose of
`the
`Pseudomaster device
`Is
`to access
`the data base in a node without
`affecting its normal operation.
`The TS/NRT message
`can NOT be
`transmitted
`through a Pseudo Slave Port as It will be ignored, (i.e.
`simply discarded) at the application level. The ~essage will be ACKed
`at
`the protocol
`level.
`During the configuration process the ACCOL
`programmer may choose to configure up to two ports on
`a node as· a
`pseudo slave port, however only one pseudo slave port can be specified
`to accept alarms.
`
`firmware)
`later
`and
`in AE
`The pseudo port is limited to three
`This does not affect normal
`messages outstanding at any
`time.
`operation with
`the AIC, Toolkit, etc.
`but
`it does
`limit
`the
`throughput of the pseudo port In so~e unusual 'applications •
`. ,- ';'
`
`(8
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Gdi"d'e
`COMMUNICATION MESSAGE STRUCTURE
`
`Page 11
`5 february 1993
`
`3 COMMUNICATION MESSAGE STRUCTURE
`
`3.1 Protocol Messages (POLL, ACK, ACK-NODATA, NAK, UP-ACK,
`
`Node Status Byte)
`
`slaves and
`its
`interrogate
`The POlL message is used by a master to
`determine
`if the slave
`Is alive, and If so, to solicit data. The
`format of the poll message Is:
`DLE,STX,ADDR,SER,POLL,PRI,DLE,ETX,CRC
`where: DLE = ASCII character 10H
`STX = ASCII character 02H
`ADDR = Address of polled node
`SER = Serial number of message
`POLL ~ Function code 8SH
`PRI = Priority of requested data
`DLE = ASCII character 10H
`ETX = ASCII character 03H
`CRC = Cyclic R~tundancy Check - 2 bytes
`* A PRI of 0 indicates that alarms or data can be accepted;
`A PRI of 10K indicates that alarms cannot be accepted.
`
`to
`slave
`a
`is used by
`(also called DOWN-ACK) message
`The ACK
`acknowledge
`receipt of a data message (not a POLL) from its master.
`Its format Is:
`
`DLE,STX,ADDR,SER,DTA,SLV,NSB,DOWN,DLE,ETX,CRC
`
`where: DLE = ASCII character 10K
`STX = ASCII character 02K
`ADDR = Address of master node (always 0)
`SER = Serial number of message ACK'd
`DTA = function code 86H
`SLY = Local address of slave responding
`NSB = Node St~tus,Byte
`DOWN
`c Number of buffers in use
`DLE = ASCII character lOH
`ETX= ASCII character 03H
`CRC = Cyclic Redundancy Check
`The ACK-NODATA message is used by a slave to acknowledge receipt of a
`POLL
`and
`Indicate that It has no dalJ messages to respond with. The
`format is:
`,~~
`DLE,STX,ADDR,SER,NOD,SLV,NSB,DOWN,DLE,ETX,CRC
`where: DLE = ASCII character 10H
`STX = ASCII character 02H
`ADDR = Address of master node (always 0)
`SER = Serial number of message ACK'd
`NOD
`function code 87H
`SLY = Local address of slave responding
`NSB = Node Status Byte
`DOWN = Number of buffers In use
`DLE = ASCII character lOH
`
`E
`
`------.------------------------------------------------
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 CommunIcatIons User's Guide
`COMMUNICATION MESSAGE STRUCTURE
`
`Page 12
`5 February 1993
`
`ETX = ASCII character 03H
`CRC = Cyclic Redundancy Check.
`
`,
`
`',<
`
`The NAK message Is used by a slave to !indicate that a message other
`than
`a
`POLL was
`received but
`there
`Is Insufficient buffer space
`available. The format of the NAK message Is:
`OLE,STX,AOOR,SER,NAK,SLV,NSB,OOWN,OLE,ETX,CRC
`
`where: OLE = ASCII character 10H
`STX = ASCII character 02H
`AOOR = Address of master node (always 0)
`SER = Serial number of message being NAK'd
`NAK ~ Function code 95H
`SLY " Local address of slave responding
`NSB " Node Status Byte
`DOWN " Number of buffers In use
`OLE " ASCII character 10H
`ETX " ASCII character 03H
`CRC " Cyclic Redundancy Check
`The UP-ACK message Is used by the master to I n form the slave
`that It
`successfully received and buffer~d the message.
`Its format Is:
`OLE,STX,AODR,SERM,UTA,SERS,OLE,ETX,CRC
`
`where: OLE = ASCII character 10H
`STX " ASCII cliiiracter 02H
`AOOR ~ Local address of slave
`SERM = Master's'message serial number
`UTA = Function code BBH
`SERS " Serial number of message ACK'd
`OLE ~ ASCII character 10H
`ETX " ASCII character 03H
`CRC " Cyclic Redundancy Check
`Is used
`to
`inform
`the Master
`The Node Status Byte
`conditions eXisting within the slave. The bit definition
`may be found in section B.4 of thIs manual.
`
`of certain
`of this byte
`
`I I I
`! I' I
`i I
`I
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`It
`I
`I
`
`~ ! I i [!
`I
`I
`[ ,
`
`Network-3000 Communications User's Guide
`COMMUNICATION MESSAGE STRUCTURE
`
`Page 13
`5 February 1993
`
`3.2 Data Message (Global And Local)
`
`least one
`Global data messages are those which must pass through at
`master before
`reaching
`their destination. The general format for a
`global message is:
`DLE.STX,LADD.SER,DADD,SADD,CTL.DFUN,SEQ.SFUN,NSB,DATA,
`DLE, ETX, CRC
`
`where: DLE ~ ASCII character 10H
`STX = ASCII char.acter 02H
`LADD = Local address + SOH
`SER = Message serial number
`DADD ~ Destination global address
`SADD ~ Source global address
`CTL = Control byte
`DFUN ~ Destination function code
`SEQ = Application sequence number
`SFUN = Source function code
`NSB = Node status Byte
`DATA = Application-dependent
`(up to 241 bytes)
`DLE = ASCII character 10H
`ETX = ASCII character 03H
`CRC = Cyclic Redundancy Check
`
`data
`
`any nodes
`Local messages are those which do not have to pass through
`to
`reach their destination. By definition, the first node to receive
`a local message Is the destination. The format of a local message
`is
`(the bytes from LADD through NSB form the local header):
`DLE,STX,LADD,SER,DFUN,SEQ,SFUN,NSB,DATA,DLE,ETX,CRC
`
`where: DLE = ASCII character lOH
`STX ~ ASCII ch.aracter 02H
`LADD = Local atlHT'~ss
`SER ~ Message serial number
`DFUN = Destiniitlon function code.
`SEQ = Application sequence n~mber
`SFUN = Source function code
`NSB = Node Status Byte
`DATA ~ Application-dependent data
`(up to 246 bytes)
`DLE = ASCII character 10H
`ETX = ASCII character 03H
`CRC = Cyclic Redundancy Check
`* The master on a communclatlons line is always local address O.
`Slave nodes have local addresses in the range 1 through 127.
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Gu~de
`DATA TRANSFER
`
`Page 14
`5 February 1993
`
`4 DATA TRANSFER
`
`a
`in
`transferred between nodes
`This chapter discusses how data is
`NETWORK-3000
`configuration.
`Some of
`the
`,data is required for the
`operation of
`the network while other data
`is used
`to
`support
`application specific. programs. Each of the sub-chapters will discuss
`the purpose as well as the format and error codes, where appropriate,
`of the specific data transfer technique.
`
`4.1 Alarm Handling
`
`types of alarm
`two
`supports
`The alarm system of the Network-3000
`signals: Aralog and Logical Alarm Signals. Analog Alarms sup~ort the
`following types of conditions:
`a. High Alarm - occurs when the value of the signal
`exceeds the applicationdefll)ed high 11mit. A
`Return-To-Normal occurs when;tb~ signal value falls below
`the high limit minus the hlgh'deadband.
`
`I ,
`
`b. Low Alarm - occurs when the Value of the signal
`decreases below the application defined low limit. A
`Return-To-Normal occurs when the signal value falls above
`the low limit pI us the low deadband.
`
`c. High/High Alarm - occurs when the value of the signal
`exceeds the application defined high/high limit. A
`Return-To-Normal occurs when the signal value falls below
`the high/high limit minus the high deadband.
`
`d. Low/Low Alarm - occurs when the value of the signal
`decreases below the application defined low/low limit. A
`Return-To-Normal occurs when the signal value falls above
`the low/low limit plus the low deadband.
`
`Logical Alarms support the following types of conditions:
`
`a. True State Alarm - 'occurs when the value of the signal
`is TRUE. The Return-To-Normal oc~urs when the signal
`becomes FALSE.
`b. False State Alarm - occ~rst'hen the value of the
`signal is FALSE. The Return-Ta-Normal occurs when the
`signal becomes TRUE.
`
`c. Change Of State Alarm - occurs when the signal value
`goes from TRUE to False or from FALSE to TRUE. The
`Return-To-Normal occurs when the alarm is acknowledged.
`
`the Return-To-Normal Alarm,
`support
`Both Logical and Analog Alarms
`which is specific for each of the above alarm types.
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`Network-3000 Communications User's Guide
`DATA TRANSFER
`
`Page 15
`5 February 1993
`
`and
`local master node
`its
`to
`each node
`Alarms are reported by
`(user selectable).
`Alarms
`optionally
`to a pseudomaster dev'icie
`traverse the network from node to node in an UPWARD direction until
`they arrive at
`the Network Master or CONSOLE. Each time a signal
`value is updated, the Alarm conditions are ch~cked. If the signal
`1S
`NOT
`alarm
`inhibited, and the alarm conditions are met, the signal is
`reported as in alarm and placed into a Time Stamp Buffer
`(i .e.
`a
`buffer containing alarm signals that are to be reported). With AIC
`Version 5.4, or earlier, the Time Stamp Buffer has a fixed size of 32
`entries. With AIC Version 5.41, or later, the size of the Time Stamp
`Buffer is conflgurable upto 255 entries. When
`the
`alarm signal
`is
`placed
`into
`the Time Stamp Buffer it is given a five byte Date and
`Time stamp. The time stamp has a resolution of 20 milliseconds. Upon
`each poll by the local master, alarm reports (if present) in the slave
`are transmitted.
`
`from one or more
`The local master, upon receipt of alarm report(s)
`slaves, places
`the received alarm reports in the circular iCompaction
`List. More
`than 1 alarm may
`fit
`in
`a
`communicatiori
`buffer.
`Therefore,
`alarms from the local master and/or one or more 'slaves may
`be placed in a single communication buffer
`for
`transmission
`to
`the
`next
`level of
`the network hierarchy. The compaction schem. reduces
`the number of communication buffers required for alarm
`reporting and
`allows
`communication buffers
`to b~~ome available
`for more alarm
`signals to be received. Alarms are. tl'~,jcallY reported as they occur,
`however in a node where all alarms'ha~e been reported a periodic timer
`is used to allow the alarm reporting task
`to check
`the Time Stamp
`Buffer.
`
`receives.
`it
`the alarm signals
`The Network Master may acknowledge
`This has NO effect on the normal operation of the alarm system. When
`a node receives an alarm acknowledgement for an alarm
`report
`it has
`initiated,
`the alarm acknowledge state
`for the signal is cleared.
`More than one
`acknowledge may be
`transmitted
`in one
`acknowledge
`message.
`However, multiple acknowledge to one signal has no meaning.
`The node processing an alarm acknowledge must
`respond;
`the
`response
`has
`a
`single error code
`indicating whether or not
`the alarm
`acknowledge was successful.
`
`is
`A node may be sent the Alarm Initialization Request. The purpose
`to have
`the node generate alarm reports for all signals which are in
`the Alarm Acknowledge' state (I.e.
`those signals which have not been
`acknowledged yet).
`The
`alarm
`system will
`respond
`that
`it has
`successfully completed the Initialization process. The
`actual
`alarm
`reports will be transmitted upon subsequent polls.
`
`Alarm reports have a higher prioritY,than all other messages queued to
`go up;
`improved Alarm
`response
`f~", realized
`in
`this way. Alarm
`messages are throttled to prevent a ~oae from becoming overwhelmed.
`The poll message priority byte is used to inform a slave node whether
`or not an alarm report message may be transmitted.
`
`- " - - - - - - - -
`
`IPR2017-00216
`SIPCO, LLC
`Exhibit 2019
`
`

`

`~
`
`I
`~ I
`! I ,
`It " I
`I
`~ ,
`I
`I
`
`II.
`
`f [
`I I
`
`Network-3000 Communications User's Guide
`DATA TRANSFER
`
`Page 16
`5 February 1993
`
`When alarms are being reported via a pseudo slave port as well as via
`the
`slave port,
`if either port ceases
`to accept alarms (due to
`throttling, communication failure, etc.) reporting will
`continue
`to
`the operational master or pseudo master ONLY. After the failure is
`repaired, alarm reporting will resume with the next alarm which occurs
`being reported to both ports. Therefore, if alarms can be reported to
`either port, alarm gathering will continue.
`If neither port
`is
`polling for alarms, the alarm system ,ill cease gathering alarms until
`alarm polling is resumed. When
`tWQ pb;rts are accepting alarms
`the
`~axlmum. rate of alarm reporting is Jlmltedby the slowest port; this
`1S partlcularly noticeable when
`the
`slave port
`Is
`a 250kb data
`highway.
`.
`
`4.1.1 A