CN109088826A - A kind of reliable multicast method based on all-optical network coding in software definition data center optical-fiber network - Google Patents
A kind of reliable multicast method based on all-optical network coding in software definition data center optical-fiber network Download PDFInfo
- Publication number
- CN109088826A CN109088826A CN201811131870.7A CN201811131870A CN109088826A CN 109088826 A CN109088826 A CN 109088826A CN 201811131870 A CN201811131870 A CN 201811131870A CN 109088826 A CN109088826 A CN 109088826A
- Authority
- CN
- China
- Prior art keywords
- network
- multicast routing
- optical
- multicast
- data center
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/16—Multipoint routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The reliable multicast method that the invention discloses a kind of based on all-optical network coding in software definition data center optical-fiber network, then this method devises Multicast Routing and the matched method of photosphere network code under a kind of and coefficient Multicast Routing change condition of the above method first with more universe quantum genetic algorithm dynamic generation Multicast Routings and standby Multicast Routing.Main innovation point of the invention shows themselves in that the Multicast Routing in data center's optical-fiber network is calculated using the distributed quantum genetic algorithm based on more universe and obtains, and can obtain a plurality of standby Multicast Routing for meeting all-optical network code requirement simultaneously；It can determine network code node location while obtaining Multicast Routing；If current multicast route break, network code vector can be adjusted according to the network code number of nodes of standby Multicast Routing, network code dimension when standby Multicast Routing is activated and network code vector is distributed to the coding nodes of standby Multicast Routing.
Description
Technical field
The present invention relates to one kind improved in software definition data center optical-fiber network based on all-optical network coding multicast it is reliable
Property scheme, including in software definition data center optical-fiber network using be based on more universe quantum genetic algorithm dynamic generation multicasts
The method of routing and standby Multicast Routing, and one kind all-optical network encoding operation and multicast path under Multicast Routing change condition
By dynamic matching method, belong to optical communication network administrative skill field.
Background technique
Data center plays the effect to become more and more important in modern society, and data center network is that connection data center is big
The bridge of scale server realizes that multicast is one of necessary functions of data center network, multicast energy in data center network
Enough effective service efficiencies for improving data center network resource.However, data center network inner stream flow is unevenly distributed, and
And there is extremely strong locality, dynamic, sudden and diversity.This reliability and spirit to data center network inside multicast
More stringent requirements are proposed for activity.In addition, large-scale data exchange and communication are needed inside data center, so that Traditional IP group
Broadcast network bandwidth, real-time and in terms of be all unable to satisfy the multicast transmission demand at large-scale data center.
Optical-fiber network has the advantages that high bandwidth, low energy consumption, reliable and stable, is several in data center's On-premise all-optical network
The inevitable choice built according to center.Software defined network framework can be realized being uniformly controlled and managing for data center's optical network resource
Reason.Therefore, high bandwidth is studied under software definition data center optical-fiber network architectural framework, the method for multicasting of high reliability meets number
According to the developing direction of central site network.The multicast service of data center network bearer types multiplicity, different multicast services are to network
Influence area and resource requirement otherness are larger, show extremely strong locality and sudden.Multicast machine based on network code
System can be improved the reliability of multicast, if in data center's optical-fiber network can dynamic construction Multicast Routing, and existing
Flexible choice standby Multicast Routing and according to standby Multicast Routing when Multicast Routing is larger by the load of other service impacts
Network code mechanism, which is flexibly matched with, can further increase the reliability and flexibility of multicast in data center.
Based on this target, the present invention proposes that one kind is being based on more universe quantum in software definition data center optical-fiber network
The method of evolution algorithm dynamic generation Multicast Routing and standby Multicast Routing, and a kind of and coefficient multicast of the above method
The method of the Dynamic Matching of all-optical network encoding operation and Multicast Routing under the conditions of routing variation.
Summary of the invention
Multicast transmission based on network code requires building to meet the multicast tree of network code transmission demand first.In order to
Multicast reliability and success rate are further increased, network control planes allow for guaranteeing when software definition data center optical-fiber network
When interior multicast area network environment changes, multicast tree construction can be adaptively adjusted.This requires in construction multicast tree
It is able to record Backup route subgraph in the process, the flexibility and diversity for increasing Multicast Routing are dynamically added and are moved back with supporting node
Multicast out.
In order to adaptively adjust Multicast Routing according to network resource status, the present invention is calculated using more universe quantum genetics
Method building meets the multicast routing infrastructure based on network code reliability requirement.Meet data center's distribution firstly, devising
It calculates more universe quantum genetic algorithms of environmental requirement and can be solved based on network code Multicast Routing and quantum genetic algorithm
Mapping method between search model.Then, using more universe distribution quantum genetic algorithms in software definition data center light
Network internal establishes the more disjoint paths Multicast Routings for meeting network code transmission requirement, and the algorithm is in search optimal solution
The generation track of optimal solution can be tracked in the process, and generates standby Multicast Routing subgraph.Finally, design is lost based on quantum derivative
The relevant operation of propagation algorithm can continue the motion profile for tracking optimal solution set, promote Multicast Routing being capable of Zhi Chijie
Point is dynamically added and exits multicast group.
Detailed description of the invention
The present invention is further illustrated with reference to the accompanying drawings and detailed description.
Dynamic multicast route implementing scheme of the Fig. 1 based on distributed more universe quantum genetic algorithms.
Fig. 2 Multicast Routing output link status diagram.
The quantum genetic algorithm coding mode of Fig. 3 Multicast Routing.
Fig. 4 solves the algorithm flow chart of dynamic multicast routing.
Fig. 5 photosphere network code and dynamic multicast matched routings General layout Plan.
Specific embodiment
The multiple-objection optimization dynamic multicast based on distributed quantum evolutionary algorithm is built in software definition data center optical-fiber network
The overall plan for setting research is as shown in Figure 1.First by network resource status, network delay limitation, multicast throughput requirement and net
The indexs such as network code requirement are mapped as the search restrictive condition of more disjoint paths Multicast Routings；Then Multicast Routing is searched for into problem
It is the model that searching algorithm can search for by quantum coding mapping, and quantum bit, chromosomal variation method and algorithm is set
Fitness function；Optimal solution is finally searched for using the parallel method in more universe, adaptive adjustment machine is utilized during search
System adjustment rotation angle step length and quantum mutation probability and the activity trajectory for tracking optimal solution.
Search model is constructed, realization is reflected from the multicast routing problem based on network code to quantum genetic algorithm solvable problem
The method and process penetrated are as follows.
(1) Optimized model is established
Multicast Routing is established in data center network can be abstracted as one in given digraphG=(E, V) in search for road
The problem of diameter, whereinEFor side collection,VFor nodal set.Target limitation in network can be on the side of digraph(i=1,
2,…N) and node (i=1,2,…M) in setting, whereinNFor the number on side in figure,MFor number of network nodes in figure.In order to
Meet to establish in multicast network (digraph) and meets multicast throughput requirementrDisjoint paths simultaneously make multicast transmission time delay
It is minimum with network-encoding operation number.The optimization problem can be modeled as following mathematical model: limit item in formula (1)-(4)
Part minimizes the value of formula (5), wherein in formula (5)cIndicate the number on the side for network code；xIndicate that there is a plurality of input
While intermediate node include output while number, it includesnA part, it is specific as shown in Figure 2.
Condition limitation:
(1)
(2)
(3)
(4)
It minimizes:
(5)
As shown in Fig. 2, nodevIt is the intermediate node (also referred to as potential encoded joint) with a plurality of input side attribute, the node
With 3 output sidesx 1, x 2, x 3, every output side state determined by whether it carries encoded information.Ifx i =1, it says
BrightiItem exports side and carries encoded information, and otherwise this side is without encoded information.
As shown in Fig. 2, nodevIt is the intermediate node (also referred to as potential encoded joint) with a plurality of input side attribute, it should
Node has 3 output sidesx 1, x 2, x 3, every output side state determined by whether it carries encoded information.Ifx i =
1, illustrateiItem exports side and carries encoded information, and otherwise this side is without encoded information.
In addition, in formula (1)R(s, v i ) indicate from source nodesTo destination nodev i Multicast rate, formula (1) is expressed as
Reach network code multicast rater, any destination nodeThe required minimum multicast rate reached, whereini=1, 2
,…, n,nFor purpose number of nodes,DFor purpose node set.Formula (2) is source node to the limitation of destination node propagation delay time, whereinFor tolerable time delay.Formula (3) is the limitation of destination node Delay Variation, and destination node only receives all disjoint paths
Data can be just correctly decoded.So destination nodev i End-to-end time delay it is practical byrTime delay maximum one in disjoint paths
Path determines, is represented by, whereinIt can be determined by formula (6), whereinP j (s, v i ) indicate from source nodesTo destination nodev i ?jDisjoint paths.
(2) multicast routing optimization problem is to algorithm search space reflection
On the basis of above-mentioned model, next need for above-mentioned multi-objective optimization question to be mapped as what quantum genetic algorithm can solve
Problem.
(a) digraph is decomposed and (decomposes the intermediate node with more in-degrees and degree of having more), the figure after being decomposed
(each node is single out-degree in figure), and creation includes from source node under the constraint of formula (2)sTo each destination nodev i
Path arrayP i (i=1,2,…,|D|)。
(b) in the search phase foriThe array of pathsP i (i=1,2,…,|D|) search all includesrSeparate road
The routing of diameter is combined, if the combined number of selection ism i , then willP i Withm i A combined number updates.
(c) chromosome is created by the way of integer coding, the length of integer coding string is identical as destination node number, dye
Colour solid has |D| a gene position, theiThe value range of a gene position is 1-m i , as shown in Figure 3.
(d) design search fitness functionfAs shown in formula (7):
(7)
In formula (7), α indicates the number on mesh coding side,γWithβFor constant,d n For the number of path for being unsatisfactory for constraint formulations (2)
Mesh,d v Indicate maximum delay variation,p(d v, Ω) and indicate penalty function, only when being unsatisfactory for formula (3), the penalty function just comes into force, should
Penalty function definition is as shown in formula (8).
(8)
(3) searching algorithm
According to the integer coding design and expression of above-mentioned model, search space reaches, and search space is with purpose
The number of node increases and in arrayP i InrThe combination of disjoint paths increase and it is non-linear quickly increase, simultaneously using more universe
Row quantum genetic algorithm improves the search efficiency of algorithm, and algorithm main process is as shown in figure 4, whereinQ(t) it is thetFor population,P
(t) the observation state that is,B(t) it is thetFor the optimal solution in population.
In Multicast Routing variation, namely when use standby Multicast Routing progress multicast transmission, corresponding network code section
Changes will occur for point position, network code number of nodes and network code dimension.Therefore, software definition data center light net
The reliable multicast mechanism based on network code also needs a kind of photosphere network code to match with dynamic multicast routing variation in network
Method of adjustment, General layout Plan is as shown in Figure 5.
Network code design scheme is by patent of invention " the multidimensional all-optical network coding staff of logic-based displacement and XOR operation
Method ", application number: CN201510578811.4, publication number: CN105245980A is provided.Specifically: the energy proposed using the patent
It is enough that all-optical network coding is realized by the multi-channel network encoding mechanism of logical operation Rapid Implementation in the optical domain；It is mentioned using the patent
Network code vector self-adjusted block mechanism out, including coding vector dimension adaptively adjusts and distribution method, in conjunction with herein
The standby multicast path of the multicast achievement process record of proposition realizes that the network-encoding operation of different dimensions is realized and supports multicast node
It is dynamically added and is exited multicast group, encoding mechanism and coding vector distribution mechanism are implemented in multicast tree, pass through software definition
Optical network control plane dynamic dispatching coding vector distribution, to meet the needs of group data center optical-fiber network is to reliable multicast.
Claims (2)
1. one kind is compiled based on more universe quantum genetic algorithm dynamic generations based on network in software definition data center optical-fiber network
The method of code Multicast Routing and standby Multicast Routing, it is characterised in that: Multicast Routing uses the distributed quantum based on more universe
Genetic algorithm is calculated from data center's optical network structure and is obtained, and the Multicast Routing for calculating acquisition can determine network code node
And a plurality of multicast Backup route for meeting all-optical network code requirement can be provided simultaneously；It is described based on network code multicast
Routing refers to thering is the section for realizing the photosphere network code function based on all-optical logic displacement and XOR operation in Multicast Routing
Point；Standby Multicast Routing refers to being currently based on all-optical network coding multicast route break in software definition data center optical-fiber network
After, the Multicast Routing alternatively based on all-optical network coding；Above-mentioned all-optical network coding refers in particular in data center's optical-fiber network
The photosphere network coding technique of logic-based displacement and logic XOR operation.
2. a kind of method to match with the all-optical network coding being adapted based on network code standby multicast path with Multicast Routing,
It is characterized by: when standby Multicast Routing is used, according to network code number of nodes, the network of standby Multicast Routing
Coding dimension adjustment network code vector and the coding nodes that network code vector is distributed to standby Multicast Routing；After described
Standby Multicast Routing refers to standby multicast path described in claim 1；The network code refers in particular to data center's optical-fiber network
The photosphere network coding technique of interior logic-based displacement and logic XOR operation；All-optical network code Design scheme described here
By patent of invention " logic-based displacement and XOR operation the coding method of multidimensional all-optical network ", application number:
CN201510578811.4, publication number: CN105245980A is provided.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811131870.7A CN109088826A (en) | 2018-09-27 | 2018-09-27 | A kind of reliable multicast method based on all-optical network coding in software definition data center optical-fiber network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811131870.7A CN109088826A (en) | 2018-09-27 | 2018-09-27 | A kind of reliable multicast method based on all-optical network coding in software definition data center optical-fiber network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109088826A true CN109088826A (en) | 2018-12-25 |
Family
ID=64842873
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811131870.7A Pending CN109088826A (en) | 2018-09-27 | 2018-09-27 | A kind of reliable multicast method based on all-optical network coding in software definition data center optical-fiber network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109088826A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101145930A (en) * | 2007-09-19 | 2008-03-19 | 华为技术有限公司 | Method, system and device for guaranteeing reliable transmission of multicast service |
| CN101834699A (en) * | 2010-05-06 | 2010-09-15 | 北京邮电大学 | Network coding realization method based on logical operation in optical multicast network |
| CN102137009A (en) * | 2011-01-31 | 2011-07-27 | 华为技术有限公司 | Method, system and equipment for processing Dual-layer service in network |
| CN105245980A (en) * | 2015-09-14 | 2016-01-13 | 山东理工大学 | Logical shift and XOR operation-based multidimensional all-optical network encoding method |
| US9621260B2 (en) * | 2013-07-18 | 2017-04-11 | Cisco Technology, Inc. | Proactive optical restoration system |
| CN107612830A (en) * | 2016-07-12 | 2018-01-19 | 南京中兴软件有限责任公司 | Multicast service realizing method, device and system |
-
2018
- 2018-09-27 CN CN201811131870.7A patent/CN109088826A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101145930A (en) * | 2007-09-19 | 2008-03-19 | 华为技术有限公司 | Method, system and device for guaranteeing reliable transmission of multicast service |
| CN101834699A (en) * | 2010-05-06 | 2010-09-15 | 北京邮电大学 | Network coding realization method based on logical operation in optical multicast network |
| CN102137009A (en) * | 2011-01-31 | 2011-07-27 | 华为技术有限公司 | Method, system and equipment for processing Dual-layer service in network |
| US9621260B2 (en) * | 2013-07-18 | 2017-04-11 | Cisco Technology, Inc. | Proactive optical restoration system |
| CN105245980A (en) * | 2015-09-14 | 2016-01-13 | 山东理工大学 | Logical shift and XOR operation-based multidimensional all-optical network encoding method |
| CN107612830A (en) * | 2016-07-12 | 2018-01-19 | 南京中兴软件有限责任公司 | Multicast service realizing method, device and system |
Non-Patent Citations (5)
| Title |
|---|
| HUANLAI XING; LEXI XU; RONG QU; ZHIJIAN QU: "A quantum inspired evolutionary algorithm for dynamic multicast routing with network coding", 《2016 16TH INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES (ISCIT)》 * |
| 刘晓红，曲志坚；曹雁锋；张先伟；冯刚: "基于自适应机制的多宇宙并行量子衍生进化算法", 《计算机应用》 * |
| 曲志坚: "光组播网络中基于逻辑运算的网络编码关键技术研究", 《中国博士学位论文全文数据库 信息科技辑》 * |
| 曲志坚;纪越峰;柏琳;孙咏梅;付佳: "Key module for a novel all-optical network coding scheme", 《CHINESE OPTICS LETTERS》 * |
| 曲志坚；纪越峰；柏琳；王肖玲；邢焕来: "基于网络编码的双路径组播树生成算法", 《电子学报》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108401015A (en) | A kind of data center network method for routing based on deeply study | |
| CN108183823B (en) | Method for multiplexing and configuring multiple resources in data center network | |
| Sun et al. | Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA | |
| CN111885493B (en) | Micro-cloud deployment method based on improved cuckoo search algorithm | |
| CN115242295B (en) | Satellite network SDN multi-controller deployment method and system | |
| CN101616074B (en) | Multicast routing optimization method based on quantum evolution | |
| CN114143264A (en) | Traffic scheduling method based on reinforcement learning in SRv6 network | |
| CN102196325B (en) | Ant-colony-system-based dynamic routing and wavelength assignment method for optical network | |
| CN109889447B (en) | Network transmission method and system based on hybrid ring networking and fountain codes | |
| Gudla et al. | A reliable routing mechanism with energy-efficient node selection for data transmission using a genetic algorithm in wireless sensor network | |
| Randaccio et al. | Group multicast routing problem: A genetic algorithms based approach | |
| CN109088826A (en) | A kind of reliable multicast method based on all-optical network coding in software definition data center optical-fiber network | |
| CN112073983A (en) | Wireless data center network topology optimization method and system based on flow prediction | |
| CN116389347A (en) | Dynamic SDN route optimization algorithm based on reinforcement learning | |
| Srivastava et al. | Implementation of Ant Colony Optimization Algorithm for Load Balancing Routing in MANET Network | |
| Venkatasubramanian | Optimal Cluster head selection-based Hybrid Moth Search Algorithm with Tree Seed algorithm for multipath routing in WSN | |
| CN116828548A (en) | Optimal route scheduling method based on reinforcement learning for power wireless network | |
| CN113938376B (en) | Fault node repairing method in distributed storage system | |
| CN101741749A (en) | Method for optimizing multi-object multicast routing based on immune clone | |
| Jing et al. | An improved GAC routing algorithm based on SDN | |
| Chen et al. | Enabling QoS multipath routing protocol for wireless sensor networks | |
| Saha et al. | Design of hierarchical communication networks under node/link failure constraints | |
| Yan et al. | SRADR: Network status and reputation adaptive QoS dynamic routing for satellite networks | |
| Guo et al. | Improved NSGA-II optimizing coding-link cost trade-offs for multicast routing in WDM networks | |
| CN115226044B (en) | Multicast routing method and system in NFV network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20181225 |