A method for resolving conflicts in broadcasting strategies

Abstract

The present invention belongs to the field of IP broadcast technology, and specifically discloses a method for resolving broadcast play strategy conflicts, including: S1, establishing a play strategy structure; S2, converting each play strategy into a play strategy structure; S3, judging whether there is an intersection, if there is an intersection, entering the next step, if there is no intersection, playing the strategy according to the play strategy file; S4, establishing links for the play strategies with intersections to form a strategy conflict network; S5, forming an orderly strategy sequence for all play strategy structures according to the strategy conflict network; S6, judging whether the first strategy conflict value of the strategy sequence is greater than zero, if greater than zero, deleting the first play strategy structure of the strategy sequence, if equal to zero, playing the strategy according to the strategy sequence. The application of the present invention in the field of broadcasting effectively realizes the setting of large-scale play strategies, and solves the problem of manually detecting the effectiveness of strategies when managers set play plans.

Description

Technical Field

[0001] The invention belongs to the technical field of IP broadcasting, and in particular relates to a method for resolving broadcasting play strategy conflicts. Background Art

[0002] When IP broadcasting plays multiple playback strategies specified by the user, conflicts between the multiple strategies may occur, such as playback time conflicts, playback time period conflicts, or playback mode conflicts, etc. As a result, the playback engine cannot determine the appropriate strategy among the multiple conflicting strategies.

[0003] Therefore, providing a new method for resolving broadcast play strategy conflicts is a technical problem that technical personnel in this field urgently need to solve. Summary of the invention

[0004] The purpose of the present invention is to overcome the defect of IP broadcasting in the prior art that there is a broadcast conflict, and to provide a method for resolving broadcasting play strategy conflicts.

[0005] The present invention provides a method for resolving broadcast play strategy conflicts, comprising the following steps:

[0006] S1. Establish a playback strategy structure;

[0007] S2, loading the playback strategy file, and converting each playback strategy in the playback strategy file into a playback strategy structure;

[0008] S3, compare each playback strategy structure to determine whether there is an intersection, if there is an intersection, proceed to the next step, if there is no intersection, then play the strategy according to the playback strategy file;

[0009] S4, establishing links for the playback strategies with intersections, marking them as strategy conflicts, updating the values ​​of the strategy conflicts, and forming a strategy conflict network;

[0010] S5. Form an orderly strategy sequence for all playback strategy structures according to the strategy conflict network;

[0011] S6. Determine whether the policy conflict value of the first play policy structure of the policy sequence is greater than zero. If it is greater than zero, delete the first play policy structure of the policy sequence. If it is equal to zero, play the policy according to the policy sequence.

[0012] A further solution is that the play policy structure at least includes a policy number, a play time, an occupied time period, a play mode, a play content, a policy conflict and a play priority.

[0013] A further solution is that in step S3, determining whether there is an intersection is specifically:

[0014] Determine whether there is any intersection based on the playback time or occupied time period in each playback strategy structure.

[0015] A further solution is that in step S4, the initial value of the policy conflict is zero, and the value of the policy conflict increases by 1 each time a link is added to the playback strategy.

[0016] A further solution is to set a playback priority according to the importance of each playback strategy, where the playback priority is a positive integer from 1 to n. The higher the importance of the playback strategy, the greater the playback priority.

[0017] A further solution is that in step S5, if the policy conflict values ​​are the same, the sizes of the play priorities are compared, and the smaller the play priority, the higher the position in the policy sequence.

[0018] A further solution is that in step S6, when the policy conflict values ​​of the play policy structure are all zero, the play priorities are rearranged in descending order and the policies are played according to the rearranged policy sequence.

[0019] Compared with the prior art, the present invention has the following beneficial effects:

[0020] (1) The present invention deletes the first node in the ordered nodes and updates the conflict correlation numbers of other nodes, which can quickly solve the problem of finding the key nodes in the conflict and achieve rapid conflict resolution. The application of this method in the broadcasting field effectively realizes the setting of large-scale broadcast strategies and solves the problem of manually detecting the effectiveness of strategies when managers set broadcast plans.

[0021] (2) The present invention can digitize a single playback strategy through the structural design of a single strategy node, which is convenient for analysis and comparison.

[0022] (3) The present invention uses a directed cyclic network graph to represent the conflict relationship of broadcast play strategies, and the number of conflicts of each play strategy can be clearly seen.

[0023] (4) The method of the present invention uses a combination of the conflict correlation number and priority of the policy to sort the policy nodes, which can not only quickly resolve the conflict, but also ensure the normal playback of important files. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The following drawings are only used to illustrate and explain the present invention, and are not used to limit the scope of the present invention, wherein:

[0025] Figure 1 : Flow chart of the method of the present invention;

[0026] Figure 2 : A schematic diagram of a playback strategy structure of this embodiment;

[0027] Figure 3 : Strategy conflict network diagram;

[0028] Figure 4 : Schematic diagram of playback time conflict;

[0029] Figure 5 : Schematic diagram of conflict in occupied time periods;

[0030] Figure 6 : A schematic diagram of a strategy sequence of this embodiment;

[0031] Figure 7 : The effect diagram after deleting the first playback strategy in the sequence. DETAILED DESCRIPTION

[0032] In order to make the purpose, technical solution, design method and advantages of the present invention clearer, the present invention is further described in detail by specific embodiments in conjunction with the accompanying drawings. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0033] like Figure 1 As shown, the present invention provides a method for resolving broadcast play strategy conflicts, comprising the following steps:

[0034] S1. Establish a playback strategy structure;

[0035] S2, loading the playback strategy file, and converting each playback strategy in the playback strategy file into a playback strategy structure;

[0036] S3, compare each playback strategy structure to determine whether there is an intersection, if there is an intersection, proceed to the next step, if there is no intersection, then play the strategy according to the playback strategy file;

[0037] S4, establishing links for the playback strategies with intersections, marking them as strategy conflicts, updating the values ​​of the strategy conflicts, and forming a strategy conflict network;

[0038] S5. Form an orderly strategy sequence for all playback strategy structures according to the strategy conflict network;

[0039] S6. Determine whether the policy conflict value of the first play policy structure of the policy sequence is greater than zero. If it is greater than zero, delete the first play policy structure of the policy sequence. If it is equal to zero, play the policy according to the policy sequence.

[0040] In the above, the play policy structure at least includes a policy number, a play time, an occupied time period, a play mode, a play content, a policy conflict and a play priority.

[0041] In this embodiment, the play strategy structure is as follows: Figure 2 As shown, where:

[0042] id: unique label of the strategy, the value is a globally unique integer;

[0043] File_name: The file to be played by the policy, which is the storage path of the audio file;

[0044] Play_time: The time when the strategy starts playing, which is the number of seconds from 1970 to the start time of playing;

[0045] Play_mode: Play mode, the value is 0 or 1, 0 means timed play, 1 means loop play;

[0046] Active_time: Policy validity period, the value is a date time period, such as: 20211101--20221101, which means that the playback policy is valid between November 1, 2021 and November 1, 2022, and is invalid during other periods;

[0047] Occupy_time: strategy occupancy period, the value is a time period, such as: 14:00:00--15:00:00;

[0048] Weight: policy priority, usually a number between 1 and 3. The larger the number, the higher the priority.

[0049] Link: pointer to the conflict strategy singly linked list;

[0050] Link_num: the number of conflicting strategies, the default value is 0;

[0051] Conflict_rule: points to the conflicting policy node;

[0052] Next: points to the next conflict strategy node.

[0053] In the above, Play_time: the start time of the strategy, the value is the number of seconds from 1970 to the start time of the play, which is a time representation method. Generally, the number of seconds from 0:00 on January 4, 1970 to the present can represent the current time. It is a long number, which saves storage space compared to string representation.

[0054] like Figure 3 As shown, strategy 5 has 4 conflicts, so Link_num=4.

[0055] In the above steps S3 and S4, the play time and occupied time period of each policy are checked one by one to see if they have the same play time or overlapped time periods with other policies. If so, a link is established between the two policies and the value of the link_num field is modified. Figure 4 and Figure 5 As shown. The final formation is as Figure 2 The policy conflict network diagram shown.

[0056] In the above step S5, all policy structures are sorted according to link_num and weight values, with the larger link_num at the front. If there are equal link_nums, the weights are compared and the smaller weight is placed at the front. If the weights are also equal, a random number is calculated for each and sorted according to the size of the random number. An ordered policy sequence is formed, such as Figure 6 shown.

[0057] In the above step S6, it is determined whether the link_num of the first node is greater than 0. If it is greater than 0, the first node in the sequence is deleted, and the link single linked list and link_num of all nodes connected to the node are updated. If the link_num of the first node is equal to 0, the strategy is played according to the strategy sequence. Figure 3 The results of deletion are as follows Figure 7 As shown:

[0058] If there are still nodes in the sequence whose link_num is greater than 0, jump to step (3) to sort the remaining nodes. If the link_num of all remaining nodes is equal to 0, rearrange them in order of playback priority from large to small and play the strategy according to the rearranged strategy sequence.

[0059] The embodiments of the present invention have been described above, and the above description is exemplary, not exhaustive, and is not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The selection of terms used herein is intended to best explain the principles of the embodiments, practical applications, or technical improvements in the market, or to enable other persons of ordinary skill in the art to understand the embodiments disclosed herein.

Claims

1. A method for resolving broadcast play strategy conflicts, characterized in that: The following steps are involved: S1. Establish a playback strategy structure; S2, loading the playback strategy file, and converting each playback strategy in the playback strategy file into a playback strategy structure; S3, compare each playback strategy structure to determine whether there is an intersection, if there is an intersection, proceed to the next step, if there is no intersection, then play the strategy according to the playback strategy file; S4, establishing links for the playback strategies with intersections, marking them as strategy conflicts, updating the values ​​of the strategy conflicts, and forming a strategy conflict network; S5. Form an orderly strategy sequence for all playback strategy structures according to the strategy conflict network; S6. Determine whether the policy conflict value of the first play policy structure of the policy sequence is greater than zero. If it is greater than zero, delete the first play policy structure of the policy sequence. If it is equal to zero, play the policy according to the policy sequence.

2. A method for resolving broadcast play strategy conflicts according to claim 1, characterized in that: The play policy structure at least includes a policy number, a play time, an occupied time period, a play mode, a play content, a policy conflict and a play priority.

3. A method for resolving broadcast play strategy conflicts according to claim 2, characterized in that: In step S3, determining whether there is an intersection is specifically as follows: Determine whether there is any intersection based on the playback time or occupied time period in each playback strategy structure.

4. A method for resolving broadcast play strategy conflicts according to claim 3, characterized in that: In step S4, the initial value of the policy conflict is zero, and the value of the policy conflict increases by 1 each time a link is added to the playback strategy.

5. A method for resolving broadcast play strategy conflicts according to claim 2, characterized in that: The playback priority is set according to the importance of each playback strategy, and the playback priority is a positive integer from 1 to n. The higher the importance of the playback strategy, the greater the playback priority.

6. A method for resolving broadcast play strategy conflicts according to claim 5, characterized in that: In step S5, if the policy conflict values ​​are the same, the sizes of the play priorities are compared, and the smaller the play priority, the higher the position in the policy sequence.

7. A method for resolving broadcast play strategy conflicts according to claim 6, characterized in that: In step S6, when the policy conflict values ​​of the play policy structure are all zero, the play priorities are rearranged in descending order and the policies are played according to the rearranged policy sequence.

Images