CN114500463B - Method and device for address allocation based on IPv6 coding visualization - Google Patents

Method and device for address allocation based on IPv6 coding visualization Download PDF

Info

Publication number
CN114500463B
CN114500463B CN202011266708.3A CN202011266708A CN114500463B CN 114500463 B CN114500463 B CN 114500463B CN 202011266708 A CN202011266708 A CN 202011266708A CN 114500463 B CN114500463 B CN 114500463B
Authority
CN
China
Prior art keywords
address
ipv6
coding
coding scheme
ipv6 address
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
CN202011266708.3A
Other languages
Chinese (zh)
Other versions
CN114500463A (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.)
Unihub China Information Technology Co Ltd
Original Assignee
Unihub China Information Technology Co Ltd
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 Unihub China Information Technology Co Ltd filed Critical Unihub China Information Technology Co Ltd
Priority to CN202011266708.3A priority Critical patent/CN114500463B/en
Publication of CN114500463A publication Critical patent/CN114500463A/en
Application granted granted Critical
Publication of CN114500463B publication Critical patent/CN114500463B/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/22Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks comprising specially adapted graphical user interfaces [GUI]

Landscapes

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

Abstract

The invention discloses a method and a device for address allocation based on IPv6 coding visualization, wherein the method comprises the following steps: inputting an organization, an original address type and a new address type, and automatically displaying an identification name, a coding name and a 16-system code corresponding to the new address type in a graphical mode according to a predefined coding scheme; manually selecting a specific code, generating an address according to the code, and distributing the address; if the address prefix length and the address number are automatically allocated, the address prefix length and the address number are input; if the allocation is manual, designating an address segment range to be allocated; and automatically distributing address segments from the original address types according to the content in the coding scheme to generate free available IPv6 addresses. The method and the device can flexibly carry out address allocation on the IPv6 address through the coding scheme, and realize visualization, standardization and automation of IPv6 address management.

Description

Method and device for address allocation based on IPv6 coding visualization
Technical Field
The invention relates to the field of IPv6 address allocation, in particular to a method and a device for carrying out address allocation based on IPv6 coding visualization.
Background
The lack of knowledge of the importance of IPv4 address planning in the early stages of internet development leads to the problems of severe route expansion, premature exhaustion of addresses, and inability to effectively manage the addresses. The lack of a hierarchical structure for IPv4 addresses, and the lack of unified planning for address allocation and management, results in network routing inefficiency. In order to avoid the problem of the IPv4 address, the I.S. part performs unified planning on the IPv6 address, so that 128 bits in the IPv6 address have specific meanings. The telecom group, the Unicom group and the mobile group divide the IPv6 address planning on the basis of the planning of the engineering department, and each province needs to be planned on the basis of the group. Therefore, the IPv6 address has 128 bits long, the address space is almost infinite (2≡128), the number of the planned fields is large, and a finer interval allocation specification is needed, so that the IPv6 address is complex in calculation and can not be successfully managed by using the traditional manual management mode.
Disclosure of Invention
In order to solve the problem of IPv6 address allocation, the invention provides a method and a device for carrying out address allocation based on IPv6 coding visualization, which can flexibly carry out address allocation on IPv6 addresses through a coding scheme and realize visualization, standardization and automation of IPv6 address management.
In order to achieve the above purpose, the present invention adopts the following technical scheme:
in an embodiment of the present invention, a method for address allocation based on IPv6 coding visualization is provided, where the method includes:
inputting an organization, an original address type and a new address type, and automatically displaying an identification name, a coding name and a 16-system code corresponding to the new address type in a graphical mode according to a predefined coding scheme;
manually selecting a specific code, generating an address according to the code, and distributing the address;
if the address prefix length and the address number are automatically allocated, the address prefix length and the address number are input; if the allocation is manual, designating an address segment range to be allocated;
and automatically distributing address segments from the original address types according to the content in the coding scheme to generate free available IPv6 addresses.
Further, the coding scheme is a 128-bit binary code that is programmed with the IPv6 address type associated with it, and consists of several identities.
Further, the identifier is a continuous IPv6 address bit, which is defined by the user according to the IPv6 address planning scheme of the letter department and the group, and the identifier and the coding range are defined by the access type, province, county, network type and QOS level.
Further, the coding scheme reserves subnet space.
Further, the logic for generating the free available IPv6 address is as follows:
splicing codes in sequence according to the sequence defined by the identification, wherein each 4 bits of 16-system numbers are divided into a group, and each group is separated by an English colon to generate an IPv6 address;
after the address prefix length is spliced to the IPv6 address, a complete IPv6 address is generated;
checking whether the IPv6 address is an idle unused address and is not present in the IPv6 address class table; if the address does not meet the requirement, continuing to circulate the codes according to the sequence defined by the identification to generate the next IPv6 address until the IPv6 address meeting the condition is generated.
In an embodiment of the present invention, there is also provided an apparatus for address allocation based on IPv6 encoding visualization, including:
the coding scheme graphical display module is used for inputting an organization, an original address type and a new address type, and automatically displaying an identification name, a coding name and a 16-system code corresponding to the new address type in a graphical mode according to a predefined coding scheme;
the manual selection coding module is used for manually selecting a specific code, generating an address according to the code and distributing the address;
the input allocation parameter module is used for inputting the address prefix length and the address number if the automatic allocation is performed; if the allocation is manual, designating an address segment range to be allocated;
and the IPv6 address automatic generation module is used for automatically distributing address segments from the original address types according to the content in the coding scheme to generate idle available IPv6 addresses.
Further, the coding scheme is a 128-bit binary code that is programmed with the IPv6 address type associated with it, and consists of several identities.
Further, the identifier is a continuous IPv6 address bit, which is defined by the user according to the IPv6 address planning scheme of the letter department and the group, and the identifier and the coding range are defined by the access type, province, county, network type and QOS level.
Further, the coding scheme reserves subnet space.
Further, the logic for generating the free available IPv6 address is as follows:
splicing codes in sequence according to the sequence defined by the identification, wherein each 4 bits of 16-system numbers are divided into a group, and each group is separated by an English colon to generate an IPv6 address;
after the address prefix length is spliced to the IPv6 address, a complete IPv6 address is generated;
checking whether the IPv6 address is an idle unused address and is not present in the IPv6 address class table; if the address does not meet the requirement, continuing to circulate the codes according to the sequence defined by the identification to generate the next IPv6 address until the IPv6 address meeting the condition is generated.
In an embodiment of the present invention, a computer device is further provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the aforementioned method for address allocation based on IPv6 encoding visualization when executing the computer program.
In an embodiment of the present invention, a computer-readable storage medium storing a computer program for executing the method for address allocation based on IPv6 encoding visualization is also presented.
The beneficial effects are that:
1. according to the requirements of the industrial information department or telecommunication group, the mobile group and the communication group, the identification is flexibly defined, the coding scheme is generated, and the IPv6 address can be automatically allocated according to the coding scheme; meanwhile, the coding scheme reserves a subnet space, each province can refine the coding scheme on the basis of group definition, so that each province can conveniently conduct finer planning and use on the IPv6 address, and the problems of large IPv6 address field length and large number of planable fields are solved.
2. In the invention, when the address is allocated, the attribute meaning of 128 bits of the IPv6 address is directly graphically displayed, so that a user can visually see the definition of each section of the IPv6 address, the allocation visualization, standardization and automation of the IPv6 address are realized, the continuity of the address allocation is ensured, the human calculation error caused by the complexity of the IPv6 address is avoided, and the address allocation operation is clearly carried out.
Drawings
FIG. 1 is a flow chart of a method for address assignment based on IPv6 encoding visualization according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an IPv6 address assignment page according to one embodiment of the invention;
FIG. 3 is a schematic diagram of an IPv6 identification management page according to one embodiment of the invention;
FIG. 4 is a schematic diagram of an additional markup page according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a modification markup page of an embodiment of the present invention;
FIG. 6 is a schematic diagram of an IPv6 identification code management page according to one embodiment of the invention;
FIG. 7 is a diagram of an additional code page according to an embodiment of the present invention;
FIG. 8 is a schematic diagram of a modified encoded name page according to an embodiment of the invention;
FIG. 9 is a schematic diagram of a county code management page according to an embodiment of the present invention;
FIG. 10 is a schematic illustration of a county reserved space code page according to an embodiment of the present invention;
FIG. 11 is a schematic diagram of a new county code page according to an embodiment of the present invention;
FIG. 12 is a schematic diagram of an IPv6 address coding scheme page according to one embodiment of the invention;
FIG. 13 is a schematic diagram of an encoding scheme editing page according to an embodiment of the present invention;
FIG. 14 is a diagram of a QOS level page of an embodiment of the invention;
FIG. 15 is a schematic diagram of an apparatus for address assignment based on IPv6 coded visualization according to an embodiment of the present invention;
FIG. 16 is a schematic diagram of a computer device according to an embodiment of the invention.
Detailed Description
The principles and spirit of the present invention will be described below with reference to several exemplary embodiments, with the understanding that these embodiments are merely provided to enable those skilled in the art to better understand and practice the invention and are not intended to limit the scope of the invention in any way. Rather, 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.
Those skilled in the art will appreciate that embodiments of the invention may be implemented as a system, apparatus, device, method, or computer program product. Accordingly, the present disclosure may be embodied in the following forms, namely: complete hardware, complete software (including firmware, resident software, micro-code, etc.), or a combination of hardware and software.
In order to ensure the continuity of the national backbone network and company addresses of all provinces, continuous IP address blocks are planned according to the network and the region, and specific IPv6 addresses in the provinces are used, and further refinement and distribution can be carried out according to a coding scheme.
According to the embodiment of the invention, a method and a device for carrying out address allocation based on IPv6 coding visualization are provided, a telecom group carries out standard definition of types on IPv6 addresses, and when address planning is carried out in a system, the types of the addresses must be selected; the coding scheme divides the IPv6 address according to different identifications, and the IPv6 address type is associated with the coding scheme; when the user distributes the IPv6 address, the user can select the type of the IPv6 address, and the system can automatically generate the idle available IPv6 address according to the coding scheme, thereby ensuring the specification and continuity of the IPv6 address.
The principles and spirit of the present invention are explained in detail below with reference to several representative embodiments thereof.
Fig. 1 is a flow chart of a method for address allocation based on IPv6 coding visualization according to an embodiment of the present invention. As shown in fig. 1, the method includes:
1. by inputting the organization, the original address type and the new address type, the identification, the code name and the 16-system code corresponding to the new address type are automatically displayed in a graphical mode according to a pre-defined coding scheme.
2. Manually selecting codes: according to the displayed coding scheme, a specific code is manually selected, and an address is generated according to the code and is allocated.
3. Inputting allocation parameters: if the automatic allocation is performed, the address prefix and the address number need to be input; if manual assignment, the address segment range to be assigned is specified.
4. Clicking the allocation button automatically allocates address segments from the original address type according to the content of the coding scheme.
The coding scheme described above is a 128-bit binary code that is programmed by address type and consists of several identities. The concrete explanation is as follows:
the IPv6 address identifies the attributes of the address access type, the region and the like according to the address management requirement and the address use purpose of the industrial and communication part, distinguishes network, platform and various business addresses, and plans and uses part of business addresses according to counties.
The IPv6 address length is 128 bits, the display is carried out by 16 system numbers, one-bit 16 system number is 4 bits, the identification bit definition is carried out by taking the 16 system number as a reference unit, and the identification bit definition is used for identifying the access type, province, county, network type, QOS grade and the like of the address, so that the continuity of the national backbone network and company addresses in each province is ensured as much as possible, and continuous IP address blocks are planned according to the network and the region.
The implementation method comprises the following steps:
defining an identification: the identifier is a continuous IPv6 address bit, is defined by a user according to the engineering department and the group IPv6 address planning scheme, and defines the identifier and the coding range according to the attribute such as the access type, province, county, network type, QOS level and the like.
Defining a coding scheme: the coding scheme consists of a series of different identifications. And carrying out identification division on a plurality of continuous bits of the IPv6 address, wherein the division is carried out sequentially from the first bit of the IPv6 address. The logo needs to be defined continuously, and the middle cannot be blank.
The telecommunications group has defined the type of IPv6 address, associating the IPv6 address type with the coding scheme.
It should be noted that although the operations of the method of the present invention are described in a particular order in the above embodiments and the accompanying drawings, this does not require or imply that the operations must be performed in the particular order or that all of the illustrated operations be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform.
In order to more clearly explain the above method for address assignment based on IPv6 coding visualization, a specific embodiment will be described below, however, it should be noted that this embodiment is only for better illustrating the present invention and is not meant to limit the present invention unduly.
FIG. 2 is a schematic diagram of an IPv6 address assignment page according to one embodiment of the invention. As shown in fig. 2, the organization name and the original address type are manually selected, and the new address type is displayed in linkage according to the original address type. The IPv6 address type is a tree interface, when address planning is carried out, an address is required to be selected from the original address type, and planning is carried out according to the new address type. After selecting the new address type, the page displays the coding scheme associated with the new address type, and the identifier contained in the coding scheme, the coding range of the identifier and the position of the identifier in the IPv6 address are listed in the display list. If the mark contains the county mark, the coding range of the mark needs to be linked according to the application organization, and all counties associated with the organization are filtered and displayed. And the identification items listed in the display list can be canceled from being checked, and the identification items are not checked when the addresses are allocated.
Address assignment is classified into automatic assignment and manual entry or selection of addresses.
Automatic distribution:
(1) The length of the prefix of the check address is greater than or equal to the sum of the lengths of the marks defined in the coding scheme (the cancelled marks are not in the calculation range) and less than or equal to 128. The input box defaults to the identification length sum. If the verification fails, a prompt is given: the address prefix length of IPv6 does not meet the specification, and should be X or more (shown as the sum of the identification lengths in the actual coding scheme).
(2) The number of addresses, input box defaults to 1. If the number of addresses is filled, it is necessary to be a positive integer of > =1. If the verification fails, a prompt is given: please input a positive integer greater than or equal to 1.
(3) When the 'assign address' button is clicked, the IPv6 address is automatically generated according to the coding scheme.
If the unselected code name exists, a prompt is given: the code name of the selected identification has a null option, please check.
Address auto-generation logic:
the identification codes are taken out, the codes are spliced in sequence according to the sequence defined by the identification, each 4-bit hexadecimal number is a group, and each group is separated by an English colon to generate an IPv6 address. Finally, after the address prefix length is spliced to the IPv6 address, a section of complete IPv6 address is generated. Check if the IPv6 address is a free unused address and is not present in the IPv6 address class table. If the address does not meet the requirement, the cycle identification code is needed to generate the next IPv6 address until the IPv6 address meeting the condition is generated.
Examples: coding (7C-7F, B0-BF) of province identification Guangdong and coding (00, 01) of county identification litchi bay area need to be circulated (circulation order is carried out according to identification definition order), and a plurality of IPv6 addresses are sequentially generated. Every time an IPv6 address is generated, the following operations are needed: IPv6 address: 240E:037C:0000:0000:0000:0000:0000:0000/40, verifies whether the address is a free unused address and cannot have a duplicate, inclusive, or cross relationship with an address in the address list. If the condition is not satisfied, continuing to circularly generate the next address: 240E:037C:0100:0000:0000:0000:0000:0000/40, and continuing checking. The above operation is circulated until the number of addresses meeting the requirement is generated.
Manually enter or select an address:
the user knows a section of IPv6 address, and can input the address into an input box to directly carry out address allocation. Or clicking a 'manual allocation' button, popping up an IPv6 address selection page, and backfilling the selected address into an input box for allocation. Clicking the address adding button to check whether the IPv6 address meets the selected coding scheme, and prompting the user to be wrong if the IPv6 address does not meet the selected coding scheme.
And (3) checking IPv6 address:
(1) Check if the IPv6 address format is correct (address format is 240E:03B1: 0100::/40). If the failure occurs, a prompt is given: the IPv6 address format is incorrect.
(2) The length of the IPv6 address prefix is checked to be greater than or equal to the sum of the selected identification lengths in the coding scheme (the cancelled identification is not in the calculation range) and less than or equal to 128. If the failure occurs, a prompt is given: the address prefix length of IPv6 does not meet the specification, and should be X or more (shown as the sum of the identification lengths in the actual coding scheme).
(3) Check if the address has a duplicate, contain, or cross relationship with an address in the address list. If the failure occurs, a prompt is given: the IPv6 address collides with the address list allocated address.
(4) Checking whether the IP address meets the specification according to the coding scheme:
and according to the identification sequence defined in the coding scheme, judging whether the 16-system codes of the identification bits where the IPv6 addresses are positioned are matched with the codes of the identification defined by the coding scheme or not.
Examples:
IPv6 address 240E:03B 1:0100::40, translate to full encoding: 240E:03B1:0100:0000:0000:0000:0000:0000. Intercepting addresses according to the identification length of the coding scheme:
1-20 bits: 240E:0;
21-24 bits: 3, a step of;
25-32 bits: b1;
33-40 bits: 01;
matching the intercepted address with the identification code of the corresponding position, meeting the specification, and reporting errors if the IPv6 address is correct and fails: the IPv6 address does not conform to the coding scheme.
(5) And conforming to the coding scheme address, and checking whether the IPv6 address is a free unused address. If the failure occurs, a prompt is given: the IPv6 address is not within the free address range.
TABLE 1
The identities are defined based on the telecommunications group IPv6 address planning scheme of table 1 above. The 128 bits of the IPv6 address are flexibly managed through the definition of the identification bit. Other specifications such as communication groups and mobile groups are supported as well. The following pages are each exemplified by a telecommunications group definition.
As shown in FIG. 3, a user may add, delete, and modify a custom identifier and may edit the code definition of the identifier. The identification of unified definition of the worker letter part and the group can not be modified and deleted, and the code definition can be edited. The identification page is added, as shown in fig. 4. The identification page is modified as shown in fig. 5.
The code definition of the universal mark is that the editing button is clicked, the code definition page of the mark is popped up, the page lists all codes, and the codes can be added, modified and deleted. As shown in fig. 6, the encoding is not repeatable. The same name may define multiple encodings. The codes of the same name are combined and displayed. And more than 2 continuous codes are displayed by English horizontal lines-separation, and a plurality of codes are displayed by English commas in separation. Only the names can be modified, 16-system codes define errors, and only the names can be deleted and then added again. The newly added code page, as shown in fig. 7, fills in the 16-ary code to conform to the bit length. One bit 16-ary number=4 bits. 16-ary encoding: allowing the input of a single code, multiple codes, or successive code segments, generally indicated by the numbers 0 to 9 and letters a to F.
Examples: 8bit length;
single code: 00;
a plurality of codes: 00,01,03 the codes are separated by English commas;
consecutive encoding segments: 00-FF, which represents continuous coding segments by English horizontal line-separation;
binary encoding: automatically generating according to the input 16-system code. No input modification is allowed.
The encoded name page is modified as shown in fig. 8.
The county identifier belongs to a special identifier and needs to be maintained and managed separately. Taking Guangdong as an example, the county code management page, as shown in FIG. 9, derives: excel can be derived from the query results in fig. 9. And (3) importing: the one-time importation may be performed as fields in table 2. An example of an import template is shown in Table 2 below:
TABLE 2
Provincial level name Market grade name County, county-level city and district Hexadecimal coding
Guangdong aspect Guangzhou style Liwan area 00,01
Guangdong aspect Guangzhou style Exception area 02,03
Guangdong aspect Guangzhou style Sea ball area 04,05
Guangdong aspect Guangzhou style Tianhe river region 06,07
Guangdong aspect Guangzhou style Bai Yunou 08,09
Guangdong aspect Guangzhou style Yellow body region 0A,0B
Guangdong aspect Guangzhou style Saffron area 0C,0D
Guangdong aspect Guangzhou style Flower area 0E,0F
Guangdong aspect Guangzhou style South sand area 10,11
Guangdong aspect Guangzhou style Urban area 14,15
Guangdong aspect Guangzhou style From the chemical transformation zone 16,17
Guangdong aspect Shaoguan Wu Jiangou 18
Guangdong aspect Shaoguan Jiang Ou 19
Guangdong aspect Shaoguan Qu Jiangou 1A
Guangdong aspect Shaoguan Lechang city 1B
Guangdong aspect Shaoguan Nanxiong city 1C
Guangdong aspect Shaoguan Xingxing county 1D
Guangdong aspect Shaoguan Tumbler Yuan county 1E
Guangdong aspect Shaoguan Chen Hui county 1F
Guangdong aspect Shaoguan Ruyuan Yao Autonomous County 20
Guangdong aspect Shaoguan Xinfeng county 21
In the importing process, if the county code is found to be repeated, an error is prompted, the error code is required to be written back into the Excel file for the user to download and modify, and the importing can be carried out again after the modification.
Inquiring reservation: the county code lists its reserved code without the user's own calculation, as shown in fig. 10.
Newly added county coded pages, as shown in fig. 11, province: basic data, pull-down selection. Ground city: a drop down option may be entered and the default display may be such that all of the city is selected (no provinces selected and not displayed) and if the user enters a city name, the display is filtered by the city name. If the city already exists, the selection can be directly performed. If the city does not exist, the name of the city is directly input. The market needs to be increased when the new market is added. County: a pull-down option may be entered. All counties in the selected city are displayed by default. If the county name is input, the display is filtered by the name. If counties already exist, then direct selection is possible. If the county does not exist, the county name is directly input. The county needs to be added when the new county is added. 16-ary encoding: generally indicated by the numerals 0 to 9 and letters a to F. A 2-bit hexadecimal number must be entered. Coding is not repeatable under the same province. Allowing a single code, multiple codes, or a succession of code segments to be entered.
Examples: single code: 00;
a plurality of codes: 00,01,03 the codes are separated by English commas;
consecutive encoding segments: 00-FF, which represents continuous coding segments by English horizontal line-separation;
binary encoding: automatically generating according to the input hexadecimal code. No input modification is allowed.
IPv6 address types are defined by groups, and a coding scheme is defined as shown in fig. 12. The coding scheme of the group defined address type, which is used as the basic data, cannot be modified and deleted. The address type is newly added subsequently, and the editing button is clicked, so that the coding scheme can be newly added. Clicking on the plus sign may expand the address type tree.
Clicking the edit button opens the coding scheme edit page as shown in fig. 13. Displaying the graph of the coding scheme, and displaying the coding name if the code is selected. If the code is not selected, the identification name is displayed. And clicking a dividing button in the space part of the subnet to display a selection identification area, wherein the selection identification area can be selected, and the identification which appears in the scheme can not be selected by radio selection. Clicking "determine" adds the identity to FIG. 14 and displays the identity sequentially after the existing identities and recalculates the subnet space. Clicking "close" will pack up the area without any action.
The code selection may continue for the divided identifiers. If the requirement identification is not met, an IPv6 identification management button can be clicked, and a new identification is added.
In the coding scheme, the newly divided identifiers can be deleted in the list, and after the deletion, the corresponding identifiers are deleted together by the coding scheme graph, and the subnet space is recalculated.
Based on the same inventive concept, the invention also provides a device for address allocation based on IPv6 coding visualization. The implementation of the device can be referred to as implementation of the above method, and the repetition is not repeated. The term "module" as used below may be a combination of software and/or hardware that implements the intended function. While the means described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
Fig. 15 is a schematic structural diagram of an apparatus for address allocation based on IPv6 encoding visualization according to an embodiment of the present invention. As shown in fig. 15, the apparatus includes:
the coding scheme graphical display module 101 is used for inputting an organization, an original address type and a new address type, and automatically displaying an identification name, a coding name and a 16-system code corresponding to the new address type in a graphical mode according to a predefined coding scheme;
the coding scheme is a 128-bit binary code which is planned according to the IPv6 address type associated with the coding scheme and consists of a plurality of identifications;
the identification is continuous IPv6 address bit, which is defined by a user according to IPv6 address planning schemes of a worker communication part and a group, and the access type, province, county, network type and QOS level define identification and coding range;
the coding scheme reserves a subnet space;
the manual selection coding module 102 is configured to manually select a specific code, generate an address according to the code, and allocate the address;
an input allocation parameter module 103, configured to input an address prefix length and an address number if automatic allocation is performed; if the allocation is manual, designating an address segment range to be allocated;
an IPv6 address automatic generation module 104, configured to automatically allocate an address segment from the original address type according to the content in the coding scheme, and generate an idle available IPv6 address;
the logic for generating the free available IPv6 address is as follows:
splicing codes in sequence according to the sequence defined by the identification, wherein each 4 bits of 16-system numbers are divided into a group, and each group is separated by an English colon to generate an IPv6 address;
after the address prefix length is spliced to the IPv6 address, a complete IPv6 address is generated;
checking whether the IPv6 address is an idle unused address and is not present in the IPv6 address class table; if the address does not meet the requirement, continuing to circulate the codes according to the sequence defined by the identification to generate the next IPv6 address until the IPv6 address meeting the condition is generated.
It should be noted that while several modules of an apparatus for address assignment based on IPv6 coded visualization are mentioned in the above detailed description, this partitioning is merely exemplary and not mandatory. Indeed, the features and functions of two or more modules described above may be embodied in one module in accordance with embodiments of the present invention. Conversely, the features and functions of one module described above may be further divided into a plurality of modules to be embodied.
Based on the foregoing inventive concept, as shown in fig. 16, the present invention further proposes a computer device 200, including a memory 210, a processor 220, and a computer program 230 stored in the memory 210 and executable on the processor 220, where the processor 220 implements the foregoing method for address allocation based on IPv6 encoding visualization when executing the computer program 230.
Based on the foregoing inventive concept, the present invention also proposes a computer-readable storage medium storing a computer program for executing the foregoing method for address allocation based on IPv6 encoding visualization.
According to the method and the device for address allocation based on IPv6 coding visualization, which are provided by the invention, the identification is flexibly defined according to the requirements of the industrial information department or telecommunication group, the mobile group and the communication group, the coding scheme is generated, and the IPv6 address can be automatically allocated according to the coding scheme; meanwhile, the coding scheme reserves a subnet space, each province can refine the coding scheme on the basis of group definition, so that each province can conveniently carry out finer planning and use on the IPv6 address, and the problems of large IPv6 address field length and large number of planable fields are solved; when the addresses are distributed, the attribute meanings of 128 bits of the IPv6 addresses are directly and graphically displayed, so that a user can intuitively see the definition of each section of the IPv6 addresses, the distribution visualization, standardization and automation of the IPv6 addresses are realized, the continuity of the address distribution is ensured, the human calculation errors caused by the complexity of the IPv6 addresses are avoided, and the address distribution operation is clearly carried out.
While the spirit and principles of the present invention have been described with reference to several particular embodiments, it is to be understood that the invention is not limited to the disclosed embodiments nor does it imply that features of the various aspects are not useful in combination, nor are they useful in any combination, such as for convenience of description. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
It should be apparent to those skilled in the art that various modifications or variations can be made in the present invention without requiring any inventive effort by those skilled in the art based on the technical solutions of the present invention.

Claims (12)

1. A method for address allocation based on IPv6 coded visualization, the method comprising:
inputting an organization, an original address type and a new address type, and automatically displaying an identification name, a coding name and a 16-system code corresponding to the new address type in a graphical mode according to a predefined coding scheme;
manually selecting a specific code, generating an address according to the code, and distributing the address;
if the address prefix length and the address number are automatically allocated, the address prefix length and the address number are input; if the allocation is manual, designating an address segment range to be allocated;
and automatically distributing address segments from the original address types according to the content in the coding scheme to generate free available IPv6 addresses.
2. The method for address assignment based on IPv6 coding visualization of claim 1, wherein the coding scheme is a 128-bit binary code that is planned by an IPv6 address type associated therewith and consists of several identities.
3. The method for address allocation based on IPv6 coding visualization according to claim 2, wherein the identifier is a continuous IPv6 address bit, and is defined by the user according to an IPv6 address planning scheme of the letter and group, and the access type, province, county, network type, and QOS class define the identifier and the coding range.
4. The method for address assignment based on IPv6 coding visualization according to claim 1 or 2, wherein the coding scheme reserves a subnet space.
5. The method for address assignment based on IPv6 coded visualization of claim 1, wherein the logic for generating the free available IPv6 address is as follows:
splicing codes in sequence according to the sequence defined by the identification, wherein each 4 bits of 16-system numbers are divided into a group, and each group is separated by an English colon to generate an IPv6 address;
after the address prefix length is spliced to the IPv6 address, a complete IPv6 address is generated;
checking whether the IPv6 address is an idle unused address and is not present in the IPv6 address class table; if the address does not meet the requirement, continuing to circulate the codes according to the sequence defined by the identification to generate the next IPv6 address until the IPv6 address meeting the condition is generated.
6. An apparatus for address assignment based on IPv6 coded visualization, the apparatus comprising:
the coding scheme graphical display module is used for inputting an organization, an original address type and a new address type, and automatically displaying an identification name, a coding name and a 16-system code corresponding to the new address type in a graphical mode according to a predefined coding scheme;
the manual selection coding module is used for manually selecting a specific code, generating an address according to the code and distributing the address;
the input allocation parameter module is used for inputting the address prefix length and the address number if the automatic allocation is performed; if the allocation is manual, designating an address segment range to be allocated;
and the IPv6 address automatic generation module is used for automatically distributing address segments from the original address types according to the content in the coding scheme to generate idle available IPv6 addresses.
7. The apparatus for address assignment based on IPv6 coding visualization of claim 6, wherein the coding scheme is a 128-bit binary code that is programmed with its associated IPv6 address type and consists of several identities.
8. The apparatus for address assignment based on IPv6 coding visualization according to claim 7, wherein the identifier is a continuous IPv6 address bit, and is defined by a user according to an IPv6 address planning scheme of a worker and a group, and the access type, province, county, network type, and QOS class define the identifier and the coding range.
9. The apparatus for address assignment based on IPv6 coding visualization according to claim 6 or 7, wherein the coding scheme reserves a subnet space.
10. The apparatus for address assignment based on IPv6 coded visualization of claim 6, wherein the logic for generating the free available IPv6 address is as follows:
splicing codes in sequence according to the sequence defined by the identification, wherein each 4 bits of 16-system numbers are divided into a group, and each group is separated by an English colon to generate an IPv6 address;
after the address prefix length is spliced to the IPv6 address, a complete IPv6 address is generated;
checking whether the IPv6 address is an idle unused address and is not present in the IPv6 address class table; if the address does not meet the requirement, continuing to circulate the codes according to the sequence defined by the identification to generate the next IPv6 address until the IPv6 address meeting the condition is generated.
11. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of claim 1 or 2 or 3 or 5 when executing the computer program.
12. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program for executing the method of claim 1 or 2 or 3 or 5.
CN202011266708.3A 2020-11-13 2020-11-13 Method and device for address allocation based on IPv6 coding visualization Active CN114500463B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011266708.3A CN114500463B (en) 2020-11-13 2020-11-13 Method and device for address allocation based on IPv6 coding visualization

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011266708.3A CN114500463B (en) 2020-11-13 2020-11-13 Method and device for address allocation based on IPv6 coding visualization

Publications (2)

Publication Number Publication Date
CN114500463A CN114500463A (en) 2022-05-13
CN114500463B true CN114500463B (en) 2023-08-08

Family

ID=81490572

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011266708.3A Active CN114500463B (en) 2020-11-13 2020-11-13 Method and device for address allocation based on IPv6 coding visualization

Country Status (1)

Country Link
CN (1) CN114500463B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115460146B (en) * 2022-08-19 2024-04-23 北京连星科技有限公司 IPv6 address based visual management method, system and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109167847A (en) * 2018-08-09 2019-01-08 中国联合网络通信集团有限公司 A kind of generation method and SMF, communication system of the address IPv6
CN109983752A (en) * 2016-10-05 2019-07-05 亚马逊技术有限公司 Network address with NS grades of information of encoding D
CN110650219A (en) * 2019-09-06 2020-01-03 北京伯光时科技有限公司 IPv6 address allocation method and device, electronic equipment and storage medium

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10248996B2 (en) * 2009-01-28 2019-04-02 Headwater Research Llc Method for operating a wireless end-user device mobile payment agent
US10462203B2 (en) * 2017-06-13 2019-10-29 Wowza Media Systems, LLC Hardware encoder

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109983752A (en) * 2016-10-05 2019-07-05 亚马逊技术有限公司 Network address with NS grades of information of encoding D
CN109167847A (en) * 2018-08-09 2019-01-08 中国联合网络通信集团有限公司 A kind of generation method and SMF, communication system of the address IPv6
CN110650219A (en) * 2019-09-06 2020-01-03 北京伯光时科技有限公司 IPv6 address allocation method and device, electronic equipment and storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
IPv6地址结构、地址分类以及表示方法;WFlySky;《https://blog.csdn.net/W_TF2017/article/details/109268046》;全文 *

Also Published As

Publication number Publication date
CN114500463A (en) 2022-05-13

Similar Documents

Publication Publication Date Title
CN113691651B (en) Top-level planning visualization management method, system and storage medium based on IPv6 network
CN114500463B (en) Method and device for address allocation based on IPv6 coding visualization
CN102279749A (en) Method and equipment for merging codes
CN111221522A (en) Automatic code generation method of front-end and back-end separation architecture for government intensive application development
CN107632827A (en) The generation method and device of the installation kit of application
CN110650219A (en) IPv6 address allocation method and device, electronic equipment and storage medium
CN114979074B (en) Enterprise IPv6 address hierarchical management method, system and storage medium
CN113032633A (en) Method for customizing table by using reference data item
CN106970918B (en) Method and device for generating unique identifier of international address
CN116401407A (en) Node attribute configuration method, device, equipment and storage medium of mind map
CN108256034A (en) Data migration method and equipment
CN104408189A (en) Keyword ranking display method and device
CN104750468A (en) Server side topological data conversion method and device
CN118152393A (en) BIM model management method and device based on WBS, electronic equipment and storage medium
CN113486034A (en) Historical version backtracking method for vector map layer and pattern spot
CN116521921A (en) Configuration and query method of data model in three-dimensional visual scene
CN104267967B (en) The generation method and device of the program code of software
CN109726204B (en) Data management method and device based on user-defined data table
CN116777671A (en) Large-scale energy storage resource management method and system based on automatic topology display generation
CN116304091A (en) Construction and application method, device, equipment and medium of design selection type knowledge graph
CN103984540A (en) Method and device for generating hardware interface running program
CN103530413B (en) Method and device for processing data
CN105224597A (en) A kind of can by the system and method for the foreign key relationship synthetic image in database
CN114118944A (en) Forensic laboratory grading management method, terminal device and storage medium
CN108090185A (en) A kind of customer information duplicate checking method

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