CN100593316C - Key word and priority based hierarchical IPv6 network address assignment method - Google Patents
Key word and priority based hierarchical IPv6 network address assignment method Download PDFInfo
- Publication number
- CN100593316C CN100593316C CN200610171650A CN200610171650A CN100593316C CN 100593316 C CN100593316 C CN 100593316C CN 200610171650 A CN200610171650 A CN 200610171650A CN 200610171650 A CN200610171650 A CN 200610171650A CN 100593316 C CN100593316 C CN 100593316C
- Authority
- CN
- China
- Prior art keywords
- address space
- address
- keyword
- space
- sequence number
- 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
Abstract
The invention discloses a method for distributing hierarchy IPv6 network addresses based on keywords and priority, which comprises the following steps: step 1) an address space is initialized according to setting by the user and serial numbers are distributed for the address space according to keyword hierarchy; step 2) Keys are used for presenting an inputted keyword string, SpaceCur is used forpresenting the current address space, deep is used for representing the current position in the keyword string, KeyNum is used for representing the length of the keyword string before the address space, and determine whether the KeyNum is 1; if the KeyNum is 1, step 4) is carried out; if the KeyNum is not 1, the next step is carried out; step 3) the address space of keyword distribution is taken as a base; step 4) the address space of priority distribution is taken as a base; step 5) when a conflict occurs in the address space, conflict treatment is carried out. The invention fully guaranteesthe reasonableness in distributing the address space and improves IPv6 address aggregation.
Description
Technical field
The present invention relates to a kind of network address assignment method, particularly a kind of level IPv6 network address assignment method based on keyword and priority.
Background technology
Along with Internet fast development, the limited address space of IPv4 definition is with depleted, and the deficiency of address space will influence further developing of the Internet.In order to address this problem, the IPv6 procotol has been proposed.Be different from the IPv4 procotol, the address size of IPv6 procotol has 128, for the user provides huge address space.The address structure of IPv6 and address assignment adopt strict hierarchical structure, so that carry out the address polymerization, thus reduce the scale of routing table in the router.IETF (the Internet engineering duty group) has made relevant regulations to IPv6 agreement and address style and distribution thereof, and at RFC3513, RFC3587 and RFC3177 have the description of pair relevant regulations.
The RFC3513 regulation, in IANA (Internet the is acted on behalf of member management office) addresses distributed of having the right space, first three bit is (with Binary Zero 01 beginning) fixed, 29 bit address space are distributed to each LIR (district internet registry mechanism), and LIR can distribute to customer rs site with 32 bit address space of back.According to above principle, it is 2001:da8: that Cernet2 (Chinese education net of new generation) has been assigned to prefix :/32 IPv6 address space.
The RFC3177 suggestion is when distributing the subnet address, and prefix length is generally 48 or 64, may be thought of as the 48 bit address prefixes that it distributes several successive for very huge subnet, and promptly prefix is 47,46 ...Therefore, if the customer rs site prefix is 48 bits, its subnet that just has 16 bits is divided the space, even the customer rs site prefix is 64, it also can be broken back 64 bit address sections and carry out the planning and the distribution of subnet.Especially, the distribution of subnet address needs must satisfy to greatest extent the principle of IPv6 address polymerization.
Therefore for LIR that has distributed 32 bit address prefixes or big ISP, need in its IPv6 address space the subnet address of 2^16 to 2^64 is planned and distributed, even the problem that in prefix is 64 subnet, also has address field planning and distribute.Under the prerequisite of present stage address space abundance, the IPv6 network address assignment method mainly adopts artificial experimental method, this can cause address space under the situation of dynamic growth, planning to address space but rests on the starting stage, the feasible actual change that the planning of address space is lagged behind address space.
General distribution method to the IPv6 network address is asked for an interview list of references 1: " A Growth-Based AddressAllocation Scheme for IPv6 " comprised the introduction to IPv6 address space dichotomy in the document.
Summary of the invention
Purpose of the present invention overcomes the defective that existing IPv6 network address assignment method can't effectively distribute the IPv6 address, thereby proposes the distribution method that the address degree of polymerization of IPv6 network is distributed and improved significantly in a kind of reasonably standard IPv6 network address.
To achieve these goals, the invention provides a kind of level IPv6 network address assignment method, may further comprise the steps based on keyword and priority:
Step 1), according to user's setting initialization address space, be address space level Allotment Serial Number according to keywords;
Step 2), represent the keyword string imported with Keys, represent the space, current address with SpaceCur, represent current keyword string of living in position with deep, the length of representing keyword string behind the space, current address with KeyNum, judge that KeyNum is not 1, if 1, execution in step 4), if be not 1, carry out next step;
Step 3), based on the keyword assignment address space;
Step 4), based on the priority assignment address space;
Step 5), when address space clashes, processing conflicts.
In the technique scheme, described step 1) specifically may further comprise the steps:
Step 1-1), the user sets address space prefix, lowest address unit's prefix, maximum key length, four values of corresponding keyword sequence number quantity;
Step 1-2), give the all-ones subnet address number according to IPv6 address prefix and lowest address unit's prefix;
Step 1-3), cut apart whole address space equably, and give corresponding sequence number according to keyword address space quantity.
In described step 1), finish the initialization operation of address space after, also can make amendment to the keyword level, comprise from user input obtaining designated key word string (then equaling whole address space) and related amendments attribute for sky; Judge then and distributed the address whether after revising, not isolated continuously, if return user's operation failure, otherwise revise the relative address block message.
In the technique scheme, described step 3) specifically may further comprise the steps:
Step 3-1), judge whether deep keyword has distributed corresponding sequence number in the SpaceCur address space; If then carry out next step; Otherwise execution in step 3-3);
Step 3-2), the value of deep is added one, after SpaceCur adds the deep keyword, execution in step 3-8);
Step 3-3), judge whether the sequence number in the SpaceCur address space is used up,, execution in step 3-5 then) if use up; Then do not carry out next step if use up;
Step 3-4), according to keywords address space selection principle begins place's distribution at the address space of selected sequence number, the address assignment end;
Step 3-5), in the SpaceCur address space, search the corresponding sequence number of the keyword address space that can distribute maximum space);
Step 3-6), in selected sequence number, judge whether the maximum allocated space can meet the requirement of sequence number lowest spatial; If satisfy, then carry out next step; If do not satisfy, then presentation address space conflict, execution in step 5);
Step 3-7), in selected address space, search and do not use the multiple that is numbered 2 n power in the address, the n soprano begins to distribute new address space from it, address assignment finishes.
Step 3-8), the KeyNum of SpaceCur is 1 execution in step 4); Otherwise execution in step 3-1).
At described step 3-4) in, described keyword address space selection principle comprises:
(a), in corresponding keyword address space, sequence number is 0 to use at first;
(b), sequence number is the multiple of 2 n power, the big more first more use of n;
(c), n identical then sequence number less and service time of having distributed address space relatively, short more first more use service time.
In the technique scheme, in described step 4), specifically may further comprise the steps:
Step 4-1), in the SpaceCur address space, judge whether Keys exists; If exist, then carry out next step; Otherwise execution in step 4-4);
Step 4-2), judge whether address space is used up, if use up, then execution in step 5); Otherwise carry out next step;
Step 4-3), the Keys correspondence with the address after distribute new address space, address assignment finishes;
Step 4-4), according to address space priority, in SpaceCur, search the minimum address space of address space priority, if priority is identical, according to the user preference is set and selects;
Step 4-5), judge whether address space is used up, if used up then execution in step 5), otherwise carry out next step;
Step 4-6), in selected address space, be numbered the multiple of 2 n power, n soprano place begins to distribute new address space, end address assigning process.
At described step 4-4) in, described address space priority computing formula is:
Address space priority=Prior+f (MaxGlobal, MaxLocal)+p (NumUsed);
Wherein, Prior is the priority of user's setting; MaxGlobal is the maximum new address space that can be assigned in the designated key word space; MaxLocal is the new address space that can be assigned in the particular address piece; NumUsed specifies in the address space addresses distributed amount of space; (MaxGlobal MaxLocal) is function about MaxGlobal and MaxLocal to f, and its value is directly proportional with MaxGlobal, is inversely proportional to MaxLocal; P (NumUsed) is the function about NumUsed, and its value is directly proportional with NumUsed.
In the technique scheme, in described step 5), specifically may further comprise the steps:
Step 5-1), judge behind the SpaceCur address space, whether to exist adjacent sequence number unallocated, and continuation address space size is more than or equal to the situation of the existing size of SpaceCur; Then carry out next step if exist, otherwise carry out 5-4);
Step 5-2), SpaceCur expands one times of address space;
Step 5-3), add that before deep keyword " ex ", SpaceCur are global address space, deep is 1, re-executes step 2);
Step 5-4), inform that the user can't carry out address space and distribute, select whether to continue automatic assigning process by the user, if then carry out next step, otherwise the end address assigning process;
Step 5-5), keyword Keys be re-set as " ex " add Keys, SpaceCur is a global address space, deep is 1, re-executes step 2 then).
At described step 5-2) in, the specific implementation step that described SpaceCur is expanded one times of address space comprises:
Step 5-2-1), obtain designated key word string and sequence number tabulation from user's input;
Step 5-2-2), judge to merge address space and whether meet the merging requirement, if do not meet, then return user's operation failure, if meet then carry out next step;
Step 5-2-3), associated sequence numbers is labeled as distributes, and represent the association attributes of its merging;
Step 5-2-4), to merge the corresponding key length of address space be KeyNum-1, then merge and finish; Otherwise, remaining space cut apart and increased the sequence number size according to smallest sequence number address space dividing method.
The invention has the advantages that:
1, method of the present invention is corresponding with keyword, allocate big address space in advance according to user's setting, and stipulated keyword address space selection principle, avoid the first comer being distributed excessive address space and making full use of first Allotment Serial Number that bigger address this actual rule of volume grows demand is arranged in the incipient stage, having guaranteed that corresponding keyword sequence number does not use up the growth of following address space under the situation and guarantees is assigned to maximum available address space under the situation that sequence number exhausts, fully guarantee the reasonability that address space distributes, improved the polymerization of IPv6 address.
2, method of the present invention is under existence conforms to the situation of keyword, and batch operation is finished in the corresponding big address space of keyword; The coupling factor that can be according to actual needs need consider when distributing address space takes into account, such as geography information, routing iinformation or the like.
3, method of the present invention is used up under the situation in the corresponding sequence number of keyword space, obtains new address space distributing of maximum address space the address block from distributing; It is to grab not high address space of utilance in essence that plunder can distribute the address block of distribution in maximum address space, thereby has guaranteed the reasonability that address space distributes, and has improved the polymerization of IPv6 address.
4 the present invention with the priority of existing address space as distributing foundation, it is considered and has comprised artificial experience judgement composition, the address space that can increase and its following growth trend, can be so that the corresponding address space has corresponding dynamic priority according to current system assignment situation, guarantee too much or address assignment situation improperly, thereby further guaranteed the reasonability that address space distributes, improved the polymerization of IPv6 address.
Description of drawings
Fig. 1 is the schematic diagram of level IPv6 network address assignment method when doing the sequence number initialization operation based on keyword and priority of the present invention;
Fig. 2 is the schematic diagram after after the address space initialization keyword level being made an amendment;
Fig. 3 is of the present invention based on the initialized schematic diagram of numbering in the level IPv6 network address assignment method of keyword and priority;
Fig. 4 is the schematic diagram of keyword sequence number selecting sequence;
Fig. 5 is the schematic diagram of address space expansion;
Fig. 6 utilizes the schematic diagram that according to keywords distributes based on the level IPv6 network address assignment method of keyword and priority of the present invention among the embodiment;
Fig. 7 utilizes the schematic diagram that according to priority distributes based on the level IPv6 network address assignment method of keyword and priority of the present invention among the embodiment;
The schematic diagram of Fig. 8 for realizing that in one embodiment address space merges;
Fig. 9 is the flow chart of the inventive method.
Embodiment
The present invention is further illustrated below in conjunction with the drawings and specific embodiments.
In conjunction with the embodiments, before method of the present invention described, at first several notions involved among the present invention are described.
Address number: give lowest address unit in the address space sequence number (if the address space prefix is 32, the lowest address prefix of management is 48, so the numbering of lowest address unit will be successively from 0 to 2^16-1), hereinafter referred to as numbering.
Key length: be used to represent the length of keyword string behind the keyword, below replace with KeyNum; For example " Beijing, Haidian, Zhong Guan-cun ", the key length in " Beijing " is 2, and the key length in " Haidian " is 1, and the key length of " Zhong Guan-cun " is 0; It may be noted that especially may be different with the key length of layer keyword correspondence.
The keyword correspondence is space, location sequence number significantly: in the address space range of " appointment ", address space is evenly cut apart the numbering that the back is given, hereinafter referred to as sequence number; As shown in Figure 1, wherein first keyword corresponding sequence number is 0-3, and second keyword corresponding sequence number is 0-7; It may be noted that especially different keyword corresponding sequence number quantity may be inequality.
Keyword address space selection principle:
(1), in corresponding keyword address space, sequence number is 0 to use at first;
(2), sequence number is the multiple of 2 n power, the big more first more use of n;
(3), n is identical, relatively less than and service time in the space of addresses distributed of the most approaching sequence number therewith, the service time of this address space is short more, the then first more use of the keyword address space of current selection.With Fig. 4 is example, and above-mentioned three selection principles are described.In Fig. 4, the sequence number of assignable address space is 0-15, (1) on principle, and in first time during the request address space, selecting sequence number is 0 address space; In second time during the request address space, because 8 be 2 cube, (2) on principle, Allotment Serial Number is 8 address space; When request address space for the third time, sequence number be 4 and 12 address space for may the addresses distributed space (all being the multiple of 2 quadratic power), (3) on principle, selecting sequence number for use is 12 address space; Then when the 4th request address space, selecting sequence number for use is 4 address space; When the 5th request address space, can select sequence number is 2,6,10,14 address space (all being the multiple of 2 first power), and based on principle (3), selecting sequence number is 6 address space.Similar with above-mentioned assigning process, can distribute according to three above-mentioned principles other address spaces among Fig. 4.
The account form of address space priority:
Address space priority=Prior+f (MaxGlobal, MaxLocal)+p (NumUsed);
Wherein, MaxGlobal refers to the maximum new address space that can be assigned in all address spaces; MaxLocal specifies the new address space that maximum can be assigned in the address space; NumUsed specifies in the address space addresses distributed amount of space; (MaxGlobal MaxLocal) is function about MaxGlobal and MaxLocal to f, and its value is directly proportional with MaxGlobal, is inversely proportional to MaxLocal; P (NumUsed) is the function about NumUsed, and its value is directly proportional with NumUsed.
Embodiment 1:
Below in a concrete example, the distribution of the IPv6 network address is described.At first do following hypothesis:
The address space prefix is " 2001:da8: :/32 ";
The user sets and obtains key length 2 is 32 with corresponding big address amount of space;
Address space priority computing formula is:
Prior+3*Log2(MaxGlobal/MaxLocal)+2*NumUsed。
As shown in Figure 9, the specific implementation step of utilizing method of the present invention that the IPv6 network address is distributed is as follows:
Step 20, give the all-ones subnet address number according to the address space prefix of setting in the step 10 and lowest address unit's prefix.Because the address space prefix is 32, and lowest address unit's prefix is 48, so subnet address total " 2 16 powers " individual (65536), therefore in the present embodiment, numbering is from 0-65535.
Step 30, in each keyword corresponding address space, evenly cut apart address space according to its corresponding sequence number quantity, and give corresponding sequence number.In the present embodiment, whole address space may be partitioned into 32 big address spaces, so their sequence number is from 0-31.For example, in Fig. 3,2001:da8: :/37 sequence numbers are 0,2001:da8:4800: :/37 sequence numbers are 8,2001:da8:8800: :/37 sequence numbers are 16,2001:da8:f800: :/37 sequence numbers are 31.Address space cut apart finish after, being revised as the key length of global address space, the value of long key length adds 1.
Above-mentioned step 10 to step 30 is the initialization procedure to address space, after initialization finishes, also can make amendment to the keyword level of address space.As shown in Figure 2, the modification of keyword level is comprised from user's input obtain designated key word string (then equaling whole address space) and related amendments attribute for sky; Judge then and distributed the address whether after revising, not isolated continuously, if return user's operation failure, otherwise revise the relative address block message.
Step 40, reception distribute the request first time of address space, from this request, obtain keyword string (Keys) and priority (Prior), and space, current address (SpaceCur) being set for global address space, it is 1 that current keyword string of living in position (deep) is set.In the present embodiment, as shown in Figure 6, the keyword string of request is Keys=" backbone, " for the first time, the priority P rior=4 of this request.
The key length of step 50, request is 2, the corresponding sequence number of the individual keyword of deep (deep=1) does not use up, is that 0 address space begins the place and distributes address space to give request for the first time according to keyword address space selection principle (1) in sequence number, finishes this address space and distributes.
Step 60, receive and ask for the second time Keys=" Beijing, node ", Prior=4; Wherein, the priority P rior=4 in the request is set by the user.Because keyword " Beijing " do not exist,, be that 16 address space place distributes the address address space in sequence number according to keyword address space selection principle (2); Finishing this address space distributes.
Step 70, receive and ask Keys=" Shanghai, node ", Prior=4 for the third time; Because keyword " Shanghai " do not exist,, be that 24 address space place distributes the address address space in sequence number according to keyword address space selection principle; Finishing this address space distributes.
Step 80, receive the 4th time the request Keys=" Beijing, general headquarters ", Prior=12; Because it is 16 big address space that keyword " Beijing " has distributed sequence number, and KeyNum is 2, therefore further distributes address space in the sequence number related with " Beijing " 16 address spaces, and SpaceCur is " Beijing " at this moment, and deep is 1.
Step 90, in SpaceCur (" Beijing ") address space, Keys " Beijing, general headquarters " does not exist; Then in the SpaceCur address space, search the address block of address space priority minimum, in search procedure, will utilize aforesaid priority computing formula that the address block in the space, current address is done priority and calculate.As shown in Figure 7, according to result of calculation as can be known keyword be that " Beijing, node " address space priority is 4, minimum is selected the address space at this keyword place.
Step 100, in " Beijing, node " address, be numbered the multiple of 2 n power, n soprano place begins to distribute new address space; Finishing the 4th address space distributes.
Step 110, receive request Keys=" Beijing, Haidian ", Prior=4, and require 4 address units the 5th time; Keys " Beijing, Haidian " does not exist in SpaceCur (" Beijing ") address space; Then search the address block of address space priority minimum in the SpaceCur address space, be " Beijing, node " this moment, and address space priority is 4; In " Beijing, node " address, be numbered the multiple of 2 n power, n soprano place begins to distribute new address space; Finishing the 5th address space distributes.
Step 120, receive the 6th time the request Keys=" Beijing, Fengtai ", Prior=8; Keys " Beijing, Fengtai " does not exist in SpaceCur (" Beijing ") address space; Then search the address block of address space priority minimum in the SpaceCur address space, be " Beijing, node " this moment, and address space priority is 7; In " Beijing, node " address, be numbered the multiple of 2 n power, n soprano place begins to distribute new address space; Finishing this address space distributes.
Step 130, receive the 7th time the request Keys=" Beijing, Changping ", Prior=4; Keys " Beijing, Changping " does not exist in SpaceCur (" Beijing ") address space; Then search the address block of address space priority minimum in SpaceCur (" Beijing ") address space, be " Beijing, node " this moment, and address space priority is 10; In " Beijing, node " address, be numbered the multiple of 2 n power, n soprano place begins to distribute new address space; Finishing this address space distributes.
Step 140, receive request Keys=" Beijing, Haidian ", Prior=4, and require 4 address units the 8th time; Keys " Beijing, Haidian " exists in SpaceCur (" Beijing ") address space; " Beijing, Haidian " corresponding with distributing new space behind the address; Finishing this address space distributes.
Step 150, receive the 9th request Keys=" Beijing, Chaoyang ", Prior=8; Keys in SpaceCur (" Beijing ") address space " Beijing, Chaoyang " does not exist; Then search the address block of address space priority minimum in the SpaceCur address space, be " Beijing, general headquarters " this moment, and address space priority is 12; In " Beijing, general headquarters " address, be numbered the multiple of 2 n power, n soprano place begins to distribute new address space; Finishing this address space distributes.
Step 160, finish the tenth time to the 99 time address space and distribute.
Step 170, receive request Keys=" Beijing, Haidian ", Prior=4, and require 32 address units the 100 time; This moment, keyword " Beijing, Haidian " did not have so big address space left space in the address space of sequence number 16; This moment, SpaceCur was " Beijing ".
Step 180, behind the SpaceCur address space, have adjacent sequence number unallocated, and continuation address space size is more than or equal to its existing usage space; Expand the SpaceCur address space, as shown in Figure 5, soon sequence number is 16,17 address merging.
Step 190, Keys become " Beijing, ex Haidian " from " Beijing, Haidian ", deep is 1.
Step 200, in merging address space, redistribute " Beijing, ex Haidian ", this moment is according to above principle and flow process, is that new address space is joined in 17 address space 1/2nd punishment in former sequence number.
Step 210, the 100 is once similar to the 149 address space distribution and above process.
Step 220, receive the 150 time the request Keys=" Wuhan, node ", Prior=4; Keyword " Wuhan " does not exist, and distributes the address address space according to keyword address space selection principle at the address space place of sequence number 18; Finishing this address space distributes.
Step 230, the 150 is once similar to the 499 address space distribution and above process.
Step 240, receive the 700 time the request Keys=" Beijing, news ", Prior=4; This moment, address space was used up in " Beijing " space, and keyword " Beijing " afterwards sequence number be that 18 address space has been distributed to keyword " Wuhan ", cause the expanded address space failure.
Step 250, inform that the user can't carry out address space and distribute, whether continue automatic assigning process.
Step 260, user select to continue.
Step 270, Keys become " ex Beijing, news " from " Beijing, news ", and SpaceCur is a global address space, and deep is 1; Restart address allocation procedure.
Step 280, Keys " ex Beijing " does not exist and the later sequence number of keyword " Beijing " is used in SpaceCur (overall situation) address space, then search the keyword address space that can distribute maximum space in SpaceCur (overall situation) address space, this example is " northwest ".
Step 290, in keyword " northwest " corresponding address space, search and do not use the multiple that is numbered 2 n power in the address, the n soprano begins to distribute new address space from it, this time address assignment finishes.
Claims (5)
1, a kind of level IPv6 network address assignment method based on keyword and priority may further comprise the steps:
Step 1), according to user's setting initialization address space, be address space level Allotment Serial Number according to keywords;
Described step 1) specifically may further comprise the steps:
Step 1-1), the user sets address space prefix, lowest address unit's prefix, maximum key length and four values of corresponding keyword sequence number quantity;
Step 1-2), give the all-ones subnet address number according to IPv6 address prefix and lowest address unit's prefix;
Step 1-3), in each keyword corresponding address space, evenly cut apart address space according to its corresponding sequence number quantity, and give corresponding sequence number;
Step 2), represent the keyword string imported with Keys, represent the space, current address with SpaceCur, represent current keyword string of living in position with deep, the length of representing keyword string behind the space, current address with KeyNum, judge whether KeyNum is 1, if 1, execution in step 4), if be not 1, carry out next step;
Step 3), based on the keyword assignment address space; Describedly specifically may further comprise the steps based on the keyword assignment address space:
Step 3-1), judge whether deep keyword has distributed corresponding sequence number in the SpaceCur address space; If then carry out next step; Otherwise execution in step 3-3);
Step 3-2), the value of deep is added one, after SpaceCur adds the deep keyword, execution in step 3-8);
Step 3-3), judge whether the sequence number in the SpaceCur address space is used up,, execution in step 3-5 then) if use up; Then do not carry out next step if use up;
Step 3-4), according to keywords address space selection principle begins place's distribution at the address space of selected sequence number, the address assignment end;
Described keyword address space selection principle comprises:
(a), in corresponding keyword address space, sequence number is 0 to use at first;
(b), sequence number is the multiple of 2 n power, the big more first more use of n;
(c), n identical then sequence number less and service time of having distributed address space relatively, short more first more use service time;
Step 3-5), in the SpaceCur address space, search the corresponding sequence number of the keyword address space that can distribute maximum space;
Step 3-6), in selected sequence number, judge whether the maximum allocated space can meet the requirement of sequence number lowest spatial;
If satisfy, then carry out next step; If do not satisfy, then presentation address space conflict, execution in step 5);
Step 3-7), in selected address space, search and do not use the multiple that is numbered 2 n power in the address, the n soprano begins to distribute new address space from it, address assignment finishes;
Step 3-8), the KeyNum of SpaceCur is 1 execution in step 4); Otherwise execution in step 3-1);
Step 4), based on the priority assignment address space; Describedly specifically may further comprise the steps based on the priority assignment address space:
Step 4-1), in the SpaceCur address space, judge whether Keys exists; If exist, then carry out next step; Otherwise execution in step 4-4);
Step 4-2), judge whether address space is used up, if use up, then execution in step 5); Otherwise carry out next step;
Step 4-3), the Keys correspondence with the address after distribute new address space, address assignment finishes;
Step 4-4), according to address space priority, in SpaceCur, search the minimum address space of address space priority, if priority is identical, according to the user preference is set and selects;
Step 4-5), judge whether address space is used up, if used up then execution in step 5), otherwise carry out next step;
Step 4-6), in selected address space, be numbered the multiple of 2 n power, n soprano place begins to distribute new address space, end address assigning process;
Step 5), when address space clashes, processing conflicts.
2, the level IPv6 network address assignment method based on keyword and priority according to claim 1, it is characterized in that, at described step 1-1)-step 1-3) in, after finishing the initialization operation of address space, also the keyword level is made amendment, comprise: obtain designated key word string and related amendments attribute from user's input, wherein keyword string is that sky then equals whole address space; Judge then whether the continuity of having distributed address space is not isolated after revising, if return user's operation failure, otherwise revise the relative address block message.
3, the level IPv6 network address assignment method based on keyword and priority according to claim 1 is characterized in that, at described step 4-4) in, described address space priority computing formula is:
Address space priority=Prior+f (MaxGlobal, MaxLocal)+p (NumUsed);
Wherein, Prior is the priority of user's setting; MaxGlobal is the maximum new address space that can be assigned in the designated key word space; MaxLocal is the new address space that can be assigned in the particular address piece; NumUsed specifies in the address space addresses distributed amount of space; (MaxGlobal MaxLocal) is function about MaxGlobal and MaxLocal to f, and its value is directly proportional with MaxGlobal, is inversely proportional to MaxLocal; P (NumUsed) is the function about NumUsed, and its value is directly proportional with NumUsed.
4, the level IPv6 network address assignment method based on keyword and priority according to claim 1 is characterized in that, in described step 5), specifically may further comprise the steps:
Step 5-1), judge behind the SpaceCur address space, whether to exist adjacent sequence number unallocated, and continuation address space size is more than or equal to the situation of the existing size of SpaceCur; Then carry out next step if exist, otherwise carry out 5-4);
Step 5-2), SpaceCur expands one times of address space;
Step 5-3), add that before deep keyword " ex ", SpaceCur are global address space, deep is 1, re-executes step 2);
Step 5-4), inform that the user can't carry out address space and distribute, select whether to continue automatic assigning process by the user, if then carry out next step, otherwise the end address assigning process;
Step 5-5), keyword Keys be re-set as " ex " add Keys, SpaceCur is a global address space, deep is 1, re-executes step 2 then).
5, the level IPv6 network address assignment method based on keyword and priority according to claim 4 is characterized in that, at described step 5-2) in, the specific implementation step that described SpaceCur is expanded one times of address space comprises:
Step 5-2-1), obtain designated key word string and sequence number tabulation from user's input;
Step 5-2-2), judge to merge address space and whether meet the merging requirement, if do not meet, then return user's operation failure, if meet then carry out next step;
Step 5-2-3), associated sequence numbers is labeled as distributes, and represent the association attributes of its merging;
Step 5-2-4), to merge the corresponding key length of address space be KeyNum-1, then merge and finish; Otherwise, remaining space cut apart and increased the sequence number size according to smallest sequence number address space dividing method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610171650A CN100593316C (en) | 2006-12-31 | 2006-12-31 | Key word and priority based hierarchical IPv6 network address assignment method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610171650A CN100593316C (en) | 2006-12-31 | 2006-12-31 | Key word and priority based hierarchical IPv6 network address assignment method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101212494A CN101212494A (en) | 2008-07-02 |
| CN100593316C true CN100593316C (en) | 2010-03-03 |
Family
ID=39612154
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200610171650A Active CN100593316C (en) | 2006-12-31 | 2006-12-31 | Key word and priority based hierarchical IPv6 network address assignment method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100593316C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102340551B (en) * | 2010-07-27 | 2016-02-03 | 中国电信股份有限公司 | A kind of method and system building IPv6 address pool |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003009624A1 (en) * | 2001-07-10 | 2003-01-30 | Siemens Aktiengesellschaft | Method for carrying out a qos-oriented handoff between a first and a second ip-based, especially mobile ipv6-based, communication path, between a mobile node (mn) and a correspondent node (cn) |
| CN1494282A (en) * | 2003-09-24 | 2004-05-05 | 中国科学院计算技术研究所 | Dynamic passive field name distribution method for implementing terminal to terminal communication in internet |
| CN1527560A (en) * | 2003-09-24 | 2004-09-08 | 中国科学院计算技术研究所 | Dynamic domain name distributing service method in mobile internet |
-
2006
- 2006-12-31 CN CN200610171650A patent/CN100593316C/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003009624A1 (en) * | 2001-07-10 | 2003-01-30 | Siemens Aktiengesellschaft | Method for carrying out a qos-oriented handoff between a first and a second ip-based, especially mobile ipv6-based, communication path, between a mobile node (mn) and a correspondent node (cn) |
| CN1494282A (en) * | 2003-09-24 | 2004-05-05 | 中国科学院计算技术研究所 | Dynamic passive field name distribution method for implementing terminal to terminal communication in internet |
| CN1527560A (en) * | 2003-09-24 | 2004-09-08 | 中国科学院计算技术研究所 | Dynamic domain name distributing service method in mobile internet |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101212494A (en) | 2008-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109040259B (en) | CDN node distribution method and system based on MEC | |
| CN102055817B (en) | Method for gathering homologous address beam and homologous gathering network route system | |
| CN101582917B (en) | Method for dispatching MCU resource, business server and system | |
| CN106302172A (en) | Support Hash lookup and the storage of route querying, lookup method and device simultaneously | |
| CN111159002B (en) | Data edge collection method, edge collection equipment and system based on grouping | |
| CN105227683A (en) | A kind of LDAP company-data synchronous method and system | |
| CN106302843A (en) | A kind of IP address base update method and device | |
| CN100593316C (en) | Key word and priority based hierarchical IPv6 network address assignment method | |
| CN105376309B (en) | Access gateway allocation method and device | |
| CN110380906B (en) | Large-scale multidimensional fusion virtual network mapping method | |
| CN106550006A (en) | Cloud Server resource allocation methods and device | |
| CN104426794A (en) | A message forwarding method and device | |
| CN108776698B (en) | Spark-based anti-deflection data fragmentation method | |
| CN110290228A (en) | A kind of internet protocol address distribution method and device | |
| CN103002067A (en) | Acquiring method of internet protocol (IP) addresses of virtual machine | |
| CN112235436A (en) | Network address translation rule matching method and equipment | |
| CN101267329A (en) | A method, system and device for selecting multi-point controller in conference dispatching | |
| CN103207835A (en) | Mass data storage method through self-adaptive Range partitions | |
| CN107306203A (en) | A kind of method and device of the scheduling of resource based on virtual network | |
| Ezell et al. | I/O router placement and fine-grained routing on Titan to support Spider II | |
| CN1972206A (en) | A method for building combination-based P2P system | |
| CN108809699B (en) | Method for realizing large-scale virtual network node repeated mapping | |
| CN106372165A (en) | Leader selection method and device for cluster based on totem protocol | |
| CN101572625A (en) | IP partition method | |
| CN115412737B (en) | Live broadcast return source relay node determining method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |