KR101075970B1 - Method for dispersing communication load of karaoke player - Google Patents

Abstract

Disclosed is a method for distributing communication load in a music cycle period. Disclosed is a communication load distribution method of a karaoke cycle, the method comprising: (a) inquiring whether a karaoke cycle has a file in a karaoke cycle provided at one side of the karaoke cycle, and requesting the file transmission; (b) determining whether the next song cycle is a file presence query from the random song cycle; (c) in step (b), if it is determined that the next karaoke cycle is a file existence query from the arbitrary karaoke cycle, checking whether a file of the same size in the same path exists; (d) in step (c), if there exists a file of the same size in the same path, determining whether there is a calculated value calculated in the file; (e) in step (d), if there is a calculated value calculated in the file, determining whether the calculated value is the same; (f) in step (e), if it is determined that the calculated value is the same, transmitting a message to the arbitrary song period that the file requested by the any song period is 'present'; It features.

Karaoke, communication load, server

Description

Communication load distribution method of song group cycle {METHOD FOR DISPERSING COMMUNICATION LOAD OF KARAOKE PLAYER}

The present invention relates to a method for distributing a communication load of a karaoke cycle, and more particularly, to determine whether a file to be downloaded exists in a karaoke cycle next to each other, and to a single file in one store without a representative karaoke cycle. The present invention relates to a method for distributing a communication load of a karaoke cycle, which allows a connection to a content delivery server, thereby reducing a final transmission time of a file and enabling the karaoke cycle to be operated regardless of operation.

Due to the nature of the karaoke environment, several karaoke cycles exist in a single store, and these karaoke cycles must receive the same file from the content delivery server.

Specifically, a method of receiving a file, as illustrated in FIG. 1, has a method in which all of the music cycle periods 1, 2, 3,.., N receive a file directly from the content delivery server 10. . That is, several music recording cycles (1, 2, 3, .., n) receive files from one content delivery server 10, respectively.

As shown in FIG. 2, a fixed representative music cycle period 20 receives a file from the content transmission server 10 and transmits the file to the remaining music cycle periods 1, 2, 3, .., n. There is a way to retransmit. That is, the representative song group cycle 20 receives the file from the content delivery server 10. Thereafter, a plurality of song cycles (1, 2, 3, ..., n) are transmitted from the representative song cycle 20.

In addition, although not shown in the drawing, there is a method in which a representative karaoke cycle that is fluidly selected (determined at each booting time) receives a file from a content delivery server and retransmits the file to the remaining karaoke cycle.

The conventional method of receiving a file as described above has the following problems.

As shown in FIG. 1, when data (file) is received from the content delivery server 10, an overload occurs. That is, when all the song cycles 1, 2, 3, .., n (or each song cycle) receive data directly from the content delivery server 10, the traffic of the content delivery server 10 side is lost. In addition, traffic on the Internet connection network such as business side ADSL and cable will increase.

As shown in FIG. 2, in the case of a method in which a fixed representative music cycle period 20 receives a file from the content delivery server 10, there is a burden of manually setting the representative music cycle period 20.

However, due to the nature of karaoke, the owner of the equipment generally does not directly install and set the equipment. Therefore, when a malfunction occurs in the representative karaoke cycle 20, it is difficult to respond in the shop.

In addition, when the representative song group 20 is turned off and the remaining song groups 1, 2, 3, .., n are turned on, the content delivery server 10 is no longer used. File not received

Although not shown in the drawing, in the case of the master (flow) / slave model, since the representative song cycle is selected when booting, the problem in which the representative song cycle 20 is turned off as in the case of FIG. It is disadvantageous to operate the karaoke cycle because all karaoke cycles in the store must boot at the same time in order to select whether it should be the representative karaoke cycle.

The present invention has been created to solve the above problems, it is determined whether the file to be downloaded exists in the next karaoke cycle, and without a representative karaoke cycle from one store to one content delivery server for one file Its purpose is to provide a method for distributing the communication load of the song cycle so that the traffic of the Internet section can be reduced and it can operate regardless of the operation of the song cycle, and the operation of the song cycle is smooth. .

Communication load distribution method of the karaoke cycle of the present invention for achieving the above object, (a) any karaoke cycle inquiries of the existence of the file to the next karaoke cycle provided on one side of the arbitrary karaoke cycle, Requesting the file transmission; (b) determining whether the next song cycle is a file presence query from the random song cycle; (c) in step (b), if it is determined that the next karaoke cycle is a file existence query from the arbitrary karaoke cycle, checking whether a file of the same size in the same path exists; (d) in the step (c), if there exists a file of the same size in the same path, determining whether there is a calculated value calculated in the file; (e) in step (d), if there is a calculated value calculated in the file, determining whether the calculated value is the same; (f) in step (e), if it is determined that the calculation value is the same, transmitting a message to the arbitrary song period that the file requested by the any song period is 'present'; and ,
(g) in step (b), if it is not determined that the next song cycle is a file existence query from the any song cycle, checking whether the file transfer request from the song cycle is requested; (h) in step (g), if it is determined that the next song cycle is a file transmission request from the arbitrary song cycle, determining whether the connection being transmitted is equal to or less than a reference number; (i) in step (h), if the number of connections being transmitted is equal to or less than the reference number, generating a transmission connection.

According to an embodiment of the present invention, it is determined whether a file to be downloaded exists in the next song period, and by allowing one file to be connected to one content transmission server without a representative song period, all song periods Compared to the download from the content delivery server, it is possible to reduce the final transmission time of the file by reducing the traffic in the Internet section.

And since one representative karaoke cycle is not transmitted to all karaoke cycles as before, it is possible to operate regardless of whether the karaoke cycle is in operation (or open).

In addition, the management cost of the representative song group is not required as in the past, thus reducing the management cost.

In addition, when a song group cycle with a lot of content to be downloaded by turning it off for a long time is connected online, it is possible to receive a file at a faster speed from the nearest song group cycle without receiving a file from the content transfer server through the Internet. Can generate significant operational benefits.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

3 is a flow chart sequentially showing a communication load distribution method of the karaoke cycle according to the present invention, Figure 4 is a configuration of the communication load distribution system of the karaoke cycle applied to the communication load distribution method of the karaoke cycle according to the present invention A schematic diagram is shown.

Referring to each of these figures, in the method of distributing the communication load of the song cycle according to the present invention, first, the next song cycle 120-1 in which any song cycle 110 is provided on one side of the song cycle period 110 is provided. , 120-2, 120-3, ..., 120-n, inquires whether a file (for example, a MIDI file) exists, and requests the transmission of the file (step 210).

Then, the presence or absence of the file and the next song periods 120-1, 120-2, 120-3, ..., 120-n having received the file transmission request are present from the arbitrary song periods 110. It is determined whether or not the inquiry (step 220).

Here, as shown in FIG. 4, the random music period 110 may be one or several.

In step 220, if it is determined that the next music cycle period 120-1, 120-2, 120-3, ..., 120-n is a file existence query from an arbitrary music cycle period 110 Then, it is checked whether a file of the same size of the same path exists (step 230).

In step 230, when a file of the same size exists in the same path, it is determined whether a calculated value MD5SUM calculated in the file exists.

In step 240, if there is a calculated value MD5SUM calculated in the file, it is determined whether the calculated value MD5SUM is the same (step 250).

In step 250, if it is determined that the calculated value MD5SUM is the same, any song group period 110 transmits a message to the any song group period 110 that the requested file is 'present' (step 260). )

In addition, in step 220, it is determined that the next karaoke period 120-1, 120-2, 120-3, ..., 120-n is a file existence query from any karaoke period 110 If not, it is checked whether a file transmission request is received from the random song period 110 (step 270).

In step 270, if it is determined that the next music cycle period 120-1, 120-2, 120-3, ..., 120-n is a file transmission request from an arbitrary music cycle period 110, It is determined whether the number of connections being transmitted is equal to or less than the reference number (n). (Step 280) Here, the reference number (n) is a value that is determined according to the performance of the song cycle and is not limited to a specific number.

In step 280, if the connection being transmitted is equal to or less than the reference number, a transmission connection is created (step 290).

In step 280, if the number of connections being transmitted is greater than or equal to the reference number, a message of 'unanswerable (BUSY)' is transmitted to the random song period 110 (step 300).

In step 230, if a file of the same size in the same path does not exist, it is determined whether a file of the same path and the same calculation value (md5sum) is being downloaded (step 310).

In step 310, when downloading the file of the same path and the same calculation value (md5sum), the message 'downloading' is transmitted to an arbitrary song period 110 (step 320).

In step 310, if the file of the same path and the same calculation value (md5sum) is not being downloaded, the message “No” is transmitted to an arbitrary song cycle period 110 (step 330).

In addition, in step 240, when the calculated value MD5SUM does not exist in the file, it is determined whether a calculation thread exists in the file (step 340).

In step 340, if there is a calculation thread in the corresponding file, the message 'in calculation' is transmitted to a random song cycle 110 (step 350).

In step 340, if there are no calculation threads in the corresponding file, it is determined whether the number of calculation threads is any number (n) or less than any number (step 360).

In step 360, if the calculation threads are any number and less than any opening, the calculation value md5sum is calculated and a thread is generated (step 370).

Subsequently, step 350 is performed. That is, the message 'calculating' is transmitted to any song cycle period 110.

Meanwhile, in step 250, if the calculated value MD5SUM is not determined to be the same, that is, the calculated value MD5SUM is not the same, the step 330 is performed. That is, a message of 'no file' is transmitted to any song cycle period 110.

In operation 360, when the calculation threads are any number and more than any number, the step 300 is performed. That is, a message of 'unresponsive' (BUSY) is transmitted to the random song period 110.

On the other hand, after performing the process of steps 260, 270, 290, 300, 320, 330, 350, any of the cycle period 110 or the side cycle period 120-1, 120-2, 120-3 , ..., 120-n) to wait for the file existence and / or file transmission request, or to perform. That is, the process waits to perform the same process as in step 210 or, if there is a process, repeats the process from step 210.

As described above, in the method of distributing the communication load of the karaoke cycle according to the present invention, as shown in FIGS. 3 and 4, for example, any karaoke cycle 110 among a plurality of karaoke cycles in a karaoke is performed. A method of determining whether a file to be downloaded exists in the next song group cycle (120-1, 120-2, 120-3, ..., 120-n). In the karaoke (business) to allow a connection to one content transmission server 100 for one file.

That is, before receiving a file from the content delivery server 100, each karaoke cycle checks whether the file exists in the next karaoke cycle, and if it is confirmed that there is no corresponding file in all karaoke cycle in the store, the content delivery server 100 How to receive a file from.

Accordingly, it is possible to eliminate the inconvenience of the operation of the conventional representative music cycle cycle method described above, and to eliminate the traffic overload of the manner in which all the music cycle cycles are connected to the content delivery server 100.

This will be described in detail.

As described above, in the method of distributing the communication load of the karaoke cycle according to the present invention, when the arbitrary karaoke cycle 110 has a target file to be transmitted, it is requested to first transmit the file to all karaoke cycles next to it. Next, the music group cycles 120-1, 120-2, 120-3, ..., 120-n next to the music group cycle 110 requested by the random song group are 'downloading', 'no corresponding file', Responds to any song group cycle 110 that has requested a message of 'the file present', 'finding the existence of the file', 'unresponsive (BUSY)', 'start transmission'.

Subsequently, if any song cycle period 110 analyzes the above messages and determines that there are no song cycles having the corresponding file, it receives a file from the content delivery server 100.

On the other hand, if there is a side music cycle (120-1, 120-2, 120-3, ..., 120-n) that has the file, the side music cycle (120-1, 120-2, 120) -3, ..., 120-n) waits until the file can be transferred.

And if the file (requested file) is transmitted by a specific side music cycle (120-1, 120-2, 120-3, ..., 120-n), the random music cycle 110 is the file Receive

The received file is verified and the processing for one file transfer is completed.

As described above, in the method of distributing the communication load of the karaoke cycle according to the present invention, the traffic of the Internet section is reduced compared to all existing karaoke cycles downloaded from the content delivery server 100.

In addition, the communication load distribution method of the karaoke cycle according to the present invention is not a form in which one representative karaoke cycle is transmitted to all karaoke cycles as before, and there is no need for special management of the representative karaoke cycle as before.

In addition, the method for distributing the communication load of the karaoke cycle according to the present invention, if the karaoke cycle with a lot of content to be downloaded by leaving it in the OFF state for a long time is connected to online without receiving a file from the content transmission server 100 through the Internet, You can get a file at a faster speed in the nearest side music cycle.

As described above, the present invention has been described with reference to one embodiment shown in the drawings, but this is only an example, and those skilled in the art may make various modifications and equivalent embodiments therefrom. Will understand. Therefore, the true scope of protection of the present invention should be defined only by the appended claims.

1 and 2 schematically show the configuration of a communication system of a conventional song cycle.

3 is a flow chart sequentially showing a communication load distribution method of a karaoke cycle according to the present invention.

Figure 4 is a block diagram schematically showing the configuration of the communication load distribution system of the song cycle cycle to which the communication load distribution method of the song cycle according to the present invention.

Claims (9)

(a) inquiring whether there is a file in the next karaoke period provided by any karaoke cycle on one side of the karaoke cycle, and requesting the file transmission; (b) determining whether the next song cycle is a file presence query from the random song cycle; (c) in step (b), if it is determined that the next karaoke cycle is a file existence query from the arbitrary karaoke cycle, checking whether a file of the same size in the same path exists; (d) in step (c), if there exists a file of the same size in the same path, determining whether there is a calculated value calculated in the file; (e) in step (d), if there is a calculated value calculated in the file, determining whether the calculated value is the same; (f) in step (e), if it is determined that the calculated value is the same, transmitting a message to the arbitrary karaoke period that the file requested by the arbitrary karaoke period is 'present'; and , (g) in step (b), if it is not determined that the next song cycle is a file existence query from the any song cycle, checking whether the file transfer request from the song cycle is requested; (h) in step (g), if it is determined that the next song cycle is a file transmission request from the arbitrary song cycle, determining whether the connection being transmitted is equal to or less than a reference number; (i) in step (h), if the number of connections being transmitted is equal to or less than the reference number, generating a transmission connection. delete The method of claim 1, In the step (h), if the number of connections being transmitted is more than the reference number, the communication load distribution method of the cycle cycle, characterized in that it further comprises the step of transmitting a message "unresponsive" to the arbitrary cycle period . delete delete The method of claim 1, (l) in step (d), if there is no calculation value calculated in the file, determining whether a calculation thread exists in the file; (m) in step (l), if there is a calculation thread in the corresponding file, transmitting a message of 'calculating' to the arbitrary song cycle period. Distributing communication load in the song cycle. The method of claim 6, (n) in step (m), if there are no calculation threads in the corresponding file, determining whether the number of calculation threads is any number and less than any opening; (o) in step (n), calculating the calculated value and generating a thread if the number of calculation threads is any number and less than any opening; (p) performing the step (m); communication load distribution method of the karaoke cycle characterized in that it further comprises. The method of claim 7, wherein In the step (n), if the number of calculation threads (threads) more than any number and a certain number, further comprising the step of transmitting a message "unresponsive" to the song cycle period Method of distributing communication load in the song cycle cycle. delete

Images