Channel thread buffering method and system during channel switching
By using the hot buffer and cold buffer of the linked list structure during channel switching, the channel thread data is reasonably configured, which solves the problem of slow or lagging channel switching, and improves user experience and device response time, especially in poor network environments. Down.
Patent Information
- Application Number
- PCT/CN2024/092991
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-29
- Filing Date
- 2024-05-14
- Publication Date
- 2024-12-05
AI Technical Summary
Unreasonable data resource cache during channel switching results in slow or stuttering channel switching, especially in poor network environments that affect user experience.
A linked list consisting of playback nodes and buffer nodes is adopted to divide the hot buffer zone and cold buffer zone, and the channel thread data is reasonably configured according to the channel's viewing time and buffer time, optimize the channel switching process, and reduce the data buffering time.
By rationally configuring channel thread data, optimizing channel switching speed, improving user experience, reducing the adverse impact of high-frequency channel switching on resource buffering, saving cache resources, and providing a smoother and more stable playback experience.
Smart Images

Figure CN2024092991_05122024_PF_FP_ABST
Abstract
Description
Channel thread buffering method and system during channel switching Technical Field
[0001] The present invention relates to the field of smart homes, and in particular to a channel thread buffering method and system during channel switching. Background Art
[0002] Channel switching is a common feature in modern television and streaming platforms, where users need to switch between different channels to meet different needs. Channel switching requires requesting new media content from a server or broadcast signal source and presenting it to the user.
[0003] A common problem when switching channels is improper data resource caching. This can cause slow channel switching or even lag. When switching channels, the relevant data for the current channel must be loaded from local storage into memory and decoded before being converted into digital signals for processing by the chip or module. Improper data resource caching can cause the channel switching process to take longer or even fail. This is because when switching channels, the relevant data for the current channel must be loaded from local storage into memory, decoded, and then converted into digital signals for processing by the chip or module. Improper data resource caching takes longer to load, resulting in a longer channel switching time or even failure to complete the switch.
[0004] To address this issue, existing technologies commonly use data resource preloading and streaming media caching. Data resource preloading involves preloading media resources that may be needed in the future before a user switches channels. This is achieved by requesting resources in advance and caching them. This way, when the user switches channels, most of the media resources are already cached, allowing them to be presented to the user more quickly.
[0005] Streaming media caching technology refers to caching data during streaming, which allows for faster presentation of media content when users switch channels. Streaming media caching technology typically determines caching strategies based on factors such as user viewing history, predicted content the user is likely to watch, and real-time network conditions to maximize the streaming experience.
[0006] However, even with these technologies, data resource caching may not be efficient in real-world network environments. While these technologies work well in good network conditions, in poor network conditions with limited bandwidth, it can take several seconds or even longer (depending on the video resolution) for data to be downloaded and displayed to the user, significantly impacting the user experience.
[0007] Summary of the Invention
[0008] In view of this, the present invention proposes a channel thread buffering method and system during channel switching, the specific solution is as follows:
[0009] A channel thread buffering method for channel switching, comprising:
[0010] Construct a linked list consisting of one playback node and n buffer nodes arranged in sequence, where n ≥ 2; divide the linked list into a cold buffer and a hot buffer that covers at least one playback node and one buffer node;
[0011] Initialize the linked list, add the channel thread of the initial channel to the playback node, and add the channel threads of at most n channels close to the initial channel to the corresponding buffer nodes respectively;
[0012] When a user switches from an old channel to a new channel, the following operations are performed:
[0013] Check whether the new channel exists in the current linked list;
[0014] If it exists in the hot buffer, the channel thread of the old channel is moved, and the channel thread of the new channel is moved to the play node, and the linked list is updated;
[0015] If it exists in the cold buffer, the channel thread of the old channel is moved, and at the same time, according to the buffering time of the new channel, it is determined whether to move the thread of the new channel to the playback node, and the linked list is updated;
[0016] After the linked list is updated, the channel thread for decoding the old channel is stopped, and the channel thread for decoding the new channel in the playback node is started to achieve playback.
[0017] In one embodiment, if the new channel does not exist in the current linked list, then:
[0018] Obtain and create a channel thread for a new channel, and search the current linked list for a vacant node that does not contain a cached channel thread and belongs to the buffer node;
[0019] If there is a vacant node, the channel thread of the new channel is added to a vacant node;
[0020] If there is no vacant node, first eliminate the channel thread of a buffer node in the cold buffer to obtain a vacant node, and then add the channel thread of the new channel to the vacant node;
[0021] After adding the channel thread of the new channel, determine whether to move the thread of the new channel to the playback node based on the buffer time of the new channel, and update the linked list.
[0022] In a specific embodiment, the linked list is a bidirectional linked list, and a virtual head node and a virtual tail node that do not cache thread data are added at the head and tail of the linked list respectively to achieve fast query;
[0023] Nodes between the virtual head node and the virtual tail node can all implement bidirectional queries.
[0024] In a specific embodiment, the hot buffer includes a virtual head node, a play node, and two buffer nodes, and the cold buffer includes four buffer nodes.
[0025] In a specific embodiment, the amount of channel thread data that can be cached by the nodes in the hot buffer is larger than that of the nodes in the cold buffer.
[0026] In a specific embodiment, if the viewing time of a certain channel exceeds a preset viewing threshold, it proves that the user continues to watch the channel. When switching the channel, the channel thread of the channel is preferentially moved to the buffer node of the hot buffer.
[0027] In a specific embodiment, if the new channel exists in the hot buffer or the cold buffer, the channel thread of the old channel is moved from the play node to the buffer node in the hot buffer that is closest to the play node.
[0028] In a specific embodiment, “determining whether to move the thread of the new channel to the playback node according to the buffering time of the new channel” specifically includes:
[0029] If the buffering time of the new channel exceeds the preset buffering threshold, it proves that the user is still waiting to watch the new channel, and the channel thread of the new channel is moved to the playback node;
[0030] If the buffering time of the new channel does not exceed the buffering threshold, it proves that the user has switched channels again and the new channel has become the old channel.
[0031] A channel thread buffer system for channel switching, comprising:
[0032] A linked list construction unit is used to construct a linked list consisting of one playback node and n buffer nodes arranged in sequence, where n is greater than or equal to 2; and to divide the linked list into a cold buffer zone and a hot buffer zone that covers at least one playback node and one buffer node;
[0033] A linked list initialization unit, configured to initialize the linked list, add the channel thread of the initial channel to the playback node, and add the channel threads of at most n channels close to the initial channel to corresponding buffer nodes respectively;
[0034] The channel switching unit is used to perform the following operations when a user switches from an old channel to a new channel:
[0035] Check whether the new channel exists in the current linked list;
[0036] If it exists in the hot buffer, the channel thread of the old channel is moved, and the channel thread of the new channel is moved to the play node, and the linked list is updated;
[0037] If it exists in the cold buffer, the channel thread of the old channel is moved, and at the same time, according to the buffering time of the new channel, it is determined whether to move the thread of the new channel to the playback node, and the linked list is updated;
[0038] After the linked list is updated, the channel thread for decoding the old channel is stopped, and the channel thread for decoding the new channel in the playback node is started to achieve playback.
[0039] In a specific embodiment, the channel switching unit further includes:
[0040] If the new channel does not exist in the current list, then:
[0041] Obtain and create a channel thread for a new channel, and search the current linked list for a vacant node that does not contain a channel thread and is a buffer node;
[0042] If there is a vacant node, add the channel thread of the new channel to a vacant node;
[0043] If there is no vacant node, first eliminate the channel thread of a buffer node in the cold buffer to obtain a vacant node, and then add the channel thread of the new channel to the vacant node;
[0044] After adding the channel thread of the new channel, determine whether to move the thread of the new channel to the playback node based on the buffer time of the new channel, and update the linked list.
[0045] Beneficial effects: The present invention proposes a channel thread buffering method and system during channel switching. By rationally configuring thread data during channel switching, the speed of channel switching is optimized, and the data buffering time is reduced, so that users can enjoy a smoother and more stable playback experience. By setting cold buffers and hot buffers, the channel data in the node is rationally configured. By monitoring the duration of the channel, the adverse effects of high-frequency channel switching on resource buffering are reduced, saving cache resources. By analyzing user habits, the channel information that best suits user habits is configured in the node to improve the user experience. BRIEF DESCRIPTION OF THE DRAWINGS
[0046] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments. It should be understood that the following drawings only illustrate certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other relevant drawings can be obtained based on these drawings without paying any creative work.
[0047] FIG1 is a schematic diagram of a linked list structure according to an embodiment of the present invention;
[0048] FIG. 2 is a schematic diagram of a channel thread buffer system module according to an embodiment of the present invention.
[0049] Reference numerals: 1 - linked list construction unit; 2 - linked list initialization unit; 3 - channel switching unit. DETAILED DESCRIPTION
[0050] Hereinafter, various embodiments of the present disclosure will be described more fully. The present disclosure may have various embodiments, and modifications and variations may be made therein. However, it should be understood that there is no intention to limit the various embodiments of the present disclosure to the specific embodiments disclosed herein, but rather that the present disclosure should be construed to encompass all modifications, equivalents, and / or alternatives falling within the spirit and scope of the various embodiments of the present disclosure.
[0051] Taking video data as an example, playing video data requires at least the following steps:
[0052] Decoding: When you switch to a new channel, the TV receives a new video stream and needs to decode it. The video decoder converts the compressed video data stream into renderable video data for subsequent rendering processing.
[0053] Rendering: After decoding, the video data needs to be rendered. This process involves a series of processing on the video data, such as color space conversion, image scaling, noise reduction, etc. These processes improve the video quality and prepare it for subsequent drawing.
[0054] Rendering: After the rendering process is complete, the video data is passed to the image renderer for final image synthesis. The renderer combines the video data with other image elements on the TV (such as UI elements, text, etc.) to produce a displayable image frame.
[0055] It should be noted that in this process, decoding, rendering, and drawing are usually performed in parallel to improve the speed and efficiency of channel switching. In addition, different hardware and software platforms may have different implementation methods and optimization strategies, and the specific implementation may vary.
[0056] It should be noted that the linked list of the present invention is a chain structure in which each node is connected in sequence. Excluding the virtual head node and the virtual tail node, the play node is located at the head of the linked list.
[0057] It should be noted that the old channel and the new channel of the present invention are relative. The channel played before the channel switch is the old channel, and the channel played after the switch is the new channel. The new channel can be converted to the old channel at any time.
[0058] The terms used in the various embodiments disclosed in the present invention are only used to describe the purpose of specific embodiments and are not intended to limit the various embodiments disclosed in the present invention. As used herein, the singular form is intended to also include the plural form, unless the context clearly indicates otherwise. Unless otherwise specified, all terms used herein (including technical terms and scientific terms) have the same meaning as those generally understood by those skilled in the art of the various embodiments disclosed in the present invention. The terms (such as those defined in generally used dictionaries) will be interpreted as having the same meaning as the contextual meaning in the relevant technical field and will not be interpreted as having an idealized meaning or an overly formal meaning, unless clearly specified in the various embodiments disclosed in the present invention.
[0059] Example 1
[0060] Embodiment 1 of the present invention discloses a channel thread buffering method for channel switching. By rationally configuring thread data during channel switching, the channel switching speed is optimized and the user experience is enhanced. The specific solution is as follows:
[0061] A channel thread buffering method for channel switching, comprising the following steps:
[0062] 101. Construct a linked list consisting of one playback node and n buffer nodes arranged in sequence, where n ≥ 2; divide the linked list into a cold buffer and a hot buffer that covers at least one playback node and one buffer node;
[0063] 102. Initialize the linked list, add the channel thread of the initial channel to the playback node, and add the channel threads of at most n channels close to the initial channel to the corresponding buffer nodes respectively;
[0064] 103. When the user switches from the old channel to the new channel, perform the following operations:
[0065] Check whether the new channel exists in the current linked list;
[0066] If it exists in the hot buffer, move the channel thread of the old channel, move the channel thread of the new channel to the playback node, and update the linked list;
[0067] If it exists in the cold buffer, the channel thread of the old channel is moved. At the same time, according to the buffering time of the new channel, it is determined whether to move the thread of the new channel to the playback node and update the linked list;
[0068] After the linked list is updated, the channel thread decoding the old channel is stopped, and the channel thread decoding the new channel in the playback node is started to achieve playback.
[0069] In this embodiment, both step 101 and step 102 are for preparing for channel switching.
[0070] Step 101 is responsible for constructing a linked list, and the nodes on the linked list are responsible for storing the channel thread data of different channels. The channel thread data is the relevant media resources to be played on the channel, and the channel threads of some channels can be downloaded in advance. The linked list includes two types of nodes. One is the play node at the head of the linked list. The channel thread to be played is stored in this node, and the channel threads of other channels must be moved to the play node before they can be played. The other is the buffer node, which is responsible for storing the channel threads of the predicted channel. The number of buffer nodes must be at least greater than two, otherwise the meaning of the prediction is lost. It can be set according to the actual applicable storage space. The more buffer nodes there are, the more channels are predicted, the greater the probability of the channel being measured, and the higher the user experience.
[0071] In this embodiment, the linked list is divided into a hot buffer and a cold buffer according to the size of the cacheable resources, and the hot buffer includes at least one buffer node. In terms of the amount of cacheable channel thread data, the nodes in the hot buffer are larger than the nodes in the cold buffer. The hot buffer has more bufferable resources and can generally buffer 2M of data. The cold buffer can buffer less data and can generally buffer 1M of data. If a channel stays in the hot buffer for more than a preset time, it will be moved to the cold buffer. The hot buffer and the cold buffer solve the problem of resource allocation very well. In essence, they give more resources to channels with a high probability and give fewer resources to channels with a low probability. The play node, as the node that stores the currently playing channel, must be located in the hot buffer.
[0072] Furthermore, if a channel's data is not accessed for a long period of time, the buffer node in the cold buffer will remove the stored channel data to make room for new channel data. Therefore, channels in the cold buffer have a higher probability of being removed. Channels in the hot buffer will be moved to the cold buffer if they are not selected and are generally not removed directly.
[0073] The channel thread buffering method of this embodiment sets the linked list to a bidirectional linked list structure. The bidirectional linked list can implement bidirectional search, which allows for faster search of data throughout the linked list. Even if the linked list contains many nodes and stores many resources, the bidirectional linked list can quickly search for all resources in the linked list. Preferably, a virtual head node and a virtual tail node that do not cache thread data are added to the head and tail of the linked list, respectively, to achieve fast query; nodes between the virtual head node and the virtual tail node can all implement bidirectional query. Figure 1 shows a schematic diagram of the structure of the linked list.
[0074] Preferably, the hot buffer and cold buffer are continuous, not spaced apart. For example, the hot buffer includes a virtual head node, a play node, and two buffer nodes, while the cold buffer includes four buffer nodes. The two buffer nodes in the hot buffer are sequentially located after the play node, and the nodes in the cold buffer are also sequentially located after the nodes in the hot buffer.
[0075] The initialization linked list is primarily for the initial startup scenario. The channel thread for the initial channel (the channel to be played upon startup) is added to the playback node. The channel threads for up to n channels close to the initial channel are added to the corresponding buffer nodes. By default, these channels are the ones closest to the initial channel, and these channels are used as the initial prediction targets. There are a total of n buffer nodes, meaning n prediction targets. When initializing the linked list, you can select n or fewer channels.
[0076] When a user switches channels, two concepts emerge: the old channel and the new channel. The channel before the switch is defined as the old channel, and the channel after the switch is defined as the new channel. After switching channels, the current linked list is first searched for relevant data for the new channel within the node. As the new channel changes, the data in the corresponding linked list also changes, so the most recent linked list is used as the reference. There are three specific scenarios: the first is not in the linked list, the second is in the linked list's hot buffer, and the third is in the linked list's cold buffer. Both the second and third scenarios involve the new channel being in the linked list.
[0077] If the new channel exists in the hot buffer, the old channel's channel thread is removed from the playback node, the new channel's channel thread is moved to the playback node, and the linked list is updated. If a channel thread for the new channel already exists in the hot buffer, playback of that channel can be achieved at the fastest speed. The hot buffer is essentially used to store channels with higher probability. Once the new channel is confirmed to be in the hot buffer, proving the prediction is correct, a switch can be made immediately, and the new channel's channel thread can be moved to the playback node. The old channel's channel thread can be temporarily moved to a buffer node in the hot buffer, moved to the cold buffer, or even the old channel's data can be retired. The specific operation depends on the performance of the old channel.
[0078] For example, if the viewing time of a channel exceeds a preset viewing threshold, it proves that the user has been watching the channel continuously. When switching to the channel, the channel thread of this channel is preferentially moved to the buffer node of the hot buffer. The buffering strategy is tied to the user's viewing habits, and the channels that the user frequently uses are placed in higher priority nodes.
[0079] For example, if the new channel exists in the hot or cold buffer, the channel thread of the old channel is moved from the playback node to the buffer node closest to the playback node in the hot buffer. This solution defaults to giving the old channel a higher priority, assuming that users are more likely to repeatedly access the old channel for viewing.
[0080] In either case, the node data in the linked list will change, so the linked list must be updated in real time to ensure that the latest linked list is used as a reference each time the channel is switched.
[0081] If the new channel exists in the cold buffer, the channel thread of the old channel is moved, and at the same time, it is determined whether to move the thread of the new channel to the playback node based on the buffering time of the new channel, and the linked list is updated. This embodiment sets a buffer threshold, which can be simply understood as the threshold of the user's stay time on a certain channel. Specifically, if the buffering time of the new channel exceeds the preset buffer threshold, it proves that the user is still waiting to watch the new channel, and the channel thread of the new channel is moved to the playback node; if the buffering time of the new channel does not exceed the buffer threshold, it proves that the user has switched channels again, and the new channel has become the old channel. At this time, the channel can be placed in the node of the cold buffer. In actual applications, users can switch channels continuously and frequently. Setting a buffer threshold can reduce the waste of cache resources and reduce the cache amount of non-essential channel resources. It can also improve the response time of the device, reduce the user's waiting buffer time, and improve the user experience.
[0082] If the new channel doesn't exist in the current linked list, the new channel's channel thread is retrieved and created. The current linked list is searched for a vacant buffer node with an uncached channel thread. Previously, the number of buffer nodes was limited to n, and not every buffer node necessarily contained thread data. Furthermore, some channels that have been unused for a long time are removed from the cold buffer.
[0083] When there is a vacant node, the channel thread of the new channel is added to a vacant node. When the buffering time of the new channel exceeds the preset buffering threshold, it is moved to the playback node and the linked list is updated to prevent batch channel switching from wasting cache resources.
[0084] If there are no vacant nodes, the channel thread of a buffer node in the cold buffer is eliminated to obtain a vacant node. Then, the channel thread of the new channel is added to the vacant node. After the threads are added, the buffer time of the new channel is used to determine whether to move it to the playback node for playback and update the linked list.
[0085] This embodiment provides a channel thread buffering method for channel switching. By properly configuring thread data during channel switching, the channel switching speed is optimized, allowing users to enjoy a smoother and more stable playback experience. By setting cold and hot buffers, channel data in the node is properly configured. By monitoring the duration of the channel, the adverse effects of high-frequency channel switching on resource buffering are reduced, saving cache resources. By analyzing user habits, the channel information that best suits user habits is configured in the node, improving the user experience.
[0086] Example 2
[0087] Embodiment 2 of the present invention discloses a channel thread buffering system for channel switching, which systematizes the channel thread buffering method for channel switching of embodiment 1. The specific structure of the system is shown in FIG2 of the specification. The specific solution is as follows:
[0088] A channel thread buffer system for channel switching, comprising:
[0089] Linked list construction unit 1 is used to construct a linked list consisting of one playback node and n buffer nodes arranged in sequence, where n is greater than or equal to 2; and divide the linked list into a cold buffer zone and a hot buffer zone that covers at least one playback node and one buffer node;
[0090] Linked list initialization unit 2 is used to initialize the linked list, add the channel thread of the initial channel to the play node, and add the channel threads of at most n channels close to the initial channel to the corresponding buffer nodes respectively;
[0091] The channel switching unit 3 is used to perform the following operations when the user switches from an old channel to a new channel:
[0092] Check whether the new channel exists in the current linked list;
[0093] If it exists in the hot buffer, move the channel thread of the old channel, move the channel thread of the new channel to the playback node, and update the linked list;
[0094] If it exists in the cold buffer, the channel thread of the old channel is moved. At the same time, according to the buffering time of the new channel, it is determined whether to move the thread of the new channel to the playback node and update the linked list;
[0095] After the linked list is updated, the channel thread decoding the old channel is stopped, and the channel thread decoding the new channel in the playback node is started to achieve playback.
[0096] In a specific embodiment, the channel switching unit 3 further includes:
[0097] If the new channel does not exist in the current list, then:
[0098] Get and create a channel thread for the new channel, and check whether there is a vacant node in the current linked list that is not a cached channel thread and is a buffer node;
[0099] If there is a vacant node, add the channel thread of the new channel to a vacant node;
[0100] If there is no vacant node, first eliminate the channel thread of a buffer node in the cold buffer to obtain a vacant node, and then add the channel thread of the new channel to the vacant node;
[0101] After adding the channel thread of the new channel, determine whether to move the thread of the new channel to the playback node based on the buffer time of the new channel, and update the linked list.
[0102] This embodiment proposes a channel thread buffering system for channel switching, which systematizes the channel thread buffering method of embodiment 1 to make it more practical.
[0103] This invention proposes a channel thread buffering method and system for channel switching. By rationally configuring thread data during channel switching, the channel switching speed is optimized and data buffering time is reduced, allowing users to enjoy a smoother and more stable playback experience. By setting cold and hot buffers, channel data in nodes is rationally configured. By monitoring the duration of channels, the adverse effects of high-frequency channel switching on resource buffering are reduced, conserving cache resources. By analyzing user habits, channel information that best suits user habits is configured in nodes, improving the user experience.
[0104] Those skilled in the art will understand that the accompanying drawings are only schematic diagrams of a preferred implementation scenario, and the modules or processes in the accompanying drawings are not necessarily necessary for the implementation of the present invention. Those skilled in the art will understand that the modules in the devices in the implementation scenario can be distributed in the devices of the implementation scenario according to the description of the implementation scenario, or can be changed accordingly and located in one or more devices different from the present implementation scenario. The modules of the above-mentioned implementation scenarios can be combined into one module, or can be further split into multiple sub-modules. The above-mentioned serial numbers of the present invention are only for description and do not represent the advantages and disadvantages of the implementation scenarios. Disclosed above are only a few specific implementation scenarios of the present invention, but the present invention is not limited thereto, and any changes that can be thought of by those skilled in the art should fall within the scope of protection of the present invention.
Claims
1. A channel thread buffering method for channel switching, characterized in that: include: Construct a linked list consisting of one playback node and n buffer nodes arranged in sequence, where n≥2; divide the linked list into a cold buffer and a hot buffer covering at least the playback node and one buffer node; Initialize the linked list, add the channel thread of the initial channel to the play node, and add the channel threads of at most n channels close to the initial channel to the corresponding buffer nodes respectively; When a user switches from an old channel to a new channel, the following operations are performed: Check whether the new channel exists in the current linked list; If it exists in the hot buffer, the channel thread of the old channel is moved, and the channel thread of the new channel is moved to the play node, and the linked list is updated; If it exists in the cold buffer, the channel thread of the old channel is moved, and at the same time, according to the buffering time of the new channel, it is determined whether to move the thread of the new channel to the play node, and the linked list is updated; After the linked list is updated, the channel thread decoding the old channel is stopped, and the channel thread decoding of the new channel in the playback node is started to achieve playback.
2. The channel thread buffering method according to claim 1, characterized in that: If the new channel does not exist in the current linked list, then: Acquire and create a channel thread for a new channel, and search the current linked list for a vacant node that does not have a channel thread cached and belongs to the buffer node; If there is a vacant node, the channel thread of the new channel is added to a vacant node; If there is no vacant node, first eliminate the channel thread of a buffer node in the cold buffer to obtain a vacant node, and then add the channel thread of the new channel to the vacant node; After adding the channel thread of the new channel, determine whether to move the thread of the new channel to the playback node according to the buffer time of the new channel, and update the linked list.
3. The channel thread buffering method according to claim 1, characterized in that: The linked list is a bidirectional linked list, and a virtual head node and a virtual tail node that do not cache thread data are added to the head and tail of the linked list respectively to achieve fast query; The nodes between the virtual head node and the virtual tail node can all implement bidirectional query.
4. The channel thread buffering method according to claim 3, characterized in that: The hot buffer includes a virtual head node, a play node and two buffer nodes, and the cold buffer includes four buffer nodes.
5. The channel thread buffering method according to claim 1, characterized in that: The amount of channel thread data that can be cached is larger for the nodes in the hot buffer than for the nodes in the cold buffer.
6. The channel thread buffering method according to claim 5, characterized in that: If the viewing time of a certain channel exceeds a preset viewing threshold, it proves that the user continues to watch the channel, and when switching the channel, the channel thread of the channel is preferentially moved to the buffer node of the hot buffer.
7. The channel thread buffering method according to claim 5, characterized in that: If the new channel exists in the hot buffer or the cold buffer, the channel thread of the old channel is moved from the play node to the buffer node closest to the play node in the hot buffer.
8. The channel thread buffering method according to claim 1, characterized in that: "Judging whether to move the thread of the new channel to the playback node according to the buffering time of the new channel" specifically includes: If the buffering time of the new channel exceeds the preset buffering threshold, it means that the user is still waiting to watch the new channel, and the channel thread of the new channel is moved to the playback node; If the buffering time of the new channel does not exceed the buffering threshold, it proves that the user has switched channels again and the new channel has become the old channel.
9. A channel thread buffer system for channel switching, characterized in that: These include: A linked list construction unit is used to construct a linked list consisting of 1 playback node and n buffer nodes arranged in sequence, where n≥2; and to divide the cold buffer into a buffer that covers at least the playback node and A hot buffer for the buffer node; A linked list initialization unit, used to initialize the linked list, add the channel thread of the initial channel to the play node, and add the channel threads of at most n channels close to the initial channel to the corresponding buffer nodes respectively; The channel switching unit is used to perform the following operations when a user switches from an old channel to a new channel: Check whether the new channel exists in the current linked list; If it exists in the hot buffer, the channel thread of the old channel is moved, and the channel thread of the new channel is moved to the play node, and the linked list is updated; If it exists in the cold buffer, the channel thread of the old channel is moved, and at the same time, according to the buffering time of the new channel, it is determined whether to move the thread of the new channel to the play node, and the linked list is updated; After the linked list is updated, the channel thread decoding the old channel is stopped, and the channel thread decoding of the new channel in the playback node is started to achieve playback.
10. The channel thread buffer system according to claim 9, characterized in that: The channel switching unit also includes: If the new channel does not exist in the current linked list, then: Acquire and create a channel thread for a new channel, and search the current linked list for a vacant node that does not cache a channel thread and belongs to the buffer node; If there is a vacant node, add the channel thread of the new channel to a vacant node; If there is no vacant node, first eliminate the channel thread of a buffer node in the cold buffer to obtain a vacant node, and then add the channel thread of the new channel to the vacant node; After adding the channel thread of the new channel, determine whether to move the thread of the new channel to the playback node according to the buffer time of the new channel, and update the linked list.
Citation Information
Patent Citations
Method, device and TV set for switching channels
CN101197951A
Method for switching digital channel and device for processing digital video
CN101472154A
Method for controlling channel switching, device and electronic device
CN101729825A
Method for caching data
CN103514106A
Multi-process channel data switching method and device, television and storage medium
CN108737890A
