WO2002044903A1 - An universal assigning method for the networking computer to assign computer's address with full decimal algorithm - Google Patents
An universal assigning method for the networking computer to assign computer's address with full decimal algorithm Download PDFInfo
- Publication number
- WO2002044903A1 WO2002044903A1 PCT/CN2001/001343 CN0101343W WO0244903A1 WO 2002044903 A1 WO2002044903 A1 WO 2002044903A1 CN 0101343 W CN0101343 W CN 0101343W WO 0244903 A1 WO0244903 A1 WO 0244903A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- address
- domain
- external
- internal
- addresses
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
Definitions
- the invention relates to an overall allocation method of networked computer addresses. Background technique
- the address scheme used by the Internet is still the IPv4 protocol developed 20 years ago.
- the address scheme uses 4 segments of 8-bit decimal numbers to allocate the addresses of hosts and other devices connected to the Internet. "Decimal" method to represent.
- these addresses seemed to be enough for worldwide use, and IPv4 also achieved enormous success, but in the last 20 years of the 20th century, the development of the Internet in the world was extremely rapid.
- Hosts accessing the Internet The number is increasing exponentially each year, so the number of existing addresses is no longer sufficient for this development. Addresses will also be more and more widely used in other intelligent terminals such as logistics codes, space codes, identification codes, and three-dimensional geographic codes of e-commerce. Therefore, the original address allocation technology is not compatible with the current computer technology. Disclosure of invention
- the purpose of the present invention is to provide a new address allocation method, which can provide sufficient address space for the future development of the Internet. At the same time, this new method also provides various personal information appliances, logistics and other phenomena in personal electronic commerce and personal communication.
- the application of the terminal provides enough addresses, and a simpler, more convenient, and cheaper method, and also ensures that the address structure can have more levels.
- a general allocation method for a computer and an intelligent terminal to allocate a computer address using a full decimal algorithm which is characterized in that the input port of the computer and the intelligent terminal, such as a keyboard, a barcode, a two-dimensional code, etc.
- Code input devices, eye input devices, voice input devices, etc. will enter addresses into computers and combine the software and hardware of various computers and pass various transmission media, such as optical cables, microwaves, and copper conductors, etc., to be stored in the database
- the external addresses of networked computers and smart terminals in the system correspond to the internally calculated addresses of the computer.
- the steps are:
- the address described in C may be fixed-length or fixed-length or corresponding to a binary internal address
- the original domain names applied in various languages such as numbers, English, Chinese, etc., the existing telephone numbers, BP machine numbers, mobile phone numbers and other communication numbers, microphone addresses, and based on The latest numeric domain name in decimal encoding;
- the address in the database is directly corresponding to the binary address inside the computer and the data stream is directed to the host through computer hardware and software such as a gateway through transmission media such as optical cables, microwaves and copper wires.
- the text domain name can be resolved by the resolver to find its decimal Address, and point to the address where the host is located, and the telephone number, mobile phone and other communication numbers in the database will be directly pointed to the communication system to which the communication number belongs by pointing to the gateway.
- each domain address has a value range of 2 ° -2 512 , 2 °-2 256 , 2 ° -2 128 , 2 ° -2 64 or 2 °- 2 A binary number between 4 .
- Each domain must be separated by a delimiter. If there is a continuous all-zero field in the address or internal address, it can be replaced by a pair of braces or square brackets. If there is more than one continuous all 0 field in the address or internal binary address, each continuous all 0 field can be replaced by a pair of braces or brackets, and Arabic numerals are used in parentheses to indicate that there is Several all-zero fields. If within the domain of the address or internal binary address, there is a continuous Arabic paragraph with the same number, the Arabic numeral can be replaced by a pair of parentheses, and the numbers to be omitted are marked from left to right in the parentheses. Characters and ellipsis.
- the external address is an address having a multi-level structure, and the address may be an interface of a single network, that is, a monocular address.
- the monocular structure has three levels, namely, a public topology layer, and a network for a public Internet transfer service. A collection of vendors and network exchanges.
- the site topology layer is used to limit a specific site or organization that does not provide public Internet transfer services to off-site nodes.
- the network interface identifier is used to identify the network interface on the link.
- the public topology layer is composed of an address prefix, a top-level aggregation identifier, a reserved domain, and a second-level aggregation identifier
- the site topology layer is composed of a site-level aggregation identifier
- the network interface identifier is only composed of a network interface identifier.
- the two-level aggregation identifier may be further divided into an internal multi-level hierarchy
- the site-level aggregation identifier may also establish an internal addressing structure and an identification subnet thereof
- the network interface identifier may be in a multiple node on the same node. Used on each interface.
- an address dedicated to local communication is provided, that is, a local monocular address.
- the local monocular address can be used for communication between nodes on the same link to form a local chain.
- the monogram address of a road has the structure of an address format prefix and a network interface identifier, and is filled with 0 in the middle.
- the local monocular address can also be used to address a communication network interface within a site range to form a monocular address within a station. Its structure is a format prefix, a subnet identifier, and a network interface identifier. Marks are filled with 0.
- the address encoding method of the present invention also defines some special-purpose addresses. For example, an address composed of all zeros is an unspecified address and cannot be assigned to any node, which means that the network interface has not obtained a formal address temporarily. For example, if the address is all 1, which is the local loopback address, it is used when a node wants to send a message back to itself. When testing whether the protocol stack works normally, the local loopback address is usually used.
- some addresses can be assigned to multiple network interfaces at the same time to form a cluster address, which has the same structure as a monocular address. Addresses can also be assigned to multi-addresses. Address packets destined for multi-addresses will be received by all network interfaces that have the multi-addresses at the same time. Best Mode for Carrying Out the Invention
- the invention compiles the external addresses of the networked computers and smart terminals stored in the database corresponding to the addresses calculated internally by the computer.
- the steps are as follows: the various external addresses of all networked computers and smart terminals are positioned as decimal values.
- a decimal integer between 10 ° -10 2 locates the internal addresses of all networked computers and smart terminals as binary values, which are represented as binary numbers between 2 fl -2 1 () 24 ;
- the positioning method corresponds to an external address and a binary internal address.
- the address is input through a computer and an input terminal of a smart terminal, such as a keyboard, a bar code, a two-dimensional code and other code input devices, an eye input device, and a voice input device.
- the database should also store the original domain names applied in various languages, such as numbers, English, Chinese, existing telephone numbers, BP machine numbers, mobile phone numbers and other communication numbers, microphone addresses, and the latest digital domain names based on decimal encoding;
- the address will be directly corresponded to the internal binary address of the computer and point to the host through the gateway.
- the text domain name can be resolved by the resolver to find its decimal address and point to the address of the host.
- the phone number, mobile phone and other communication numbers in the database will pass The pointing gateway points directly to the communication system to which the communication number belongs.
- each domain address is a decimal between 10 Q -10 M Integers, and domain addresses are separated by braces.
- This form of address is Y ⁇ Y ⁇ Y ⁇ Y ⁇ , where each ⁇ represents an external domain address, expressed as a 64-bit decimal number.
- the entire internal address will also be divided into 16 domains.
- Each domain address is a binary number between 2 Q -2 fi4 , and its address form is D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ D ⁇ , each D represents an internal domain address, expressed as a 64-bit binary number.
- One external domain address corresponds to four internal domain addresses.
- each domain address is a decimal integer between 10 ° -10 32 , and the domain addresses are separated by square brackets.
- This form of address is Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y] Y], where each ⁇ represents a domain address, expressed as a 32-bit decimal number.
- the entire internal address will also be divided into 8 domains, each domain address is a binary number between 2 ° -2 128 , and its address form is X] X] ⁇ ] ⁇ ] ⁇ ] ⁇ ] ⁇ ] ⁇ ], each Each X represents a domain address and is represented by a 128-bit binary number.
- the address 0] 0] 0] 12345678] 987654] 0] 0] 0] 0 can be abbreviated as:
- the paragraph of Arabic numerals can be replaced by a pair of parentheses, and the numbers to be omitted are marked from left to right in the parentheses, Number of delimiters and omissions.
- 0] 0] 12345678000000000] 987654000000J9800980000] 0] 0] 0 can be abbreviated as [] 12345678 (0/9)] 987654 (0/6)] 980098 (0/4) [3].
- the external address In the process of address preparation of the networked computer and the intelligent terminal, the external address must be corresponding to the internal binary address. For this reason, in this embodiment, the fixed length and no positioning method are used to make the two correspond.
- the external address [7] 19 will correspond to the internal binary address [7] (0/251) 10011, and the address [7] 21 will correspond to [7] (0/251) 10101 c
- the address prepared as above can be assigned to a network interface. If it can be assigned to a single network interface, the identifier is used as a mono address, and the packet with the mono address as the destination address will be sent to the unique network interface identified by it.
- the monocular address has a multi-layered network structure with good scalability, which is conducive to solving the problem of routing addressing.
- an aggregatable global monocular address can have three levels, namely, the public topology layer, the site topology layer, and the network interface identifier.
- the public topology layer consists of the address prefix (FP), top-level aggregation identifier (TLA), and reserved domain (RES).
- NLA second-level aggregation identifier
- SLA site-level aggregation identifier
- SLA network interface identifier
- the FP of an address is 1001
- the TLA ID is 8960
- the RES is 9806
- the NLA ID is 9999999
- the SLL ID is 8887
- the network interface ID is 0.
- the entire address should be identified as 1001 (0 I 24) 8960] (0/4) 9806 (0/14)] (0 125) 9999999] (0 128) 8887] [4].
- the format prefix routing system can quickly distinguish whether an address is a monocular address or another type of address.
- the top-level aggregation identifier is the highest level in the routing hierarchy. The default router must give the address in the routing table. Each valid top-level aggregation identifier establishes a corresponding entry, and provides routing information to the address area represented by these top-level aggregation identifiers.
- Organizations assigned a top-level aggregate identity use a secondary aggregate identity when establishing an addressing hierarchy for internal addressing and identifying sites within it. When an organization allocates its internal two-level aggregation identifier, it can choose an allocation scheme according to its own needs and establish its internal addressing hierarchy.
- Site-level aggregate identification is used by individual organizations (sites) to establish their internal addressing hierarchy and identify subnet numbers.
- the structure can be as follows:
- SLA1 subnet number the number of levels in the site-level aggregation identification domain and the selection of the length of the SLA identification at each level are determined by each organization according to the topology of the internal subnet.
- the method for uniformly allocating addresses of computers and smart terminals is basically the same as that of the first embodiment, but a method of positioning an indefinite length may be used when the external address and the internal address are correspondingly prepared.
- This method locates the various external addresses of all networked computers and smart terminals as decimal values, which are represented as decimal integers between 10 0 and 25 ⁇ , and locates the internal addresses of all networked computers and smart terminals as binary values, which have a range of representations. Is a binary number between 2 Q -2 lfl24 ; then the method of positioning indefinite length can be used to correspond the external address with the binary internal address.
- the method for locating an indefinite length is to match each decimal number in the external address with every four-digit binary number in the computer's internal address.
- the external address [] 7] 7] 7] 7] 7] 8] 8] 3] 3] can correspond to the internal binary address [] 0111] 0111] 0111] 0111] 1000] 1000] 0011] 0011 .
- each decimal number in the address corresponds to a four-digit internal binary number.
- the external address and the internal binary address can be equally divided into 2 domains, 4 domains, 16 domains, or 256 domains, and the above addresses can be allocated at the same time.
- a cluster address is formed for multiple network interfaces, and its structure is the same as a monocular address.
- An address can also be assigned a multi-address.
- Address packets with the multi-address as the destination will be received by all network interfaces that have the multi-address.
- the address encoding method in the above embodiment also defines some special-purpose addresses. For example, an address composed of all zeros is an unspecified address and cannot be allocated. To any node, it means that the network interface has not obtained a formal address temporarily. If the address is all 1, which is the local loopback address, it is used when a node wants to send a message back to itself. When testing whether the protocol stack works normally, the local loopback address is also usually used.
- the present invention adopts the above-mentioned technical solution for address allocation, which provides sufficient address space for the future development of the Internet, and makes the representation of addresses simpler, more convenient to use, and the address allocation more standardized.
- the adoption of this technical solution has fully taken into account the size of the existing router routing table and the computing power of the current computer.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
BR0107919-0A BR0107919A (en) | 2000-11-30 | 2001-09-07 | Universal designation method for the network computer to designate the computer address with a total decimal algorithm |
JP2002547002A JP2004514385A (en) | 2000-11-30 | 2001-09-07 | Total addressing method for assigning computer addresses of networked computers using all decimal algorithms |
AU2002213782A AU2002213782A1 (en) | 2000-11-30 | 2001-09-07 | An universal assigning method for the networking computer to assign computer's address with full decimal algorithm |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN 00127622 CN1293403A (en) | 2000-11-30 | 2000-11-30 | General scheme for assigning addresses to networked computers by decimal algorithm |
CN00127622.0 | 2000-11-30 | ||
CNB001351826A CN1152298C (en) | 2000-11-30 | 2000-12-26 | Overall complete decimal algorithm to allocate computer address for network computers |
CN00135182.6 | 2000-12-26 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2002044903A1 true WO2002044903A1 (en) | 2002-06-06 |
Family
ID=25739581
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2001/001343 WO2002044903A1 (en) | 2000-11-30 | 2001-09-07 | An universal assigning method for the networking computer to assign computer's address with full decimal algorithm |
Country Status (6)
Country | Link |
---|---|
JP (1) | JP2004514385A (en) |
KR (1) | KR100468543B1 (en) |
CN (1) | CN1152298C (en) |
AU (1) | AU2002213782A1 (en) |
BR (1) | BR0107919A (en) |
WO (1) | WO2002044903A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113709268A (en) * | 2020-12-11 | 2021-11-26 | 浙江十进制网络有限公司 | Network random on-demand addressing method and its interconnected network |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101110826B (en) * | 2007-08-22 | 2012-03-14 | 张建中 | Method, device and system for constructing multi-dimensional address |
CN101123613B (en) * | 2007-08-23 | 2013-06-05 | 张建中 | A coding method and device and system for multi-dimension address |
CN101174332B (en) * | 2007-10-29 | 2010-11-03 | 张建中 | Method, device and system for interactively combining real-time scene in real world with virtual reality scene |
CN113691642A (en) * | 2020-12-11 | 2021-11-23 | 浙江十进制网络有限公司 | Network multicast addressing method and its interconnected network |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6038233A (en) * | 1996-07-04 | 2000-03-14 | Hitachi, Ltd. | Translator for IP networks, network system using the translator, and IP network coupling method therefor |
US6052725A (en) * | 1998-07-02 | 2000-04-18 | Lucent Technologies, Inc. | Non-local dynamic internet protocol addressing system and method |
-
2000
- 2000-12-26 CN CNB001351826A patent/CN1152298C/en not_active Expired - Lifetime
-
2001
- 2001-09-07 KR KR10-2002-7009817A patent/KR100468543B1/en not_active IP Right Cessation
- 2001-09-07 AU AU2002213782A patent/AU2002213782A1/en not_active Abandoned
- 2001-09-07 WO PCT/CN2001/001343 patent/WO2002044903A1/en active IP Right Grant
- 2001-09-07 BR BR0107919-0A patent/BR0107919A/en not_active IP Right Cessation
- 2001-09-07 JP JP2002547002A patent/JP2004514385A/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6038233A (en) * | 1996-07-04 | 2000-03-14 | Hitachi, Ltd. | Translator for IP networks, network system using the translator, and IP network coupling method therefor |
US6052725A (en) * | 1998-07-02 | 2000-04-18 | Lucent Technologies, Inc. | Non-local dynamic internet protocol addressing system and method |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113709268A (en) * | 2020-12-11 | 2021-11-26 | 浙江十进制网络有限公司 | Network random on-demand addressing method and its interconnected network |
Also Published As
Publication number | Publication date |
---|---|
CN1318792A (en) | 2001-10-24 |
KR20020075899A (en) | 2002-10-07 |
AU2002213782A1 (en) | 2002-06-11 |
KR100468543B1 (en) | 2005-01-27 |
JP2004514385A (en) | 2004-05-13 |
CN1152298C (en) | 2004-06-02 |
BR0107919A (en) | 2002-11-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6324585B1 (en) | Method and apparatus for domain name service request resolution | |
US8301738B1 (en) | Systems and methods for private network addressing in IP protocols | |
EP2479935A1 (en) | Method, system and communication terminal for implementing inter-communication between new network and internet | |
US9819641B2 (en) | Method of and a processing device handling a protocol address in a network | |
WO2012130128A1 (en) | Method, device, and system for implementing network identifier conversion | |
WO2002044903A1 (en) | An universal assigning method for the networking computer to assign computer's address with full decimal algorithm | |
CN102439948A (en) | Determining the group address for an ethernet-based multicast communication | |
KR101052913B1 (en) | Network system and method for allocating IPv6 address | |
EP2637359A1 (en) | Method and system for monitoring locator/identifier separation network | |
Wang et al. | Towards variable length addressing for scalable Internet routing | |
CN107241457A (en) | A kind of method for realizing network end-to-end communication | |
CN1293403A (en) | General scheme for assigning addresses to networked computers by decimal algorithm | |
CN115499366A (en) | Message transmission method and device | |
WO2012113198A1 (en) | Communication system and information interaction method | |
Chong et al. | Research on the Address Structure of Decimal Network | |
KR20000046358A (en) | Method for assigning source address of internet protocol packet in router | |
KR100846014B1 (en) | METHOD OF CONFIGURING IPv6 LINK-LOCAL ADDRESSES USING PSEUDO EUI-64 IDENTIFIERS IRRESPECTIVE OF TYPE OF PHYSICAL MEDIA | |
CN113709268A (en) | Network random on-demand addressing method and its interconnected network | |
CN113691641A (en) | Data packet transmission conversion method, internet and data packet processing equipment | |
Jiao et al. | Research of New Network Address Structure | |
CN113691643A (en) | Data packet transmission conversion method, internet and data packet processing equipment | |
Zhan et al. | A Full Decimal Method of Address Assignment for Networked Computer | |
KR20040007389A (en) | System and method for using the address of internet protocol version 6 | |
Li et al. | Research of Subnetting Based on Huffman Coding | |
Lai et al. | Design and Research of New Network Address Coding |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
ENP | Entry into the national phase |
Ref country code: JP Ref document number: 2002 547002 Kind code of ref document: A Format of ref document f/p: F |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020027009817 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 1020027009817 Country of ref document: KR |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
122 | Ep: pct application non-entry in european phase | ||
WWG | Wipo information: grant in national office |
Ref document number: 1020027009817 Country of ref document: KR |