Remote teaching method, system and device based on cloud computing and storage medium
By setting up multiple virtual nodes on the cloud server and using the visit prediction model, the problem of communication resource occupation in the remote teaching system is solved, efficient storage and access of teaching content is achieved, and the efficiency and reliability of remote teaching is improved.
Patent Information
- Application Number
- CN202411075840.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-07
- Publication Date
- 2024-11-22
AI Technical Summary
When the existing cloud-based remote teaching system uploads and reads teaching content, the problem of communication resource occupation has not been effectively solved, resulting in inefficiency.
By setting up multiple virtual nodes on the cloud server, the teacher side stores teaching content redundantly in multiple nodes. The monitoring unit monitors the node's storage space and delay time in real time. The management unit allocates the best execution node for the access task and passes the The visit volume prediction model predicts future visit volume and optimizes task allocation and backup strategies.
It realizes efficient storage and access of teaching content, prevents single point of failure, improves the efficiency and reliability of distance teaching, and ensures smooth access of teaching content.
Smart Images

Figure CN119003169A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of data processing technology, and more specifically to a remote teaching method, system, device and storage medium based on cloud computing. Background Art
[0002] With the continuous improvement of network infrastructure and the continuous maturity of cloud computing technology, cloud computing distance education will be popularized and applied in a wider range. In particular, in some areas and schools with scarce educational resources, cloud computing distance education will become an important supplement and alternative. Similar prior art includes a Chinese patent with publication number CN112907207A, which proposes a cloud computing-based distance education system and method, which relates to the field of distance education technology, including: a terminal management module, which is used to obtain verification information of teacher objects and student objects, and extract teaching-related data of teacher objects and student objects; a cloud computing module, which is used to process teaching-related data, and determine the teaching needs of teaching teachers and students, fuzzy screen the teaching needs, and determine the priority of teaching needs; a course execution module, which is used to extract the teaching needs of teaching teachers and students, and search and query the courses, make reservations, and conduct virtual teaching evaluation, and match the corresponding course teaching channels; the embodiment of the present invention determines the teaching needs of teaching teachers and students, fuzzy screens the teaching needs, determines the priority of teaching needs, and generates cloud computing course adjustment processing, thereby optimizing task instructions, giving priority to task instructions, and improving the efficiency of distance education. In addition, similar prior art includes a Korean patent with publication number KR20220146786A, which discloses a central server with a built-in learner-customized coding cloud education platform, which uses various information of learners to provide coding education content suitable for the learner's level, and an education platform containing the platform, including: collecting information such as voice, video, text, stories, etc. input by users, as well as the acquisition process of device information, spatial information, structured and unstructured data, etc. The process of identifying, understanding and interpreting the situation of coding learners based on input information and obtained information; providing coding education programs to coding learners, and analyzing and determining the situation of coding learners by storing coding training courses for coding learners. Both of the above documents solve the problem of realizing remote learning based on cloud computing, but neither of them takes into account the problem of communication resource occupation when uploading and reading teaching content. Summary of the invention
[0003] In order to better solve the above problems, the present invention provides a remote teaching method based on cloud computing, which comprises the following steps:
[0004] Step S1: storing different teaching contents in multiple virtual nodes on the cloud server based on a first access task sent by the teacher, and accessing the teaching contents in the multiple virtual nodes by receiving a second access task from the student, wherein the same teaching content is stored in the multiple virtual nodes;
[0005] Step S2: the monitoring unit monitors the remaining storage space of each virtual node and the delay time of processing the access task in real time, divides the first node and the second node according to the remaining storage space and the delay time, sends the first access task received by the first node and the second access task received by the second node to the management unit, and adds the first access task and the second access task to the corresponding list;
[0006] Step S3: allocating the best execution node to the first access task and the second access task in the list through the management unit;
[0007] Step S4: Use the type of teaching content in the historical data of each virtual node, the update time of the teaching content, the number of student users corresponding to the teaching content, and the number of visits to the teaching content at different times as training data, train a visit prediction model, and use the visit prediction model to predict the number of visits to each teaching content corresponding to each virtual node within a preset time in the future.
[0008] As a preferred technical solution of the present invention, step S1 comprises:
[0009] The teacher end uploads different teaching contents to multiple virtual nodes on the cloud server in real time or non-real time by sending the first access task, and the same teaching content is redundantly uploaded to multiple virtual nodes. The virtual node receives the second access task sent by the student end through the communication interface, and accesses the teaching content of each virtual node according to the sending of the second access task, wherein the physical distance between the virtual nodes for the same teaching content is greater than the set distance.
[0010] As a preferred technical solution of the present invention, step S2 includes the following steps:
[0011] Step S21: monitoring the remaining storage space of each virtual node and the delay time for processing the access task in real time through the monitoring unit;
[0012] Step S22: taking the virtual node whose remaining storage space is less than or equal to the first threshold as the first node, and when the first node receives the first access task, sending the first access task to the management unit, adding the first access task to the first list, and sorting the first access tasks in the first list from large to small according to the storage space occupied;
[0013] Step S23: The virtual node whose delay time is greater than or equal to the second threshold is used as the second node. When the second node receives the second access task, the second access task is sent to the management unit, and the second access task is added to the second list, and the second access tasks in the second list are sorted from high to low according to the real-time requirements.
[0014] As a preferred technical solution of the present invention, step S3 includes the following steps:
[0015] Step S31: according to the order of the first access tasks in the first list, each of the first access tasks is used as a first target task, the delay time of the virtual node whose remaining storage space is greater than the storage space required by the first target task is obtained, and the third node whose delay time is the smallest and less than a third threshold is used as the execution node of the first target task, wherein the third threshold is less than the second threshold;
[0016] Step S32: taking any of the second access tasks in the second list as the second target task, obtaining in real time through the monitoring unit the other virtual nodes that contain the teaching content to be accessed by the second target task and whose delay time is less than the second threshold, taking the virtual nodes as the fourth nodes, forwarding the second access task to the fourth node with the smallest delay time through the management unit, and taking the fourth node with the smallest delay time as the execution node;
[0017] Step S33: Repeat the steps S31 to S32 to obtain the execution nodes of each of the first access tasks and each of the second access tasks in the first list and the second list.
[0018] As a preferred technical solution of the present invention, the step S3 also includes: when the third node cannot be found in the virtual node, when the virtual node whose remaining storage space is greater than the storage space required by the first target task cannot be found, or when the minimum delay time in the virtual node whose remaining storage space is greater than the storage space required by the first target task is greater than the third threshold, the N virtual nodes whose remaining storage space is greater than the set threshold and whose delay time is the smallest are used as nodes to be selected, and the first target task is divided into N sub-access tasks based on the remaining storage space of the nodes to be selected, and the N sub-access tasks are executed by N execution nodes, wherein the ratio of the storage space occupied by any two of the sub-access tasks to the remaining storage space of the corresponding execution nodes is equal, wherein the total remaining storage space of the N execution nodes is greater than the storage space required by the first target task, and the ratio of the storage space occupied by any two of the sub-access tasks to the remaining storage space of the corresponding execution nodes is equal;
[0019] When the student terminal accesses any one of the N execution nodes through the second access task, the second access task is forwarded to the other N-1 execution nodes, and the N execution nodes respectively send the corresponding sub-teaching contents to the management unit, and the management unit combines the N sub-teaching contents into the complete teaching content.
[0020] As a preferred technical solution of the present invention, step S4 includes:
[0021] Creating the access volume prediction model, using the type of the teaching content, update time, number of corresponding student users, and the second task access volume of the teaching content in different time periods in all the virtual node historical data as training data, and training the access volume model based on a machine learning algorithm;
[0022] The type, update time, and corresponding number of student users corresponding to each teaching content in the virtual node are input into the access prediction model to predict the access of each teaching content in a future preset time period, and based on the access of each teaching content in the preset time period, the total access of each virtual node in the preset time period is obtained.
[0023] As a preferred technical solution of the present invention, step S4 is followed by step S5: within the preset time period, when the total number of visits to the virtual node corresponding to the delay time is greater than the set time, the teaching content with the largest number of visits in the virtual node is backed up to multiple backup nodes before the preset time period, and deleted after the preset time period, wherein the backup nodes are the M virtual nodes with the smallest total number of visits within the preset time period among the nodes to be backed up whose remaining storage space is greater than the storage space occupied by the teaching content with the largest number of visits, and the value of M is a positive integer greater than or equal to 1.
[0024] The present invention also provides a remote teaching system based on cloud computing, the system is used to implement the above method, the system comprises:
[0025] The teacher end is used to send a first access task to store different teaching contents in multiple virtual nodes on the cloud server, wherein the same teaching content is stored in multiple virtual nodes;
[0026] The student terminal is used to send a second access task to access the teaching contents in the plurality of virtual nodes;
[0027] A virtual node, used for storing the teaching content;
[0028] The monitoring unit is configured to: monitor the remaining storage space of each virtual node and the delay time for processing the access task in real time, and divide the first node and the second node according to the remaining storage space and the delay time, send the first access task received by the first node and the second access task received by the second node to the management unit, and add the first access task and the second access task to the corresponding list;
[0029] A management unit, configured to allocate an optimal execution node to the first access task and the second access task in the list;
[0030] The model creation unit is configured to use the type of teaching content in the historical data of each virtual node, the update time of the teaching content, the number of student users corresponding to the teaching content, and the number of visits to the teaching content at different times as training data, train a visit prediction model, and use the visit prediction model to predict the number of visits to each teaching content corresponding to each virtual node within the preset time in the future.
[0031] The present invention also provides a cloud computing-based remote education device, comprising:
[0032] Memory for storing computer programs;
[0033] A processor is used to implement the above method when executing the computer program.
[0034] The present invention also provides a computer storage medium, wherein the storage medium stores program instructions, wherein when the program instructions are executed, the device where the storage medium is located is controlled to execute the above method.
[0035] Compared with the prior art, the beneficial effects of the present invention are at least as follows:
[0036] The present invention sends the above-mentioned first access task through the teacher end, redundantly uploads the same above-mentioned teaching content to the multiple above-mentioned virtual nodes of the above-mentioned cloud server, and also disperses the positions of any two above-mentioned virtual nodes storing the same above-mentioned teaching content to prevent the failure of one of the virtual nodes from affecting other above-mentioned virtual nodes. The above-mentioned second access task is sent through the student end to access the above-mentioned teaching content in the above-mentioned virtual node. By monitoring the remaining storage space of each above-mentioned virtual node and the delay time for processing the above-mentioned access task, the above-mentioned virtual node whose remaining storage space is less than or equal to the above-mentioned first threshold is used as the first node, and the above-mentioned virtual node whose delay time is greater than or equal to the above-mentioned second threshold is used as the above-mentioned second node. The above-mentioned first access task and the above-mentioned second access task received by the above-mentioned first access task and the above-mentioned second node are sent to the above-mentioned management unit, and the virtual node with the shortest delay time is selected from the above-mentioned virtual nodes that meet the above-mentioned remaining storage space greater than the storage space required by the above-mentioned first target task as the above-mentioned third node, that is, the execution node of the first target task, and the virtual node containing The other virtual nodes that contain the teaching content to be accessed by the second target task and whose delay time is less than the second threshold are used as the fourth nodes, and the virtual node with the smallest delay time among the fourth nodes is used as the execution node of the first target task. When the third node that meets the requirements cannot be found among the virtual nodes, the virtual nodes are sorted from small to large according to the delay time, and the virtual nodes with remaining storage space greater than the set threshold among the N virtual nodes are obtained according to the sorting as the selection nodes, and the first target task is divided into N sub-access tasks based on the remaining storage space of the N selection nodes, so as to realize efficient execution of the first target task, and the total number of visits to each virtual node within a preset time period is predicted in advance through the access volume prediction model, and the teaching content with the largest number of visits in the virtual node with a larger total number of visits is backed up in advance to the virtual node with a smaller total number of visits and a smaller delay, and the efficient execution of the first access task and the second access task is realized through the mutual cooperation of the above technical solutions. BRIEF DESCRIPTION OF THE DRAWINGS
[0037] Figure 1 This is a flow chart of the remote teaching method based on cloud computing of the present invention;
[0038] Figure 2 This is a structural diagram of the remote teaching system based on cloud computing of the present invention. DETAILED DESCRIPTION
[0039] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.
[0040] The present invention provides a remote teaching method based on cloud computing, such as Figure 1 As shown, the method comprises the following steps:
[0041] Step S1: storing different teaching contents in multiple virtual nodes on the cloud server based on a first access task sent by the teacher, and accessing the teaching contents in the multiple virtual nodes by receiving a second access task sent by the student, wherein the same teaching content is stored in the multiple virtual nodes;
[0042] Specifically, the teacher terminal sends the first access task to the virtual node of the cloud server, and uploads the different teaching contents to the multiple virtual nodes on the cloud server in real time or non-real time according to the first access task. The student terminal accesses the teaching contents in the virtual nodes by sending the second access task. By redundantly uploading the same teaching contents to multiple virtual nodes, when one of the virtual nodes has a large number of visits or fails, making it impossible for the student terminal to access the virtual node in real time through the second access task, the second access task can be executed through other virtual nodes. The locations of any two virtual nodes storing the same teaching contents are dispersed to prevent the failure of one virtual node from affecting other virtual nodes, thereby making access smoother.
[0043] Step S2: the monitoring unit monitors the remaining storage space of each virtual node and the delay time of processing the access task in real time, divides the first node and the second node according to the remaining storage space and the delay time, sends the first access task received by the first node and the second access task received by the second node to the management unit, and adds the first access task and the second access task to the corresponding list;
[0044] Specifically, the remaining storage space of each of the above-mentioned virtual nodes and the delay time for processing the above-mentioned access tasks are monitored by the above-mentioned monitoring unit, so as to timely understand the storage resource usage, access traffic and processing speed of each of the above-mentioned virtual nodes, wherein the greater the access traffic of the above-mentioned virtual nodes, the slower the processing speed and the longer the delay time. The above-mentioned virtual nodes whose remaining storage space is less than or equal to the above-mentioned first threshold are taken as the first nodes, that is, the virtual nodes with insufficient storage space, and the above-mentioned virtual nodes whose delay time is greater than or equal to the above-mentioned second threshold are taken as the above-mentioned second nodes, that is, the nodes with large access traffic and long processing delay time. When the above-mentioned first node and the above-mentioned second node receive and process the above-mentioned first access task and the second access task respectively, the processing pressure of the above-mentioned first node and the above-mentioned second node will be aggravated. Therefore, the above-mentioned first access task and the above-mentioned second access task received by the above-mentioned first access task and the above-mentioned second node are sent to the above-mentioned management unit, and the above-mentioned management unit obtains the optimal execution node corresponding to each of the above-mentioned first access task and the above-mentioned second access task, so that the above-mentioned first access task and the above-mentioned second access task in the above-mentioned list can be efficiently executed.
[0045] Step S3: allocating optimal execution nodes for the first access task and the second access task through the management unit;
[0046] Specifically, the higher the first access task is ranked in the first list of the management unit, the larger the storage space it needs and the higher the requirement for the remaining storage space of the execution node. Therefore, the first access task is taken as the first target task in turn, and the virtual node that satisfies the above-mentioned remaining storage space is greater than the storage space required by the first target task is taken as the first node to be executed, and the virtual node with the shortest delay time is selected from the first node to be executed as the third node, and the third node is used as the execution node of the first target task. The higher the second access task is ranked in the second list, the higher the real-time requirement is. Therefore, each of the second access tasks is taken as the second target task in the order in the second list. target task, since the same teaching content is redundantly stored on multiple virtual nodes, and the second to-be-executed nodes containing other teaching contents to be accessed by the second target task are monitored in real time through the monitoring unit, the second to-be-executed nodes whose delay time is less than the second threshold are used as the fourth nodes, and the fourth nodes with the smallest delay time among the fourth nodes are used as the execution nodes of the first target task, that is, the fourth nodes with the fastest processing speed, wherein the list includes the first list and the second list. Through the technical solution, the optimal execution nodes are allocated to each of the first target task and the second target task, so as to ensure the efficient execution of the first target task and the second target task.
[0047] Step S4: Use the type of teaching content in the historical data of each virtual node, the update time of the teaching content, the number of student users corresponding to the teaching content, and the number of visits to the teaching content at different times as training data to train a visit prediction model, and use the visit prediction model to predict the number of visits to each teaching content corresponding to each virtual node within the preset time in the future.
[0048] Specifically, by creating the above-mentioned access volume prediction model, and inputting the type, update time, corresponding number of student users of the above-mentioned teaching content in the historical data of all the above-mentioned virtual nodes and the access volume of the above-mentioned teaching content corresponding to the above-mentioned second task in different time periods as the training data of the above-mentioned access volume prediction model, due to different subject types, the learning methods are different. For example, liberal arts require repeated memorization, so the frequency of access may be higher. The access volume of the above-mentioned teaching content is also related to the update time of the above-mentioned teaching content and the corresponding number of student users. Among them, the closer to the above-mentioned update time, the greater the access volume, and vice versa. The more student users there are, the greater the corresponding access volume, and vice versa. Through the above-mentioned access volume prediction model, and inputting the type, update time, and corresponding number of student users of each of the above-mentioned teaching content in each of the above-mentioned virtual nodes into the above-mentioned access volume prediction model, it is possible to accurately predict the access volume of each of the above-mentioned teaching content at different time points in the future preset time period, and then calculate the total number of accesses of each virtual node in the future preset time period, and then judge whether it is necessary to migrate part of the above-mentioned teaching content to other virtual nodes in advance based on the above-mentioned total number of accesses, so as to ensure that each virtual node in the above-mentioned preset time period can efficiently execute the above-mentioned second access task.
[0049] Furthermore, the step S1 comprises:
[0050] A first access task is sent through the teacher end, and based on the first access task, different teaching contents are uploaded to multiple virtual nodes on the cloud server in real time or non-real time, and the same teaching content is redundantly uploaded to multiple virtual nodes. The virtual node receives a second access task sent by the student end through the communication interface, and accesses the teaching content of each virtual node according to the second access task, wherein the physical distance between the virtual nodes for the same teaching content is greater than the set distance.
[0051] Specifically, the teacher terminal sends the first access task to the cloud server virtual node, and uploads different teaching contents to multiple virtual nodes on the cloud server in real time or non-real time according to the first access task, wherein the teaching contents uploaded in real time are live courses, and the teaching contents uploaded non-real time are recorded courses. The student terminal accesses the teaching contents in the virtual nodes by sending the second access task, and redundantly uploads the same teaching contents to multiple virtual nodes. When one of the virtual nodes has a large number of visits or fails, so that the student terminal cannot access the virtual node in real time through the second access task, the second access task can be executed through other virtual nodes storing the teaching contents. The locations of any two virtual nodes storing the same teaching contents are dispersed to prevent the failure of one virtual node from affecting other virtual nodes, thereby making the access smoother.
[0052] Furthermore, the step S2 comprises the following steps:
[0053] Step S21: monitoring the remaining storage space of each virtual node and the delay time of processing access tasks in real time through the monitoring unit, wherein the access tasks include the first access task and the second access task;
[0054] Step S22: taking the virtual node whose remaining storage space is less than or equal to the first threshold as the first node, and when the first node receives the first access task, sending the first access task to the management unit, adding the first access task to the first list, and sorting the first access tasks in the first list from large to small according to the storage space occupied;
[0055] Specifically, the remaining storage space of each of the above-mentioned virtual nodes and the delay time for processing the above-mentioned access tasks are monitored by the above-mentioned monitoring unit, so as to timely understand the storage resource usage, access traffic and processing speed of each of the above-mentioned virtual nodes, wherein the greater the access traffic of the above-mentioned virtual node, the slower the processing speed and the longer the delay time. The above-mentioned virtual node whose remaining storage space is less than or equal to the above-mentioned first threshold is regarded as the first node, that is, the virtual node with insufficient storage space. Since the above-mentioned first node is a virtual node with insufficient storage space and the above-mentioned first access task is a task of uploading the occupied storage space, the storage space shortage will be further aggravated. Therefore, when the above-mentioned first node receives the above-mentioned first access task, the above-mentioned first access task is sent to the above-mentioned management unit, and through the above-mentioned management unit, an execution node with better performance is found, thereby ensuring the efficient execution of the first access task.
[0056] Step S23: The virtual node whose delay time is greater than or equal to the second threshold is used as the second node. When the second node receives the second access task, the second access task is sent to the management unit, and the second access task is added to the second list, and the second access tasks in the second list are sorted from high to low according to the real-time requirements.
[0057] Specifically, the virtual node whose delay time is greater than or equal to the second threshold is also regarded as the second node, that is, a node with large access traffic and long processing delay time. When the second node receives and processes the second access task, the processing pressure of the second node will be aggravated, resulting in a longer delay time. Therefore, the second access task received by the second node is sent to the management unit and added to the second list. The second access tasks in the second list are sorted according to real-time requirements. The optimal execution node corresponding to each second access task is obtained through the management unit, so that each second access task in the second list can be efficiently executed.
[0058] Furthermore, step S3 includes the following steps:
[0059] Step S31: according to the order of the first access tasks in the first list, each of the first access tasks is used as a first target task, the delay time of the virtual node whose remaining storage space is greater than the storage space required by the first target task is obtained, and the third node whose delay time is the smallest and less than a third threshold is used as the execution node of the first target task, wherein the third threshold is less than the second threshold;
[0060] Specifically, since the first access tasks in the first list require more storage space as they are closer to the front, the requirements for the remaining storage space of the execution node are higher, therefore, according to the order of the first access tasks in the first list, the first access tasks are sequentially used as the first target tasks, wherein the first target task is for the teacher to upload teaching content, which has high requirements for real-time performance and storage capacity, especially for live teaching content. Therefore, the virtual node that satisfies the requirement that the remaining storage space is greater than the storage space required for the first target task is used as the first node to be executed, and the virtual node with the shortest delay time is selected from the first node to be executed as the third node, and the third node is used as the execution node of the first target task, wherein the delay time of the third node is less than the third threshold. Through the above technical solution, the first target task can be efficiently executed, thereby ensuring the smooth execution of the second access task corresponding to the student end.
[0061] Step S32: taking any of the second access tasks in the second list as the second target task, obtaining in real time through the monitoring unit the other virtual nodes that contain the teaching content to be accessed by the second target task and whose delay time is less than the second threshold, taking the virtual nodes as the fourth nodes, forwarding the second type of access tasks to the fourth node with the smallest delay time through the management unit, and taking the fourth node with the smallest delay time as the execution node;
[0062] Step S33: Repeat the steps S31 to S32 to obtain the execution nodes of each of the first access tasks and each of the second access tasks in the first list and the second list.
[0063] Specifically, the higher the ranking of the second access task in the second list is, the higher the real-time requirement is. Therefore, each of the second access tasks is used as the second target task in the order in the second list. Since the same teaching content is redundantly stored on multiple virtual nodes, and the second to-be-executed nodes containing other teaching contents to be accessed by the second target task are monitored in real time by the monitoring unit, the second to-be-executed nodes whose delay time is less than the second threshold are used as the fourth nodes, and the fourth nodes with the smallest delay time among the fourth nodes are used as the execution nodes of the first target task, that is, the fourth node with the fastest processing speed. Through the technical solution, the optimal execution node is allocated to each of the second target tasks to ensure efficient execution of the second target tasks.
[0064] Further, the step S3 also includes: when the third node cannot be found in the virtual node, when the virtual node whose remaining storage space is greater than the storage space required by the first target task cannot be found, or when the minimum delay time in the virtual node whose remaining storage space is greater than the storage space required by the first target task is greater than the third threshold, the N virtual nodes whose remaining storage space is greater than the set threshold and whose delay time is the smallest are used as selection nodes, and the first target task is divided into N sub-access tasks based on the remaining storage space of the selection nodes, and the N sub-access tasks are executed through the N selection nodes, wherein the ratio of the storage space occupied by any two of the sub-access tasks to the remaining storage space of the corresponding selection nodes is equal, wherein the total remaining storage space of the N selection nodes is greater than the storage space required by the first target task, and the ratio of the storage space occupied by any two of the sub-access tasks to the remaining storage space of the corresponding selection nodes is equal;
[0065] When the student terminal accesses any one of the N selection nodes through the second access task, the second access task is forwarded to the other N-1 selection nodes, and the N selection nodes respectively send the corresponding sub-teaching contents to the management unit, and the management unit combines the N sub-teaching contents into the complete teaching content.
[0066] Specifically, when the third node that meets the requirements cannot be found in the virtual nodes, that is, there is no virtual node that meets the requirement that the remaining storage space is greater than the storage space required for the first target task and that the delay time is less than the third threshold, since the real-time requirement of the first target task is relatively high, the virtual nodes are sorted from small to large according to the delay time, and the virtual nodes whose remaining storage space is greater than the set threshold are obtained from the N virtual nodes according to the sorting as the selection nodes, and the first target task is divided into N sub-access tasks based on the remaining storage space of the N selection nodes, and the ratio of the storage space required for any two of the sub-access tasks to the remaining storage space of the corresponding selection nodes is equal, and the other N-1 selection nodes are stored in each of the selection nodes. The ID information of the point is collected, and the sub-teaching contents corresponding to the N selection nodes are sequentially stored in the management unit. When the student terminal accesses any one of the N selection nodes through the second access task, the second access task is forwarded to the other N-1 selection nodes through the selection node. The N selection nodes also send the corresponding sub-teaching contents to the management unit respectively. After receiving all the sub-teaching contents, the management unit splices the sub-teaching contents into the complete teaching content in sequence. Through the technical solution, not only can the first target task be completed efficiently when the third node cannot be found, but also the teaching content can be completely restored from the multiple selection nodes when the student terminal accesses the teaching content corresponding to the first target task.
[0067] Furthermore, the step S4 comprises:
[0068] Creating the access volume prediction model, using the type of the teaching content, update time, number of corresponding student users, and the second task access volume of the teaching content in different time periods in all the virtual node historical data as training data, and training the access volume model based on a machine learning algorithm;
[0069] The type, update time, and corresponding number of student users corresponding to each teaching content in the virtual node are input into the access prediction model to predict the access of each teaching content in a future preset time period, and based on the access of each teaching content in the preset time period, the total access of each virtual node in the preset time period is obtained.
[0070] Specifically, by creating the above-mentioned access volume prediction model, and inputting the type, update time, corresponding number of student users of the above-mentioned teaching content in the historical data of all the above-mentioned virtual nodes and the access volume of the above-mentioned teaching content corresponding to the above-mentioned second task in different time periods as the training data of the above-mentioned access volume prediction model, the above-mentioned teaching content type, for example: liberal arts and science, due to different subject types, the learning methods are different, for example, liberal arts requires repeated memorization, so the frequency of access may be higher, and the access volume of the above-mentioned teaching content is also related to the update time of the above-mentioned teaching content and the corresponding number of student users, wherein, the closer to the above-mentioned update time, the greater the access volume, and vice versa, the smaller the number of student users, the greater the corresponding access volume, and vice versa; through the above-mentioned access volume prediction model, and inputting the type, update time, and corresponding number of student users of each of the above-mentioned teaching content in each of the above-mentioned virtual nodes into the above-mentioned access volume prediction model, it is possible to accurately predict the access volume of each of the above-mentioned teaching content at different time points in the future preset time period, and then calculate the total number of accesses of each virtual node in the future preset time period, and then judge whether it is necessary to migrate part of the above-mentioned teaching content to other virtual nodes in advance according to the above-mentioned total number of accesses, so as to ensure that each virtual node in the above-mentioned preset time period can efficiently execute the above-mentioned second access task.
[0071] Furthermore, the step S4 further includes a step S5:
[0072] Within the preset time period, when the total number of visits to the virtual node corresponding to the delay time is greater than the set time, the teaching content with the largest number of visits in the virtual node is backed up to multiple backup nodes before the preset time period and deleted after the preset time period, wherein the backup nodes are M virtual nodes with the smallest total number of visits within the preset time period among the nodes to be backed up whose remaining storage space is greater than the storage space occupied by the teaching content with the largest number of visits, and the value of M is a positive integer greater than or equal to 1.
[0073] Specifically, the delay time of the above-mentioned virtual node under the above-mentioned total access volume is obtained through the historical data of the above-mentioned virtual node, and when the above-mentioned delay time is greater than the set time, that is, when the delay time is too long and affects the access of student users, the above-mentioned teaching content with the largest access volume in the above-mentioned virtual node is backed up in advance to the above-mentioned multiple backup nodes, so that within the above-mentioned preset time period, due to the advance backup to multiple backup nodes, the access pressure of the above-mentioned virtual node with a larger delay time due to the large access volume can be shared, thereby improving the access efficiency, wherein the above-mentioned virtual node whose remaining storage space is greater than the storage space occupied by the above-mentioned teaching content with the largest access volume is used as the above-mentioned node to be backed up, and the M above-mentioned virtual nodes with the smallest total access volume among the above-mentioned nodes to be backed up, through the above-mentioned technical scheme, the access efficiency of the virtual nodes with a large total access volume and a long delay time within the preset time period is improved, and at the same time, the resource utilization rate of the virtual nodes with a large remaining storage space and a small access volume is also improved.
[0074] The present invention also provides a remote teaching system based on cloud computing, the system is used to implement the above method, such as Figure 2 As shown, the system comprises:
[0075] The teacher end is used to send a first access task to store different teaching contents in multiple virtual nodes on the cloud server, wherein the same teaching content is stored in multiple virtual nodes;
[0076] The student terminal is used to send a second access task to access the teaching contents in the plurality of virtual nodes;
[0077] A virtual node, used for storing the teaching content;
[0078] The monitoring unit is configured to: monitor the remaining storage space of each virtual node and the delay time for processing the access task in real time, and divide the first node and the second node according to the remaining storage space and the delay time, send the first access task received by the first node and the second access task received by the second node to the management unit, and add the first access task and the second access task to the corresponding list;
[0079] A management unit, configured to allocate an optimal execution node to the first access task and the second access task in the list;
[0080] The model creation unit is configured to use the type of teaching content in the historical data of each virtual node, the update time of the teaching content, the number of student users corresponding to the teaching content, and the number of visits to the teaching content at different times as training data, train a visit prediction model, and use the visit prediction model to predict the number of visits to each teaching content corresponding to each virtual node within the preset time in the future.
[0081] The present invention also provides a cloud computing-based remote education device, comprising:
[0082] Memory for storing computer programs;
[0083] A processor is used to implement the above method when executing the computer program.
[0084] The present invention also provides a computer storage medium, wherein the storage medium stores program instructions, wherein when the program instructions are executed, the device where the storage medium is located is controlled to execute the above method.
[0085] In summary, the present invention sends the above-mentioned first access task through the teacher end, redundantly uploads the same above-mentioned teaching content to the multiple above-mentioned virtual nodes of the above-mentioned cloud server, and also disperses the positions of any two above-mentioned virtual nodes storing the same above-mentioned teaching content to prevent the failure of one of the virtual nodes from affecting other above-mentioned virtual nodes. The above-mentioned second access task is sent through the student end to access the above-mentioned teaching content in the above-mentioned virtual node. By monitoring the remaining storage space of each above-mentioned virtual node and the delay time for processing the above-mentioned access task, the above-mentioned virtual node whose remaining storage space is less than or equal to the above-mentioned first threshold is used as the first node, and the above-mentioned virtual node whose delay time is greater than or equal to the above-mentioned second threshold is used as the above-mentioned second node. The above-mentioned first access task and the above-mentioned second access task received by the above-mentioned first access task and the above-mentioned second node are sent to the above-mentioned management unit, and the virtual node with the shortest delay time is selected from the above-mentioned virtual nodes that satisfy the above-mentioned remaining storage space greater than the storage space required by the above-mentioned first target task as the above-mentioned third node, that is, the execution node of the first target task, and the The other virtual nodes that contain the teaching content to be accessed by the second target task and whose delay time is less than the second threshold are used as the fourth nodes, and the virtual node with the smallest delay time among the fourth nodes is used as the execution node of the first target task. When the third node that meets the requirements cannot be found among the virtual nodes, the virtual nodes are sorted from small to large according to the delay time, and the virtual nodes with remaining storage space greater than the set threshold among the N virtual nodes are obtained according to the sorting as the selection nodes, and the first target task is divided into N sub-access tasks based on the remaining storage space of the N selection nodes, so as to realize the efficient execution of the first target task, and the total number of visits to each virtual node within a preset time period is predicted in advance through the access volume prediction model, and the teaching content with the largest number of visits in the virtual node with a larger total number of visits is backed up in advance to the virtual node with a smaller total number of visits and a smaller delay, and the efficient execution of the first access task and the second access task is realized through the mutual cooperation of the above technical solutions.
[0086] The technical features of the above-mentioned embodiments can be combined arbitrarily. In order to make the description concise, not all possible combinations of the technical features in the above-mentioned embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0087] The above-mentioned embodiments only express several implementation methods of the present invention, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the patent of the present invention. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the concept of the present invention, and these all belong to the protection scope of the present invention. Therefore, the protection scope of the patent of the present invention shall be subject to the attached claims.
[0088] The above are only preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A remote teaching method based on cloud computing, characterized in that: The method comprises the following steps: Step S1: storing different teaching contents in multiple virtual nodes on the cloud server based on a first access task sent by the teacher, and accessing the teaching contents in the multiple virtual nodes by receiving a second access task from the student, wherein the same teaching content is stored in the multiple virtual nodes; Step S2: the monitoring unit monitors the remaining storage space of each virtual node and the delay time of processing the access task in real time, divides the first node and the second node according to the remaining storage space and the delay time, sends the first access task received by the first node and the second access task received by the second node to the management unit, and adds the first access task and the second access task to the corresponding list; Step S3: allocating the best execution node to the first access task and the second access task in the list through the management unit; Step S4: Use the type of teaching content in the historical data of each virtual node, the update time of the teaching content, the number of student users corresponding to the teaching content, and the number of visits to the teaching content at different times as training data, train a visit prediction model, and use the visit prediction model to predict the number of visits to each teaching content corresponding to each virtual node within a preset time in the future.
2. The method according to claim 1, characterized in that The step S1 comprises: The teacher end uploads different teaching contents to multiple virtual nodes on the cloud server in real time or non-real time by sending the first access task, and the same teaching content is redundantly uploaded to multiple virtual nodes. The virtual node receives the second access task sent by the student end through the communication interface, and accesses the teaching content of each virtual node according to the sending of the second access task, wherein the physical distance between the virtual nodes for the same teaching content is greater than the set distance.
3. The method according to claim 1, characterized in that The step S2 comprises the following steps: Step S21: monitoring the remaining storage space of each virtual node and the delay time for processing the access task in real time through the monitoring unit; Step S22: taking the virtual node whose remaining storage space is less than or equal to the first threshold as the first node, and when the first node receives the first access task, sending the first access task to the management unit, adding the first access task to the first list, and sorting the first access tasks in the first list from large to small according to the storage space occupied; Step S23: The virtual node whose delay time is greater than or equal to the second threshold is used as the second node. When the second node receives the second access task, the second access task is sent to the management unit, and the second access task is added to the second list, and the second access tasks in the second list are sorted from high to low according to the real-time requirements.
4. The method according to claim 3, characterized in that The step S3 comprises the following steps: Step S31: according to the order of the first access tasks in the first list, each of the first access tasks is used as a first target task, the delay time of the virtual node whose remaining storage space is greater than the storage space required by the first target task is obtained, and the third node whose delay time is the smallest and less than a third threshold is used as the execution node of the first target task, wherein the third threshold is less than the second threshold; Step S32: taking any of the second access tasks in the second list as the second target task, obtaining in real time through the monitoring unit the other virtual nodes that contain the teaching content to be accessed by the second target task and whose delay time is less than the second threshold, taking the virtual nodes as the fourth nodes, forwarding the second access task to the fourth node with the smallest delay time through the management unit, and taking the fourth node with the smallest delay time as the execution node; Step S33: Repeat the steps S31 to S32 to obtain the execution nodes of each of the first access tasks and each of the second access tasks in the first list and the second list.
5. The method according to claim 4, characterized in that The step S3 also includes: when the third node cannot be found in the virtual node, when the virtual node whose remaining storage space is greater than the storage space required by the first target task cannot be found, or when the minimum delay time in the virtual node whose remaining storage space is greater than the storage space required by the first target task is greater than the third threshold, the N virtual nodes whose remaining storage space is greater than the set threshold and whose delay time is the smallest are selected as nodes to be selected, and based on the remaining storage space of the nodes to be selected, the first target task is divided into N sub-access tasks, and the N sub-access tasks are executed through the N execution nodes, wherein the ratio of the storage space occupied by any two of the sub-access tasks to the remaining storage space of the corresponding execution nodes is equal, wherein the total remaining storage space of the N execution nodes is greater than the storage space required by the first target task, and the ratio of the storage space occupied by any two of the sub-access tasks to the remaining storage space of the corresponding execution nodes is equal; When the student terminal accesses any one of the N execution nodes through the second access task, the second access task is forwarded to the other N-1 execution nodes, and the N execution nodes respectively send the corresponding sub-teaching contents to the management unit, and the management unit combines the N sub-teaching contents into the complete teaching content.
6. The method according to claim 1, characterized in that The step S4 comprises: Creating the access volume prediction model, using the type of the teaching content, update time, number of corresponding student users, and the second task access volume of the teaching content in different time periods in all the virtual node historical data as training data, and training the access volume model based on a machine learning algorithm; The type, update time, and corresponding number of student users corresponding to each teaching content in the virtual node are input into the access prediction model to predict the access of each teaching content in a future preset time period, and based on the access of each teaching content in the preset time period, the total access of each virtual node in the preset time period is obtained.
7. The method according to claim 6, characterized in that The step S4 is followed by a step S5: within the preset time period, when the total number of visits to the virtual node corresponding to the delay time is greater than the set time, the teaching content with the largest number of visits in the virtual node is backed up to multiple backup nodes before the preset time period, and deleted after the preset time period, wherein the backup nodes are M virtual nodes with the smallest total number of visits within the preset time period among the nodes to be backed up whose remaining storage space is greater than the storage space occupied by the teaching content with the largest number of visits, and the value of M is a positive integer greater than or equal to 1.
8. A cloud computing-based distance learning system, the system being used to implement the method according to any one of claims 1 to 7, characterized in that: The system comprises: The teacher end is used to send a first access task to store different teaching contents in multiple virtual nodes on the cloud server, wherein the same teaching content is stored in multiple virtual nodes; The student terminal is used to send a second access task to access the teaching contents in the plurality of virtual nodes; A virtual node, used for storing the teaching content; The monitoring unit is configured to: monitor the remaining storage space of each virtual node and the delay time for processing the access task in real time, and divide the first node and the second node according to the remaining storage space and the delay time, send the first access task received by the first node and the second access task received by the second node to the management unit, and add the first access task and the second access task to the corresponding list; A management unit, configured to allocate an optimal execution node to the first access task and the second access task in the list; The model creation unit is configured to use the type of teaching content in the historical data of each virtual node, the update time of the teaching content, the number of student users corresponding to the teaching content, and the number of visits to the teaching content at different times as training data, train a visit prediction model, and use the visit prediction model to predict the number of visits to each teaching content corresponding to each virtual node within the preset time in the future.
9. A cloud computing-based distance education device, characterized in that: include: Memory for storing computer programs; A processor, configured to implement the method according to any one of claims 1 to 7 when executing the computer program.
10. A computer storage medium, characterized in that: The storage medium stores program instructions, wherein when the program instructions are executed, the device where the storage medium is located is controlled to execute the method according to any one of claims 1 to 7.
