CN106656438B - A kind of generation of GOOSE message sequence and edit methods - Google Patents
A kind of generation of GOOSE message sequence and edit methods Download PDFInfo
- Publication number
- CN106656438B CN106656438B CN201710001941.0A CN201710001941A CN106656438B CN 106656438 B CN106656438 B CN 106656438B CN 201710001941 A CN201710001941 A CN 201710001941A CN 106656438 B CN106656438 B CN 106656438B
- Authority
- CN
- China
- Prior art keywords
- message
- sequence
- node
- value
- sqnum
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 241000272814 Anser sp. Species 0.000 title claims abstract description 18
- 150000001875 compounds Chemical class 0.000 claims abstract description 12
- 238000003780 insertion Methods 0.000 claims abstract description 5
- 230000037431 insertion Effects 0.000 claims abstract description 5
- 241001125929 Trisopterus luscus Species 0.000 claims description 10
- 230000006854 communication Effects 0.000 abstract description 11
- 238000012360 testing method Methods 0.000 abstract description 8
- 238000004891 communication Methods 0.000 abstract description 7
- 230000001681 protective effect Effects 0.000 abstract description 3
- 230000007613 environmental effect Effects 0.000 description 3
- 101100520142 Caenorhabditis elegans pin-2 gene Proteins 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 101001128814 Pandinus imperator Pandinin-1 Proteins 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 101150037009 pin1 gene Proteins 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/24—Testing correct operation
- H04L1/242—Testing correct operation by comparing a transmitted test signal with a locally generated replica
- H04L1/244—Testing correct operation by comparing a transmitted test signal with a locally generated replica test sequence generators
Abstract
The present invention relates to a kind of generation of GOOSE message sequence and edit methods.Its main feature is that, include the following steps: the generation of (1) sequence of message: using compound storage of linked list sequence of message, every frame message is a node (pFNode) in compound chained list (SList), and the editor of sequence of message is realized using pFNode duplication and the insertion of compound chained list and delete operation；Wherein contain in pFNode: the content (context) of message structure, the time interval (ts) of the pointer (pnext) for being directed toward next pFNode and next frame message, termination condition (condition).The method of the present invention solve relay protection personnel to protective relaying device carry out communication fault-tolerance test when, can not convenient and efficient carry out sequence of message editor the problem of.
Description
Technical field
The present invention relates to a kind of generation of GOOSE message sequence and edit methods.
Background technique
Communication process refers to communicating pair (or multi-party, to be multicast as SV is subscribed to) to complete certain function or mesh
And a series of communication messages interaction of progress process, it can be seen that communication process is there are four element, respectively communication message
1 sender and recipients, the time that the content and communication message of communication message issue.Communication process have one it is important
Concept is exactly context environmental, that is to say, that the appearance order of various messages is that there are strict requirements, and must follow strictly.
It is tested for GOOSE message, the sequence of message of sending is a communication process, and sender and recipients pass through group
It broadcasts address or APPID realizes association (because GOOSE belongs to cast communication, there is no proper recipients).Message issues
Time there are two concepts, first is that the absolute time that message issues, second is that the relative time that message issues, i.e., with it is adjacent upper
The time interval of one frame message.Context environmental defines the rule that adjacent two frames GOOSE message has to comply in certain fields
Then, according to the regulation of IEC61850, the context environmental rule of GOOSE message is as follows: when 1) restarting, stnum=1, sqnum=
1；2) when without new events, stnum is remained unchanged compared to the stnum of former frame message, and sqnum compares the squnm of former frame message
Add 1, adjacent two frames message time period is T0；3) when new events, stnum adds 1, the sqnum to be compared to the stnum of former frame message
0, later according to 2) sending, but the time interval of 4 frame messages after new events and its former frame message be according to this T1, T1, T2,
T3；Wherein T0 is maxTime defined in SCD file, and T1 is minTime defined in SCD file, the T1, T3 that T2 is twice
For twice of T2.
For a long time, never a kind of test equipment can be edited for GOOSE message sequence, preferably at most can only
Automatically generated sequence of message according to certain rules, later can only content and adjacent two frames message to certain frame message time
It is edited at interval.Through market survey, also there has been no a kind of relay protection GOOSE message test equipment can to sequence of message into
Edlin.
Summary of the invention
The object of the present invention is to provide a kind of generation of GOOSE message sequence and edit methods, can not increase work
Under the premise of amount, the comprehensive and diversity of GOOSE message test is significantly increased.
A kind of generation of GOOSE message sequence and edit methods, its special feature is that, include the following steps:
(1) generation of sequence of message:
Using compound storage of linked list sequence of message, every frame message is a node in compound chained list (SList)
(pFNode), the editor of sequence of message is realized using pFNode duplication and the insertion of compound chained list and delete operation；
Wherein contain in pFNode: the content (context) of message structure, the pointer for being directed toward next pFNode
(pnext), with the time interval of next frame message (ts), termination condition (condition)；
The critical field wherein contained in context: state number (stNum) and serial number (sqNum), the value of critical field
It is automatically generated according to critical field create-rule, or edits the specified value of write-in to it；Wherein stNum automatically generates rule
Be then: the stNum of previous frame message adjacent thereto is identical；The rule that automatically generates of sqNum is: the previous frame report more adjacent than its
The sqNum of text is big by 1, is 1 if reaching the maximum value of field；
Wherein the value of ts is automatically generated according to the value of the sqNum of the context of current pFNode, or is edited and write to it
Enter specified value, the rule automatically generated is: if sqNum is 0 or 1, ts T1, if sqNum is 2, ts T2, such as
Fruit sqNum is 3, then ts is T3, if sqNum is other values, ts T0；
Wherein the sequence of sequence of message by pnext point out or pnext turn one's head be directed toward a compound link in node shape
It circularizes chained list or pnext is that sky shows the sequence ends；When forming annular chain meter, it is arranged some pFNode's
Condition carrys out end loop, and the content of condition includes that cycle-index (count) and circulation jump out node (pout), when
It when the count of the pFNode meets condition, jumps back out at pout, if pout is sky, the sequence ends；
(2) editor of sequence of message:
The copy function of sequence of message: each of selected sequence of message node is replicated into portion, by the section of duplication
Point be sequentially inserted into after the node of designated position, node insertion when, in addition to stNum, sqNum, ts and condition other
The value of attribute remains unchanged, and the value of stNum, sqNum and ts are selected according to user, and specific there are two types of operation modes: first is that foundation
It automatically generates rule and generates new value, two are to maintain original value, and the value of condition is removed；The node of designated position is original
The value of stNum, sqNum and ts of subsequent node selected according to user, specific there are two types of operation modes: first is that according to automatic raw
New value is generated at rule, two are to maintain original value；
The delete operation of sequence of message: each of selected sequence of message node is deleted from chained list, is selected
The last one node after all nodes, the value of other attributes remains unchanged in addition to stNum, sqNum and ts attribute, and
The value of stNum, sqNum and ts are selected according to user, and specifically there are two types of operation modes: first is that generating newly according to rule is automatically generated
Value, two are to maintain original value；
The circulate operation of sequence of message: the pout of the condition of the last one node of selected sequence of message is set
It is set to the pnext of the node, the count of the condition of the node is set to the number of circulation, by the pnext of the node
It is set as first node of selected sequence of message.
The method of the present invention solves relay protection personnel when carrying out communication fault-tolerance test to protective relaying device, can not
The problem of carry out sequence of message editor of convenient and efficient, this method initiate sequence of message editor, and changing in the past can only be for single
The limitation that frame message content is edited significantly increases GOOSE message survey under the premise of not increasing workload completely
The comprehensive and diversity of examination.The blank of protective relaying device message fault-tolerance test is filled up.The method of the present invention is specifically to make
The edit methods of a set of GOOSE message sequence are determined, the perfect generating mode of GOOSE message test cases, thus effectively complete
It has been apt to the edit methods of GOOSE message sequence, has enriched test cases.
Specific embodiment
Embodiment 1:
The site type definition of compound chained list:
The value of model is shown to be for 1 according to the value for automatically generating critical field and ts in rule generation context, takes
Value shows not automatically generate for 2, uses original value.
The definition of termination condition structure:
If the first node of composite link SList is phead, then and phead- > pnext can traverse entire SList, terminate
Pnext labeled as some node is sky.
The implementation method of duplication is as follows:
If first node copied is pbeg, the last one node is pend, and when duplication removes each node
The value of condition, the model of each node of juxtaposition are 2；If the previous node at the position for needing to be inserted into after duplication is
Pin1, the latter node are pin2；
1) setting pin1- > pnext is pbeg；
2) setting pend- > pnext is pin2；
3) if operation mode, which is selected as, keeps original value, completion is operated, is otherwise executed 4)；
4) it is begun stepping through from pin1, until pend, the model for setting each node is 1.
The implementation method of circulation is as follows:
If the start node of circulation is pbeg, end node pend, cycle-index n；
1) setting pend- > condition- > count is n；
2) setting pend- > condition- > pout is pend- > pnext；
3) setting pend- > pnext is pbeg；
The implementation method of deletion is as follows:
If the node more than one chained list that selected needs are deleted such as is deleted the 2nd, 3,4,8,9 node, then can be torn open
Be divided into independent delete operation twice, i.e., the the 2nd, 3,4 node be it is primary, the 8th, 9 node is primary.The method is to delete choosing
In continuous nodes, if first node chosen is pbeg, the previous node of first node chosen is pin, finally
One node chosen is pend:
1) if pin is sky, executes 2), otherwise execute 5)；
2) setting phead is that pend- > pnext operates completion, otherwise execute 3) if phead is sky；
3) if operation mode, which is selected as, keeps original value, completion is operated, is otherwise executed 4)；
4) it is begun stepping through from phead, until chain end of list (EOL), the model for setting each node is 1, and operation is completed；
5) setting pin- > pnext is that pend- > pnext has been operated if operation mode, which is selected as, keeps original value
At otherwise executing 6)；
6) it is begun stepping through from pin- > pnext, until chain end of list (EOL), the model for setting each node is 1, has been operated
At.
The implementation method of transmission is as follows:
If the node that will currently send is pnode, previous node is pprev:
1) pprev is set as sky, pnode phead；
If 2) pnode is sky, transmission terminates, else if the model of pnode is 1, then executes 3), otherwise executes
4)；
3) value for generating the critical field of pnode- > context according to rule is sent, and message is organized to be sent, it holds
Row 5)；
4) directly tissue message is sent, and is executed 5)；
5) setting pprev is 6) pnode is executed, otherwise executed if pnode- > condition- > count is not 0
8)；
6) pnode- > condition- > sndcnt adds 1, if pnode- > condition- > sndcnt be equal to pnode- >
7) condition- > count is then executed, is otherwise executed 8)；
7) setting pnode is pnode- > condition- > pout, is executed 2)；
8) setting pnode is pnode- > pnext, is executed 2).
Claims (1)
1. generation and the edit methods of a kind of GOOSE message sequence, which comprises the steps of:
(1) generation of sequence of message:
Using compound storage of linked list sequence of message, every frame message is a node pFNode in compound chained list SList, is utilized
PFNode duplication and the insertion of compound chained list and delete operation realize the editor of sequence of message；
Wherein contain in pFNode: the content context of message structure, the pointer pnext for being directed toward next pFNode, with it is next
Time interval ts, the termination condition condition of frame message；
The critical field wherein contained in context: state stNum and serial number sqNum, the value of critical field is according to key
Field create-rule automatically generates, or edits to it specified value of write-in；Wherein the rule that automatically generates of stNum is: with
The stNum of its adjacent previous frame message is identical；The rule that automatically generates of sqNum is: the previous frame message more adjacent than its
SqNum is big by 1, is 1 if reaching the maximum value of field；
Wherein the value of ts is automatically generated according to the value of the sqNum of the context of current pFNode, or is edited write-in to it and referred to
Fixed value, the rule automatically generated is: if sqNum is 0 or 1, ts T1, if sqNum is 2, ts T2, if
SqNum is 3, then ts is T3, if sqNum is other values, ts T0；
Wherein the sequence of sequence of message forms ring by the node that pnext is pointed out or pnext turns one's head to be directed toward in a compound chained list
Shape chained list or pnext are that sky shows the sequence ends；When forming annular chain meter, the condition that some pFNode is arranged comes
End loop, the content of condition includes that cycle-index count and circulation jump out node pout, when the pFNode's
It when count meets condition, jumps back out at pout, if pout is sky, the sequence ends；
(2) editor of sequence of message:
The copy function of sequence of message: each of selected sequence of message node is replicated it is a, by the node of duplication according to
Secondary to be inserted into after the node of designated position, node is in insertion, other attributes in addition to stNum, sqNum, ts and condition
Value remain unchanged, the value of stNum, sqNum and ts is selected according to user, and specific there are two types of operation modes: first is that according to automatic
Create-rule generates new value, and two are to maintain original value, and the value of condition is removed；After the node of designated position is original
The value of stNum, sqNum and ts of continuous node are selected according to user, and specific there are two types of operation modes: first is that according to rule are automatically generated
New value is then generated, two are to maintain original value；
The delete operation of sequence of message: each of selected sequence of message node is deleted from chained list, it is chosen most
All nodes after the latter node, the value of other attributes remains unchanged in addition to stNum, sqNum and ts attribute, and stNum,
The value of sqNum and ts is selected according to user, and specific there are two types of operation modes: first is that new value is generated according to rule is automatically generated,
Two are to maintain original value；
The circulate operation of sequence of message: it sets the pout of the condition of the last one node of selected sequence of message to
The pnext of the node sets the count of the condition of the node to the number of circulation, and the pnext of the node is arranged
For first node of selected sequence of message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710001941.0A CN106656438B (en) | 2017-01-03 | 2017-01-03 | A kind of generation of GOOSE message sequence and edit methods |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710001941.0A CN106656438B (en) | 2017-01-03 | 2017-01-03 | A kind of generation of GOOSE message sequence and edit methods |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106656438A CN106656438A (en) | 2017-05-10 |
| CN106656438B true CN106656438B (en) | 2019-07-23 |
Family
ID=58838294
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710001941.0A Active CN106656438B (en) | 2017-01-03 | 2017-01-03 | A kind of generation of GOOSE message sequence and edit methods |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106656438B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101635682A (en) * | 2009-08-05 | 2010-01-27 | 中兴通讯股份有限公司 | Storage management method and storage management system |
| CN103731368A (en) * | 2012-10-12 | 2014-04-16 | 中兴通讯股份有限公司 | Method and device for processing message |
| CN104979904A (en) * | 2015-05-22 | 2015-10-14 | 国网智能电网研究院 | Service message processing method applicable to power communication test platform |
-
2017
- 2017-01-03 CN CN201710001941.0A patent/CN106656438B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101635682A (en) * | 2009-08-05 | 2010-01-27 | 中兴通讯股份有限公司 | Storage management method and storage management system |
| CN103731368A (en) * | 2012-10-12 | 2014-04-16 | 中兴通讯股份有限公司 | Method and device for processing message |
| CN104979904A (en) * | 2015-05-22 | 2015-10-14 | 国网智能电网研究院 | Service message processing method applicable to power communication test platform |
Non-Patent Citations (1)
| Title |
|---|
| 变电站IED的GOOSE通信软件设计及实现;肖韬;《中国优秀硕士学位论文全文数据库信息科技辑》;20100415;5-18 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106656438A (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103617576B (en) | General fault detecting and maintenance method for equipment | |
| CN105549982B (en) | A kind of development of automation platform based on model configuration | |
| CN106953918B (en) | Master-slave station programmed control system and method based on universal service protocol | |
| CN104143124B (en) | Scheduling meeting method and project management system | |
| CN100588204C (en) | A kind of real-time viewing platform of communication network simulation tool and its implementation | |
| CN107729366A (en) | A kind of pervasive multi-source heterogeneous large-scale data synchronization system | |
| CN102830951B (en) | A kind of quick satellite multi-parameter instruction notes disposal route | |
| CN106155658A (en) | The behavior tree editing machine realized based on U3D Plugin Mechanism | |
| CN104318006B (en) | A kind of optimization method of virtual terminals of intelligent substation design | |
| CN110704047B (en) | Dynamic visual configuration system and operation management method based on same | |
| CN106250514B (en) | Transnational method of data synchronization based on Mysql database and SQL log | |
| CN104933535A (en) | An intelligent monitoring operation ticket management method and a system thereof | |
| CN104917293B (en) | Topological mapping method for secondary virtual and physical links of intelligent substation | |
| CN107632817A (en) | A kind of Mobile solution efficient iterative Spark frameworks | |
| CN106656438B (en) | A kind of generation of GOOSE message sequence and edit methods | |
| CN105225164A (en) | Intelligent substation GOOSE virtual secondary circuit graphic method | |
| CN105955828B (en) | A kind of Real-time co-authoring consistency maintaining method for supporting string operation | |
| CN104836846A (en) | Energy interconnection communication network architecture system based on SDN technology | |
| CN110061985A (en) | A kind of method of online classroom remote real-time synchronous movement and playback | |
| CN109726446B (en) | Automatic mapping system of self-adaptive distribution network single line diagram | |
| CN111163128B (en) | Web front-end communication management method based on qWebchannel pipeline in QT | |
| CN103001864B (en) | Information forwarding method based on International Electrotechnical Commission (IEC) 61850data set | |
| CN107133275A (en) | The method that a kind of regulation and control main website telemechanical point table is audited automatically | |
| CN106528157A (en) | State machine workflow engine based on SCXML standard | |
| CN112698774A (en) | B/S architecture multi-expert online negotiation plotting system based on WebGIS |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |