CN111711995A

CN111711995A - Broadcast channel competitive scheduling method

Info

Publication number: CN111711995A
Application number: CN202010616424.6A
Authority: CN
Inventors: 李洪钧; 方林; 邓永生; 傅历建
Original assignee: Gospell Digital Technology Co ltd
Current assignee: Gospell Digital Technology Co ltd
Priority date: 2020-06-30
Filing date: 2020-06-30
Publication date: 2020-09-25
Anticipated expiration: 2040-06-30
Also published as: CN111711995B

Abstract

The invention discloses a broadcast channel competitive scheduling method in the technical field of video broadcasting, which comprises the following steps: A. establishing a broadcasting station information table, a program information table, a channel information table and a program reservation information table; B. adding a newly-added broadcasting station in a program reservation information table according to the newly-added reserved watching position; C. according to the program ID, finding the program starting time and the program ending time of the program ID in a pre-established program information table; searching channel information of the ID of the broadcasting station in a pre-established channel information table; D. and generating a channel program schedule table of the broadcast site ID according to the program start time and the program end time of the program ID in the program reservation information table and the channel information of the broadcast site ID. The method of the invention enables the live program source of the hot broadcast to be selected to a proper broadcast tower for broadcasting, thereby saving the internet communication traffic, reducing the network congestion, and increasing the audience rating of the broadcast program and the utilization rate of the broadcast channel.

Description

Broadcast channel competitive scheduling method

Technical Field

The invention relates to the technical field of video broadcasting, and particularly discloses a broadcast channel competitive scheduling method.

Background

At present, various live video contents exist on the internet, and users interested in the live video contents generally adopt intelligent terminal equipment to watch the live video contents. Because a plurality of point-to-point connections need to be established between a live broadcast source and audience equipment, under the conditions of high program resolution and more audiences, the live video occupies larger internet transmission bandwidth, so that the probability of network congestion is increased.

Meanwhile, some transmission networks in a digital broadcasting mode also exist, such as a ground wireless digital coverage network based on a VHF/UHF band of tower broadcast transmission. Due to the existence of multimode data transmission standards, the intelligent terminal equipment can simultaneously receive the internet data and the terrestrial wireless digital broadcasting signals. For example, in the 5G standard, in addition to high-speed bidirectional communication in a high frequency band, a digital broadcasting standard in a 700MHz frequency band is defined.

However, for reasons of convention, the terrestrial wireless digital overlay networks are mostly used today to transmit traditional digital television programs. The number of people who actually watch the program contents is not large; the internet live content with a large audience does not get the opportunity to broadcast. Therefore, the terrestrial wireless digital overlay network only transmits the digital television program signals, which causes waste of channel resources and energy to some extent. Based on the analysis, the internet live broadcast content occupying large bandwidth is broadcasted through the ground wireless digital coverage network based on iron tower broadcast transmission, so that network congestion can be relieved, and the ground wireless digital coverage network is fully utilized. However, how to realize the scheduling of the internet live content in the broadcast tower base station includes: the problems of whether the live program should be loaded on the tower, which towers are loaded, which channels of the tower are occupied and the like are solved, and a specific scheme is not given in the prior art.

Disclosure of Invention

The invention aims to broadcast the Internet live broadcast content occupying a large bandwidth through a ground wireless digital overlay network based on iron tower broadcast transmission, further solves the problem of how to realize the scheduling of the Internet live broadcast content in a broadcast iron tower base station, and provides a broadcast channel competitive scheduling method.

In order to achieve the above purpose, the invention provides the following technical scheme:

a broadcast channel contention scheduling method comprises the following steps:

A. establishing a broadcast site information table, wherein the broadcast site information table comprises each broadcast site ID and a signal coverage range thereof; establishing a program information table, wherein the program information table comprises program ID, bandwidth required by playing programs, program starting time and program ending time; establishing a channel information table, wherein the channel information table comprises the ID of each channel, the ID of a broadcasting station and the channel bandwidth; establishing a program reservation information table, wherein each reservation information record of the program reservation information table at least comprises a program ID, a reservation terminal ID, a reservation watching position and a broadcasting station ID matched with the reservation watching position;

B. when a new program reservation is added in the program reservation information table, calculating to obtain a broadcast site matched with the newly added reserved watching position according to the newly added reserved watching position in the new program reservation, adding a broadcast site ID corresponding to the newly added reserved watching position in the program reservation information table, wherein the broadcast site ID is the number of all broadcast sites of which the broadcast signal range covers the reserved watching position, and the broadcast site ID is obtained by searching in the broadcast site information table according to the newly added reserved watching position;

C. according to the program ID in the newly-added program reservation, finding the program starting time and the program ending time of the program ID in a pre-established program information table; searching channel information of the ID of the broadcasting station in a pre-established channel information table;

D. and executing scheduling, wherein the executing scheduling is to generate a channel program schedule table of the broadcast site ID according to the program starting time and the program ending time of the program ID in the new program reservation in the program reservation information table and the channel information of the broadcast site ID, and each program schedule record of the channel program schedule table comprises the channel ID, the program ID to be scheduled and the time period of the program ID to be scheduled.

As a preferred embodiment of the present invention, step D further comprises: before scheduling is executed each time, a program site reservation user number list is generated according to the program reservation information list, the records of the program site reservation user number list comprise the reservation terminal number of the program ID in the broadcast site ID and a channel allocation mark, and the channel allocation mark identifies whether channel allocation is successful or not.

As a preferred aspect of the present invention, the step D is a loop operation in which a preferred recording in which the channel allocation flag is false and the number of reserved terminals is the largest in the number list of reserved users at the program site is found, a channel is allocated to the broadcast site ID in which the program ID of the preferred recording is the largest in the number of reserved terminals,

if the distribution is successful, setting the channel distribution mark of the preferred record as true, and updating the reserved user number table of the program site;

the conditions for the end of the cycle operation were: all channels are allocated completely, or all records with the number of the reserved terminals being larger than the threshold value in the program site reserved user number list are allocated completely.

As a preferred embodiment of the present invention, the step of updating the program site reservation user number table includes: if the broadcast station ID of the program ID which is preferably recorded is plural, and the channel assignment of the one broadcast station ID which is preferably recorded is successful, the number of the reserved terminals in the program station reservation subscriber number table of the other broadcast station IDs in the preferred recording of which the channel assignment is successful is decreased by 1.

As a preferred scheme of the present invention, when the time periods of the scheduled broadcast program IDs of all channels of the broadcast station ID are allocated, the broadcast station ID completes the channel program scheduling, and the broadcast stations corresponding to the broadcast station ID sequentially broadcast the scheduled broadcast programs in the channels of the broadcast station ID according to the channel program scheduling table.

As a preferred scheme of the present invention, generating a channel programming table of broadcast station IDs specifically includes the steps of:

s1, acquiring a channel ID and a corresponding data bandwidth in the channel information of the broadcast station ID;

s2, screening out the channel with the data bandwidth more than or equal to the program ID bandwidth to obtain a preselected channel;

and S3, for each pre-selected channel, if the time period from the starting time of the program ID to the ending time of the program ID is not occupied, listing the program ID in the scheduled broadcast program ID of the pre-selected channel, otherwise, not listing the program ID in the scheduled broadcast program ID of the pre-selected channel.

As a preferred aspect of the present invention, when a plurality of preselected channels all satisfy a condition that a program ID is listed in a scheduled broadcast program ID, a channel fragmentation time generated after the program ID is assigned in each preselected channel is calculated, and the preselected channel that generates the shortest channel fragmentation time is taken as a broadcast channel corresponding to the program ID, the channel fragmentation time being obtained by adding a forward fragmentation time, which is a difference between a start time of the program ID and an end time of a previous program ID assigned in the channel, and a backward fragmentation time, which is a difference between an end time of the program ID and a start time of a next program ID assigned in the channel.

As a preferred aspect of the present invention, a forward fragment time calculation method includes:

finding a forward program of which the end time is before the start time of the program ID and the difference between the end time and the start time of the program ID is minimum in all the scheduled programs of the preselected channel, and calculating the absolute value of the difference between the end time of the forward program and the start time of the program ID;

the backward fragment time calculation method comprises the following steps:

among all the scheduled programs of the pre-selected channel, a backward program having a start time after the end time of the program ID and a minimum difference between the start time and the end time of the program ID is found, and the absolute value of the difference between the start time of the backward program and the end time of the program ID is calculated.

Based on the same conception, the invention also provides a broadcast channel competition scheduling device, which comprises at least one processor and a memory which is in communication connection with the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 8.

Compared with the prior art, the invention has the beneficial effects that:

1. the invention provides a broadcast channel competitive scheduling method, which establishes a series of tables, generates a channel program planning table comprising a channel ID, a planned broadcast program ID and a time period of the planned broadcast program ID by searching related information in the series of tables according to a newly-increased live program ID and a geographical position of a program to be watched, and a broadcast station selects a live program source for hot broadcast to a proper broadcast tower for broadcasting according to the channel program planning table, thereby greatly saving internet communication traffic, reducing network congestion, and increasing the audience rating of broadcast programs and the utilization rate of broadcast channels.

2. Setting a channel distribution mark for each record in the program reservation information table, determining the sequence of distributing channels to the program ID according to the channel distribution mark and the reservation terminal number, and distributing the channels circularly to ensure that each record meeting the conditions in the program reservation information table realizes channel distribution, thereby avoiding information omission and avoiding channel distribution for the same record for multiple times.

3. When the geographic position of the same program is covered by a plurality of broadcast stations, if the channel allocation of the program in one broadcast station ID is successful, other broadcast stations do not allocate the channel to the program any more, so as to save channel resources.

4. According to the time periods of the live programs, program distribution is carried out on each channel according to the time sequence so as to ensure that the broadcasting stations broadcast a live program in the same time period and avoid time conflict.

5. When programs are distributed to each channel according to the time sequence, the programs are preferentially distributed to the channels with less time for generating channel fragments, and the time interval between adjacent live programs is reduced as much as possible, so that the utilization rate of the channels is maximized.

Description of the drawings:

fig. 1 is a flowchart of a contention scheduling method for a broadcast channel in embodiment 1 of the present invention;

fig. 2 is a flowchart of a broadcast channel contention scheduling method determined based on the number of reserved terminals in embodiment 1 of the present invention;

fig. 3 is a schematic diagram of an architecture and an operating principle of a video live broadcast system combining broadcast and bidirectional communication using a broadcast channel contention scheduling method in embodiment 2 of the present invention.

Detailed Description

The present invention will be described in further detail with reference to test examples and specific embodiments. It should be understood that the scope of the above-described subject matter is not limited to the following examples, and any techniques implemented based on the disclosure of the present invention are within the scope of the present invention.

Example 1

A flow chart of a broadcast channel contention scheduling method is shown in fig. 1, and the steps include:

A. establishing a broadcast site information table, wherein the broadcast site information table comprises each broadcast site ID and a signal coverage range thereof; establishing a program information table, wherein the program information table comprises program ID, bandwidth required by playing programs, program starting time and program ending time; establishing a channel information table, wherein the channel information table comprises the ID of each channel, the ID of a broadcasting station and the channel bandwidth; and establishing a program reservation information table, wherein each reservation information record of the program reservation information table at least comprises a program ID, a reservation terminal ID, a reserved watching position and a broadcasting station ID matched with the reserved watching position. And the channel planning of the program is realized by maintaining the table.

As a preferred scheme, all live programs are not transmitted through a broadcast channel, but through screening, live programs with more reserved users are transmitted in an incoming mode through a broadcast station (iron tower) and a corresponding digital broadcast network, so that on one hand, the mobile data traffic of the users is saved, and the users have smoother experience in watching the programs; on the other hand, the method greatly saves the internet traffic and reduces the network congestion. Therefore, before programming, the number of the reserved terminals corresponding to the program ID at each broadcast station is calculated according to the program reservation information table, and a reserved program station user number table is generated. The record of the program site reservation user number table comprises the number of reserved terminals of the program ID at the broadcast site ID and a channel allocation mark, wherein the channel allocation mark identifies whether channel allocation is successful or not. In step D, finding the preferred record with the channel allocation flag being false and the largest number of the reserved terminals in the program site reserved user quantity table, allocating channels for the program ID of the preferred record in the broadcast site ID with the largest number of the reserved terminals, if the allocation is successful, setting the channel allocation flag of the preferred record to be true, and updating the program site reserved user quantity table.

Fig. 2 shows a flowchart of a contention scheduling method for a broadcast channel based on the number of reserved terminals, which includes the steps of:

s1, establishing a program reservation information table, wherein each reservation information record of the program reservation information table at least comprises a program ID, a reservation terminal ID and a reserved watching geographic position.

And S2, acquiring the broadcast site ID corresponding to the reserved viewing geographical position according to the reserved viewing geographical position and the pre-established broadcast site information table.

And S3, calculating the number of the reserved terminals corresponding to the program ID at each broadcast station according to the program reservation information table, and generating a reserved program station user number table, wherein each record of the reserved program station user number table comprises the program ID, the broadcast station ID and the reserved terminal number.

S4, judging whether the number of the reserved terminals of the program ID at the broadcast station ID is more than or equal to the minimum preset threshold value, if yes, executing the step S5, and if not, ending the step.

And S5, finding the starting time and the ending time of the program ID in the pre-established program information table according to the program ID.

S6, searching the channel information of the broadcasting station in the pre-established channel information table.

S7, generating a channel program planning record of the broadcasting station according to the starting time of the program ID, the ending time of the program ID and the channel information of the broadcasting station, and listing the channel program planning record in a program planning table of the broadcasting station ID, wherein each program planning record comprises the channel ID, the planned broadcasting program ID and the time period of the planned broadcasting program ID.

S8, when the program ID is already listed in the program schedule table of the broadcast station ID, clearing the number of reserved terminals corresponding to the program ID in the broadcast station ID in the program reservation information table.

S9, returning to step S4, channel assignment is carried out to the next program ID until any one of the following conditions is satisfied: 1) in the program reservation information table, the number of reserved terminals of the program ID at the broadcast site ID is equal to zero or less than a minimum preset threshold value; 2) the time periods for the scheduled broadcast program IDs for all channels of the broadcast site ID are allocated.

And after the channel allocation is finished, generating a final program planning table of the broadcast site ID, outputting the program planning table as a scheduling result of the local broadcast site ID, and finishing the broadcast of the live broadcast program through an iron tower according to the generated program planning table of the broadcast site ID after the live broadcast program starts.

As a preferred scheme, before a program schedule table of broadcast site IDs is generated and live broadcast is not performed, a scheduling method of adding new program reservation information is considered, which includes the following steps:

when a new program reservation information is added, the program ID, the reservation terminal ID and the reservation watching position of the reservation information are added into a program reservation information table as a record, correspondingly, after the broadcast station ID is determined according to the reservation watching geographic position, in a reservation program station user number table, the number of the program ID in the reservation terminal of the corresponding broadcast station ID is added by one, and the number of the reservation terminal of the broadcast station ID is adaptively adjusted according to the program ID and the reservation watching position.

As a preferred scheme, if there are multiple broadcast site IDs corresponding to program IDs recorded preferentially, that is, the geographic location of a certain program watched by the program ID is covered by multiple broadcast site IDs simultaneously, when the channel allocation of a live program in the preferred recording on one of the broadcast site IDs is successful, the number of terminals reserved in the program site reservation subscriber number table by other broadcast site IDs covering the geographic location is reduced by 1, and the program is no longer allocated, so that the unnecessary waste caused by repeated channel allocation of the same program is avoided.

As a preferred scheme, generating a channel programming record of a broadcast station according to a start time of a program ID, an end time of the program ID, and channel information of the broadcast station specifically includes the following steps:

s71, acquiring a channel ID and a corresponding data bandwidth in the channel information of the broadcasting station;

s72, screening out the channel with the data bandwidth more than or equal to the program ID bandwidth to obtain a preselected channel;

and S73, for each pre-selected channel, if the time period from the starting time of the program ID to the ending time of the program ID is not occupied, listing the program ID in the scheduled broadcast program ID of the pre-selected channel, otherwise, not listing the program ID in the scheduled broadcast program ID of the pre-selected channel.

When the program IDs of a plurality of preselected channels are listed in the program IDs of the scheduled broadcast, the channel idle time corresponding to the program ID in each preselected channel is calculated, the preselected channel with the shortest channel idle time is used as the broadcast channel corresponding to the program ID, and the channel idle time corresponding to the program ID is obtained by adding the forward fragment time and the backward fragment time.

The forward fragment time calculation method comprises the following steps: among all the scheduled programs of the pre-selected channel, a forward program is found whose end time is before the start time of the program ID and whose difference between the end time and the start time of the program ID is the smallest, and the absolute value of the difference between the end time of the forward program and the start time of the program ID is calculated.

The backward fragment time calculation method comprises the following steps: among all the scheduled programs of the pre-selected channel, a backward program having a start time before the end time of the program ID and a minimum difference between the start time and the end time of the program ID is found, and the absolute value of the difference between the start time of the backward program and the end time of the program ID is calculated.

Example 2

Based on the concept of the present invention, embodiment 2 provides a more specific technical solution, and a system architecture and a schematic diagram are shown in fig. 3.

The system is composed of a live broadcast platform, a mobile cellular network, a digital broadcast network, a user terminal, a management system of a built-in broadcast channel program planning program and the like.

The user terminals are divided into two types, one is a dual-mode terminal, which can receive high-speed data of the mobile cellular network and broadcast signals of various sites of the broadcast network. The other is a single mode terminal which can only receive high speed data of the mobile cellular network and cannot receive broadcast signals. In the system and method of the present invention, the user terminal is capable of receiving at least broadcast signals of the respective sites of the broadcast network.

The live broadcast platform refers to a management and broadcasting platform for live broadcast users and program contents. The core function of the system is to process the audio and video of the live program source and transmit the audio and video to each terminal device watching the live content. Each live program of the live platform has preset information of start time, end time, program definition, code rate, bandwidth and the like.

The digital broadcast network is composed of a plurality of broadcast transmitting sites, and signals of each site cover a certain area. Each station has a certain working frequency band, the working frequency band can be divided into a plurality of channels, and each channel can broadcast and transmit programs with a certain code rate. Site selection, coverage area of each site and the like are determined by a digital broadcast network planner according to the number of users to be covered, regional geographic environment and other factors. After sites are deployed, signal coverage areas of adjacent sites may overlap, and an area with a large coverage area of a master station may also exist, where the coverage area of the master station includes a plurality of small station coverage areas, and in the mutually overlapping areas, as long as signal frequency bands are different, co-frequency band interference is not caused. Each station comprises an exciter, a transmitter and an antenna feed system, besides, a source receiving device can be arranged, the source receiving device can receive and multiplex a plurality of program source data streams and then send the multiplexed program source data streams to the exciter, and at each specific time point, one program source monopolizes one channel of the station.

Mobile cellular data networks are now 4G, 5G or more advanced mobile communication networks in the future.

The management system of the program planning program with built-in broadcast channel is used for planning and planning the programs transmitted by each station and each channel of the digital broadcast network. It can communicate with each live broadcast platform and digital broadcast network. The programming is based on the data of the reserved live program to be watched by the terminal, and the site and signal coverage condition of the broadcasting network.

Based on the above framework, a more specific technical solution for scheduling and scheduling channels and programs of each broadcast transmission site (tower) is as follows:

data structure design

The broadcast channel scheduler maintains the following data list:

1) and the broadcast station information table comprises all stations capable of transmitting broadcast signals in the system, and each station at least comprises a station ID, a station programmable channel maximum number, a station signal coverage range and the like. The data records of the table are related to the network planning of the broadcast system and are substantially unchanged since the network was built. The "site signal coverage" is a geographical area outline, and signal coverage of different sites may overlap. In addition, the broadcast signal of some large towers (such as the main transmission tower of a city) may completely cover the signal coverage of a plurality of small towers (covering a city). Overlap of signal coverage areas may occur between small towers in rural areas. And for towers with overlapped signal coverage areas, a multi-frequency transmission mechanism is adopted to avoid the occurrence of same frequency interference.

The signal coverage area of the transmitting station is related to the iron tower coordinates, the antenna hanging height, the antenna shaping, the transmitter power, the signal excitation mode, the digital pre-distortion correction condition, the terrain of a signal coverage area and the like of the transmitting station, but the signal coverage area is generally not changed too much once the transmitting station is installed and operated. Generally, each city has at least 1 transmitting station (large tower) with large power, and the transmitting power is generally strong enough to cover the whole city; there are also several less powerful transmitting stations (small towers) whose signals cover a portion of an urban area (e.g., several streets or 1 town, etc.). The small stations without signal overlapping area can share the transmitting frequency, but the transmitting frequency between the small towers with signal overlapping area is mutually staggered, and the working frequency of each small tower and the working frequency of the big tower are mutually staggered. Therefore, a terminal, at a geographic location, can generally receive broadcast signals transmitted by two towers (one is a large tower covering the city, and the other is a small tower covering the area where the terminal is located); if in the signal overlapping area of a plurality of adjacent small towers, the broadcast signals transmitted by 3 or more towers can be received simultaneously.

2) A channel information table, which gives available channel information for all towers. Each channel includes a channel ID, an ID of a station to which the channel belongs, a channel number (a number within the station), a channel bandwidth (referring to an effective data transmission bandwidth), and the like. The channel carrier frequency is an important attribute of a channel, and a certain channel can be regarded as a subcarrier or a group consisting of a plurality of subcarriers of the working frequency band of the tower to which the channel belongs; all channels of a tower constitute a continuous wide frequency band, i.e. the operating frequency band of the tower. As mentioned above, towers with overlapping signal coverage areas should operate in different frequency bands to avoid co-channel interference. Similar to broadcast sites, channel information tables are typically modified only a few times after network construction is complete and operational.

3) In the program information table, each piece of program information at least comprises a program ID, a program start time, a program end time and a program data bandwidth, and in order to simplify calculation, the program bandwidth can only adopt a plurality of preset values and cannot be any value.

4) And a program reservation information table containing the reservation condition of the current terminal for the program. Each piece of reservation information includes at least a program ID, a reserved terminal ID, a reserved viewing location (geographical coordinates), available broadcast sites (there may be a plurality, up to 7, each identified by a site ID; because we consider that each terminal can receive broadcast signals of up to 7 towers at the same time at a certain location). Wherein the available broadcasting station is calculated according to the reserved watching position of the terminal and the 'station signal coverage' in the broadcasting station information table.

5) The subscriber number table of the reserved program site, wherein each 1 record of the subscriber number table indicates how many terminals reserved for a program can be covered if the program is broadcast at a certain site. Each record thus includes information of program ID, station ID, number of terminals, and the like. The data of the table is calculated from the program schedule information table.

6) The channel programming table, which represents the programming of each channel, is the result of the calculation output of the scheduler. Each record of the table includes a channel ID, a program ID for scheduled broadcast (including the time period during which the program ID is broadcast).

In addition, the scheduler has several core system parameters including the minimum number of subscribers (minimum predetermined threshold) required to start the broadcast channel planning for a program, that is, a certain station can allocate a channel for a certain program only when the number of terminals covering the reserved program exceeds the minimum predetermined threshold. Since the number of terminals receiving a program if a channel is allocated is small, it is a waste of channel resources and a waste of energy required to start broadcasting.

Second, channel planning

The scheduler calculates and updates the channel plan of the station according to the user number table of the reserved program station at regular intervals (for example, every several minutes), and the steps are as follows:

2.1 pretreatment

First, all the channel plan records in the "site channel plan table" that are before the next scheduled execution time at all start times are cleared (waiting for re-planning), that is, all programs that have not started to be broadcast before the next scheduling are possible to be re-scheduled (programs that have started to be broadcast before the next scheduling must not be rescheduled, since there may be terminals that are watching them at that time).

Then, the user number table of the reserved program site in the system is copied to a backup (because the record is modified in the calculation process, the reserved data of the system cannot be influenced), and the backup user number table of the reserved program site is used for operation in the following circulation.

2.2 channel Allocation

The channel allocation operation is performed according to the following steps:

1. the "reserved program site user number table" is inquired to find the record (assumed as P1, S1) having the largest number of reserved users, and then an attempt is made to allocate a channel for the recorded program (P1) at the site of the record (S1). The method comprises the following specific steps:

a) in the "channel information table", all channels belonging to the site S1 (C1-C10, assuming n) having the same data bandwidth as the program P1 bandwidth are found;

b) for a certain channel (e.g., Cx) of C1-C10, the programs that it has scheduled in the "channel programming table" (i.e., the program ID fields of those records in the "channel programming table" whose channel field is equal to Cx) are queried, and if any of them conflicts with the time of program P1 (whose start time or end time is between the start time and the end time of program P1), it indicates that program P1 cannot schedule the channel Cx. Otherwise it indicates that program P1 can be scheduled to channel Cx. The start time and the end time of the program can be obtained by querying a "program information table".

c) If program P1 can be scheduled to channel Cx, then the size of the resulting "channel chip" (which may not be able to reallocate the channel idle time for any program) after its scheduling to channel Cx should be calculated and program P1 scheduled to the channel that produced the smallest channel chip. The channel chips are obtained by adding the "forward" chips and the "backward" chips. Wherein the "forward fragmentation" calculation step is to find a program, of all the scheduled programs of the channel Cx, whose end time is before the start time of the program P1 and whose difference between the end time and the start time of the program P1 is the smallest, and calculate the absolute value of the difference between the end time and the start time of the program P1, so as to obtain the "forward fragmentation"; if the start time of program P1 is preceded by the end of no one of the scheduled programs, then the "forward fragmentation" is equal to the absolute value of the difference between the current system time and the start time of program P1. The calculation steps of the 'backward fragment' are as follows: among all the scheduled programs of channel Cx, finding the program whose start time is after the end time of program P1 and whose difference between the start time and the end time of program P1 is the smallest, calculating the absolute value of the difference between the start time and the end time of program P1, and obtaining "backward fragmentation"; if none of the scheduled programs between their starts is after the end time of program P1, then the "backward shard" is equal to 0. Assuming that the channel with the smallest channel fragmentation is C5, program P1 is scheduled to channel C5, i.e., a record is added in the "channel programming table" C5, P1.

2. If the channel allocation to a program at a certain site is successful, the "number table of users at the reserved program site" should be updated, that is, if a certain reservation corresponds to the program, the reserved receiving site can receive the signal of the site which has just successfully allocated the channel, but can also receive the signals of other sites, and the number of the reserved users of other sites should be subtracted. This is because the terminal does not need to receive the same program transmitted by other stations since it can already receive a program transmitted by a certain station.

For example, the following steps are carried out: if a channel has been successfully allocated for program P1 at site S1, then "program reservation information table" should be queried to find all program IDs equal to P1, sites containing S1 but also having reserved records for other sites, and the number of reserved users for this program in the "reserved program site user number table" corresponding to other sites is subtracted by 1. Assuming that there are [ P1, T1, [ S1, S2] ], [ P1, T2, [ S1, S2] ], [ P1, T3, [ S1, S3] ]inthe "program site user number table", the number of reserved users recorded [ P = P1, S = S2] should be subtracted by 2, and the number of reserved users recorded [ P = P1, S = S3] should be subtracted by 1.

3. The scheduling program repeats the steps 1 and 2 until any one of the following conditions is satisfied: 1) all reserved programs with the number of the reserved users larger than the threshold value are traversed, and 2) all site channels are distributed.

4. When the loop is completed, indicating that the channel allocation is finished, the scheduler should output the updated "channel programming table" as the result of local scheduling.

Third, subscriber reserves/cancels the reservation program

The scheduler recalculates and updates the data of the program reservation information table and the reserved program site user number table every time a program reservation or reservation cancellation event occurs. The method comprises the following specific steps:

when a terminal (assumed to be T1) newly subscribes to watch a program (assumed to be P1) at a certain location (assumed to be L1), the scheduler should:

1) inquiring a broadcast station information table, calculating the signal coverage range of the reserved watching position in which stations, if the number of the stations is more than 0, adding 1 record in a program reservation data table, wherein the record comprises the reserved program, a reserved terminal and an applicable station. For example, if it is found by inquiry that the terminal can receive the broadcast signals from the stations S1 and S2 at the location L1, a record [ P1, T1, [ S1, S2] should be added to the "program reservation data table".

2) And according to the newly added program reservation data record, the value of the number of the reserved terminals in the related record of the reserved program site user number table is added. Examples are: if a record [ P1, T1, [ S1, S2] ] is added to the program reservation data, then records [ P = P1, S = S1] and [ P = P1, S = S2] should be found in the "reserved program site users number table", respectively, and added with 1 to the "reserved users number" field thereof, respectively; if there is no matching record (indicating that the station has not previously subscribed to the program at any terminal), then a new such record is created and the "number of subscribed users" field is set to 1.

Correspondingly, when a terminal (assumed to be T1) cancels a reservation for viewing a program (assumed to be P1), the scheduler should:

1) and inquiring a program reservation data table to find a record of the program which is the same as the program to be canceled and the terminal ID which is the same as the terminal to cancel the reservation, and acquiring the site information of the record. For example, if the terminal T1 cancels the reservation for the program P1 and inquires that there is a record [ P1, T1, [ S1, S2] in the "program reservation data" table, it is known that the stations related to the program reservation are S1 and S2.

2) And (3) checking and subtracting the related reserved terminal number in the reserved program site user number table: finding records of [ P = P1, S = S1] and [ P = P1, S = S2] respectively in a 'reserved program site user number table', and subtracting 1 from a 'reserved user number' field; if the number of reserved users field is less than or equal to 0 after subtracting 1, the record is deleted in the number of users at the reserved program site table.

3) The recording of "program reservation data" is deleted (in this example, recording [ P1, T1, [ S1, S2] ]).

For a program that has already started to be broadcast, the user's cancellation or subscription will not cause the scheduler to perform any action.

Example 3

The specific application embodiment of the present invention can be further illustrated by the following steps:

1. based on the existing cellular communication network (such as 4G, 5G, etc.), a broadcasting network based on a tower (broadcasting site) is established. The installation place of each station, the antenna on the tower, the antenna shape, the transmitter power, the working frequency and the like, and detailed network planning is performed in advance. Network planning needs to be given by comprehensively considering population distribution, regional terrain, frequency spectrum resources, equipment power supply conditions and other factors. Generally, each city is provided with 1 main transmitting station, which is built at a high place, has larger transmitting power and can cover the whole urban area; in addition, a plurality of stations with medium and low power are built in the urban area, the hanging height of the antenna is lower than that of the main transmitting tower, the power is also lower, and the antenna generally covers the designated urban area.

2. After the broadcast station is successfully constructed, the actual coverage effect is tested, and the antenna shaping, the transmitting power and the like are adjusted according to the test result, so that the coverage effect meets the requirement of network planning as much as possible.

3. Installing and deploying management system software comprising the broadcast channel scheduler; and a broadcast site information table is created and initialized according to the implementation condition of network deployment.

4. The "channel information table" is initialized. Conventionally, stations are mainly used to broadcast digital television programs. According to the requirements of the invention, each iron tower needs to plan a plurality of channels for transmitting the internet live programs besides transmitting a certain number of digital television programs by using a plurality of channels. The number and bandwidth of channels for transmitting the internet live content should be set with reference to the distribution according to the resolution of the internet live content. Examples are: if the live content is 40% by 1MBPS and 60% by 2MBPS, the channel for transmitting the internet live content on the iron tower should be correspondingly designed to be 40% by 1MBPS and 60% by 2 MBPS.

5. The management system software establishes communication with each live broadcast platform, implements acquisition and updating of program information and reservation conditions, and updates internal data thereof by a 'broadcast channel scheduling program' according to the details;

6. the 'broadcast channel scheduler' of the management system software schedules and calculates the program plans of the broadcast channels of the stations regularly. After each time of updating the channel program plan, the management system software acquires the channel planned to a certain or some sites, and the program with the starting time after the current time and before the next program is planned, and informs the equipment of the corresponding site, and then acquires the content of the program from the live broadcast platform, and broadcasts in the planned channel. And simultaneously informing each live broadcast platform of the scheduled programs at which sites and channels and the terminals which can receive the programs at the sites.

The live broadcast platform informs the scheduled program broadcasting station and channel information to the terminal of the reserved program; after the terminal receives the notification, when the reserved program starts to be broadcast, the terminal can lock the carrier of the appointed site and channel to receive the live program without acquiring the data of the program in a point-to-point communication mode with the live broadcast platform. Therefore, the purposes of saving internet communication traffic and reducing the possibility of network congestion are achieved.

The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included therein.

Claims

1. A broadcast channel contention scheduling method, comprising the steps of:

A. establishing a broadcast site information table, wherein the broadcast site information table comprises each broadcast site ID and a signal coverage range thereof; establishing a program information table, wherein the program information table comprises program ID, bandwidth required by playing programs, program starting time and program ending time; establishing a channel information table, wherein the channel information table comprises the ID of each channel, the ID of the broadcasting station and the channel bandwidth; establishing a program reservation information table, wherein each reservation information record of the program reservation information table at least comprises a program ID, a reservation terminal ID, a reservation watching position and a broadcasting station ID matched with the reservation watching position;

B. when the new program is reserved in the program reservation information table, calculating to obtain a broadcast site matched with the new reserved watching position according to the new reserved watching position in the new program reservation, adding a broadcast site ID corresponding to the new reserved watching position in the program reservation information table, wherein the broadcast site ID is the number of all broadcast sites of which the broadcast signal range covers the reserved watching position, and the broadcast site ID is obtained by searching in a broadcast site information table according to the new reserved watching position;

C. according to the program ID in the newly added program reservation, finding the program starting time and the program ending time of the program ID in a pre-established program information table; searching the channel information of the broadcast station ID in a pre-established channel information table;

D. and executing scheduling, wherein the executing scheduling is to generate a channel program schedule table of the broadcast site ID according to the program start time and the program end time of the program ID in the new program reservation in the program reservation information table and the channel information of the broadcast site ID, and each program schedule record of the channel program schedule table comprises the channel ID, the program ID to be scheduled and the time period of the program ID to be scheduled.

2. The method for contention scheduling of broadcast channel according to claim 1, wherein step D further comprises: before scheduling is executed each time, a program site reservation user number list is generated according to the program reservation information list, the records of the program site reservation user number list comprise the reservation terminal number of the program ID in the broadcast site ID and a channel allocation mark, and the channel allocation mark identifies whether channel allocation is successful or not.

3. The broadcast channel contention scheduling method of claim 2, wherein the step D is a loop operation in which a preferred recording in which a channel allocation flag is false and the number of reserved terminals is the largest in the number of reserved users at the program site is found, a channel is allocated to the program ID of the preferred recording at the broadcast site ID of which the number of reserved terminals is the largest,

the conditions for the cycle termination are: all channels are allocated completely, or all records with the number of the reserved terminals being larger than the threshold value in the program site reserved user number list are allocated completely.

4. The broadcast channel contention scheduling method of claim 3, wherein the step of updating the program site reservation subscriber count table comprises: if the broadcast station IDs of the program IDs of the preferred records are multiple, and the channel allocation of the preferred record in one of the broadcast station IDs is successful, the number of the reserved terminals in the program station reservation subscriber number table of the other broadcast station IDs in the preferred record of which the channel allocation is successful is decreased by 1.

5. The method as claimed in any of claims 1-4, wherein when the time periods for programming the broadcast program IDs of all channels of the broadcast site ID are allocated, the broadcast site ID completes the channel program programming, and the broadcast sites corresponding to the broadcast site ID sequentially broadcast the programs to be programmed in the channels of the broadcast site ID according to the channel program programming table.

6. The method as claimed in claim 5, wherein the step of generating the channel programming table of the broadcast station ID specifically comprises the steps of:

s1, acquiring the channel ID and the corresponding data bandwidth in the channel information of the broadcast station ID;

s2, screening out the channel with the data bandwidth being larger than or equal to the program ID bandwidth to obtain a preselected channel;

and S3, for each preselected channel, if the time period from the starting time of the program ID to the ending time of the program ID is not occupied, listing the program ID in the scheduled broadcast program ID of the preselected channel, otherwise, not listing the program ID in the scheduled broadcast program ID of the preselected channel.

7. The method as claimed in claim 6, wherein when a plurality of said preselected channels satisfy the condition of listing said program ID in a scheduled broadcast program ID, calculating a time of channel fragmentation resulting from the allocation of said program ID in each preselected channel, and using the preselected channel resulting in the shortest time of channel fragmentation as the broadcast channel corresponding to said program ID, said time of channel fragmentation is obtained by adding a forward fragmentation time and a backward fragmentation time, said forward fragmentation time is a difference between a start time of said program ID and an end time of a previous program ID allocated in the channel, and said backward fragmentation time is a difference between an end time of said program ID and a start time of a next program ID allocated in the channel.

8. The broadcast channel contention scheduling method of claim 7,

the forward fragment time calculation method comprises the following steps:

finding a forward program of which the ending time is before the starting time of the program ID and the difference between the ending time and the starting time of the program ID is minimum in all the scheduled programs of the pre-selected channel, and calculating the absolute value of the difference between the ending time of the forward program and the starting time of the program ID;

the backward fragment time calculation method comprises the following steps:

finding a backward program having a start time after the end time of the program ID and having a minimum difference between the start time and the end time of the program ID among all the scheduled programs of the pre-selected channel, and calculating an absolute value of a difference between the start time of the backward program and the end time of the program ID.

9. A broadcast channel contention scheduling device comprising at least one processor and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 8.