CN106656438A - Method for generating and editing GOOSE message sequence - Google Patents
Method for generating and editing GOOSE message sequence Download PDFInfo
- Publication number
- CN106656438A CN106656438A CN201710001941.0A CN201710001941A CN106656438A CN 106656438 A CN106656438 A CN 106656438A CN 201710001941 A CN201710001941 A CN 201710001941A CN 106656438 A CN106656438 A CN 106656438A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- value
- sequence
- 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.)
- Granted
Links
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention relates to a method for generating and editing a GOOSE message sequence. The method is characterized by comprising the following steps: (1) generating the message sequence: storing the message sequence by using a composite link list, wherein each frame of message is a node (pFNode) in the composite link list (SList), and editing the message sequence by means of pFNode replication, and insertion and deletion operations of the composite link list, wherein the pFNode comprises: a context (context) of a message structure, a pointer (pnext) appointing to the next pFNode, a time interval (ts) with the next frame of message and a termination condition (condition). By adoption of the method provided by the invention, the problem relay protection personnel cannot conveniently and efficiently edit the message sequence when performing a communication fault tolerance test on a relay protection device is solved.
Description
Technical field
The present invention relates to a kind of generation of GOOSE message sequence and edit methods.
Background technology
Communication process refers to communicating pair (or in many ways, such as SV is subscribed to and is multicast) in order to complete certain function or mesh
And carry out a series of communication messages interaction process, it can be seen that communication process has four elementses, respectively communication message
1 sender and recipients, the content of communication message, and the time that communication message sends.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 be followed strictly.
For GOOSE message test, the sequence of message for sending is a communication process, and sender and recipients pass through group
Broadcast address or APPID realizes association (because GOOSE belongs to cast communication, not proper recipient).Message sends
Time there are two concepts, one is the absolute time that message sends, and two is the relative time that message sends, i.e., upper with adjacent
The time interval of one frame message.Context environmental defines the rule that adjacent two frames GOOSE message has to comply with some fields
Then, according to the regulation of IEC61850, the context environmental rule of GOOSE message is as follows：1) when restarting, stnum=1, sqnum=
1；2) when without new events, stnum compares the stnum of former frame message and keeps constant, and sqnum compares the squnm of former frame message
Plus 1, adjacent two frames message time period is T0；3) during new events, stnum compares the stnum of former frame message plus 1, and sqnum is
0, afterwards 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 the maxTime defined in SCD file, and T1 is the minTime defined in SCD file, and T2 is the T1, T3 of twice
For the T2 of twice.
For a long time, never a kind of tester can enter edlin for GOOSE message sequence, preferably at most can only
Sequence of message has been automatically generated according to some rules, afterwards can only be to the content of certain frame message and the time of adjacent two frames message
It is spaced into edlin.Jing market surveys, also not yet have a kind of relay protection GOOSE message tester to enter to sequence of message
Edlin.
The content of the invention
It is an object of the invention to provide a kind of generation of GOOSE message sequence and edit methods, can not increase work
On 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, it is particular in that, comprises the steps：
(1) generation of sequence of message：
It is a node in compound chained list (SList) per frame message using compound storage of linked list sequence of message
(pFNode), replicated using pFNode and be combined the insertion of chained list and deletion action realizes the editor of sequence of message；
Wherein pFNode is contained within：The content (context) of message structure, the pointer for pointing to next one pFNode
(pnext) and next frame message time interval (ts), termination condition (condition)；
The critical field contained in wherein context：State number (stNum) and serial number (sqNum), the value of critical field
Automatically generated according to critical field create-rule, or the value that write is specified is edited to it；Wherein stNum's automatically generates rule
It is then：The stNum of the previous frame message being adjacent 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, if reaching the maximum of field, for 1；
Wherein the value of ts is automatically generated according to the value of the sqNum of the context of current pFNode, or it is edited writes
Enter the value specified, the rule for automatically generating is：If sqNum is 0 or 1, ts are T1, if it is T2 that sqNum is 2, ts, such as
Fruit sqNum is 3, then ts is T3, if sqNum is other values, ts is T0；
The order of wherein sequence of message is pointed out by pnext, or pnext later points to the node shape in a compound link
Chained list is circularized, or pnext shows EOS for sky；When annular chain meter is formed, arrange certain pFNode's
Condition carrys out end loop, and the content of condition includes that node (pout) is jumped out in cycle-index (count) and circulation, when
When the count of the pFNode meets condition, jump back out at pout, if pout is sky, EOS；
(2) editor of sequence of message：
The copy function of sequence of message：Each node in selected sequence of message is replicated into a, will to replicate section
Point be sequentially inserted into after the node of specified location, node insertion when, in addition to stNum, sqNum, ts and condition other
The value of attribute keeps constant, and the value of stNum, sqNum and ts is selected according to user, specifically there is two kinds of operator schemes：One is foundation
Automatically generate rule and produce new value, two are to maintain original value, and the value of condition is removed；The node of specified location is original
Subsequent node stNum, sqNum and ts value according to user select, specifically have two kinds of operator schemes：One is according to automatically raw
New value is produced into rule, two are to maintain original value；
The deletion action of sequence of message：Each node in selected sequence of message is deleted from chained list, is selected
Last node after all nodes, in addition to stNum, sqNum and ts attribute other attributes value keep it is constant, and
The value of stNum, sqNum and ts is selected according to user, specifically there is two kinds of operator schemes：One is new according to rule generation is automatically generated
Value, two are to maintain original value；
The circulate operation of sequence of message：The pout of the condition of last node of selected sequence of message is set
The pnext of the node is set to, the number of times that the count of the condition of the node is set to circulate, by the pnext of the node
It is set to first node of selected sequence of message.
The inventive method solves relay protection personnel when communication fault-tolerance test is carried out to protective relaying device, it is impossible to
The problem for carrying out sequence of message editor of convenient and efficient, the pioneering sequence of message editor of the method, changing in the past can only be for single
Frame message content enters the limitation of edlin, on the premise of workload is not increased completely, significantly increases GOOSE message survey
The comprehensive and diversity of examination.The blank of protective relaying device message fault-tolerance test is filled up.The inventive method is specifically made
The edit methods of a set of GOOSE message sequence are determined, the perfect generating mode of GOOSE message test cases, so as to 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 be 1 be shown to be according to automatically generate rule produce context in critical field and ts value, take
To be worth show for 2 and do not automatically generate, using original value.
Termination condition structure is defined：
If the first node of composite link SList is phead, then and phead->Pnext can travel through whole SList, terminate
The pnext for being labeled as certain node is sky.
The implementation method of duplication is as follows：
If duplicated first node is pbeg, last node is pend, and each node is removed during duplication
The value of condition, the model of juxtaposition each node is 2；If replicate after need insert position at previous node be
Pin1, latter node is pin2；
1) pin1- is put>Pnext is pbeg；
2) pend- is put>Pnext is pin2；
If 3) operator scheme is selected to keep original value, operation to complete, otherwise perform 4)；
4) begin stepping through from pin1, till pend, the model for putting each node is 1.
The implementation method of circulation is as follows：
If the start node of circulation is pbeg, end node is pend, and cycle-index is n；
1) pend- is put>condition->Count is n；
2) pend- is put>condition->Pout is pend->pnext；
3) pend- is put>Pnext is pbeg；
The implementation method of deletion is as follows：
If the node more than one chained list that the needs selected are deleted, the 2nd, 3,4,8,9 nodes are such as deleted, then can be torn open
It is divided into deletion action independent twice, i.e., the 2nd, 3,4 nodes for once, the 8th, 9 nodes are for once.The method is selected to delete
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, perform 2), otherwise perform 5)；
2) phead is put for pend->Pnext, if phead is sky, operation is completed, otherwise performed 3)；
If 3) operator scheme is selected to keep original value, operation to complete, otherwise perform 4)；
4) begin stepping through from phead, till chain end of list (EOL), the model for putting each node is 1, and operation is completed；
5) pin- is put>Pnext is pend->Pnext, if operator scheme selects, to keep original value, to have operated
Into otherwise performing 6)；
6) from pin->Pnext begins stepping through, and till chain end of list (EOL), the model for putting each node is 1, has been operated
Into.
The implementation method of transmission is as follows：
If the node that currently will be sent is pnode, its previous node is pprev：
1) it is sky to put pprev, and pnode is phead；
If 2) pnode is sky, transmission terminates, else if the model of pnode is 1, then performs 3), otherwise performs
4)；
3) pnode- is produced according to transmission rule>The value of the critical field of context, and organize message to be transmitted, hold
Row 5)；
4) directly tissue message is transmitted, and performs 5)；
5) it is pnode to put pprev, if pnode->condition->Count is not 0, then perform 6), is otherwise performed
8)；
6)pnode->condition->Sndcnt adds 1, if pnode->condition->Sndcnt is equal to pnode->
condition->7) count, then perform, and otherwise performs 8)；
7) pnode is put for pnode->condition->2) pout, perform；
8) pnode is put for pnode->2) pnext, perform.
Claims (1)
1. a kind of generation of GOOSE message sequence and edit methods, it is characterised in that comprise the steps：
(1) generation of sequence of message：
It is a node (pFNode) in compound chained list (SList) per frame message using compound storage of linked list sequence of message, it is sharp
Replicated with pFNode and be combined the insertion of chained list and deletion action realizes the editor of sequence of message；
Wherein pFNode is contained within：The content (context) of message structure, the pointer (pnext) for pointing to next one pFNode and
The time interval (ts) of next frame message, termination condition (condition)；
The critical field contained in wherein context：State number (stNum) and serial number (sqNum), the value of critical field according to
Critical field create-rule is automatically generating, or the value that write is specified is edited to it；Wherein stNum's automatically generates rule
It is：The stNum of the previous frame message being adjacent is identical；The rule that automatically generates of sqNum is：The previous frame message more adjacent than its
SqNum it is big by 1, if reach field maximum, for 1；
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 to it and referred to
Fixed value, the rule for automatically generating is：If sqNum is 0 or 1, ts are T1, if it is T2 that sqNum is 2, ts, if
SqNum is 3, then ts is T3, if sqNum is other values, ts is T0；
The order of wherein sequence of message is pointed out by pnext, or the node that pnext is later pointed in a compound link forms ring
Shape chained list, or pnext shows EOS for sky；When annular chain meter is formed, the condition for arranging certain pFNode comes
End loop, the content of condition includes that node (pout) is jumped out in cycle-index (count) and circulation, when the pFNode's
When count meets condition, jump back out at pout, if pout is sky, EOS；
(2) editor of sequence of message：
The copy function of sequence of message：Each node in sequence of message that will be selected replicates a, by the node for replicating according to
It is secondary to be inserted into after the node of specified location, node insertion when, other attributes in addition to stNum, sqNum, ts and condition
Value keep constant, the value of stNum, sqNum and ts is selected according to user, specifically there is two kinds of operator schemes：One is according to automatically
Create-rule produces new value, and two are to maintain original value, and the value of condition is removed；After the node of specified location is original
The value of stNum, sqNum and ts of continuous node is selected according to user, specifically there is two kinds of operator schemes：One is that foundation automatically generates rule
New value is then produced, two are to maintain original value；
The deletion action of sequence of message：Each node in sequence of message that will be selected is deleted from chained list, it is chosen most
All nodes after latter node, the value of other attributes keeps constant in addition to stNum, sqNum and ts attribute, and stNum,
The value of sqNum and ts is selected according to user, specifically there is two kinds of operator schemes：One is the value new according to rule generation is automatically generated,
Two are to maintain original value；
The circulate operation of sequence of message：The pout of the condition of last node of selected sequence of message is set to
The pnext of the node, the number of times that the count of the condition of the node is set to circulate arranges the pnext of the node
First node of the sequence of message to select.
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 true CN106656438A (en) | 2017-05-10 |
| CN106656438B 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通信软件设计及实现", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106656438B (en) | 2019-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105138501B (en) | A kind of configurable dynamic report generation method and system | |
| CN107729366A (en) | A kind of pervasive multi-source heterogeneous large-scale data synchronization system | |
| CN100588204C (en) | A kind of real-time viewing platform of communication network simulation tool and its implementation | |
| DE102005016032A1 (en) | Portable distributed application frame | |
| CN106789157A (en) | The hardware resource management method of pile system and stacked switch | |
| CN107632817A (en) | A kind of Mobile solution efficient iterative Spark frameworks | |
| CN106384225A (en) | Method for batch transmission of point-to-point notifications based on customized variable fields | |
| CN110502228A (en) | A method of VR content creation and generation VR application program based on cloud platform | |
| CN108803996A (en) | Graphic file processing method, device, computer equipment and storage medium | |
| CN108920141A (en) | The Automatic Typesetting generation method and generator of business form based on layout templates | |
| CN106656438A (en) | Method for generating and editing GOOSE message sequence | |
| CN103995886B (en) | A kind of various dimensions product-design knowledge pushes framework and construction method | |
| CN112186739B (en) | Sequential control operation order non-power-outage checking method and system | |
| CN100504771C (en) | Method and system for creating application program interface | |
| CN109726446B (en) | Automatic mapping system of self-adaptive distribution network single line diagram | |
| CN107727959A (en) | Satellite test method based on test bag | |
| CN101615188A (en) | A kind of method and apparatus of importing multi-source data into data template | |
| CN115098567B (en) | Low-code platform data transmission method based on BI platform | |
| CN106781796B (en) | Communication protocol training method and system combined with application scene and scene association method | |
| CN109344487A (en) | A kind of components replacement method based on Feature Mapping | |
| CN109151740A (en) | Campus message push system and information push method | |
| CN102065240B (en) | Title generator for automatically broadcasting title | |
| CN113054659B (en) | Electric energy wisdom delivery system | |
| CN102739970B (en) | A kind of preparation method and system of material captions | |
| Conlin et al. | Division of Labor Following the Evolution of Multicellularity Promotes Entrenchment |
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 |