CN104917629A - Multi-switching-node cooperation meta-ability scheduling method - Google Patents

Multi-switching-node cooperation meta-ability scheduling method Download PDF

Info

Publication number
CN104917629A
CN104917629A CN201510175085.1A CN201510175085A CN104917629A CN 104917629 A CN104917629 A CN 104917629A CN 201510175085 A CN201510175085 A CN 201510175085A CN 104917629 A CN104917629 A CN 104917629A
Authority
CN
China
Prior art keywords
ability
combination
combination chain
network
strategy
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.)
Granted
Application number
CN201510175085.1A
Other languages
Chinese (zh)
Other versions
CN104917629B (en
Inventor
兰巨龙
程国振
张建辉
段通
姜鲲鹏
张震
卜佑军
王雨
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
PLA Information Engineering University
Original Assignee
PLA Information Engineering University
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 PLA Information Engineering University filed Critical PLA Information Engineering University
Priority to CN201510175085.1A priority Critical patent/CN104917629B/en
Publication of CN104917629A publication Critical patent/CN104917629A/en
Application granted granted Critical
Publication of CN104917629B publication Critical patent/CN104917629B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12Discovery or management of network topologies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/20Traffic policing

Abstract

The invention relates to a multi-switching-node cooperation meta-ability scheduling method. The method contains the following steps: 1, describing a network manager's network node management method through adoption of a function combination strategy, and standardizing a generated strategy set, and 2, through a global network view, scheduling meta abilities of multiple switching nodes through adoption of a meta-ability combination method which comprises a mapping process of strategy-combination chain-execution path; and the mapping process of the strategy-combination chain-execution path comprises 2.1, strategy-combination chain mapping that a series of ordered set containing all elements of a meta-ability set is parameterized by a target set and a demand set and then a combination chain having a clear target and a clear request is generated, and 2.2, combination chain-execution path mapping that an embodiment is selected for each metal ability, and, according to a distribution view and network topology of the meta-ability embodiments, a possible execution path is finally obtained through calculation. Meta-ability cooperation of the multiple switching nodes can be achieved, a network function is convenient to develop for a developer, and innovation of the network function is accelerated.

Description

First ability method of combination that many switching nodes are collaborative
(1), technical field: the present invention relates to a kind of first ability method of combination, particularly relate to first ability method of combination that a kind of many switching nodes are collaborative.
(2), background technology: along with current network service is increasingly various, network application is increasingly abundant, and the service mode of conventional internet is faced with various challenge.On the one hand, the network applications evolve of user level is very rapid, and especially to excite the demand of upper layer application to function further increasing for service provider's open service interface such as google, facebook; On the other hand, the network function of bottom is very limited, and most of network equipment function is closed, and prevents the network function of developer's development of new.What upper layer application and bottom-layer network developed does not mate is that conventional internet designs facing challenges.In order to enable bottom-layer network practical function open, provide the chance of exploitation bottom-layer network function to developer, industry proposes some novel network architecture.Datum plane is separated with control plane by mostly, and chain of command and data surface adopt unified standard interface protocol to be connected.This makes it possible to exploitation bottom-layer network function is no longer only equipment supplier, has also been extended to any third party's tissue and company simultaneously.
The opening of network function will greatly promote the innovation of network function.Along with the innovation of network function, in network, there will be a large amount of fine-grained functional module, and the example that same functional module has a large amount of different developers and provides coexists in a network.Therefore, the network application on upper strata has a lot of alternative example when using certain network function.In addition, network manager also has the larger example that management and control spatial choice is different more freely to carry out combining and deal with different performance requirements.
But, management synergistically scatter functional module in a network and the example but very difficult.On the one hand, network does not provide unified functional module definition to developer, and the network function module granularity causing third-party developer to develop differs, and function is extensive, is difficult to organization of unity.On the other hand, network does not also provide unified interface to developer, and this causes cannot collaborative work between network function module.In addition, how to be combined by mixed-media network modules mixed-media, how selector closes the function example of layer demand, is all problem demanding prompt solution.
(3), summary of the invention:
The technical problem to be solved in the present invention is: provide first ability method of combination that a kind of many switching nodes are collaborative, the method can realize the collaborative work of first ability between many switching nodes, be convenient to developer's developing network function, and network manager realizes diversified strategy, accelerate the innovation of network function.
Technical scheme of the present invention:
The first ability method of combination that many switching nodes are collaborative, containing the following step:
Step 1: adopt the network node management method of function combined strategy to network manager to be described, and the set of strategies standardization that will produce, namely provide the policy library of standard to developer;
Step 2: by the network view of the overall situation, adopt first combined ability method by first ability layout of multiple switching node, this yuan of combined ability method comprises the mapping process of " strategy-combination chain-execution route ".
The key element of unit's ability describes and comprises nine tuple structure, S:=<T, I, O, ID, B, E, F, R, A>, namely, < type, input interface collection, output interface collection, mark, perform bulk, event set, Facet classifies, resource, property set > (being the description in " a kind of data transmission method and the device " of ZL201310307096.1 see application number).
Strategy in step 2 contains object set, first capability set and demand collection; Object set is the goal set (as in traffic engineering, it is the set of some streams) wanting executable operations; Unit's capability set is the first capabilities list with type identification, and the first ability in first capability set is ordered arrangement, and object set must travel through the whole first ability inside first capability set; Demand collection defines the performance requirement that complete process streamline will be followed, the demand centralized procurement behavior restraint of Service Quality Metrics statement Global treatment.
Strategy is configured by Virtual network operator or network manager, according to this strategy, adopts different plans to carry out management and control network for different application scenarioss.
In step 2, the mapping process of " strategy-combination chain-execution route " is divided into two steps, is respectively " strategy-combination chain " and maps and " combination chain-execution route " mapping, specific as follows:
Step 2.1: " strategy-combination chain " maps: a string ordered set comprising all elements of first capability set, by object set and demand collection parametrization, generates the combination chain that has hard objectives and request;
" strategy-combination chain " maps and is expressed as wherein, g representation parameter process, P represents combined strategy, and O represents object set, C representative element capability set, and D represents demand collection; Mapping value is represent the ordered set containing a string first ability, and contain all elements of C, be that a target is O, the demand combination chain that has been the parametrization of D;
Step 2.2: " combination chain-execution route " maps: select an example to each first ability, according to arrangement view and the network topology of first ability example, finally calculate feasible execution route;
" combination chain-execution route " maps and is described as: wherein " → " represents mapping process; wherein represent combination chain i-th first ability; representative element ability all example set, wherein symbol " a " representative instance, is also representing e is first ability example; If F non-NULL, " combination chain-execution route " maps can be successful, namely for combination chain has the execution route existence that feasible at least.
" combination chain-execution route " mapping method is taked " overall combined method ", and " overall combined method " considers the cooperative relationship between first ability in combination chain, and its step is as follows:
Step 2.2.1: for each first ability in first capability set, choose one of them example respectively, obtain the combination chain after an instantiation; In this approach, the combination chain set after instantiation is obtained;
Step 2.2.2: according to network example Deployment view and network node topology, choose the feasible combination chain set meeting network connectivty;
Step 2.2.3: considering, under overall performance index constraint prerequisite, to choose optimum combination chain in the set of feasible combination chain.
The method can utilize overall performance requirement fully, by the first ability example layout in multiple switching node, by the complementation between each yuan of ability example index, calculates the process streamline of meeting consumers' demand.
Each first ability has the example collection of a candidate, needs to choose an example to perform relevant concrete operations from this set.After first abilities all on combination chain all instantiation, a process streamline can realize, i.e. execution route.Each yuan of ability instantiation of combination chain can be formed an execution route.
Step 2.2.3 can be described as a 0-1 linear programming problem, makes g be a solution of linear programming problem, and this solution so can be claimed to be a state of simulated annealing method, and make Ξ be state space, it is made up of feasible solution; Adopt simulated annealing method to choose optimum combination chain, comprise the following steps:
Step 2.2.3.1: the initial condition of selecting system from state space, and determine initial temperature;
Step 2.2.3.2: from state set space random selecting state, be set to initial condition; Ξ (g) is the state set that can arrive from state g; When control temperature T, calculate the probability P arriving state g ' from state g t(g, g'), wherein g ' represents a state in state set space except g;
Step 2.2.3.3: comply with state g and arrive state g ' probability P t(g, g'), upgrades current state;
Step 2.2.3.4: reduce control temperature T; When reaching maximum iterations or control temperature T=0, terminate; Otherwise, turn to step 2.2.3.2.
Combination chain is formed by first combined ability of difference in functionality, and first ability is wherein ordered arrangement; Combination chain structure comprises serial, parallel and bifurcated.Wherein, serial combination scheme is the most basic compound mode, and other compound mode can be derived from by serial mode.
First combined ability method in step 2 has been come by first ability layout functional module, contain in unit's ability layout functional module: Register, accelerator, first ability information storehouse, optimum choice device, policy transformation module, combination chain pond, execution route pond, topology information base and Topology Discovery module are coordination between each several part; Unit's ability layout functional module is contacted by api interface and first ability, first combined ability is got up to realize diversified service according to keeper's demand by unit's ability layout functional module, and the network that the execution route that first ability layout functional module generates is mapped to bottom by Control Server opens up benefit.
In the network not having first ability layout functional module, when a packet arrives a switch, if can match list item, it will be transferred to down hop; Otherwise it will be forwarded to a Control Server, in Control Server, route can be calculated and is installed in switch, and therefore remaining packet can directly be forwarded.In the network with first ability layout functional module, process will change, and specifically has following steps:
Step 601: be orderly combination chain by the policy resolution of network manager, comprises constraint set, object set;
Step 602: for each first ability chooses an example, and export execution route; Each execution route is by distinctive code identification;
Step 603 a: packet arrives switch, if there is list item to mate, carries out the operations such as forwarding, otherwise will upload to Control Server;
Step 604: the packet uploading to Control Server first can by the process of first ability layout functional module;
Step 605: arrived target tightening in execution route if data packet matched one, so the stream at this packet place is the stream that a strategy is paid close attention to; Corresponding execution route can be installed in switch-layer topology by Control Server, and the packet of this stream ensuing will directly by this execution route process;
Step 606: if packet does not match the object set of any execution route, so this packet can by Control Server process.
Beneficial effect of the present invention:
1, the present invention proposes with the method for first ability first ability layout that is network basic functional units, for solving the combinatorial problem of first ability in network, by the method, the manager of network can supervising the network easily, realizes various management strategy.The present invention can provide first combined ability chain of customization for different service request, and realize the collaborative work of first ability between many switching nodes, be convenient to developer's developing network function, and network manager realizes diversified strategy, accelerate the innovation of network function.
(4), accompanying drawing illustrates:
Fig. 1 is the structural representation of combination chain;
Fig. 2 is the description schematic diagram of strategy;
Fig. 3 maps flow process diagram intention for " strategy-combination chain-execution route ";
Fig. 4 is the schematic diagram of simulated annealing method;
Fig. 5 is the structural representation of first ability layout functional module;
Fig. 6 is the handling process schematic diagram after a packet arrives switch;
Fig. 7 is a kind of first ability application scenarios schematic diagram;
The description schematic diagram of Fig. 8 to be type be first ability of port_scan;
An example schematic of Fig. 9 to be type be first ability of port_scan.
(5), embodiment:
First ability method of combination that many switching nodes are worked in coordination with contains the following step:
Step 1: adopt the network node management method of function combined strategy to network manager to be described, and the set of strategies standardization that will produce, namely provide the policy library of standard to developer;
Step 2: by the network view of the overall situation, adopt first combined ability method by first ability layout of multiple switching node, this yuan of combined ability method comprises the mapping process of " strategy-combination chain-execution route ".
The key element of unit's ability describes and comprises nine tuple structure, S:=<T, I, O, ID, B, E, F, R, A>, namely, < type, input interface collection, output interface collection, mark, perform bulk, event set, Facet classifies, resource, property set >.
Strategy in step 2 contains object set, first capability set and demand collection (as shown in Figure 2); Object set is the goal set (as in traffic engineering, it is the set of some streams) wanting executable operations; Unit's capability set is the first capabilities list with type identification, and the first ability in first capability set is ordered arrangement, and object set must travel through the whole first ability inside first capability set; Demand collection defines the performance requirement that complete process streamline will be followed, the demand centralized procurement behavior restraint of Service Quality Metrics statement Global treatment.
Strategy is configured by Virtual network operator or network manager, according to this strategy, adopts different plans to carry out management and control network for different application scenarioss.
In step 2, mapping (as shown in Figure 3) process of " strategy-combination chain-execution route " is divided into two steps, is respectively " strategy-combination chain " and maps and " combination chain-execution route " mapping, specific as follows:
Step 2.1: " strategy-combination chain " maps: a string ordered set comprising all elements of first capability set, by object set and demand collection parametrization, generates the combination chain that has hard objectives and request;
" strategy-combination chain " maps and is expressed as wherein, g representation parameter process, P represents combined strategy, and O represents object set, C representative element capability set, and D represents demand collection; Mapping value is represent the ordered set containing a string first ability, and contain all elements of C, be that a target is O, the demand combination chain that has been the parametrization of D;
Step 2.2: " combination chain-execution route " maps: select an example to each first ability, according to arrangement view and the network topology of first ability example, finally calculate feasible execution route;
" combination chain-execution route " maps and is described as: wherein " → " represents mapping process; wherein represent combination chain i-th first ability; representative element ability all example set, wherein symbol " a " representative instance, is also representing e is first ability example; If F non-NULL, " combination chain-execution route " maps can be successful, namely for combination chain has the execution route existence that feasible at least.
" combination chain-execution route " mapping method is taked " overall combined method ", and " overall combined method " considers the cooperative relationship between first ability in combination chain, and its step is as follows:
Step 2.2.1: for each first ability in first capability set, choose one of them example respectively, obtain the combination chain after an instantiation; In this approach, the combination chain set after instantiation is obtained;
Step 2.2.2: according to network example Deployment view and network node topology, choose the feasible combination chain set meeting network connectivty;
Step 2.2.3: considering, under overall performance index constraint prerequisite, to choose optimum combination chain in the set of feasible combination chain.
The method can utilize overall performance requirement fully, by the first ability example layout in multiple switching node, by the complementation between each yuan of ability example index, calculates the process streamline of meeting consumers' demand.
Each first ability has the example collection of a candidate, needs to choose an example to perform relevant concrete operations from this set.After first abilities all on combination chain all instantiation, a process streamline can realize, i.e. execution route.Each yuan of ability instantiation of combination chain can be formed an execution route.
Step 2.2.3 can be described as a 0-1 linear programming problem, makes g be a solution of linear programming problem, and this solution so can be claimed to be a state of simulated annealing method, and make Ξ be state space, it is made up of feasible solution; Adopt simulated annealing method to choose optimum combination chain, comprise the following steps (as shown in Figure 4):
Step 2.2.3.1: the initial condition of selecting system from state space, and determine initial temperature;
Step 2.2.3.2: from state set space random selecting state, be set to initial condition; Ξ (g) is the state set that can arrive from state g; When control temperature T, calculate the probability P arriving state g ' from state g t(g, g'), wherein g ' represents a state in state set space except g;
Step 2.2.3.3: comply with state g and arrive state g ' probability P t(g, g'), upgrades current state;
Step 2.2.3.4: reduce control temperature T; When reaching maximum iterations or control temperature T=0, terminate; Otherwise, turn to step 2.2.3.2.
Combination chain is formed by first combined ability of difference in functionality, and first ability is wherein ordered arrangement; Combination chain structure comprises serial, parallel and bifurcated (as shown in Figure 1).Wherein, serial combination scheme is the most basic compound mode, and other compound mode can be derived from by serial mode.
First combined ability method in step 2 has been come by first ability layout functional module (as shown in Figure 5), contain in unit's ability layout functional module: Register, accelerator, first ability information storehouse, optimum choice device, policy transformation module, combination chain pond, execution route pond, topology information base and Topology Discovery module are coordination between each several part; Unit's ability layout functional module is contacted by api interface and first ability, first combined ability is got up to realize diversified service according to keeper's demand by unit's ability layout functional module, and the network that the execution route that first ability layout functional module generates is mapped to bottom by Control Server opens up benefit.
Fig. 6 gives the handling process after a packet arrival switch; In the network not having first ability layout functional module, when a packet arrives a switch, if can match list item, it will be transferred to down hop; Otherwise it will be forwarded to a Control Server, in Control Server, route can be calculated and is installed in switch, and therefore remaining packet can directly be forwarded.In the network with first ability layout functional module, process will change, and specifically has following steps:
Step 601: be orderly combination chain by the policy resolution of network manager, comprises constraint set, object set;
Step 602: for each first ability chooses an example, and export execution route; Each execution route is by distinctive code identification;
Step 603 a: packet arrives switch, if there is list item to mate, carries out the operations such as forwarding, otherwise will upload to Control Server;
Step 604: the packet uploading to Control Server first can by the process of first ability layout functional module;
Step 605: arrived target tightening in execution route if data packet matched one, so the stream at this packet place is the stream that a strategy is paid close attention to; Corresponding execution route can be installed in switch-layer topology by Control Server, and the packet of this stream ensuing will directly by this execution route process;
Step 606: if packet does not match the object set of any execution route, so this packet can by Control Server process.
Below in conjunction with some accompanying drawings, technical scheme of the present invention is conducted further description:
First ability description (as shown in Figure 7) of TCP: Control Server A and Control Server B is responsible for different regions, network manager wishes a strategy: all flows all have to pass through a monitor node, such as before some storage resources of access (such as Hash table HT), has to pass through TCP.User 1 initiates a connection to HT, between node E1 and node E2, so just set up a connection, and Control Server A can select the first ability setting up TCP at node E1.
Fig. 8 gives the description that type is first ability of port_scan.The descriptor format defining first ability is: <Type:Descriptions>, Description are used to the reference provided to developer.The example standard XML format of IPS is write, as follows:
Fig. 9 gives the example that type is first ability of port_scan.The name name of Port_scan is flow_drop, and monitoring flow rate mode is as the data flow of <dst_port:80, dst_IP:192.168.0.0/16>, and the malicious data bag mating above pattern all can abandon.For port_scan, different developers can use different algorithm design and realization, and external user cannot be learnt.

Claims (7)

1. the first ability method of combination that switching node more than is collaborative, is characterized in that: containing the following step:
Step 1: adopt the network node management method of function combined strategy to network manager to be described, and the set of strategies standardization that will produce, namely provide the policy library of standard to developer;
Step 2: by the network view of the overall situation, adopt first combined ability method by first ability layout of multiple switching node, this yuan of combined ability method comprises the mapping process of " strategy-combination chain-execution route ".
2. first ability method of combination that many switching nodes according to claim 1 are collaborative, is characterized in that: the strategy in described step 2 contains object set, first capability set and demand collection; Object set is the goal set wanting executable operations; Unit's capability set is the first capabilities list with type identification, and the first ability in first capability set is ordered arrangement, and object set must travel through the whole first ability inside first capability set; Demand collection defines the performance requirement that complete process streamline will be followed, the demand centralized procurement behavior restraint of Service Quality Metrics statement Global treatment.
3. first ability method of combination that many switching nodes according to claim 2 are collaborative, it is characterized in that: in described step 2, the mapping process of " strategy-combination chain-execution route " is divided into two steps, be respectively " strategy-combination chain " to map and " combination chain-execution route " mapping, specific as follows:
Step 2.1: " strategy-combination chain " maps: a string ordered set comprising all elements of first capability set, by object set and demand collection parametrization, generates the combination chain that has hard objectives and request;
Step 2.2: " combination chain-execution route " maps: select an example to each first ability, according to arrangement view and the network topology of first ability example, finally calculate feasible execution route.
4. first ability method of combination that many switching nodes according to claim 3 are collaborative, is characterized in that: described " combination chain-execution route " mapping method is taked " overall combined method ", and its step is as follows:
Step 2.2.1: for each first ability in first capability set, choose one of them example respectively, obtain the combination chain after an instantiation; In this approach, the combination chain set after instantiation is obtained;
Step 2.2.2: according to network example Deployment view and network node topology, choose the feasible combination chain set meeting network connectivty;
Step 2.2.3: choose optimum combination chain in the set of feasible combination chain.
5. first ability method of combination that many switching nodes according to claim 4 are collaborative, is characterized in that: described step 2.2.3 adopts simulated annealing method to choose optimum combination chain, comprises the following steps;
Step 2.2.3.1: the initial condition of selecting system from state space, and determine initial temperature;
Step 2.2.3.2: from state set space random selecting state, be set to initial condition; When control temperature T, calculate the probability P arriving state g ' from state g t(g, g'), wherein g ' represents a state in state set space except g;
Step 2.2.3.3: comply with state g and arrive state g ' probability P t(g, g'), upgrades current state;
Step 2.2.3.4: reduce control temperature T; When reaching maximum iterations or control temperature T=0, terminate; Otherwise, turn to step 2.2.3.2.
6. first ability method of combination that many switching nodes according to claim 2 are collaborative, is characterized in that: described combination chain is formed by first combined ability of difference in functionality, and first ability is wherein ordered arrangement; Combination chain structure comprises serial, parallel and bifurcated.
7. first ability method of combination that many switching nodes according to claim 1 are collaborative, is characterized in that: the first combined ability method in described step 2 has been come by first ability layout functional module; Unit's ability layout functional module is contacted by api interface and first ability, first combined ability is got up to realize diversified service according to keeper's demand by unit's ability layout functional module, and the network that the execution route that first ability layout functional module generates is mapped to bottom by Control Server opens up benefit.
CN201510175085.1A 2015-04-14 2015-04-14 First ability method of combination of more switching node collaborations Active CN104917629B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510175085.1A CN104917629B (en) 2015-04-14 2015-04-14 First ability method of combination of more switching node collaborations

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510175085.1A CN104917629B (en) 2015-04-14 2015-04-14 First ability method of combination of more switching node collaborations

Publications (2)

Publication Number Publication Date
CN104917629A true CN104917629A (en) 2015-09-16
CN104917629B CN104917629B (en) 2018-08-17

Family

ID=54086358

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510175085.1A Active CN104917629B (en) 2015-04-14 2015-04-14 First ability method of combination of more switching node collaborations

Country Status (1)

Country Link
CN (1) CN104917629B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105376170A (en) * 2015-11-16 2016-03-02 中国人民解放军信息工程大学 Load balance-preferred virtual network function combination method
CN106533966A (en) * 2016-05-27 2017-03-22 清华大学 Network service resource arranging method and apparatus
CN107998656A (en) * 2017-11-22 2018-05-08 福建天晴数码有限公司 A kind of method of combination and terminal
CN112422540A (en) * 2020-11-09 2021-02-26 浙江大学 Dynamic transformation method for executive body in mimicry WAF

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102201995A (en) * 2011-06-03 2011-09-28 北京邮电大学 Combination service system and method for realizing network load optimization
CN102571962A (en) * 2012-01-13 2012-07-11 北京航空航天大学 Service composition path construction method for cloud manufacturing
CN103338269A (en) * 2013-07-19 2013-10-02 中国人民解放军信息工程大学 Data transmission method and device
US8874719B1 (en) * 2013-12-19 2014-10-28 Architecture Technology Corporation Context-aware network and situation management for crypto-partitioned networks
CN104135478A (en) * 2014-07-25 2014-11-05 中国人民解放军信息工程大学 XML based meta-ability managing and configuring method
CN104301212A (en) * 2014-09-26 2015-01-21 浙江工商大学 Functional chain combination method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102201995A (en) * 2011-06-03 2011-09-28 北京邮电大学 Combination service system and method for realizing network load optimization
CN102571962A (en) * 2012-01-13 2012-07-11 北京航空航天大学 Service composition path construction method for cloud manufacturing
CN103338269A (en) * 2013-07-19 2013-10-02 中国人民解放军信息工程大学 Data transmission method and device
US8874719B1 (en) * 2013-12-19 2014-10-28 Architecture Technology Corporation Context-aware network and situation management for crypto-partitioned networks
CN104135478A (en) * 2014-07-25 2014-11-05 中国人民解放军信息工程大学 XML based meta-ability managing and configuring method
CN104301212A (en) * 2014-09-26 2015-01-21 浙江工商大学 Functional chain combination method

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105376170A (en) * 2015-11-16 2016-03-02 中国人民解放军信息工程大学 Load balance-preferred virtual network function combination method
CN105376170B (en) * 2015-11-16 2018-08-03 中国人民解放军信息工程大学 A kind of virtualization network function combined method that load balancing is preferential
CN106533966A (en) * 2016-05-27 2017-03-22 清华大学 Network service resource arranging method and apparatus
CN107998656A (en) * 2017-11-22 2018-05-08 福建天晴数码有限公司 A kind of method of combination and terminal
CN107998656B (en) * 2017-11-22 2020-12-22 福建天晴数码有限公司 Arranging method and terminal
CN112422540A (en) * 2020-11-09 2021-02-26 浙江大学 Dynamic transformation method for executive body in mimicry WAF
CN112422540B (en) * 2020-11-09 2021-09-03 浙江大学 Dynamic transformation method for executive body in mimicry WAF

Also Published As

Publication number Publication date
CN104917629B (en) 2018-08-17

Similar Documents

Publication Publication Date Title
Wang et al. A graph neural network-based digital twin for network slicing management
Buyya et al. Internet of Things: Principles and paradigms
US20210110310A1 (en) Methods and apparatus to verify trained models in an edge environment
US20210314365A1 (en) End-to-end device attestation
CN105765556A (en) Customer-directed networking limits in distributed systems
CN104917629A (en) Multi-switching-node cooperation meta-ability scheduling method
CN104202183B (en) The method and apparatus that a kind of solution SDN stream ranks configuration conformance updates
CN106095035A (en) Server system and computer implemented method thereof and computer-readable recording medium
CN109791592A (en) The sensitive data in application program is handled using external treatment
CN106471470B (en) Model-driven affinity-based network function method and device
Wang et al. Building an improved Internet of Things smart sensor network based on a three-phase methodology
Petroulakis et al. Semiotics architectural framework: End-to-end security, connectivity and interoperability for industrial iot
Roxin et al. Interoperable digital building twins through communicating materials and semantic BIM
Sokolov et al. A flexible framework for developing integrated models of transportation systems using an agent-based approach
Kesaraju et al. Integrated simulation combining process-driven and event-driven models
Omer et al. A Comprehensive Review of Internet of Things: Technology Stack, Middlewares, and Fog/Edge Computing Interface
CA3170632A1 (en) High-resolution contract-based wireless network virtualization
Ferrera et al. IoT European security and privacy projects: Integration, architectures and interoperability
Al-Zoubi et al. A grid-shaped cellular modeling approach for wireless sensor networks
Subramanian et al. A goal-oriented programming framework for grid sensor networks with reconfigurable embedded nodes
Zhao et al. SimMon: a toolkit for simulation of monitoring mechanisms in cloud computing environment
Zheng et al. The effects of wireless communication failures on group behavior of mobile sensors
Tolosana-Calasanz et al. Extending cometcloud to process dynamic data streams on heterogeneous infrastructures
Khan A distributed computing architecture to enable advances in field operations and management of distributed infrastructure
Sahin et al. Programming Languages, Network Simulators, and Tools

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant