CN104917629B - First ability method of combination of more switching node collaborations - Google Patents

First ability method of combination of more switching node collaborations Download PDF

Info

Publication number
CN104917629B
CN104917629B CN201510175085.1A CN201510175085A CN104917629B CN 104917629 B CN104917629 B CN 104917629B CN 201510175085 A CN201510175085 A CN 201510175085A CN 104917629 B CN104917629 B CN 104917629B
Authority
CN
China
Prior art keywords
ability
combination
network
strategy
combination chain
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.)
Active
Application number
CN201510175085.1A
Other languages
Chinese (zh)
Other versions
CN104917629A (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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present invention relates to a kind of first ability method of combination of more switching node collaborations, contain the following steps:1:The network node management method of network administrator is described using function combined strategy, and the set of strategies of generation is standardized;2:By global network view, first ability layout of multiple switching nodes is got up using first combined ability method, this yuan of combined ability method includes the mapping process of " strategy combination chain execution route ":2.1:" strategy combination chain " maps:The ordered set of a string of all elements comprising first capability set is parameterized by object set and demand collection, and generating one has hard objectives and the combination chain of request;2.2:" combination chain execution route " mapping:Select an example that feasible execution route is finally calculated according to the arrangement view and network topology of first ability example each first ability;The present invention can realize the collaborative work of first ability between more switching nodes, be convenient for developer's developing network function, accelerate the innovation of network function.

Description

First ability method of combination of more switching node collaborations
(1), technical field:The present invention relates to a kind of first ability method of combination, are assisted more particularly to a kind of more switching nodes Same first ability method of combination.
(2), background technology:As current network service is increasingly various, network application is increasingly abundant, conventional internet Service mode is faced with various challenges.On the one hand, the network application development of user level is very rapid, especially Service providers' open service interface such as ***, facebook further excites demand of the upper layer application to function and increasingly increases It is more;On the other hand, the network function of bottom is extremely limited, and most of network equipment function closing prevents developer's exploitation new The network function of type.Upper layer application and the mismatch of bottom-layer network development are conventional internet design facing challenges.In order to make Bottom-layer network can realize that function opens, and the chance of exploitation bottom-layer network function be provided to developer, it is new that industry proposes some The network architecture of type.They mostly detach data plane with control plane, and control plane and data surface use unified mark Quasi- interface protocol connection.This makes it possible to develop bottom-layer network function to be no longer only equipment supplier, while being also extended to times What third party's tissue and company.
The opening of network function will greatly push the innovation of network function.With the innovation of network function, meeting in network There are a large amount of fine-grained function modules, and the same function module has the example of a large amount of different developer's offers in net It is coexisted in network.Therefore, the network application on upper layer has many alternative examples when using certain network function.In addition, network The example that manager also has the more free management and control spatial choice of bigger different is combined to cope with different performance requirements.
However, synergistically management spreads function module in a network and the example is but very difficult.On the one hand, network is simultaneously Unified function module is not provided to developer to define, lead to the network function module granularity that third-party developer develops not One, function is extensive, it is difficult to organization of unity.On the other hand, network does not also provide unified interface to developer, this leads to network work( It can not cooperate between module.In addition, how to be combined network module, how selector closes the function of layer demand Example is all a problem to be solved.
Invention content
The technical problem to be solved by the present invention is to:A kind of first ability method of combination of more switching node collaborations, the party are provided Method can realize the collaborative work of first ability between more switching nodes, real convenient for developer's developing network function and network administrator Existing diversified strategy, accelerates the innovation of network function.
Technical scheme of the present invention:
A kind of first ability method of combination of more switching node collaborations, contains the following steps:
Step 1:The network node management method of network administrator is described using function combined strategy, and will be generated Set of strategies standardization, i.e., to developer provide standard policy library;
Step 2:By global network view, using first combined ability method by first ability layout of multiple switching nodes Get up, this yuan of combined ability method includes the mapping process of " strategy-combination chain-execution route ".
The element description of first ability includes nine tuple structures, S:=<T,I,O,ID,B,E,F,R,A>, that is,<Type, Input interface collection, output interface collection, mark execute body, event set, Facet classification, resource, property set>(referring to application No. is ZL201310307096.1's《A kind of data transmission method and device》In description).
Strategy in step 2 contains object set, first capability set and demand collection;Object set is the target collection of operation to be executed (such as in traffic engineering, it is the set of some streams);First capability set is first capabilities list with type identification, in first capability set First ability be ordered into arrangement, and object set must traverse all first abilities inside first capability set;Demand collection defines The complete processing assembly line performance requirement to be followed, demand collection state the behavior of Global treatment about using Service Quality Metrics Beam.
Strategy is configured by network operator or network administrator, according to the strategy, for different application scenarios using not Same plan carrys out management and control network.
The mapping process of " strategy-combination chain-execution route " is divided into two steps in step 2, and respectively " strategy-combination chain " reflects It penetrates and " combination chain-execution route " maps, it is specific as follows:
Step 2.1:" strategy-combination chain " maps:The ordered set of a string of all elements comprising first capability set is by target Collection and demand collection parametrization, generating one has hard objectives and the combination chain of request;
" strategy-combination chain " mapping is expressed asWherein,G representation parameters Process, P represent combined strategy, and O represents object set, C representative element capability sets, and D represents demand collection;Mapping value isIndicate one A ordered set for containing a string yuan of abilities, andThe all elements for containing C, be a target be O, the parameter that demand is D Combination chain is changed;
Step 2.2:" combination chain-execution route " mapping:One example is selected to each first ability, according to first ability example Arrangement view and network topology, feasible execution route is finally calculated;
" combination chain-execution route " mapping is described as:Wherein " → " represents mapping Process;WhereinRepresent combination chainI-th yuan of ability;It represents First abilityAll example sets, wherein symbol " a " representative instance, namelyIt is first ability to represent eReality Example;If F non-emptys, " combination chain-execution route " mapping can succeed, i.e., for combining chainAt least one is feasible Execution route exists.
" combination chain-execution route " mapping method takes " global combined method ", and " global combined method " considers combination Cooperative relationship in chain between first ability, its step are as follows:
Step 2.2.1:For the first ability of each of first capability set, one of example is chosen respectively, obtains a reality Combination chain after exampleization;In this approach, the combination chain set after being instantiated;
Step 2.2.2:According to network example Deployment view and network node topology, selection meets the feasible of network connectivty Combine chain set;
Step 2.2.3:Under the premise of considering whole performance indicator constraint, optimal set is chosen in feasible combination chain set Close chain.
This method can fully utilize global performance requirement to lead to first ability example layout in multiple switching nodes The complementation between each first ability example index is crossed, the processing assembly line for meeting user demand is calculated.
Each member ability is owned by a candidate example collection, needs to choose an example from this set to execute Relevant concrete operations.After first ability all on combination chain all instantiates, a processing assembly line can be realized, that is, hold Walking along the street diameter.The each first ability instantiation for combining chain is constituted into an execution route.
Step 2.2.3 can be described as a 0-1 linear programming problem, enable the solution that g is linear programming problem, then It is a state of simulated annealing method that can claim this solution, and it is state space to enable Ξ, it is deconstructed by feasible;It is moved back using simulation Ignition method chooses optimum combination chain, includes the following steps:
Step 2.2.3.1:The original state of selecting system from state space, and determine initial temperature;
Step 2.2.3.2:A state is randomly selected from state set space, is set as original state;Ξ (g) is can be from shape The state set that state g is reached;In the case where controlling temperature T, the probability P that state g ' is reached from state g is calculatedT(g, g'), Middle g ' represents a state in addition to g in state set space;
Step 2.2.3.3:Compliance state g reaches state g ' probability PsT(g, g') updates current state;
Step 2.2.3.4:Reduce control temperature T;When reaching maximum iterations or control temperature T=0, terminate; Otherwise, step 2.2.3.2 is turned to.
Combination chain is to be formed by first combined ability of different function, and first ability therein is ordered into arrangement;Combination link Structure includes serial, parallel and bifurcated.Wherein, serial combination scheme is most basic combination, and other combinations can be with It is derived from by serial mode.
First combined ability method in step 2 is completed by first ability layout function module, first ability layout function module In contain:Register, accelerator, first ability information library, optimum choice device, policy transformation module, combination chain pond, execution route Pond, topology information base and Topology Discovery module are coordinations between each section;First ability layout function module is connect by API Mouth is contacted with first ability, and first combined ability is got up to realize diversified by first ability layout function module according to administrator's demand Service, the execution route that first ability layout function module generates open up benefit by controlling the network of server mappings to bottom.
In the network of no first ability layout function module, when data packet one interchanger of arrival, if energy It is fitted on list item, it will be transferred to next-hop;Otherwise, it will be forwarded to a control server, in controlling server, road By that can be calculated and be installed in interchanger, therefore remaining data packet can be directly forwarded.Has the function of first ability layout In the network of module, process will change, and specifically have following steps:
Step 601:It is orderly combination chain, including constraint set, object set by the policy resolution of network administrator;
Step 602:An example is chosen for each first ability, and exports execution route;Each execution route is by distinctive Code identification;
Step 603:One data packet reaches interchanger, otherwise will be upper if there is list item matching such as is then forwarded at the operations Pass to control server;
Step 604:Uploading to the data packet of control server can be handled first by first ability layout function module;
Step 605:If data packet matched arrived that target tightening in execution route one, where this data packet Stream be one strategy concern stream;Corresponding execution route can be installed to by controlling server in switch-layer topology, be connect down The data packet of this stream come will be directly by the processing of this execution route;
Step 606:If data packet is not matched to the object set of any execution route, this data packet can be controlled Control server processing.
Beneficial effects of the present invention:
1, the present invention is proposed using first ability as the method for first ability layout of network basic functional units, for solving net The combinatorial problem of first ability in network, by the method, the manager of network can easily manage network, realize various Management strategy.The present invention can provide first combined ability chain of customization for different service requests, and realize more switching nodes Between first ability collaborative work, realize diversified strategy convenient for developer's developing network function and network administrator, accelerate The innovation of network function.
Description of the drawings
Fig. 1 is the structural schematic diagram for combining chain;
Fig. 2 is the description schematic diagram of strategy;
Fig. 3 is that " strategy-combination chain-execution route " maps flow chart schematic diagram;
Fig. 4 is the schematic diagram of simulated annealing method;
Fig. 5 is the structural schematic diagram of first ability layout function module;
Fig. 6 is that a data packet reaches the processing flow schematic diagram after interchanger;
Fig. 7 is a kind of first ability application scenarios schematic diagram;
Fig. 8 is the description schematic diagram for first ability that type is port_scan;
Fig. 9 is an example schematic of first ability that type is port_scan.
Specific implementation mode
First ability method of combination of more switching node collaborations contains the following steps:
Step 1:The network node management method of network administrator is described using function combined strategy, and will be generated Set of strategies standardization, i.e., to developer provide standard policy library;
Step 2:By global network view, using first combined ability method by first ability layout of multiple switching nodes Get up, this yuan of combined ability method includes the mapping process of " strategy-combination chain-execution route ".
The element description of first ability includes nine tuple structures, S:=<T,I,O,ID,B,E,F,R,A>, that is,<Type, Input interface collection, output interface collection, mark execute body, event set, Facet classification, resource, property set>.
Strategy in step 2 contains object set, first capability set and demand collection (as shown in Figure 2);Object set is to execute behaviour The target collection of work (such as in traffic engineering, it is the set of some streams);First capability set is arranged with first ability of type identification Table, first ability in first capability set is ordered into arrangement, and object set must traverse all first abilities inside first capability set; Demand collection defines that the complete processing assembly line performance requirement to be followed, demand collection are global using Service Quality Metrics statement The behavior restraint of processing.
Strategy is configured by network operator or network administrator, according to the strategy, for different application scenarios using not Same plan carrys out management and control network.
Mapping (as shown in Figure 3) process of " strategy-combination chain-execution route " is divided into two steps, respectively " plan in step 2 Summary-combination chain " mapping and " combination chain-execution route " mapping, it is specific as follows:
Step 2.1:" strategy-combination chain " maps:The ordered set of a string of all elements comprising first capability set is by target Collection and demand collection parametrization, generating one has hard objectives and the combination chain of request;
" strategy-combination chain " mapping is expressed asWherein,G representation parameters Process, P represent combined strategy, and O represents object set, C representative element capability sets, and D represents demand collection;Mapping value isIndicate one A ordered set for containing a string yuan of abilities, andThe all elements for containing C, be a target be O, the ginseng that demand is D Number has changed combination chain;
Step 2.2:" combination chain-execution route " mapping:One example is selected to each first ability, according to first ability example Arrangement view and network topology, feasible execution route is finally calculated;
" combination chain-execution route " mapping is described as:Wherein " → " represents mapping Process;WhereinRepresent combination chainI-th yuan of ability;It represents First abilityAll example sets, wherein symbol " a " representative instance, namelyIt is first ability to represent eReality Example;If F non-emptys, " combination chain-execution route " mapping can succeed, i.e., for combining chainAt least one is feasible Execution route exists.
" combination chain-execution route " mapping method takes " global combined method ", and " global combined method " considers combination Cooperative relationship in chain between first ability, its step are as follows:
Step 2.2.1:For the first ability of each of first capability set, one of example is chosen respectively, obtains a reality Combination chain after exampleization;In this approach, the combination chain set after being instantiated;
Step 2.2.2:According to network example Deployment view and network node topology, selection meets the feasible of network connectivty Combine chain set;
Step 2.2.3:Under the premise of considering whole performance indicator constraint, optimal set is chosen in feasible combination chain set Close chain.
This method can fully utilize global performance requirement to lead to first ability example layout in multiple switching nodes The complementation between each first ability example index is crossed, the processing assembly line for meeting user demand is calculated.
Each member ability is owned by a candidate example collection, needs to choose an example from this set to execute Relevant concrete operations.After first ability all on combination chain all instantiates, a processing assembly line can be realized, that is, hold Walking along the street diameter.The each first ability instantiation for combining chain is constituted into an execution route.
Step 2.2.3 can be described as a 0-1 linear programming problem, enable the solution that g is linear programming problem, then It is a state of simulated annealing method that can claim this solution, and it is state space to enable Ξ, it is deconstructed by feasible;It is moved back using simulation Ignition method chooses optimum combination chain, includes the following steps (as shown in Figure 4):
Step 2.2.3.1:The original state of selecting system from state space, and determine initial temperature;
Step 2.2.3.2:A state is randomly selected from state set space, is set as original state;Ξ (g) is can be from shape The state set that state g is reached;In the case where controlling temperature T, the probability P that state g ' is reached from state g is calculatedT(g, g'), Middle g ' represents a state in addition to g in state set space;
Step 2.2.3.3:Compliance state g reaches state g ' probability PsT(g, g') updates current state;
Step 2.2.3.4:Reduce control temperature T;When reaching maximum iterations or control temperature T=0, terminate; Otherwise, step 2.2.3.2 is turned to.
Combination chain is to be formed by first combined ability of different function, and first ability therein is ordered into arrangement;Combination link Structure includes serial, parallel and bifurcated (as shown in Figure 1).Wherein, serial combination scheme is most basic combination, other groups Conjunction mode can be derived from by serial mode.
First combined ability method in step 2 is completed by first ability layout function module (as shown in Figure 5), and first ability is compiled Contain in row function module:Register, accelerator, first ability information library, optimum choice device, policy transformation module, combination chain pond, Execution route pond, topology information base and Topology Discovery module are coordinations between each section;First ability layout function module is logical It crosses api interface to contact with first ability, first combined ability is got up to realize more by first ability layout function module according to administrator's demand The various service of kind, the execution route that first ability layout function module generates are opened up by controlling the network of server mappings to bottom It mends.
Fig. 6 gives a data packet and reaches the process flow after interchanger;In no first ability layout function module In network, when a data packet reaches an interchanger, if list item can be matched to, it will be transferred to next-hop;Otherwise, it It will be forwarded to a control server, in controlling server, routing can be calculated and is installed in interchanger, therefore remaining Data packet can directly be forwarded.In the network with first ability layout function module, process will change, and specifically have following Step:
Step 601:It is orderly combination chain, including constraint set, object set by the policy resolution of network administrator;
Step 602:An example is chosen for each first ability, and exports execution route;Each execution route is by distinctive Code identification;
Step 603:One data packet reaches interchanger, otherwise will be upper if there is list item matching such as is then forwarded at the operations Pass to control server;
Step 604:Uploading to the data packet of control server can be handled first by first ability layout function module;
Step 605:If data packet matched arrived that target tightening in execution route one, where this data packet Stream be one strategy concern stream;Corresponding execution route can be installed to by controlling server in switch-layer topology, be connect down The data packet of this stream come will be directly by the processing of this execution route;
Step 606:If data packet is not matched to the object set of any execution route, this data packet can be controlled Control server processing.
Technical scheme of the present invention is further described with reference to some attached drawings:
First ability description (as shown in Figure 7) of port scan:Control server A and control server B are responsible for different areas Domain, network administrator wish a strategy:All flows all have to pass through a monitoring node, for example are accessing some storages Port scan is had to pass through before resource (such as Hash table HT).As soon as connection of the initiation of user 1 to HT, then in node E1 A connection is established between node E2, control server A can select to establish first ability of port scan in node E1.
Fig. 8 gives the description for first ability that type is port_scan.The descriptor format of the first ability of definition is:<Type: Descriptions>, Description is the reference for being provided to developer.The example standard of IPS is write with XML format, such as Under:
Fig. 9 gives an example of first ability that type is port_scan.The name name of Port_scan is flow_ Drop, monitoring flow rate mode is such as<dst_port:80,dst_IP:192.168.0.0/16>Data flow, and match with upper mold The prior data bank of formula can all abandon.For port_scan, different developers can use different algorithm design and reality Existing, external user can not be learnt.

Claims (4)

1. a kind of first ability method of combination of more switching node collaborations, it is characterized in that:Contain the following steps:
Step 1:The network node management method of network administrator is described using function combined strategy, and by the plan of generation Slightly collection standardization, i.e., provide the policy library of standard to developer;
Step 2:By global network view, first ability layout of multiple switching nodes is risen using first combined ability method Come, this yuan of combined ability method includes the mapping process of " strategy-combination chain-execution route ", and the strategy is the strategy of standard Function combined strategy in library;
Strategy in the step 2 contains object set, first capability set and demand collection;Object set is the object set of operation to be executed It closes;First capability set is first capabilities list with type identification, and first ability in first capability set is ordered into arrangement, and object set All first ability inside first capability set must be traversed;Demand collection defines that the complete processing assembly line performance to be followed needs It asks, demand collection states the behavior restraint of Global treatment using Service Quality Metrics;
The mapping process of " strategy-combination chain-execution route " is divided into two steps in the step 2, and respectively " strategy-combination chain " reflects It penetrates and " combination chain-execution route " maps, it is specific as follows:
Step 2.1:" strategy-combination chain " maps:The ordered set of a string of all elements comprising first capability set by object set and Demand collection parameterizes, and generating one has hard objectives and the combination chain of request;
Step 2.2:" combination chain-execution route " mapping:One example is selected to each first ability, according to point of first ability example Feasible execution route is finally calculated in cloth view and network topology;
" combination chain-execution route " mapping method takes " global combined method ", and its step are as follows:
Step 2.2.1:For the first ability of each of first capability set, one of example is chosen respectively, obtains an instantiation Combination chain afterwards;In this approach, the combination chain set after being instantiated;
Step 2.2.2:According to network example Deployment view and network node topology, the feasible combination for meeting network connectivty is chosen Chain set;
Step 2.2.3:Optimum combination chain is chosen in feasible combination chain set.
2. first ability method of combination of more switching node collaborations according to claim 1, it is characterized in that:The step 2.2.3 it uses simulated annealing method to choose optimum combination chain, includes the following steps;
Step 2.2.3.1:The original state of selecting system from state space, and determine initial temperature;
Step 2.2.3.2:A state is randomly selected from state set space, is set as original state;The case where controlling temperature T Under, calculate the probability P that state g ' is reached from state gT(g, g'), wherein g ' represent a shape in addition to g in state set space State;
Step 2.2.3.3:Compliance state g reaches state g ' probability PsT(g, g') updates 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.
3. first ability method of combination of more switching node collaborations according to claim 1, it is characterized in that:The combination chain is It is formed by first combined ability of different function, and first ability therein is ordered into arrangement;Combine chain structure include it is serial, parallel and Bifurcated.
4. first ability method of combination of more switching node collaborations according to claim 1, it is characterized in that:In the step 2 First combined ability method completed by first ability layout function module;First ability layout function module passes through api interface and member Ability contacts, and first ability layout function module gets up first combined ability to realize diversified service according to administrator's demand, The network topology that the execution route that first ability layout function module generates passes through control server mappings to bottom.
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 CN104917629A (en) 2015-09-16
CN104917629B true 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)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105376170B (en) * 2015-11-16 2018-08-03 中国人民解放军信息工程大学 A kind of virtualization network function combined method that load balancing is preferential
CN106533966B (en) * 2016-05-27 2019-05-14 清华大学 A kind of the resource method of combination and device of network service
CN107998656B (en) * 2017-11-22 2020-12-22 福建天晴数码有限公司 Arranging method and terminal
CN112422540B (en) * 2020-11-09 2021-09-03 浙江大学 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

Also Published As

Publication number Publication date
CN104917629A (en) 2015-09-16

Similar Documents

Publication Publication Date Title
Wang et al. A graph neural network-based digital twin for network slicing management
CN104917629B (en) First ability method of combination of more switching node collaborations
CN107733855A (en) A kind of block catenary system and application process that can support publicly-owned chain, alliance&#39;s chain and privately owned chain simultaneously
CN100559771C (en) The web service strategy is transformed into the method and apparatus of physical model from logical model
US20220076066A1 (en) Using generative adversarial networks (gans) to enable sharing of sensitive data
CN108293020A (en) The exclusive service forwarding of infrastructure
CN109076028A (en) Heterogeneous software defines the differential section in network environment
CN102780574B (en) The collocation method of the office data of service-oriented, device and check method, device
CN111062807A (en) Internet of things data service credit assessment method based on block chain
EP3218805B1 (en) Method and system for model-driven, affinity-based, network functions
Pujol-Perich et al. Ignnition: Bridging the gap between graph neural networks and networking systems
Zeng et al. Intelligent blockchain-based secure routing for multidomain SDN-enabled IoT networks
Wang et al. LHNN: Lattice hypergraph neural network for VLSI congestion prediction
Petroulakis et al. Semiotics architectural framework: End-to-end security, connectivity and interoperability for industrial iot
Blas et al. Routing structure over discrete event system specification: a DEVS adaptation to develop smart routing in simulation models
Olimjonovich Software Defined Networking: Management of network resources and data flow
Gao et al. Trident: toward a unified sdn programming framework with automatic updates
LIAO et al. Evolutionary algorithms in software defined networks: techniques, applications, and issues
Russo et al. LAMBDA: An open framework for deep neural network accelerators simulation
Kesaraju et al. Integrated simulation combining process-driven and event-driven models
CN105281960A (en) Method for managing flow entry in software defined network
CN102594851A (en) Method for dynamically building marine application service chain
Rotsos et al. Reasonet: Inferring network policies using ontologies
Ricci et al. Report of the NSF Workshop on Software Defined Infrastructures and Software Defined Exchanges
CN104135478B (en) First Capacity Management collocation method based on XML

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