OPTIMIZED RESOURCE MANAGEMENT IN CORE NETWORK ELEMENTS
    2.
    发明公开
    OPTIMIZED RESOURCE MANAGEMENT IN CORE NETWORK ELEMENTS 审中-公开
    优化核心网络元素的资源管理

    公开(公告)号:EP3224985A1

    公开(公告)日:2017-10-04

    申请号:EP14805230.1

    申请日:2014-11-25

    IPC分类号: H04L12/24 G06F9/50

    摘要: The present invention addresses method, apparatus and computer program product for resource management within a distributed system in a core network element, comprising organizing computing resources of the core network element into sets, wherein a first set is always active, setting an upper threshold and a lower threshold for the load of the sets, wherein the sets in operation are loaded as long as the average load of the sets in operation reaches the upper threshold, and when the upper threshold is exceeded, a new set is activated, whereas, when the load thereof falls below the lower threshold, the last activated set is deactivated, assigning a priority number to each set, segmenting an interval of random numbers for randomizing a request distribution in subintervals which are allocated to the computing resources of the active sets, wherein the length of each subinterval is determined based on the priority number of the set of the respective computing resource, and allotting a random number out of the interval to an incoming request, and forwarding the request to such computing resource which belongs to the subinterval that contains the allotted random number.

    摘要翻译: 本发明针对用于核心网络元件中的分布式系统内的资源管理的方法,设备和计算机程序产品,包括将核心网络元件的计算资源组织为集合,其中第一集合总是活动的,设置上阈值和 只要运行中的组的平均负载达到上阈值,并且当超过上阈值时,启动新的组,而当 其负载下降到低于下阈值,则最后激活的集合被去激活,为每个集合分配优先级号码,分割随机数的间隔用于随机化分配给活动集合的计算资源的子间隔中的请求分布,其中 基于各个计算资源的集合的优先级号码以及分配随机数来确定每个子间隔的长度 输入请求的时间间隔内的m个号码,并且将该请求转发给属于包含分配的随机数的子区间的这样的计算资源。