CN112822101B - Communication path generation method and device - Google Patents
Communication path generation method and device Download PDFInfo
- Publication number
- CN112822101B CN112822101B CN201911116359.4A CN201911116359A CN112822101B CN 112822101 B CN112822101 B CN 112822101B CN 201911116359 A CN201911116359 A CN 201911116359A CN 112822101 B CN112822101 B CN 112822101B
- Authority
- CN
- China
- Prior art keywords
- chromosome
- path
- target
- population
- termination condition
- 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
Links
Images
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/22—Alternate routing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Biophysics (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Evolutionary Biology (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- General Engineering & Computer Science (AREA)
- Biomedical Technology (AREA)
- Genetics & Genomics (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- Artificial Intelligence (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Physiology (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present disclosure provides a communication path generation method and apparatus. The communication path generation device selects a corresponding working path and a corresponding protection path for communication service in a communication network; performing chromosome coding using the working path and the protection path to generate an initial population; taking the initial population as a target population, and judging whether the target population meets a preset termination condition; if the target population does not meet the preset termination condition, processing the target population by using at least one of selection operation, crossover operation or mutation operation to generate a new generation population, and then repeatedly executing the step of judging whether the target population meets the preset termination condition by using the new generation population as the target population; and if the target group meets the preset termination condition, extracting the codes of the target working path and the target protection path of the corresponding communication service from the chromosomes in the target group. The method and the device can generate the service path and the protection path which form a ring, and effectively reduce the comprehensive risk of the communication network.
Description
Technical Field
The present disclosure relates to the field of communications, and in particular, to a method and an apparatus for generating a communication path.
Background
At present, the optimal path meeting the requirements can be planned by applying the algorithm thought of 'selection, intersection and variation' of a genetic algorithm to the communication field.
Disclosure of Invention
The inventor finds that, through research, communication service often presents the characteristic of dual channels, that is, the communication service generally includes a service path and a protection path, and this point is not considered in the process of planning the path by using a genetic algorithm, so that the service path and the protection path are crossed and overlapped, and the comprehensive risk of the communication network is improved.
Accordingly, the present disclosure provides a scheme capable of generating looped traffic paths and protection paths.
According to a first aspect of an embodiment of the present disclosure, there is provided a communication path generation method including: selecting a corresponding working path and a corresponding protection path for communication service in a communication network; performing chromosome coding using the working path and the protection path to generate an initial population; taking the initial population as a target population, and judging whether the target population meets a preset termination condition; if the target population does not meet the preset termination condition, processing the target population by using at least one of selection operation, crossover operation or mutation operation to generate a new generation population, and then repeatedly executing the step of judging whether the target population meets the preset termination condition by using the new generation population as the target population; and if the target group meets the preset termination condition, extracting the codes of the target working path and the target protection path of the corresponding communication service from the chromosome in the target group.
In some embodiments, in the initial population, each chromosome pair comprises a plurality of chromosome segments, each chromosome segment corresponding to one communication service, each chromosome segment comprising a first chromosome including a code corresponding to the working path and a second chromosome including a code corresponding to the protection path.
In some embodiments, the interleaving operation comprises: and performing crossover operation on the t-th chromosome in the first chromosome pair and the t-th chromosome in the second chromosome pair, wherein t is 1 or 2.
In some embodiments, the target working path and the target protection path form a looped path.
According to a second aspect of the embodiments of the present disclosure, there is provided a communication path generation apparatus including: a path selection module configured to select a corresponding working path and protection path for communication traffic in a communication network; an initial population setting module configured to perform chromosome coding using the working path and the protection path to generate an initial population; the evaluation module is configured to take the initial group as a target group and judge whether the target group meets a preset termination condition; the updating module is configured to process the target group by utilizing at least one of selection operation, crossover operation or mutation operation to generate a new generation group if the target group does not meet the preset termination condition, and then repeatedly execute the operation of judging whether the target group meets the preset termination condition or not by taking the new generation group as the target group; and the path determining module is configured to extract the codes of the target working paths and the codes of the target protection paths of the corresponding communication services from the chromosomes in the target group if the target group meets the preset termination condition.
In some embodiments, in the initial population, each chromosome pair comprises a plurality of chromosome segments, each chromosome segment corresponding to one communication service, each chromosome segment comprising a first chromosome including a code corresponding to the working path and a second chromosome including a code corresponding to the protection path.
In some embodiments, the interleaving operation comprises: and performing crossover operation on the t-th chromosome in the first chromosome pair and the t-th chromosome in the second chromosome pair, wherein t is 1 or 2.
In some embodiments, the target working path and the target protection path form a looped path.
According to a third aspect of the embodiments of the present disclosure, there is provided a communication path generation apparatus including: a memory configured to store instructions; a processor coupled to the memory, the processor configured to perform a method implementing any of the embodiments described above based on instructions stored by the memory.
According to a fourth aspect of the embodiments of the present disclosure, a computer-readable storage medium is provided, in which computer instructions are stored, and when executed by a processor, the computer-readable storage medium implements the method according to any of the embodiments described above.
Other features of the present disclosure and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.
The present disclosure may be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings, in which:
fig. 1 is a flow diagram of a communication path generation method according to one embodiment of the present disclosure;
FIG. 2 is a schematic view of a looped path according to one embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of a communication path generation apparatus according to one embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of a communication path generation apparatus according to another embodiment of the present disclosure.
It should be understood that the dimensions of the various parts shown in the figures are not drawn to scale. Further, the same or similar reference numerals denote the same or similar components.
Detailed Description
Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. The description of the exemplary embodiments is merely illustrative and is in no way intended to limit the disclosure, its application, or uses. The present disclosure may be embodied in many different forms and is not limited to the embodiments described herein. These embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art. It should be noted that: the relative arrangement of parts and steps, the composition of materials and values set forth in these embodiments are to be construed as illustrative only and not as limiting unless otherwise specifically stated.
The use of "including" or "comprising" and the like in this disclosure is intended to mean that the elements preceding the word encompass the elements listed after the word and does not exclude the possibility that other elements may also be encompassed.
All terms (including technical or scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs unless specifically defined otherwise. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
Fig. 1 is a flowchart illustrating a communication path generation method according to an embodiment of the present disclosure. In some embodiments, the following communication path generation method steps are performed by a communication path generation apparatus.
In step 101, a corresponding working path and protection path are selected for communication traffic in a communication network.
At step 102, chromosome coding is performed using the working path and the protection path to generate an initial population.
In some embodiments, in the initial population, each chromosome pair comprises a plurality of chromosome segments, each chromosome segment corresponding to one communication service, each chromosome segment comprising a first chromosome including a code corresponding to the working path and a second chromosome including a code corresponding to the protection path.
In step 103, the initial population is used as a target population, and whether the target population meets a preset termination condition is judged.
If the target group does not meet the preset termination condition, executing step 104; if the target group meets the predetermined termination condition, go to step 105.
In step 104, the target population is processed by at least one of a selection operation, a crossover operation or a mutation operation to generate a new generation population, and then the step 103 is returned to, and the step of judging whether the target population meets the preset termination condition is repeatedly executed by taking the new generation population as the target population.
In some embodiments, the tth chromosome of the first chromosome pair is interleaved with the tth chromosome of the second chromosome pair, where t is 1 or 2.
For example, two chromosome pairs are randomly selected, and the 1 st chromosome of the first chromosome pair is interleaved with the 1 st chromosome of the second chromosome pair.
In step 105, the codes of the target working path and the target protection path of the corresponding communication service are extracted from the chromosome in the target group.
For example, for a certain communication service, a path from point C to point E needs to be established. And a plurality of paths are arranged between the point C and the point E, and a target working path and a target protection path can be selected from the plurality of reachable paths through the processing, wherein the target working path and the target protection path form a ring path.
As shown in FIG. 2, the path C-F-G-E can be selected as the target working path, and the path C-D-E can be selected as the target protection path. Paths C-F-G-E and paths C-D-E form a circular path. Of course, the path C-D-E can also be used as a target working path and the path C-F-G-E can also be used as a target protection path.
In the communication path generation method provided by the above-described embodiment of the present disclosure, the working path and the protection path are encoded separately to be placed on different chromosomes of the same chromosome pair when the initial population is generated. Therefore, the generated target working path and the target protection path can be ensured to form a ring path, and the comprehensive risk of the communication network is effectively reduced.
It should be noted that the present disclosure is based on genetic algorithm, and the path selection is realized by performing corresponding adjustment on the initial population. Since genetic algorithms are known per se to those skilled in the art, they will not be described here.
Fig. 3 is a schematic structural diagram of a communication path generation apparatus according to one embodiment of the present disclosure. As shown in fig. 3, the communication path generating apparatus includes a path selecting module 31, an initial group setting module 32, an evaluating module 33, an updating module 34, and a path determining module 35.
The path selection module 31 is configured to select respective working paths and protection paths for communication traffic in the communication network.
The initial population setting module 32 is configured to perform chromosomal encoding using the working path and the protection path to generate an initial population.
In some embodiments, in the initial population, each chromosome pair comprises a plurality of chromosome segments, each chromosome segment corresponding to one communication service, each chromosome segment comprising a first chromosome including an encoding corresponding to the working path and a second chromosome including an encoding corresponding to the protection path.
The evaluation module 33 is configured to determine whether the initial population is a target population and whether the target population satisfies a preset termination condition.
The updating module 34 is configured to, if the target group does not meet the preset termination condition, process the target group by using at least one of a selecting operation, a crossover operation or a mutation operation to generate a new generation group, and then repeatedly perform an operation of determining whether the target group meets the preset termination condition with the new generation group as the target group.
In some embodiments, the tth chromosome of the first chromosome pair is interleaved with the tth chromosome of the second chromosome pair, where t is 1 or 2.
For example, two chromosome pairs are randomly selected, and the 1 st chromosome in the first chromosome pair is interleaved with the 1 st chromosome in the second chromosome pair.
The path determining module 35 is configured to extract the codes of the target working path and the target protection path of the corresponding communication service from the chromosomes in the target group if the target group meets the preset termination condition.
For example, for a certain communication service, a path from point C to point E needs to be established. And a plurality of paths are arranged between the point C and the point E, and a target working path and a target protection path can be selected from the plurality of reachable paths through the processing, wherein the target working path and the target protection path form a ring path.
In the communication path generation apparatus provided in the above-described embodiment of the present disclosure, the working path and the protection path are encoded to be placed on different chromosomes of the same chromosome pair when the initial population is generated. Therefore, the generated target working path and the target protection path can be ensured to form a ring path, and the comprehensive risk of the communication network is effectively reduced.
Fig. 4 is a schematic structural diagram of a communication path generation apparatus according to another embodiment of the present disclosure. As shown in fig. 4, the apparatus includes a memory 41 and a processor 42.
The memory 41 is used to store instructions. The processor 42 is coupled to the memory 41. The processor 42 is configured to perform a method as described in relation to any of the embodiments of fig. 1, based on the instructions stored in the memory.
As shown in fig. 4, the apparatus further includes a communication interface 43 for information interaction with other devices. Meanwhile, the device also comprises a bus 44, and the processor 42, the communication interface 43 and the memory 41 are communicated with each other through the bus 44.
The Memory 41 may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM). Such as at least one disk storage. The memory 41 may also be a memory array. The storage 41 may also be partitioned, and the blocks may be combined into virtual volumes according to certain rules.
Further, the processor 42 may be a central processing unit, or may be an ASIC (Application Specific Integrated Circuit), or one or more Integrated circuits configured to implement embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium. The computer-readable storage medium stores computer instructions, and the instructions, when executed by the processor, implement the method according to any one of the embodiments in fig. 1.
In some embodiments, the functional modules may be implemented as a general purpose Processor, a Programmable Logic Controller (PLC), a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable Logic device, discrete Gate or transistor Logic, discrete hardware components, or any suitable combination thereof for performing the functions described in the present disclosure.
So far, embodiments of the present disclosure have been described in detail. Some details that are well known in the art have not been described in order to avoid obscuring the concepts of the present disclosure. It will be fully apparent to those skilled in the art from the foregoing description how to practice the presently disclosed embodiments.
Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present disclosure. It will be understood by those skilled in the art that various changes may be made in the above embodiments or equivalents may be substituted for elements thereof without departing from the scope and spirit of the present disclosure. The scope of the present disclosure is defined by the appended claims.
Claims (6)
1. A communication path generation method comprising:
selecting a corresponding working path and a corresponding protection path aiming at communication service in a communication network, wherein a target working path and a target protection path form a ring path;
performing chromosome coding using the working path and the protection path to generate an initial population;
taking the initial population as a target population, and judging whether the target population meets a preset termination condition;
if the target group does not meet the preset termination condition, processing the target group by at least one of selection operation, crossover operation or variation operation to generate a new generation group, and then repeatedly executing the step of judging whether the target group meets the preset termination condition by taking the new generation group as the target group;
if the target group meets the preset termination condition, extracting the codes of the target working path and the target protection path of the corresponding communication service from the chromosomes in the target group;
in the initial population, each chromosome pair includes a plurality of chromosome segments, each chromosome segment corresponding to one communication service, each chromosome segment including a first chromosome including a code corresponding to a working path and a second chromosome including a code corresponding to a protection path.
2. The method of claim 1, wherein the interleaving operation comprises:
and (3) performing cross operation on the t chromosome in the ith chromosome section in the first chromosome pair and the t chromosome in the ith chromosome section in the second chromosome pair, wherein t is 1 or 2, i is more than or equal to 1 and less than or equal to N, and N is the total number of chromosome sections.
3. A communication path generation apparatus comprising:
a path selection module configured to select a corresponding working path and protection path for a communication service in a communication network, wherein a target working path and a target protection path constitute a ring path;
an initial population setting module configured to perform chromosome coding using the working path and the protection path to generate an initial population, wherein in the initial population, each chromosome pair comprises a plurality of chromosome segments, each chromosome segment corresponding to one communication service, each chromosome segment comprising a first chromosome including a code corresponding to the working path and a second chromosome including a code corresponding to the protection path;
the evaluation module is configured to take the initial group as a target group and judge whether the target group meets a preset termination condition;
the updating module is configured to process the target group by utilizing at least one of selection operation, crossover operation or mutation operation if the target group does not meet the preset termination condition so as to generate a new generation group, and then repeatedly execute the operation of judging whether the target group meets the preset termination condition or not by taking the new generation group as the target group;
and the path determining module is configured to extract the codes of the target working path and the target protection path of the corresponding communication service from the chromosome in the target group if the target group meets the preset termination condition.
4. The apparatus of claim 3, wherein the interleaving operation comprises:
and (3) performing cross operation on the t-th chromosome in the ith chromosome section in the first chromosome pair and the t-th chromosome in the ith chromosome section in the second chromosome pair, wherein t is 1 or 2, i is more than or equal to 1 and less than or equal to N, and N is the total number of the chromosome sections.
5. A communication path generation apparatus comprising:
a memory configured to store instructions;
a processor coupled to the memory, the processor configured to perform implementing the method of any of claims 1-2 based on instructions stored by the memory.
6. A computer-readable storage medium, wherein the computer-readable storage medium stores computer instructions which, when executed by a processor, implement the method of any one of claims 1-2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911116359.4A CN112822101B (en) | 2019-11-15 | 2019-11-15 | Communication path generation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911116359.4A CN112822101B (en) | 2019-11-15 | 2019-11-15 | Communication path generation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112822101A CN112822101A (en) | 2021-05-18 |
| CN112822101B true CN112822101B (en) | 2022-11-18 |
Family
ID=75851394
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911116359.4A Active CN112822101B (en) | 2019-11-15 | 2019-11-15 | Communication path generation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112822101B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106656598A (en) * | 2016-12-22 | 2017-05-10 | 云南电网有限责任公司 | Method and system for configuring alternative route of key service of electric power communication network |
| CN108494678A (en) * | 2018-03-16 | 2018-09-04 | 北京智芯微电子科技有限公司 | Alternate routing configuration method based on genetic algorithm and system |
| CN108833271A (en) * | 2018-05-28 | 2018-11-16 | 全球能源互联网研究院有限公司 | A kind of power grid wide-area control service communication routing resource and server |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3937896B2 (en) * | 2002-04-10 | 2007-06-27 | 日本電気株式会社 | WDM network design apparatus, WDM network design method used therefor, and program thereof |
-
2019
- 2019-11-15 CN CN201911116359.4A patent/CN112822101B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106656598A (en) * | 2016-12-22 | 2017-05-10 | 云南电网有限责任公司 | Method and system for configuring alternative route of key service of electric power communication network |
| CN108494678A (en) * | 2018-03-16 | 2018-09-04 | 北京智芯微电子科技有限公司 | Alternate routing configuration method based on genetic algorithm and system |
| CN108833271A (en) * | 2018-05-28 | 2018-11-16 | 全球能源互联网研究院有限公司 | A kind of power grid wide-area control service communication routing resource and server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112822101A (en) | 2021-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11509418B2 (en) | Polar code encoding method and device | |
| KR102519076B1 (en) | Apparatus and method for constructing polar code | |
| EP2849377A1 (en) | Encoding method and apparatus | |
| US20200106462A1 (en) | Decoding method and decoder | |
| CN106326987A (en) | Multi-objective optimization method and multi-objective optimization device | |
| Mahdavi et al. | Transmission expansion planning considering network adequacy and investment cost limitation using genetic algorithm | |
| CN108111252B (en) | Sequence generation method, data decoding method and device | |
| CN112822101B (en) | Communication path generation method and device | |
| CN114070655B (en) | Network flow detection rule generation method and device, electronic equipment and storage medium | |
| Shayeghi et al. | DCGA based-transmission network expansion planning considering network adequacy | |
| Shayeghi et al. | Studying the effect of losses coefficient on transmission expansion planning using decimal codification based GA | |
| CN110932270A (en) | Power distribution network fault recovery method and device comprising flexible switch | |
| US11316534B2 (en) | Encoding method and device, decoding method and device, and storage medium | |
| Zhao et al. | Modified genetic algorithm in state space pruning for power system reliability evaluation and its parameter determination | |
| CN109857740B (en) | Character string storage method, matching method, electronic device and readable storage medium | |
| CN108243113B (en) | Random load balancing method and device | |
| CN108390677A (en) | A kind of coding and decoding method of polarization code optimization | |
| Shayeghi et al. | Optimization of transmission lines loading in TNEP using decimal codification based GA | |
| CN113473460A (en) | Wireless physical layer key negotiation method based on error correcting code judgment | |
| US10263638B2 (en) | Lossless compression method for graph traversal | |
| Hristov et al. | Use of web based calculator of genetic algorithms for optimal coding the states of finite state machines | |
| CN116345544B (en) | Genetic algorithm-based power system safety and stability control strategy generation method, device and system and storage medium | |
| CN115250172A (en) | Side channel protection method and system under dynamic frequency switching | |
| CN110504976B (en) | Polar code decoding method and device | |
| CN102594370A (en) | High-efficient low-delay parallel Chien search method and device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |