Idealistico-Pragmatical System for Network Addressing
A collection of rules for formation and recognition of addresses in packet-switched data communication networks

Generally used terms and their meanings:

network – aggregate of objects which are interlinked for data exchange; objects which are not directly linked exchange data with each other through objects which relay data; data is exchanged in portions.

node – an object engaged in a network

link – medium between nodes on direct exchange

neighbor – a node in relation to a node, at the presence of a link between the two

protocol – a system of rules for data exchange; network protocol – protocol for data exchange in a network

packet – a portion of data with direction and control additions – on exchange in a network

address – uniform data for reaching a node or multiple nodes; addresses are bound to relevant nodes and are used in packets sent by and in packets sent to those nodes.

source – a node as sender of a packet; source address – address which the source of a given packet presents itself with
destination – a node as a recipient of a packet; destination address – address for determination of destination(s) of a given packet

path – a sequence of addresses; to reach a certain destination a packet is passed consecutively through each of the nodes with those addresses.

service – activity performed by a node for a node or multiple nodes

server – a node as service performer
client – a node as a service consumer

Address Types

On different approaches of reaching nodes separate types of addresses are used, each with a relevant structure, and some with additions for parameters.

Address Types and Their Descriptions

(1) Complex Location of a Node

A complex location of a node is the sequence of:
1. self-identification of a node / assigned location of a node from a starting node
2. void identification / negotiated location of a node from the node with the foregoing self-identification/location
The complex location is of the finally identified node and from the initially identified node.

Varieties:

Privately accepted complex location of a node – complex location of a node consisting of identifications for private use

Commonly accepted complex location of a node – complex location of a node consisting of identifications for public use

Explanations

self-identification of a node – identification of a node from that same node – number zero
Self-identification of a node at the beginning of a destination address is self-identification of the source node.
Self-identification of a node at the beginning of a source address is self-identification of the destination node.

starting node for assigned locations of nodes – a node which assigned locations of nodes are formed from
identification of a starting node for assigned locations of nodes – number of starting node for assigned locations of nodes among such starting nodes – a positive integer

neighbor identification from a given node – number of neighbor among the neighbors of the given node – a positive integer
assigned neighbor identification from a given node – a neighbor identification from a given node, unique for that node
negotiated neighbor identification from a given node – a neighbor identification from a given node, unique for both the given node and the neighbor being identified

end identification – identification for end of a sequence of identifications – number zero

assigned location of a node from a starting node – sequence of:
1. identification of a starting node for assigned locations of nodes
2. assigned neighbor identifications (optional), each from the node with its immediately preceding identification.
3. end identification
The assigned location is of the finally identified node and from the starting node for assigned locations of nodes.

void identification – padding for a sequence of identifications – number zero

negotiated location of a node from a given node – sequence of:
1. a negotiated neighbor identification from the given node
2. negotiated neighbor identifications (optional), each from the node with its immediately preceding identification
3. end identification
The negotiated location is of the finally identified node and from the originally given node.

identification for private use – an identification designated for private use
identification for public use – an identification designated for public use

(2) Complex Definition of a Node

A complex definition of a node is the sequence of:
1. self-identification of a node / assigned definition of a node from an initial node
2. void identification / negotiated definition of a node from the node with the foregoing self-identification/definition
The complex definition is of the finally identified node and from the initially identified node.

Varieties:

Privately accepted complex definition of a node – complex definition of a node consisting of identifications for private use

Commonly accepted complex definition of a node – complex definition of a node consisting of identifications for public use

Explanations

self-identification of a node – identification of the node from that same node – number zero
Self-identification of a node at the beginning of a destination address is self-identification of the source node.
Self-identification of a node at the beginning of a source address is self-identification of the destination node.

initial node for assigned definitions of nodes – a node which assigned definitions of nodes are formed from
identification of an initial node for assigned definitions of nodes – number of initial node for assigned definitions of nodes among such initial nodes – a positive integer

acquaintance – a node in relation to a node, each knowing an address of type “complex location of a node” of the other
acquaintance identification from a given node – number of acquaintance among the acquaintances of the given node – a positive integer
assigned acquaintance identification from a given node – an acquaintance identification from a given node, unique for that node
negotiated acquaintance identification from a given node – an acquaintance identification from a given node, unique for both the given node and the acquaintance being identified

end identification – identification for end of a sequence of identifications – number zero

assigned definition of a node from an initial node – sequence of:
1. identification of an initial node for assigned definitions of nodes
2. assigned acquaintance identifications (optional), each from the node with its immediately preceding identification
3. end identification
The assigned definition is of the finally identified node and from the initial node for assigned definitions of nodes.

void identification – padding for a sequence of identifications – number zero

negotiated definition of a node from a given node – sequence of:
1. a negotiated acquaintance identification from the given node
2. negotiated acquaintance identifications (optional), each from the node with its immediately preceding identification
3. end identification
The negotiated definition is of the finally identified node and from the originally given node.

identification for private use – an identification designated for private use
identification for public use – an identification designated for public use

(3) Definition of a Services Type for a Server

A definition of a services type for a server is:
– identification for the “allocation/indication of services types” services type / sequence of:
1. category identifications (optional), the first one – in general, each subsequent – within the category with its immediately preceding identification
2. identification of a services type within the category with the immediately preceding identification, if there is one, otherwise – identification of a services type in general
3. end identification
The definition is of the identified services type and for a server for services of that type.

Address addition:

Required initial overlapping – count of identifications from node and end identifications which must consecutively match from beginning in compared addresses – an unsigned integer
Addresses compared are, on one side, an address in the path to destination of a packet, and on the other – the source address of that packet or another address, specified for the purpose.

Varieties:

Privately recognized definition of a services type for a server – definition of a services type for a server consisting of identifications for private use

Commonly recognized definition of a services type for a server – definition of a services type for a server consisting of identifications for public use

Explanations

service “allocation/indication of services types” – allocation/indication of definitions of services types for servers
identification for the “allocation/indication of services types” services type – number zero

category identification – number of a category in general or as a subcategory among the subcategories of a certain category – a positive integer

identification of a services type – number of a services type within a certain category or in general – a positive integer

end identification – identification for end of a sequence of identifications – number zero

identification for private use – an identification designated for private use
identification for public use – an identification designated for public use

(4) Definition of a Service Type for Clients

A definition of a service type for clients is:
– identification for the “allocation/indication of service types” service type / sequence of:
1. category identifications (optional), the first one – in general, each subsequent – within the category with its immediately preceding identification
2. identification of a service type within the category with the immediately preceding identification, if there is one, otherwise – identification of a service type in general
3. end identification
The definition is of the identified service type and for every client for service of that type.

Address addition:

Required initial overlapping – count of identifications from node and end identifications which must consecutively match from beginning in compared addresses – an unsigned integer
Addresses compared are, on one side, an address in the path to a destination of a packet, and on the other – the source address of that packet or another address specified for the purpose.

Varieties:

Privately recognized definition of a service type for clients – definition of a service type for clients consisting of identifications for private use

Commonly recognized definition of a service type for clients – definition of a service type for clients consisting of identifications for public use

Explanations

service “allocation/indication of service types” – allocation/indication of definitions of service types for clients
identification for the “allocation/indication of service types” service type – number zero

category identification – number of a category in general or as a subcategory among the subcategories of a certain category – a positive integer

identification of a service type – number of a service type within a certain category or in general – a positive integer

end identification – identification for end of a sequence of identifications – number zero

identification for private use – an identification designated for private use
identification for public use – an identification designated for public use

(5) Identification for an Allocation Server / Identification of a Tree of Nodes

Subtypes:

1) Identification for an allocation server

An identification for an allocation server is:
– number zero

2) Identification of a tree of nodes

An identification of a tree of nodes is:
– the identification of root of the tree of nodes

Varieties:

Identification for a privately determined allocation server
Privately accepted identification of a tree of nodes

Identification for a publicly determined allocation server
Commonly accepted identification of a tree of nodes

Explanations

allocation server – a server allocating identifications of starting nodes for assigned locations of nodes for addresses of type “complex location of a node” and of initial nodes for assigned definitions of nodes for addresses of type “complex definition of a node”

tree of nodes – aggregate of nodes with addresses of type “complex location of a node” with the same identification of starting node for assigned locations of nodes

root of a tree of nodes – the starting node from which are the addresses through which the tree of nodes is determined
identification of root of a tree of nodes – the identification of starting node for assigned locations of nodes through which the tree of nodes is determined

Address Type Identification

For type identification and structure and addition indication of addresses use is made of:
– address type code – an unsigned integer

Address type codes:

Address Type Code
Privately accepted complex location of a node 0
Commonly accepted complex location of a node 1
Privately accepted complex definition of a node 2
Commonly accepted complex definition of a node 3
Privately recognized definition of a services type for a server 4
Commonly recognized definition of a services type for a server 5
Privately recognized definition of a service type for clients 6
Commonly recognized definition of a service type for clients 7
Identification for a privately determined allocation server
Privately accepted identification of a tree of nodes
8
Identification for a publicly determined allocation server
Commonly accepted identification of a tree of nodes
9

Protocol Arrangement of Address Data

Arrangement of Address Data for Use by Network Protocols

For use by network protocols, an address and its accompanying data are ordered in an address sequence.

An address sequence is the sequence of:
1. an address type code
2. an address of that type
3. address additions (if any for the type)

Structure of Address Sequence Components

1) Address type code

An address type code is:
– an unsigned integer

2) Address

For address types:
– privately accepted complex location of a node
– commonly accepted complex location of a node
– privately accepted complex definition of a node
– commonly accepted complex definition of a node
the address has the following structure:
– sequence:
1. series of unsigned integers; ends with number zero.
2. series of unsigned integers; ends with number zero.

For address types:
– privately recognized definition of a services type for a server
– commonly recognized definition of a services type for a server
– privately recognized definition of a service type for clients
– commonly recognized definition of a service type for clients
the address has the following structure:
– series of unsigned integers; ends with number zero.

For address types:
– identification for a privately determined allocation server / privately accepted identification of a tree of nodes
– identification for a publicly determined allocation server / commonly accepted identification of a tree of nodes
the address has the following structure:
– an unsigned integer

3) Address additions

For address types:
– privately recognized definition of a services type for a server
– commonly recognized definition of a services type for a server
– privately recognized definition of a service type for clients
– commonly recognized definition of a service type for clients
an address addition is included in the address sequence:
– an unsigned integer

Record on Exchange

On binary exchange by network protocols, unsigned integers are in the form:
binary indicators-termination sequence

On binary exchange by network protocols, at the use of address fields of fixed dimension, the following rules are applied:

1) Fill in unused bits

After writing down an address sequence to a fixed-dimension address field, each remaining unused bit in the address field is set to zero.

2) Ignore remaining trailing zeros

Writing down an address sequence to a fixed-dimension address field, if all bits of the address field are occupied and no bits of value one from the sequence remain unwritten, the address sequence is considered written down in that field.

3) Complete an address sequence

Recognizing an address sequence read from a fixed-dimension address field, for completeness of the sequence: if more bits are needed than present in the sequence, the appropriate count of bits of value zero are appended to it.

Explanations

field – place in a packet – for data with a certain designation; address field – field for an address sequence

dimension – count of digits

write – copy data to a packet
read – copy data from a packet

Language Selection Feedback