WO2017096842A1 - 内容分发任务的提交方法及系统 - Google Patents

内容分发任务的提交方法及系统 Download PDF

Info

Publication number
WO2017096842A1
WO2017096842A1 PCT/CN2016/088879 CN2016088879W WO2017096842A1 WO 2017096842 A1 WO2017096842 A1 WO 2017096842A1 CN 2016088879 W CN2016088879 W CN 2016088879W WO 2017096842 A1 WO2017096842 A1 WO 2017096842A1
Authority
WO
WIPO (PCT)
Prior art keywords
submission
task
priority
task submission
user
Prior art date
Application number
PCT/CN2016/088879
Other languages
English (en)
French (fr)
Inventor
陈浩
高俊
陈玉新
刘长付
Original Assignee
乐视控股(北京)有限公司
乐视云计算有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 乐视控股(北京)有限公司, 乐视云计算有限公司 filed Critical 乐视控股(北京)有限公司
Priority to US15/246,160 priority Critical patent/US20170161669A1/en
Publication of WO2017096842A1 publication Critical patent/WO2017096842A1/zh

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/40Support for services or applications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/61Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements

Definitions

  • the embodiments of the present invention relate to the field of CDN, and in particular, to a method and system for submitting a content distribution task.
  • Content Delivery Network is a distributed network composed of node server groups distributed in different regions. It pushes content sources such as Internet websites, network videos, and online games to network edge nodes close to users through certain rules.
  • the server enables the user to obtain the required content nearby, which is an important means to alleviate the congestion of the Internet network, improve the response speed of the Internet service, and improve the user experience.
  • content distribution is a basic function in the CDN service. By loading content (such as video, software, etc.) onto the edge node and then opening it to the user for access, the access efficiency of the user during initial access is improved.
  • the specific process is: after receiving the client's task submission request, the source server receives the files in the task, and distributes the files to all CDN node servers, and all CDN node servers store the files in the server local cache. Notifying the customer that the distribution task is successful, the customer can disclose the access address to the user and provide access.
  • the inventor has found that at least the following problems exist in the prior art: when multiple clients submit tasks at the same time, often a small number of customers cause a large amount of garbage data or unnecessary data due to wrong operation or unreasonable use. The task, or the customer's source station performance is poor, which reduces overall system performance and reduces the efficiency of content distribution.
  • the embodiment of the invention provides a method and a system for submitting a content distribution task, which are used to solve the defect that the multi-user submits a large number of tasks at the same time, which causes the overall performance of the system to be degraded, and implements the manner in which the task queue submits the content.
  • An embodiment of the present invention provides a method for submitting a content distribution task, including:
  • an embodiment of the present invention provides a submission system for content distribution tasks, including:
  • a receiving unit configured to receive multiple task submission requests from multiple users
  • a queue allocation unit configured to allocate the plurality of task submission requests to a plurality of task submission queues according to priorities of users in the user priority model, wherein each task submission queue corresponds to one submission priority
  • a submitting unit configured to submit the plurality of task submission queues to the distribution server according to the submission priority.
  • a method and system for submitting a content distribution task assigns a task submission request of a user to a different task submission queue according to a priority to which each user belongs in the user priority model, because each task submission queue corresponds to one Submitting priorities, so when multiple users submit a large number of tasks at the same time, users with higher priority can submit tasks faster, avoiding the trouble that users with lower priority submit tasks first, which leads to the overall performance of the system, and improves the efficiency of task submission. .
  • FIG. 1 is a flowchart of a method for submitting a content distribution task according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of a submission system of a content distribution task according to an embodiment of the present invention
  • FIG. 3 is a schematic structural diagram of an apparatus for implementing a method for submitting a content distribution task according to an embodiment of the present invention.
  • FIG. 1 is a flow chart of a method for submitting a content distribution task according to an embodiment of the present invention. As shown in Figure 1, the method includes:
  • the scheduling center receives multiple task submission requests from multiple users.
  • the scheduling center allocates the multiple task submission requests to multiple task submission queues according to the priority of each user in the user priority model, where each task submission queue corresponds to one submission priority;
  • S103 The scheduling center submits the multiple task submission queues to the distribution server according to the submission priority.
  • the scheduling center (the scheduling center is a server or a server cluster) allocates the user's task submission request to different task submission queues according to the priority of each user in the user priority model, because each task submission queue corresponds to This is a priority for submitting, so when multiple users submit a large number of tasks at the same time, this method enables users with higher priority to submit tasks earlier, avoiding users with lower priority submitting tasks first, resulting in lower overall system performance and improved tasks. The overall efficiency of the submission.
  • the determining process of the user priority model may be:
  • the dispatching center submits the submitted performance of the request according to the historical task, and divides the range of multiple submission performance intervals;
  • the dispatching center sets a plurality of priorities according to the plurality of submitted performance interval ranges
  • the dispatching center submits the submitted performance of the request according to the historical task of each user, and determines the user priority model of each user by referring to the plurality of submitted performance interval ranges.
  • the scheduling center submits the performance through the historical task of the user to determine the priority of the user, and can perform long-term operation of the user compared with determining the priority according to the task submitted by the user once.
  • the situation and source station performance are taken into account, and the data is more accurate.
  • the submission performance of each user is determined according to at least the amount of submitted tasks, the length of submissions, and the number of submission errors. Therefore, the process of determining which task submission request the user's task submission request should be assigned to according to the priority of the user in the user priority model may be, for example, by assigning a corresponding task amount, submission duration, and number of submission errors. Weight value, Get the weight of the submitted task amount, the submission duration, and the number of submission errors, to get the specific value of the user's submitted performance. After determining the range of the submission performance interval to which the specific value belongs, the priority to which the user belongs can be determined, thereby the task submission request of the user can be assigned to the task submission queue having different submission priorities.
  • the priority of the user does not always correspond to the commit priority of the task submission queue. This is because the number of user priorities corresponding to multiple task submission requests submitted to the distribution server at the same time is not necessarily equal to the number of priority of all users, that is, the user priority corresponding to multiple task submission requests may not be included. All user priorities, and the commit priority of the task submission queue is equal to the number of user priorities corresponding to the currently submitted multiple task submission requests.
  • the task submission speed of the user can be known, and the speed determines the priority to which the user belongs.
  • the task of a fast user is submitted first, which avoids the risk of system performance degradation or even paralysis caused by the accumulation of tasks caused by slower tasks being submitted first.
  • a user whose operation error probability is greater than a predetermined threshold and/or a user whose source station performance value is lower than a predetermined threshold may be determined as the lowest priority, and the lowest in the process of task submission.
  • the priority setting can make the submission process easy to make mistakes, that is, the task submission request that is easy to affect other users is separately assigned a task submission queue to isolate it from other task submission requests, reducing the task submission to other users. The impact of the process.
  • the scheduling center allocates the multiple task submission requests according to the priority of each user in the user priority model to multiple task submission queues in step S102.
  • the scheduling center submits a request for multiple tasks in the same task submission queue, and sets different content priorities according to the type of content submitted by the task submission request;
  • the scheduling center sorts multiple task submission requests in the same task submission queue according to the content priority.
  • the scheduling center performs content priority ordering by submitting a request to a task in the same queue, that is, submitting a request for a task belonging to the same submitting priority to perform priority determination again, and the type of the content herein may be expressed as timeliness. It can make the content with higher real-time requirements, that is, more urgent content, such as news, be processed preferentially, and the content with low real-time requirements and excessive volume is finally Get a response.
  • This embodiment can meet the needs of users on the basis of maintaining a good overall performance of the system.
  • the scheduling center may also determine the content priority corresponding to the task submission request of the new user when the task submission request with the new user is allocated to the task submission queue in which the task to be submitted is multiple, and according to The content priority assigns a new user's task submission request to the task belonging to the content priority.
  • FIG. 2 is a schematic structural diagram of a submission system of a content distribution task according to an embodiment of the present invention. As shown in FIG. 2, the system includes a receiving unit 201, a queue allocating unit 202, and a submitting unit 203.
  • the receiving unit 201 is configured to receive a plurality of task submission requests from a plurality of users.
  • the queue allocation unit 202 is configured to allocate the plurality of task submission requests received by the receiving unit 201 to the plurality of task submission queues according to the priority of each user in the user priority model, wherein each task submission queue corresponds to one submission priority. ;
  • the submitting unit 203 is configured to submit a plurality of task submit queues to which the plurality of task submit requests are allocated by the queue allocating unit 202 to the distribution server according to the commit priority.
  • the submission system of the content distribution task in this embodiment is a scheduling center in the CDN system, and the scheduling center is a server or a server cluster, wherein each unit may be a separate server or a server cluster, and at this time, between the above units
  • the interaction is represented by an interaction between servers or server clusters corresponding to the units, and the plurality of servers or server clusters together constitute a submission system for the content distribution task of the present invention.
  • the submitting system that the plurality of servers or server clusters together constitute the content distribution task of the present invention includes:
  • Receiving a server or server cluster configured to receive multiple task submission requests from multiple users
  • the queue allocation server or the server cluster is configured to allocate the plurality of task submission requests received by the receiving server or the server cluster to the plurality of task submission queues according to the priority of each user in the user priority model, wherein each task submission queue corresponds to At a submission priority;
  • a server or server cluster is submitted, configured to submit a plurality of task submission queues that have been assigned a plurality of task submission requests through the queue allocation server or the server cluster to the distribution server according to the submission priority.
  • the receiving unit and the queue allocating unit together form a first server or a first server cluster
  • the submitting unit constitutes a second server or a second server cluster.
  • the interaction between the above units is represented by an interaction between each of the first server and the second server or an interaction between the first server cluster and the second server cluster, the first server and the second server or the first
  • the server cluster and the second server cluster together constitute a submission system for the content distribution task of the present invention.
  • the system in this embodiment further includes a model determining unit 204.
  • the model determining unit 204 is connected to the queue allocating unit 202 for submitting the submitted performance of the request according to the historical task, and dividing the multiple submission performance.
  • An interval range setting a plurality of priorities according to the plurality of submission performance interval ranges; submitting the submitted performance of the request according to the history task of each user, and determining the user priority of each user by referring to the plurality of submission performance interval ranges Level model.
  • the model determining unit in this embodiment may be a server or a server cluster.
  • the interaction between the model determining unit and all the units in the embodiment shown in FIG. 2 represents an interaction between servers or server clusters corresponding to the respective units, and the plurality of servers or server clusters together constitute the present invention.
  • the receiving unit and the queue allocating unit together form a first server or a first server cluster
  • the model determining unit constitutes a second server or a second server cluster
  • the submitting unit constitutes a third server or a third server cluster.
  • the interaction between the above units is represented by an interaction between each of the first server to the third server or an interaction between the first server cluster to the third server cluster, the first server to the third server or the first The server cluster to the third server cluster together constitute a submission system for the content distribution task of the present invention.
  • the submission performance is determined based at least on the amount of submitted tasks, the length of submissions, and the number of submission errors.
  • system in this embodiment further includes a queue content sorting unit 205, configured to:
  • Submit multiple requests for the same task in the same task submission queue set different content priorities according to the type of content submitted by the task; submit multiple tasks in the same task submission queue Requests are sorted according to the content priority.
  • the queue content sorting unit in this embodiment may be a server or a server cluster.
  • the interaction between the queue content sorting unit and all the units in the above embodiment is represented by the interaction between the server or the server cluster corresponding to each unit, and the plurality of servers or server clusters together constitute the content distribution of the present invention.
  • the submission system for the task is represented by the interaction between the server or the server cluster corresponding to each unit, and the plurality of servers or server clusters together constitute the content distribution of the present invention.
  • the receiving unit and the queue allocating unit together form a first server or a first server cluster
  • the model determining unit constitutes a second server or a second server cluster
  • the submitting unit and the queue content sorting unit together form a third server or a third server cluster.
  • the interaction between the above units is represented by an interaction between each of the first servers to the third servers or an interaction between the first server cluster and the third server cluster, the first server to the third server or the first A server cluster to a third server cluster together constitute a submission system for the content distribution task of the present invention.
  • the distribution server in the process that the distribution server receives the task and distributes it to other nodes, if the distribution fails, the user may not perform the manual retry, and the distribution retry process is performed. After the distribution is successful, the user is sent to the user. A successful notification can be distributed.
  • a related function module can be implemented by a hardware processor.
  • the present invention provides a non-transitory computer readable storage medium having stored therein one or more programs including execution instructions that can be executed by an electronic device with a control interface
  • execution instructions for example:
  • FIG. 3 is a schematic structural diagram of a device 300 for implementing a method for submitting a content distribution task according to an embodiment of the present invention.
  • the specific implementation of the device 300 does not limit the specific implementation of the device 300.
  • the device 300 can include:
  • a processor 310 a communications interface 320, a memory 330, and a communication bus 340. among them:
  • the processor 310, the communication interface 320, and the memory 330 complete communication with each other via the communication bus 340.
  • the communication interface 320 is configured to communicate with a network element such as a client.
  • the processor 310 is configured to execute the program 332 in the memory 830 to perform the related steps in the foregoing method embodiments.
  • program 332 can include program code, the program code including computer operating instructions.
  • the processor 310 may be a central processing unit CPU, or an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present invention.
  • CPU central processing unit
  • ASIC Application Specific Integrated Circuit
  • the memory 330 is configured to store the program 332.
  • the memory 330 may include a high speed RAM memory and may also include a non-volatile memory such as at least one disk memory.
  • the program 332 can be specifically configured to cause the device 300 to perform the following operations:
  • Receiving step receiving multiple task submission requests from multiple users
  • a queue allocation step allocating the plurality of task submission requests to a plurality of task submission queues according to a priority of each user in the user priority model, wherein each task submission queue corresponds to one submission priority;
  • submission step submit the plurality of task submission queues to the distribution server according to the submission priority.
  • the CDN service provider submits the submitted performance of the request according to the historical task, including the task submission amount, the submission duration and the number of submission errors, and divides the five submission performance interval ranges, for example, 50-60 is an interval range, and 60-70 is an interval range. 70-80 is an interval range, 80-90 is an interval range, 90-100 is an interval range, and five priority levels are set according to the five submission performance interval ranges.
  • the submission performance of the historical task submission requests of customer A, customer B, customer C, and customer D are 93, 72, 78, and 55, respectively, thereby determining the priority model of each customer, among which User A belongs to the first priority, customer B and customer C belong to the third priority, and customer D belongs to the fifth priority.
  • the server receives their task submission request, and assigns client A's task submission request to the first submission according to the priority to which it belongs.
  • the priority task submission queue allocates the task submission request of the client B and the client C to the task submission queue corresponding to the second submission priority, and distributes the task submission request of the client D to the task submission corresponding to the third submission priority. queue.
  • the device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, ie may be located A place, or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. Those of ordinary skill in the art can understand and implement without deliberate labor.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Telephonic Communication Services (AREA)

Abstract

本发明提供了一种内容分发任务的提交方法,包括:接收来自多个用户的多个任务提交请求;将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;将所述多个任务提交队列按照所述提交优先级提交至分发服务器。本发明还提供了相应的系统。本发明实施例所示方法及系统,按照用户优先级模型中各用户所属的优先级将用户的任务提交请求分配至不同的任务提交队列,由于每一个任务提交队列对应于一个提交优先级,因此在多个用户同时提交大量任务时使得优先级高的用户能够较快提交任务,避免优先级低的用户先提交任务从而导致系统整体性能降低的麻烦,提高了任务提交的效率。

Description

内容分发任务的提交方法及系统 技术领域
本发明实施例涉及CDN领域,尤其涉及一种内容分发任务的提交方法及系统。
背景技术
内容分发网络(CDN,Content Delivery Network)是由分布在不同区域的节点服务器群组成的分布式网络,通过一定规则将互联网网站、网络视频、网络游戏等内容源推送到接近用户的网络边缘节点服务器,使用户可以就近取得所需的内容,是缓解互联网网络拥塞,提高互联网业务响应速度,改善用户业务体验的重要手段。其中,内容分发是CDN服务中的一项基本功能,通过将内容(例如视频、软件等)加载到边缘节点上,然后再开放给用户访问,来提高用户初始访问时的访问效率。具体过程为:源服务器在收到客户的任务提交请求后,接收该任务中的文件,并将这些文件分发到所有CDN节点服务器上,所有的CDN节点服务器将这些文件存储在服务器本地缓存后,通知客户分发任务执行成功,客户可以将访问地址向用户公开并提供访问。
在实现本发明的过程中,发明人发现现有技术至少存在以下问题:当多客户同时提交任务时,常有少量客户因错误操作或不合理的使用方式导致系统产生大量垃圾数据或不必要的任务,或者客户的源站性能不佳,从而使系统整体性能下降,降低了内容分发的效率。
发明内容
本发明实施例提供一种内容分发任务的提交方法及系统,用以解决现有技术中多用户同时提交大量任务导致系统整体性能下降的缺陷,实现任务队列提交内容的方式。
一方面本发明实施例提供一种内容分发任务的提交方法,包括:
接收来自多个用户的多个任务提交请求;
将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;
将所述多个任务提交队列按照所述提交优先级提交至分发服务器。
另一方面本发明实施例提供一种内容分发任务的提交系统,包括:
接收单元,用于接收来自多个用户的多个任务提交请求,
队列分配单元,用于将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;
提交单元,用于将所述多个任务提交队列按照所述提交优先级提交至分发服务器。
本发明实施例提供的内容分发任务的提交方法及系统,按照用户优先级模型中各用户所属的优先级将用户的任务提交请求分配至不同的任务提交队列,由于每一个任务提交队列对应于一个提交优先级,因此在多个用户同时提交大量任务时使得优先级高的用户能够较快提交任务,避免优先级低的用户先提交任务从而导致系统整体性能降低的麻烦,提高了任务提交的效率。
附图说明
为了更清楚地说明本发明实施例中的技术方案,下面将对实施例描述中所需要使用的附图作一简单地介绍,显而易见地,下面描述中的附图是本发明的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下,还可以根据这些附图获得其他的附图。
图1为本发明一实施例的内容分发任务的提交方法的流程图;
图2为本发明一实施例的内容分发任务的提交系统的结构示意图;
图3为实施本发明实施例的内容分发任务的提交方法的设备的结构示意图。
具体实施方式
为使本发明实施例的目的、技术方案和优点更加清楚,下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例是本发明一部分实施例,而不是全部的实施例。基于 本发明中的实施例,本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。
图1是本发明一实施例的内容分发任务的提交方法的流程图。如图1所示,该方法包括:
S101:调度中心接收来自多个用户的多个任务提交请求;
S102:调度中心将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;
S103:调度中心将所述多个任务提交队列按照所述提交优先级提交至分发服务器。
本发明实施例中,调度中心(调度中心为服务器或者服务器集群)按照用户优先级模型中各用户所属的优先级将用户的任务提交请求分配至不同的任务提交队列,由于每一个任务提交队列对应于一个提交优先级,因此在多个用户同时提交大量任务时该方法使得优先级高的用户能够较先提交任务,避免了优先级低的用户先提交任务从而导致系统整体性能降低,提高了任务提交的整体效率。
图1所示实施例中,在步骤S101接收来自多个用户的多个任务提交请求之前,用户优先级模型的确定过程可以是:
调度中心根据历史任务提交请求的提交表现,划分多个提交表现区间范围;
调度中心根据所述多个提交表现区间范围,设定多个优先级;
调度中心根据各个用户的历史任务提交请求的提交表现,参照所述多个提交表现区间范围,确定所述各个用户的用户优先级模型。
本实施例的用户优先级模型确定过程中,调度中心通过用户的历史任务提交表现,来确定用户的优先级,与根据用户一次的任务提交表现来确定优先级相比,能够将用户长期的操作情况及源站性能考虑进去,数据较为准确。
图1所示实施例中,各个用户的提交表现至少根据其提交任务量、提交时长、提交错误次数来确定。由此,根据用户在用户优先级模型中所属的优先级确定用户的任务提交请求应该被分配到哪个任务提交队列的过程可以是,例如,通过对提交任务量、提交时长、提交错误次数分配相应的权重值, 得到提交任务量、提交时长和提交错误次数的权重和,从而得到用户的提交表现的具体数值。确定该具体数值属于的提交表现区间范围后,即可确定用户所属的优先级,由此可以将用户的任务提交请求分配至具有不同提交优先级的任务提交队列。应当理解的是,用户的优先级与任务提交队列的提交优先级并不总是一一对应的。这是因为同一时刻要提交至分发服务器的多个任务提交请求对应的用户优先级的数量并不一定与所有用户优先级的数量相等,即多个任务提交请求对应的用户优先级可能并没有包括所有的用户优先级,而任务提交队列的提交优先级与当前提交的多个任务提交请求对应的用户优先级数量相等。
本实施例中通过将提交表现根据提交任务量、提交时长、提交错误次数来确定,能够得知用户的任务提交速度,该速度决定了用户所属的优先级。速度快的用户的任务先提交,可以避免因速度较慢的任务先提交造成的任务堆积导致系统性能下降甚至瘫痪的风险。作为本实施例的进一步优化,本发明实施例中可以将操作错误概率大于预定阈值的用户和/或源站性能值低于预定阈值的用户确定为最低优先级,在任务提交的过程中,最低优先级的设定可以使提交过程中容易出错,即容易对其他用户造成影响的任务提交请求单独分配一个任务提交队列,使其与其他任务提交请求隔离开来,减少了对其他用户的任务提交过程的影响。
作为图1所示实施例的进一步优化,本发明实施例中在步骤S102调度中心将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列后还包括:
S1021:调度中心对于同一任务提交队列中的多个任务提交请求,根据任务提交请求的内容的类型,设定不同的内容优先级;
S1022:调度中心将同一任务提交队列中的多个任务提交请求按照所述内容优先级进行排序。
本实施例中调度中心通过对同一队列中的任务提交请求进行内容优先级的排序,即对属于同一提交优先级的任务提交请求再次进行优先级确定,此处的内容的类型可以表现为时效性,可以使得实时性要求较高即较为紧急的内容,例如新闻,优先得到处理,而实时性要求较低且体积过大的内容最后 得到响应。本实施例能够在保持系统整体性能较好的基础上,满足用户的需求。
本发明实施例中调度中心还可以在有新用户的任务提交请求被分配至其中待提交的任务为多个的任务提交队列中时,确定新用户的任务提交请求对应的内容优先级,并根据该内容优先级将新用户的任务提交请求分配至属于该内容优先级的任务后。
图2是本发明一实施方式的内容分发任务的提交系统的结构示意图。如图2所示,该系统包括接收单元201、队列分配单元202和提交单元203。
接收单元201用于接收来自多个用户的多个任务提交请求。
队列分配单元202用于将接收单元201接收到的多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;
提交单元203用于将通过队列分配单元202分配了多个任务提交请求的多个任务提交队列按照所述提交优先级提交至分发服务器。
本实施例中的内容分发任务的提交系统为CDN系统中的调度中心,该调度中心为一个服务器或者服务器集群,其中每个单元可以是单独的服务器或者服务器集群,此时,上述单元之间的交互表现为各单元所对应的服务器或者服务器集群之间的交互,所述多个服务器或服务器集群共同构成本发明的内容分发任务的提交系统。
具体地,所述多个服务器或服务器集群共同构成本发明的内容分发任务的提交系统包括:
接收服务器或者服务器集群,配置以接收来自多个用户的多个任务提交请求;
队列分配服务器或者服务器集群,配置以将接收服务器或者服务器集群接收到的多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;
提交服务器或者服务器集群,配置以将通过队列分配服务器或者服务器集群分配了多个任务提交请求的多个任务提交队列按照所述提交优先级提交至分发服务器。
在一种替代实施例中,可以是上述多个单元中的几个单元共同组成一个服务器或者服务器集群。例如:接收单元和队列分配单元共同组成第一服务器或者第一服务器集群,提交单元构成第二服务器或者第二服务器集群。
此时,上述单元之间的交互表现为各第一服务器和第二服务器之间的交互或者第一服务器集群和第二服务器集群之间的交互,所述第一服务器和第二服务器或第一服务器集群和第二服务器集群共同构成本发明的内容分发任务的提交系统。
作为图2所示实施例的进一步优化,本实施例中系统还包括模型确定单元204,模型确定单元204与队列分配单元202连接,用于根据历史任务提交请求的提交表现,划分多个提交表现区间范围;根据所述多个提交表现区间范围,设定多个优先级;根据各个用户的历史任务提交请求的提交表现,参照所述多个提交表现区间范围,确定所述各个用户的用户优先级模型。
本实施例中的模型确定单元可以为一个服务器或者服务器集群。此时,模型确定单元和图2所示实施例中的所有单元之间的交互表现为各单元所对应的服务器或者服务器集群之间的交互,所述多个服务器或者服务器集群共同构成本发明的内容分发任务的提交系统。
在一种替代实施例中,可以是上述多个单元中的几个单元共同组成一个服务器或者服务器集群。例如:接收单元和队列分配单元共同组成第一服务器或者第一服务器集群,模型确定单元构成第二服务器或者第二服务器集群,提交单元构成第三服务器或者第三服务器集群。
此时,上述单元之间的交互表现为各第一服务器至第三服务器之间的交互或者第一服务器集群至第三服务器集群之间的交互,所述第一服务器至第三服务器或第一服务器集群至第三服务器集群共同构成本发明的内容分发任务的提交系统。
图2所示实施例中,提交表现至少根据提交任务量、提交时长、提交错误次数来确定。
作为图2所示实施例的进一步优化,本实施例中系统还包括队列内容排序单元205,用于:
对于同一任务提交队列中的多个任务提交请求,根据任务提交请求的内容的类型,设定不同的内容优先级;将同一任务提交队列中的多个任务提交 请求按照所述内容优先级进行排序。
本实施例中的队列内容排序单元可以为一个服务器或者服务器集群。此时,队列内容排序单元和上述实施例中的所有单元之间的交互表现为各单元所对应的服务器或者服务器集群之间的交互,所述多个服务器或者服务器集群共同构成本发明的内容分发任务的提交系统。
在一种替代实施例中,可以是上述多个单元中的几个单元共同组成一个服务器或者服务器集群。例如:接收单元和队列分配单元共同组成第一服务器或者第一服务器集群,模型确定单元构成第二服务器或者第二服务器集群,提交单元和队列内容排序单元共同组成第三服务器或者第三服务器集群。
此时,上述单元之间的交互表现为各第一服务器至各第三服务器之间的交互或者第一服务器集群至第三服务器集群之间的交互,所述第一服务器至第三服务器或第一服务器集群至第三服务器集群共同构成本发明的内容分发任务的提交系统。
本发明实施例中,分发服务器接收到任务并分发给其他节点的过程中,若出现分发失败的情况,可以不必通知用户进行手动重试,自行进行分发重试过程,在分发成功后向用户发送分发成功的通知即可。
本发明实施例中可以通过硬件处理器(hardware processor)来实现相关功能模块。
本发明提供一种非瞬时性(non-transitory)计算机可读存储介质,所述存储介质中存储有一个或多个包括执行指令的程序,所述执行指令能够被带有控制界面的电子设备执行,以用于执行上述方法实施例中的相关步骤,例如:
接收来自多个用户的多个任务提交请求;
将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;
将所述多个任务提交队列按照所述提交优先级提交至分发服务器。
图3是实施本发明实施例的内容分发任务的提交方法的设备300的结构示意图,本发明具体实施例并不对设备300的具体实现做限定。如图3所示,该设备300可以包括:
处理器(processor)310、通信接口(Communications Interface)320、存储器(memory)330、以及通信总线340。其中:
处理器310、通信接口320、以及存储器330通过通信总线340完成相互间的通信。
通信接口320,用于与比如客户端等的网元通信。
处理器310,用于执行存储器830中的程序332,以执行上述方法实施例中的相关步骤。
具体地,程序332可以包括程序代码,所述程序代码包括计算机操作指令。
处理器310可能是一个中央处理器CPU,或者是特定集成电路ASIC(Application Specific Integrated Circuit),或者是被配置成实施本发明实施例的一个或多个集成电路。
存储器330,用于存放程序332。存储器330可能包含高速RAM存储器,也可能还包括非易失性存储器(non-volatile memory),例如至少一个磁盘存储器。程序332具体可以用于使得设备300执行以下操作:
接收步骤:接收来自多个用户的多个任务提交请求;
队列分配步骤:将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;
提交步骤:将所述多个任务提交队列按照所述提交优先级提交至分发服务器。
程序332中各步骤的具体实现可以参见上述实施例中的相应步骤和单元中对应的描述,在此不赘述。所属领域的技术人员可以清楚地了解到,为描述的方便和简洁,上述描述的设备和模块的具体工作过程,可以参考前述方法实施例中的对应过程描述,在此不再赘述。
下面以具体实施例对本发明作进一步的说明。
CDN服务商根据历史任务提交请求的提交表现,包括任务提交量、提交时长和提交错误次数等,划分了五个提交表现区间范围,例如50-60为一个区间范围,60-70为一个区间范围,70-80为一个区间范围,80-90为一个区间范围,90-100为一个区间范围,并根据所述五个提交表现区间范围设定了五个优先级。客户A、客户B、客户C和客户D的历史任务提交请求的提交表现分别为93、72、78和55,由此确定了各个客户的优先级模型,其中客 户A属于第一优先级,客户B、客户C属于第三优先级,客户D属于第五优先级。当客户A、客户B、客户C和客户D同时向CDN服务商提交任务时,服务器接收到他们的任务提交请求,根据其所属的优先级将客户A的任务提交请求分配至对应于第一提交优先级的任务提交队列,将客户B、客户C的任务提交请求分配至对应于第二提交优先级的任务提交队列,将客户D的任务提交请求分配至对应于第三提交优先级的任务提交队列。
在对应于第二提交优先级的任务提交队列中,由于客户B提交的内容为新闻,其实时性要求较高,客户C要提交的内容为电影,实时性要求并不高,故客户B的任务提交请求的内容优先级高于客户C的任务提交请求。在该队列提交时,客户B的任务先提交至分发服务器。
以上所描述的装置实施例仅仅是示意性的,其中所述作为分离部件说明的单元可以是或者也可以不是物理上分开的,作为单元显示的部件可以是或者也可以不是物理单元,即可以位于一个地方,或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。本领域普通技术人员在不付出创造性的劳动的情况下,即可以理解并实施。
通过以上的实施方式的描述,本领域的技术人员可以清楚地了解到各实施方式可借助软件加必需的通用硬件平台的方式来实现,当然也可以通过硬件。基于这样的理解,上述技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来,该计算机软件产品可以存储在计算机可读存储介质中,如ROM/RAM、磁碟、光盘等,包括若干指令用以使得一台计算机设备(可以是个人计算机,服务器,或者网络设备等)执行各个实施例或者实施例的某些部分所述的方法。
最后应说明的是:以上实施例仅用以说明本发明的技术方案,而非对其限制;尽管参照前述实施例对本发明进行了详细的说明,本领域的普通技术人员应当理解:其依然可以对前述各实施例所记载的技术方案进行修改,或者对其中部分技术特征进行等同替换;而这些修改或者替换,并不使相应技术方案的本质脱离本发明各实施例技术方案的精神和范围。

Claims (8)

  1. 一种内容分发任务的提交方法,包括:
    接收来自多个用户的多个任务提交请求;
    将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;
    将所述多个任务提交队列按照所述提交优先级提交至分发服务器。
  2. 根据权利要求1所述的方法,其中,在接收来自多个用户的多个任务提交请求前,
    根据历史任务提交请求的提交表现,划分多个提交表现区间范围;
    根据所述多个提交表现区间范围,设定多个优先级;
    根据各个用户的历史任务提交请求的提交表现,参照所述多个提交表现区间范围,确定所述各个用户的用户优先级模型。
  3. 根据权利要求2所述的方法,其中,所述提交表现至少根据提交任务量、提交时长、提交错误次数来确定。
  4. 根据权利要求1-3中任一项所述的方法,其中,将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列后还包括:
    对于同一任务提交队列中的多个任务提交请求,根据任务提交请求的内容的类型,设定不同的内容优先级;
    将同一任务提交队列中的多个任务提交请求按照所述内容优先级进行排序。
  5. 一种内容分发任务的提交系统,包括:
    接收单元,用于接收来自多个用户的多个任务提交请求,
    队列分配单元,用于将所述多个任务提交请求按照用户优先级模型中各用户所属的优先级分配到多个任务提交队列,其中每个任务提交队列对应于一个提交优先级;
    提交单元,用于将所述多个任务提交队列按照所述提交优先级提交至分发服务器。
  6. 根据权利要求5所述的系统,还包括模型确定单元,用于根据历史任务提交请求的提交表现,划分多个提交表现区间范围,根据所述多个提交表现区间范围,设定多个优先级,根据各个用户的历史任务提交请求的提交表现,参照所述多个提交表现区间范围,确定所述各个用户的用户优先级模型。
  7. 根据权利要求6所述的系统,其中,所述提交表现至少根据提交任务量、提交时长、提交错误次数来确定。
  8. 根据权利要求5-7中任一项所述的系统,还包括队列内容排序单元,用于对于同一任务提交队列中的多个任务提交请求,根据任务提交请求的内容的类型,设定不同的内容优先级;将同一任务提交队列中的多个任务提交请求按照所述内容优先级进行排序。
PCT/CN2016/088879 2015-12-07 2016-07-06 内容分发任务的提交方法及系统 WO2017096842A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US15/246,160 US20170161669A1 (en) 2015-12-07 2016-08-24 Method and system for submitting content delivery tasks

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510890637.7 2015-12-07
CN201510890637.7A CN105897837A (zh) 2015-12-07 2015-12-07 内容分发任务的提交方法及系统

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/246,160 Continuation US20170161669A1 (en) 2015-12-07 2016-08-24 Method and system for submitting content delivery tasks

Publications (1)

Publication Number Publication Date
WO2017096842A1 true WO2017096842A1 (zh) 2017-06-15

Family

ID=57002891

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/088879 WO2017096842A1 (zh) 2015-12-07 2016-07-06 内容分发任务的提交方法及系统

Country Status (2)

Country Link
CN (1) CN105897837A (zh)
WO (1) WO2017096842A1 (zh)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107948004B (zh) * 2017-12-29 2021-06-22 北京奇艺世纪科技有限公司 一种视频cdn调取优化方法及装置
CN109067855A (zh) * 2018-07-17 2018-12-21 中国联合网络通信集团有限公司 服务请求处理方法及系统、代理节点
CN111367630A (zh) * 2019-07-12 2020-07-03 北京关键科技股份有限公司 一种基于云计算的多用户多优先级的分布式协同处理方法
CN111311061B (zh) * 2020-01-16 2024-03-12 上海三菱电梯有限公司 电梯改造方案生成方法及电梯改造方案生成系统
CN111491015B (zh) * 2020-03-31 2022-11-11 北京金山云网络技术有限公司 预热任务处理方法及系统、代理服务器、服务中心
CN111651246A (zh) * 2020-04-24 2020-09-11 平安科技(深圳)有限公司 终端和服务器之间的任务调度方法、装置和调度器
CN114448893A (zh) * 2021-12-24 2022-05-06 天翼云科技有限公司 一种cdn节点任务下发的聚合方法、装置及计算机设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1669009A (zh) * 2002-07-29 2005-09-14 国际商业机器公司 用于改善内容分发网络对分布式拒绝服务攻击的适应力的方法和设备
US20130176846A1 (en) * 2012-01-06 2013-07-11 Futurewei Technologies, Inc. Systems and Methods for Predictive Downloading in Congested Networks
CN104320672A (zh) * 2014-09-24 2015-01-28 中国人民解放军理工大学 Cdn-p2p混合架构下的直播流媒体系统资源调度方法

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101990252A (zh) * 2009-08-06 2011-03-23 中兴通讯股份有限公司 数据处理方法及装置
CN102402423A (zh) * 2010-09-19 2012-04-04 百度在线网络技术(北京)有限公司 一种在网络设备中进行多任务处理的方法和设备
CN102957733B (zh) * 2011-08-31 2015-12-02 中国科学院声学研究所 一种动态调优的内容发布方法及系统
CN102360314A (zh) * 2011-10-28 2012-02-22 中国科学院计算技术研究所 一种数据中心资源管理系统和方法
US8990819B2 (en) * 2012-09-30 2015-03-24 International Business Machines Corporation Efficient rollback and retry of conflicted speculative threads using distributed tokens

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1669009A (zh) * 2002-07-29 2005-09-14 国际商业机器公司 用于改善内容分发网络对分布式拒绝服务攻击的适应力的方法和设备
US20130176846A1 (en) * 2012-01-06 2013-07-11 Futurewei Technologies, Inc. Systems and Methods for Predictive Downloading in Congested Networks
CN104320672A (zh) * 2014-09-24 2015-01-28 中国人民解放军理工大学 Cdn-p2p混合架构下的直播流媒体系统资源调度方法

Also Published As

Publication number Publication date
CN105897837A (zh) 2016-08-24

Similar Documents

Publication Publication Date Title
WO2017096842A1 (zh) 内容分发任务的提交方法及系统
US20190324819A1 (en) Distributed-system task assignment method and apparatus
US20170126583A1 (en) Method and electronic device for bandwidth allocation based on online media services
US10908950B1 (en) Robotic process automation system with queue orchestration and task prioritization
US9992273B2 (en) Intelligent load balancer selection in a multi-load balancer environment
US9699244B2 (en) Load balanced network file accesses
US9442763B2 (en) Resource allocation method and resource management platform
US11030001B2 (en) Scheduling requests based on resource information
US9998531B2 (en) Computer-based, balanced provisioning and optimization of data transfer resources for products and services
US20150363229A1 (en) Resolving task dependencies in task queues for improved resource management
US9531636B2 (en) Extending processing capacity of server
US20160164738A1 (en) Vertical Scaling Of Computing Instances
US20120066020A1 (en) Multi-tenant database management for sla profit maximization
US9880885B2 (en) Method and system to rebalance constrained services in a cloud using a genetic algorithm
US20170161669A1 (en) Method and system for submitting content delivery tasks
Liu et al. An economical and SLO-guaranteed cloud storage service across multiple cloud service providers
WO2014194869A1 (zh) 一种请求处理方法、装置及系统
WO2017075967A1 (zh) 在线媒体服务的带宽分配方法及系统
US9817698B2 (en) Scheduling execution requests to allow partial results
US10642585B1 (en) Enhancing API service schemes
JP2017037492A (ja) 分散処理プログラム、分散処理方法および分散処理装置
Hu et al. Job scheduling without prior information in big data processing systems
US20140359182A1 (en) Methods and apparatus facilitating access to storage among multiple computers
Liu et al. Deadline guaranteed service for multi-tenant cloud storage
US11354164B1 (en) Robotic process automation system with quality of service based automation

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16872044

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16872044

Country of ref document: EP

Kind code of ref document: A1