CN103957123A - Non-linear assembly line scheduling method of PTN north batch-business issuing interface - Google Patents
Non-linear assembly line scheduling method of PTN north batch-business issuing interface Download PDFInfo
- Publication number
- CN103957123A CN103957123A CN201410185699.3A CN201410185699A CN103957123A CN 103957123 A CN103957123 A CN 103957123A CN 201410185699 A CN201410185699 A CN 201410185699A CN 103957123 A CN103957123 A CN 103957123A
- Authority
- CN
- China
- Prior art keywords
- collision vector
- business
- module
- time
- obtains
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
Abstract
The invention discloses a non-linear assembly line scheduling method of a PTN north batch-business issuing interface. The method comprises the following steps that the module calling dependency sequence and the execution time cycle life of businesses on a network management background are configured in an extendable mode, and a configuration table is obtained; a reservation table is obtained according to the configuration table; a state transition graph is obtained according to the reservation table; a plurality of starting cycles are obtained according to the state transition graph, the average starting distances of the starting cycles are calculated and compared, a minimum is obtained, and the starting cycle corresponding to the minimum serves as a minimum time interval sequence; task scheduling is carried out according to the minimum time interval sequence. According to the non-linear assembly line scheduling method of the PTN north batch-business issuing interface, the efficiency of module calling in the PTN north network management can be improved to the maximum extent.
Description
Technical field
The present invention relates to the processing method of PTN north orientation batch service, relate in particular to a kind of PTN north orientation batch service and issue interface non-linear pipeline dispatching method and system.
Background technology
At PTN(Packet Transport Network, Packet Transport Network) in north orientation network management, issuing of business is extremely important and the key link, because exist very large actual management demand, so cmcc is at the relevant specification of the related advisory with reference to ITU Telecommunication Standardization Sector (ITU-T), TMF related advisory and the OMG of OMG, and bring in " PTN of China Mobile northbound interface technical specification " according to the mobile radio communication network management requirement of China Mobile Communications Corporation.
Because this interface relates to the complexity of operation level, current north orientation provides manufacturer's each disunity on the specification to this interface realizes, and has the implementation of oneself.More that manufacturer comes division at all levels to allow client call one by one.Such mode is that business complexity is pushed away to caller in fact.Better manufacturer provides unified interface, but inner realization only successively called according to operation level.In client of operator at existing network through after actual use, the batch of meeting discovery business issues this north orientation functional interface in use needs to spend long wait, to such an extent as to client has to, consideration is avoiding runing peak period, even fixes certain timing node and processes.
The present invention, by utilizing the actual analysis to this interface, adopts non-linear pipeline principle to carry out classification processing to PTN webmaster business module, ensures usefulness to greatest extent, improves module efficiency at all levels.
Summary of the invention
The technical problem to be solved in the present invention is for sending down service spended time in north orientation network management in prior art long, inefficient defect, provides a kind of PTN north orientation batch service that can improve sending down service usefulness to issue non-linear pipeline dispatching method and the system of interface.
The technical solution adopted for the present invention to solve the technical problems is:
Provide a kind of PTN north orientation batch service to issue the non-linear pipeline dispatching method of interface, comprise the following steps:
S1, according to the classification of business, by can extended mode every kind of business being called to dependence order and time of implementation periodicity is configured in the module on network management backstage, obtain allocation list;
S2, in the time of interface interchange, judge the classification of business, and obtain the configuration data of this business in allocation list according to judged result, the configuration data obtaining is represented by directed graph adjacency matrix, obtain reservation table;
Distances in S3, calculating reservation table between any 2 conflict modules of every a line, this distance is called time of implementation periodicity for module in allocation list, obtains not having the array set of duplicate keys, and this array set is converted into the collision vector of bit string;
S4, this collision vector is processed, obtained state transitions transition figure;
S5, obtain multiple startups circulation by these state transitions transition figure, calculate each average startups that starts circulation apart from and compare, obtain minimum value, and startup corresponding this minimum value circulated as minimum interval sequence;
S6, carry out task scheduling according to this minimum interval sequence.
In dispatching method of the present invention, described can extended mode be xml form, can revise at any time the deploy content in xml, if the deploy content in xml changes, notifies in the mode of message.
In dispatching method of the present invention, step S4 specifically comprises:
Send into a m position logic shift right device using collision vector as initial collision vector, wherein m is greater than 0 integer, when the position of shifting out from shift unit is while being 0, does " step-by-step or " computing with the value in shift unit and initial collision vector, obtains a new collision vector; If the position that shift unit shifts out is 1, be left intact; Shift unit continues to move to right, and so repeats, and carries out m time altogether, and each collision vector forming for centre, also processes according to abovementioned steps;
Between the collision vector of all new formation of initial collision vector sum, connect to form a chained list, obtain state transitions transition figure, represent the transformational relation between various states, and preserve mobile number of times, in the time that the collision vector of new formation repeats, combined.
The present invention also provides a kind of PTN north orientation batch service to issue the non-linear pipeline dispatching patcher of interface, comprising:
Business relies on configuration module, for according to the classification of business, by can extended mode every kind of business being called to dependence order and time of implementation periodicity is configured in the module on network management backstage, obtains allocation list;
Reservation table analysis module, for judging the classification of business when the interface interchange, and obtains the configuration data of this business in allocation list according to judged result, and the configuration data obtaining is represented by directed graph adjacency matrix, obtains reservation table;
Forbidden list analysis module, for calculating the distance between any 2 conflict modules of the every a line of reservation table, this distance is called time of implementation periodicity for module in allocation list, obtains not having the array set of duplicate keys, and this array set is converted into the collision vector of bit string;
State analyzing module, for this collision vector is processed, obtains state transitions transition figure;
Start cycle analysis module, for obtain multiple startup circulations by these state transitions transition figure, calculate each and start the average startup distance of circulation and compare, obtain minimum value, and startup corresponding this minimum value is circulated as minimum interval sequence;
Executive Module, carries out task scheduling according to this minimum interval sequence.
In system of the present invention, described can extended mode be xml form, can revise at any time the deploy content in xml, if the deploy content in xml changes, notifies in the mode of message.
In system of the present invention, state analyzing module specifically for:
Send into a m position logic shift right device using collision vector as initial collision vector, wherein m is greater than 0 integer, when the position of shifting out from shift unit is while being 0, does " step-by-step or " computing with the value in shift unit and initial collision vector, obtains a new collision vector; If the position that shift unit shifts out is 1, be left intact; Shift unit continues to move to right, and so repeats, and carries out m time altogether, and each collision vector forming for centre, also processes according to abovementioned steps;
Between the collision vector of all new formation of initial collision vector sum, connect to form a chained list, obtain state transitions transition figure, represent the transformational relation between various states, and preserve mobile number of times, in the time that the collision vector of new formation repeats, combined.
The beneficial effect that the present invention produces is: the batch that the present invention carries out business by unified interface issues, in realizing, inside take non-linear pipeline mode to call and carry out modeling module at all levels, first analyze the reservation table of relation between module, obtain forbidden list by reservation table, obtain again collision vector, obtain state transitions transition figure according to collision vector, analysis obtains the average minimum constant circulation of distance that starts, that each module design task is directly processed interval time in fact according to the result finally solving like this, carry out the scheduling of task according to the sequence of this time, effectively avoid the direct parts collision problem of processing module and allowed streamline reach the most simultaneously processing.
Brief description of the drawings
Below in conjunction with drawings and Examples, the invention will be further described, in accompanying drawing:
Fig. 1 is the flow chart that embodiment of the present invention PTN north orientation batch service issues the non-linear pipeline dispatching method of interface;
Fig. 2 is the structural representation that embodiment of the present invention PTN north orientation batch service issues the non-linear pipeline dispatching patcher of interface.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearer, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein, only in order to explain the present invention, is not intended to limit the present invention.
By analyzing, all modules that NMS webmaster can be provided are regarded the pseudo-line list of the set Q{ station module with following functional module, the end-to-end module of pseudo-line as, list station, tunnel module, the end-to-end module in tunnel, data link list station module, the mono-station of OAM module ..., this set Q is defined as to { 1,2,3,4,5,6 ....And north orientation business is classified, such as: A service is as E1 voice private line service, and category-B is as the point-to-point ether business in 2 layer services, and C class is as the point-to-multipoint ether business in 2 layer services.So, north orientation business can be created in batches to interface regards as and calls structure as lower module: A service creates=and (1,2,3,4,3) b service establishment=(1,3,5,6,7) c service establishment=(2,4,6,7,8,9) etc., calling of each module needs certain cycle time of implementation, and module call in order also Existence dependency relationship.Due to different classes of business is classified, therefore the invocation pattern of every kind of business is fixed, and like this, any calling service meets a non-linear pipeline processing procedure.
PTN north orientation batch service of the present invention issues the non-linear pipeline dispatching method of interface, as shown in Figure 1, comprises the following steps:
S1, according to the classification of business, by can extended mode every kind of business being called to dependence order and time of implementation periodicity is configured in the module on network management backstage, obtain allocation list; Every kind of business is called dependence order and time of implementation periodicity for to set in advance according to no class of service in the module on network management backstage.
S2, in the time of interface interchange, judge the classification of business, and obtain the configuration data of this business in allocation list according to judged result, the configuration data obtaining is represented by directed graph adjacency matrix, obtain reservation table;
Distances in S3, calculating reservation table between any 2 conflict modules of every a line, this distance is called time of implementation periodicity for module in allocation list, obtains not having the array set of duplicate keys, and this array set is converted into the collision vector of bit string;
S4, this collision vector is processed, obtained state transitions transition figure;
S5, obtain multiple startups circulation by these state transitions transition figure, calculate each average startups that starts circulation apart from and compare, obtain minimum value, and startup corresponding this minimum value circulated as minimum interval sequence;
S6, carry out task scheduling according to this minimum interval sequence.
The present invention also provides a kind of PTN north orientation batch service to issue the non-linear pipeline dispatching patcher of interface, and this system is based on above-mentioned dispatching method.As shown in Figure 2, this system mainly comprises that business relies on configuration module, reservation table analysis module, forbidden list analysis module, state analyzing module, startup cycle analysis module and Executive Module.
In the embodiment of the present invention, because the invocation pattern of every kind of business fixes, the module that is relied on configuration module and provided extendible mode allow business by business is called order and time of implementation being configured in xml.In the time that upper strata webmaster calls by northbound interface, obtain a feasible reservation table through reservation table analysis module.Then obtain collision vector C=(C through forbidden list analysis module
m-1c
m-2c
2c
1).The mode of obtaining forbidden list by reservation table is very simple, as long as any every a line in reservation table 2 distances of conflicting between modules are all calculated and removed duplicate keys and obtain the set of an array.Then calculate the adjacency matrix of status transition chart G according to collision vector by state analyzing module, detailed process is: send into a m position logic shift right device (m is greater than 0 integer) using the collision vector C obtaining as initial collision vector, in the time that the position of shifting out from shift unit is 0, do " step-by-step or " computing with the value in shift unit and initial collision vector, obtain a new collision vector; If the position that shift unit shifts out is 1, be left intact; Shift unit continues to move to right, and so repeats, and such operation is carried out m time altogether.Each collision vector forming for centre, also will process according to this method.Between the collision vector of all new formation of initial collision vector sum, connect to form a chained list, represent the transformational relation between various states, and mobile number of times is preserved as weight.In the time that the collision vector of new formation repeats, they are combined.
Can know from state diagram, in the time that startup distance is more than or equal to m+1, cycle can not clash any one functional section of streamline at any time, but, at this moment the throughput of streamline, speed-up ratio and efficiency are all by very poor, and therefore, the task of non-linear pipeline scheduling is exactly to find out the average startup circulation that distance is less than m that starts, start the input input new task of circulation to streamline according to this, the cycle can not clash any one functional section of streamline at any time.Start the startup circulation that cycle analysis module can find a lot of not generating function section conflicts from state diagram----see to be exactly loop from state diagram.In fact, such startup circulation has infinite multiple.For example there is simple cycle, and non-simple cycle.Because the main target of nonpipeline scheduling is to find out the average minimum startup circulation of distance that starts, therefore, in these infinite multiple startup circulations, as long as find simple cycle.In a state diagram, the number of simple cycle is limited.
The all startups distances that start in circulating are added, then start the startup number of distances in circulation divided by this, just obtain the average startup distance of this startup circulation.For example, the average startup distance of startup circulation (1,5) is exactly 3.That is to say when non-linear pipeline is according to minimum startup circulation (1,5) while work, after carrying out first business, carry out again next business in the back to back next time cycle, and then the 3rd business of 5 time cycles execution of being separated by, so repeat, continuously to streamline input new task, each functional section of streamline what in office can not clash clock cycle.And reach the current maximum speed-up ratio of streamline.
Business relies on configuration module provides every kind of NMS background module corresponding to business that can extended mode carries out of xml to call dependence order and module expected time periodicity separately, take thisly can allow follow-up Added Business also can join very smoothly the processing procedure of streamline by extended mode, call order as long as configured the background module of corresponding service.Taking ms about cycle expected time is that unit division finally can be carried out interval according to this numeral in the time issuing calling module.
Business configuration module takes the mode dynamically reading to monitor xml, user can to the content in xml, particularly the time interval revises at any time in real time, once changing, xml configuration can carry out again streamline calculating by the mode informing business calling module of message, this means that in the process issuing in batches in business, we can carry out load Analysis according to performance analysis tool (as profile), carry out at any time the performance adjustment of streamline.
Business diagnosis when reservation table analysis module passes through interface interchange, judgement class of service now, obtain the module dependence in xml, forming a directed graph adjacency matrix represents, if fail to obtain correct dependence, carry out the sequence call of module streamline, and provide the certain information of user.Efficiency is now minimum, but ensures the correct behavior of calling.
Forbidden list analysis module starts traversal by this digraph matrix from modules A, as long as any every a line in reservation table 2 distances of conflicting between modules are all calculated and removed duplicate keys and obtain the set of an array.The distance is here exactly the module execution cycle number of estimating in configuration xml.After having obtained forbidden list, return to a F={a, b, c, d} (a, b, c, d ∈ Z), then carries out a set and obtains collision vector C=(C to the conversion of bit string
m-1c
m-2c
2c
1).
The input of state analyzing module is exactly this collision vector C, calculates status change set.Detailed process is: send into a m position logic shift right device using the collision vector C obtaining as initial collision vector, when the position of shifting out from shift unit is while being 0, do " step-by-step or " computing with the value in shift unit and initial collision vector, obtain a new collision vector; If the position that shift unit shifts out is 1, be left intact; Shift unit continues to move to right, and so repeats, and such operation is carried out m time altogether.Each collision vector forming for centre, takes degree of depth implementation strategy, also will process according to this method.Between the collision vector of all new formation of initial collision vector sum, connect to form a chained list, represent the transformational relation between various states, and preserve mobile number of times.In the time that the collision vector of new formation repeats, they are combined.
Start cycle analysis module by all recurrent state sequences that calculate as K=(2, x)-(2, y) being recorded as the set of cum rights chained list preserves, then by calculating the length of each chained list and the average of weights, minimum value is returned as to (a, b, c) form is as minimum interval sequence.
Executive Module carries out decomposition module in the batch implementation of final service, in module invoked procedure, according to the time interval sequence that solves out, each module is added to execution queue, call such as next task being put into A module after A module is carried out a the time interval, then after the interval b time interval, the 3rd task put into and called queue.To reach theoretic without the maximum speed-up ratio usefulness of conflict.
To sum up, the present invention, by the actual analysis of docking port, is divided into multiple classifications by business, adopts non-linear pipeline principle to the processing of classifying of PTN webmaster business, to ensure usefulness to greatest extent, has improved the efficiency that module at all levels is called.
Should be understood that, for those of ordinary skills, can be improved according to the above description or convert, and all these improvement and conversion all should belong to the protection range of claims of the present invention.
Claims (6)
1. PTN north orientation batch service issues a non-linear pipeline dispatching method for interface, it is characterized in that, comprises the following steps:
S1, according to the classification of business, by can extended mode every kind of business being called to dependence order and time of implementation periodicity is configured in the module on network management backstage, obtain allocation list;
S2, in the time of interface interchange, judge the classification of business, and obtain the configuration data of this business in allocation list according to judged result, the configuration data obtaining is represented by directed graph adjacency matrix, obtain reservation table;
Distances in S3, calculating reservation table between any 2 conflict modules of every a line, this distance is called time of implementation periodicity for module in allocation list, obtains not having the array set of duplicate keys, and this array set is converted into the collision vector of bit string;
S4, this collision vector is processed, obtained state transitions transition figure;
S5, obtain multiple startups circulation by these state transitions transition figure, calculate each average startups that starts circulation apart from and compare, obtain minimum value, and startup corresponding this minimum value circulated as minimum interval sequence;
S6, carry out task scheduling according to this minimum interval sequence.
2. dispatching method according to claim 1, is characterized in that, described can extended mode be xml form, can revise at any time the deploy content in xml, if the deploy content in xml changes, notifies in the mode of message.
3. dispatching method according to claim 1, is characterized in that, step S4 specifically comprises:
Send into a m position logic shift right device using collision vector as initial collision vector, wherein m is greater than 0 integer, when the position of shifting out from shift unit is while being 0, does " step-by-step or " computing with the value in shift unit and initial collision vector, obtains a new collision vector; If the position that shift unit shifts out is 1, be left intact; Shift unit continues to move to right, and so repeats, and carries out m time altogether, and each collision vector forming for centre, also processes according to abovementioned steps;
Between the collision vector of all new formation of initial collision vector sum, connect to form a chained list, obtain state transitions transition figure, represent the transformational relation between various states, and preserve mobile number of times, in the time that the collision vector of new formation repeats, combined.
4. PTN north orientation batch service issues a non-linear pipeline dispatching patcher for interface, it is characterized in that, comprising:
Business relies on configuration module, for according to the classification of business, by can extended mode every kind of business being called to dependence order and time of implementation periodicity is configured in the module on network management backstage, obtains allocation list;
Reservation table analysis module, for judging the classification of business when the interface interchange, and obtains the configuration data of this business in allocation list according to judged result, and the configuration data obtaining is represented by directed graph adjacency matrix, obtains reservation table;
Forbidden list analysis module, for calculating the distance between any 2 conflict modules of the every a line of reservation table, this distance is called time of implementation periodicity for module in allocation list, obtains not having the array set of duplicate keys, and this array set is converted into the collision vector of bit string;
State analyzing module, for this collision vector is processed, obtains state transitions transition figure;
Start cycle analysis module, for obtain multiple startup circulations by these state transitions transition figure, calculate each and start the average startup distance of circulation and compare, obtain minimum value, and startup corresponding this minimum value is circulated as minimum interval sequence;
Executive Module, carries out task scheduling according to this minimum interval sequence.
5. system according to claim 4, is characterized in that, described can extended mode be xml form, can revise at any time the deploy content in xml, if the deploy content in xml changes, notifies in the mode of message.
6. system according to claim 4, is characterized in that, state analyzing module specifically for:
Send into a m position logic shift right device using collision vector as initial collision vector, wherein m is greater than 0 integer, when the position of shifting out from shift unit is while being 0, does " step-by-step or " computing with the value in shift unit and initial collision vector, obtains a new collision vector; If the position that shift unit shifts out is 1, be left intact; Shift unit continues to move to right, and so repeats, and carries out m time altogether, and each collision vector forming for centre, also processes according to abovementioned steps;
Between the collision vector of all new formation of initial collision vector sum, connect to form a chained list, obtain state transitions transition figure, represent the transformational relation between various states, and preserve mobile number of times, in the time that the collision vector of new formation repeats, combined.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410185699.3A CN103957123A (en) | 2014-05-05 | 2014-05-05 | Non-linear assembly line scheduling method of PTN north batch-business issuing interface |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410185699.3A CN103957123A (en) | 2014-05-05 | 2014-05-05 | Non-linear assembly line scheduling method of PTN north batch-business issuing interface |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103957123A true CN103957123A (en) | 2014-07-30 |
Family
ID=51334353
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410185699.3A Pending CN103957123A (en) | 2014-05-05 | 2014-05-05 | Non-linear assembly line scheduling method of PTN north batch-business issuing interface |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103957123A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107222347A (en) * | 2017-06-09 | 2017-09-29 | 烽火通信科技股份有限公司 | A kind of configuration counter-brush method based on PTN device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6529524B1 (en) * | 1999-01-13 | 2003-03-04 | Nortel Networks Limited | Computer program products, methods, and protocol for interworking services between a public telephone network, intelligent network, and internet protocol network |
| CN101610198A (en) * | 2008-06-17 | 2009-12-23 | 大唐移动通信设备有限公司 | A kind of dispatching method of Packet Service and dispatching device |
| CN103581049A (en) * | 2012-07-26 | 2014-02-12 | 中兴通讯股份有限公司 | Method and device for determining scheduling strategy |
-
2014
- 2014-05-05 CN CN201410185699.3A patent/CN103957123A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6529524B1 (en) * | 1999-01-13 | 2003-03-04 | Nortel Networks Limited | Computer program products, methods, and protocol for interworking services between a public telephone network, intelligent network, and internet protocol network |
| CN101610198A (en) * | 2008-06-17 | 2009-12-23 | 大唐移动通信设备有限公司 | A kind of dispatching method of Packet Service and dispatching device |
| CN103581049A (en) * | 2012-07-26 | 2014-02-12 | 中兴通讯股份有限公司 | Method and device for determining scheduling strategy |
Non-Patent Citations (1)
| Title |
|---|
| 郑芹: "非线性流水线的无冲突调度的分析", 《福建电脑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107222347A (en) * | 2017-06-09 | 2017-09-29 | 烽火通信科技股份有限公司 | A kind of configuration counter-brush method based on PTN device |
| CN107222347B (en) * | 2017-06-09 | 2020-01-14 | 烽火通信科技股份有限公司 | Configuration reverse-brushing method based on PTN equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11297601B2 (en) | Resource allocation method and orchestrator for network slicing in the wireless access network | |
| CN111565114B (en) | Intention processing method, device and system | |
| Quang et al. | Single and multi-domain adaptive allocation algorithms for VNF forwarding graph embedding | |
| Wei et al. | Resource allocation for V2X communications: A local search based 3D matching approach | |
| Iacoboaiea et al. | SON coordination in heterogeneous networks: A reinforcement learning framework | |
| Demestichas et al. | Intelligent 5G Networks: Managing 5G Wireless\/Mobile Broadband | |
| Gravalos et al. | Efficient network planning for internet of things with QoS constraints | |
| Morais et al. | When SDN meets C-RAN: A survey exploring multi-point coordination, interference, and performance | |
| Debbabi et al. | An overview of interslice and intraslice resource allocation in b5g telecommunication networks | |
| Montero et al. | End-to-end 5G service deployment and orchestration in optical networks with QoE guarantees | |
| Ge et al. | Applications of artificial intelligence in wireless communications | |
| US11496550B2 (en) | Method, system, and computer program product for deploying application | |
| CN104640177A (en) | Energy-efficiency-based cell selection method for multilevel heterogeneous network | |
| Tang et al. | Link allocation, routing and scheduling of FSO augmented RF wireless mesh networks | |
| CN103957123A (en) | Non-linear assembly line scheduling method of PTN north batch-business issuing interface | |
| Liu et al. | A D2D offloading approach to efficient mobile edge resource pooling | |
| US10887888B2 (en) | Methods and modules for handling channels in a radio spectrum | |
| Debbabi et al. | Overview of AI-based Algorithms for Network Slicing Resource Management in B5G and 6G | |
| Chirivella-Perez et al. | Intent-based E2E network slice management for industry 4.0 | |
| Han et al. | 5G K-SimSys: Open/modular/flexible system level simulator for 5G system | |
| Araujo et al. | Deployment of small cells and a transport infrastructure concurrently for next-generation mobile access networks | |
| Arouk et al. | Multi-objective placement of virtual network function chains in 5G | |
| US11588882B2 (en) | Method, electronic device, and computer program product for application migration | |
| Kong et al. | Energy saving strategy for task migration based on genetic algorithm | |
| Hongyu et al. | QoS-guaranteed energy saving routing strategy using SDN central control for backbone networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Cao Dong Inventor before: Gu Lei |
|
| CB03 | Change of inventor or designer information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140730 |
|
| RJ01 | Rejection of invention patent application after publication |