44results about How to "Reduce allocation time" patented technology

Provided in embodiments of the present invention are a spectrum allocation method and device for an optical network, and a computer storage medium, the method comprising: segmenting a service path ofan optical network to obtain at least one path segment, the first half segment and the second half segment of each path segment being located at two adjacent nodes of the service path, respectively; then, according to the sequence of the path segments of the service path from front to back, trying to allocate a service processing mode meeting the service spectrum requirement for each path segmentof the service path in sequence; and when the currently allocated service processing mode of each path segment of the service path meets the service spectrum requirement, allocating the use frequencyof each path segment on the service path according to the currently allocated service processing mode of each path segment of the service path.

The invention discloses a virtual machine distribution method in a data center with minimized communication delay. The method comprises the following steps of S1, judging whether virtual machine colonies which can communication with one another and of which the scale is more than that of data nodes exist in a certain threshold of the communication delay; and S2, if yes, finding a complete subgraph composed of virtual machines under such threshold by using an efficient backtracking method or an improved greedy algorithm, and then adopting a Hopcroft-Karp algorithm to distribute the virtual machines in the complete subgraph to the data nodes; and if no, repeating the step S1. According to the virtual machine distribution method of the invention, solution space can be effectively reduced, and the virtual machine distribution time can also be reduced.

The invention provides a frequency point distribution method and device under a frequency spectrum sharing mechanism, and the method comprises the steps: receiving frequency point use request information sent by a base station, the frequency point use request information at least comprising the frequency point demand number of the base station; And if the number of distributable frequency points in the frequency point group corresponding to the base station is greater than or equal to the required number of the frequency points, selecting the frequency points with the number equal to the required number of the frequency points from the distributable frequency points, and distributing the selected frequency points to the base station. The invention provides a frequency point distribution method under a frequency spectrum sharing mechanism. Frequency points distributed to a management area are multiplexed among different divided areas; The frequency points are divided into the subareas,the subareas are divided into the subareas, the frequency points are grouped in each subarea, each base station corresponds to one frequency point group, the frequency points are selected from each frequency point group and distributed to the base stations, the interference constraint relation between the frequency points is simplified, the frequency point distribution time is shortened, and the system power consumption is reduced.

The invention discloses a label distribution method, device, system and network equipment, belonging to the field of network communication. The label allocation method includes: generating a first label switching path for the first forwarding device to the second forwarding device, the first label switching path passing through the third forwarding device; generating an FTN for the first forwarding device; generating an FTN for the third forwarding device Generate an ILM; send the FTN, the ILM, and the first label switched path to the first forwarding device and the third forwarding device. The label distribution device includes a path generation module, an FTN generation module, an ILM generation module and a sending module. The present invention distributes the same label to all forwarding devices located on the same label switching path, and in the process of data packet forwarding, the intermediate label switching router does not perform label pop-up / press-in operation after receiving the data packet, but It directly forwards the data packets, which reduces the label allocation time and improves the forwarding efficiency.

The present application provides a method for processing requests, a system on chip and a public cloud management component. The method is performed by a system on chip. The system-on-chip is contained in a bare metal server. The bare metal server also includes a processor. The bare metal server is included in a distributed storage system. The distributed storage system also includes a public cloud management component. The method includes: the system-on-chip receives a volume-hanging request sent by the public cloud management component, and the volume-hanging request includes a system volume identifier; the system-on-chip saves the system-volume identifier according to the volume-hanging request, and , the identity of the system volume is used by the bare metal server to determine the system volume, and the operating system of the bare metal server is started according to the system volume, and files for starting the operating system of the bare metal server are stored in the system volume. The method for processing requests in the embodiment of the present application helps to quickly allocate bare-metal servers, and improves efficiency and user experience.

An apparatus and method for network address allocation are provided, in which an interface module performs wireless communications through an antenna, and a protocol controller performs wireless communications using a predetermined protocol and performs a network address acquisition procedure during network entry.

The present invention provides a path allocation method and device to solve the problems of low transmission rate and long transmission delay. One of the path allocation methods includes: a source node performs path detection to generate a routing table, where the routing table includes: optional paths and path delays and / or forwarding hops corresponding to the optional paths; and / or forwarding hops to generate path allocation rules; when data needs to be sent, the source node performs path allocation on the optional paths according to the path allocation rules, and one or more optional paths that conform to the path allocation rules as a valid path for sending data. The invention can shorten the transmission delay and improve the transmission rate.

The invention provides a method for distributing a large continuous memory of a kernel. The method comprises the following steps of: acquiring a maximum memory page during distribution of the kernel; calculating a required memory page number N; turning to a step F if determining that the is a negative number; applying the memory according to the if determining that the is not a negative number; reducing the and turning to a step C if the application fails; combining combinable memory blocks to serve as the continuous memory if the application is successful; turning to a step E if determining that a newly combined continuous memory which meets requirement exists; turning to the step C if determining that the newly combined continuous memory which meets requirement does not exist; turning to the step F when determining that the application is successful due to the existence of the memory which meets requirement; jumping to the step C if the memory which meets requirement does not exist; and releasing unused memory. By the method, large continuous memory blocks can be quickly distributed from the kernel; and compared with the conventional distribution method, the distribution time is shortened. The method is mainly guaranteed in two aspects: on one hand, a maximum number of distributable memories is used for applying to the kernel each time; and on the other hand, continuous regions are immediately combined and whether the combined memory meets requirement is immediately determined after the memory is distributed each time, so extra application operation is not required.

According to the resource allocation method, device and equipment and the computer readable storage medium provided by the embodiment of the invention, flexible configuration of resource allocation strategies of various types of cases can be realized through the case configuration interface; flexible configuration of the distribution parameters of the sub-mechanisms of each level in each receiving mechanism can be realized through the mechanism distribution parameter configuration interface;based on flexibly configured allocation parameters of sub-mechanisms of each level in each receiving mechanism and resource allocation strategies of the cases of each type, the to-be-processed cases of the receiving mechanism are automatically allocated to each level in the receiving mechanism, so that multi-level flexible and intelligent resource allocation in each receiving mechanism is realized, the resource allocation time is greatly shortened, and the resource allocation efficiency is improved.

The invention relates to the field of cloud computing, and discloses a cloud computing energy consumption optimization method and system based on phase space, so as to optimize energy consumption in cloud computing, reduce task allocation time, and improve task allocation efficiency; the method of the invention includes obtaining cloud Calculate all nodes in the system and their context information, and establish an energy consumption model; measure the total energy consumption of all tasks being executed by the node, and establish a static energy consumption phase space based on the total energy consumption; use the energy consumption model to predict new The energy consumption required by the task, and establish the dynamic energy consumption phase space; calculate the optimal sub-phase space according to the static energy consumption phase space; predict the energy consumption of each node in the optimal sub-phase space for the new task, and calculate the Phase space and dynamic energy consumption Phase space design task scheduling algorithm, and determine the optimal task allocation scheme for new tasks.

The service chain grouping and reorganization method of mobile edge computing includes the following steps: step S1, establish a mobile edge computing system; step S2, the hash group manager of the edge node judges whether the edge node can provide the received user equipment The service functions of the required service chain; step S3, all service functions in the service chain are configured on edge nodes; step S4, part of the service functions in the service chain are configured on edge nodes, and the remaining service functions are configured on core network nodes; step S5 , all service functions in the service chain are configured on the core network nodes; Step S6, reorganize the group nodes. In this solution, user equipment requirements are grouped. A group only needs to configure a set of service chains, and users in the group share this service chain. Therefore, the usage of flow entries when configuring service chains is reduced, and the possibility of group table overflow is reduced. Reliability, as well as the number of information exchanges between edge nodes and core network nodes, thereby reducing the delay in the control layer.