CN1099794C - Method of assigning addresses in nodes of telecommunication network - Google Patents
Method of assigning addresses in nodes of telecommunication network Download PDFInfo
- Publication number
- CN1099794C CN1099794C CN97193323.5A CN97193323A CN1099794C CN 1099794 C CN1099794 C CN 1099794C CN 97193323 A CN97193323 A CN 97193323A CN 1099794 C CN1099794 C CN 1099794C
- Authority
- CN
- China
- Prior art keywords
- node
- address
- network
- identifier
- nodes
- 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.)
- Expired - Fee Related
Links
Images
Classifications
-
- 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
- H04L61/5007—Internet protocol [IP] addresses
-
- 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
- H04L61/5076—Update or notification mechanisms, e.g. DynDNS
-
- 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
- H04L61/5092—Address allocation by self-assignment, e.g. picking addresses at random and testing if they are already in use
Abstract
The invention relates to a method of assigning addresses in nodes of a telecommunication network. The network comprises several nodes (A...G) connected together by transfer connections so that the network constitutes a tree-like structure, one of the nodes being the root node (A). The nodes transmit to each other signals containing address data used by the nodes. For providing a flexible method easy to use, the root node (A) of the network assigns unique address identifiers to all transfer connections it uses and transmits each address identifier over the transfer connection concerned to its adjacent node, and after having received the address identifier the other nodes of the network a) assign unique identifiers to all transfer connections they use, except to the connection from which they received the address identifier, and b) transmit to each of said transfer connections an address identifier, which comprises the address identifier received by the node itself and the identifier corresponding to said connection, whereby each node assigns its own address by means of the address identifier it has received.
Description
Technical field
The present invention relates to a kind of address distribution method in the node device of tree topology communication network.
Background technology
In this application, the intersection point of telecommunication system transmission connection is called as node device or node.Node can be any equipment or the facility that can influence clock synchronization, for example branch or Cross Connect equipment.
The node of communication network must be known their own addresses (being the position) in network, because the address is depended in the effect of node in the network (configuration etc.).For node can carry out routing addressing for message in network, also need address information.
Many Modern Telecommunication agreements are used logical address, the physical address of these logical addresses and indeterminate indicating equipment.In IP address for example, which equipment in the network is discussed in the host machine part explanation, but therefrom can not obtain the physical address of this equipment in described network.In the network installation stage, and when moving in the network another location, node device all needs to distribute a logical address to node device.Generally by distributing the address for logical address of each equipment manual configuration.This for example can be undertaken by the network management workstation of network management system from network operator, perhaps at first when going into operation with centralized system for each node device distribute one corresponding to network in the address of appointment node location, subsequently, with the position of each node motion to it.
A defective of this method is to need a large amount of work, especially when a bigger network should be installed (this means a large amount of nodes).
Another defective is an ineffective activity relevant with this method when changing network, because be necessary for all new addresses of manual configuration of the position changes in the network all these nodes.
Summary of the invention
The objective of the invention is to have tree topology and comprise novel address distribution method in the node of the communication network that point-to-point connects, realize improving to overcome above-mentioned defective by providing a kind of.This target is by realizing according to method of the present invention, the method is characterized in that the root node of network all transmission connection generation unique address identifiers for its use, and the transmission that passes through to its adjacent node connects each address designator of transmission, and after receiving this address designator, other node of network a) connects for all transmission that they use, except they therefrom receive the connection of address designator, generate unique identifier, b) connect address designator of transmission to each described transmission, it comprises address designator itself that this node receives and corresponding to the identifier of described connection, thereby each node distributes it self address according to its received address designator.
Thought of the present invention is to generate node address automatically by following step in the node of tree network structure: distribute unique identifier to transmit for all (point-to-points) and connect (except leading to the connection of father node), and lower each node (child node) in position sends an address designator in tree structure, this address designator had both comprised the address designator that receives from father node, comprised the identifier of distributing to described connection again.Because the root node of network does not have father node, so the address designator that its sends or only comprise the identifier of distributing to this connection perhaps comprises himself fixing root node address designator and distributes to the identifier that this is connected.
If use, only need to distribute an address to give the root node of network in the installation (perhaps certain other stage) of described node device according to method of the present invention.After this, other node (node device) of network arrives their positional informations with respect to root node with automatic reception.Correspondingly, distribute this address of node in a predefined manner automatically based on the position of node.In addition, when change equipment or installation new equipment, needn't reconfigure the address.
Especially favourable in the very difficult network that inserts of the physical location of node device according to the solution of the present invention.
Description of drawings
Describe invention and preferred embodiments thereof for example in detail below in conjunction with accompanying drawing, in the accompanying drawings:
Fig. 1 has illustrated the General Principle according to method of the present invention;
Fig. 2 a...2f has illustrated according to the operation of method of the present invention when network changes;
The flow chart description of Fig. 3 the operation of individual node equipment;
Fig. 4 be in the node to the high level block diagram of those important parts of the present invention, and
Fig. 5 has illustrated the parts to the important node device of the present invention.
Embodiment
Starting point according to method of the present invention is, only (craft) has distributed the root node address of network when the node device of being discussed is installed.On the other hand, other individual node equipment does not need to know their own addresses (position) in network when beginning.Other individual node equipment is only known that they have to a plurality of point-to-points of other node and is connected.During these connect one is the connection to the father node of node device described in the tree structure, but (when just having started a node) this node does not need to know it under initial conditions these which is relevant connection in connecting.
Below in conjunction with the principle of Fig. 1 description according to method of the present invention.Ring node has been formed a tree-like hierarchical structure, and its root node is indicated by reference mark R.Internodal connection (promptly transmit and connect) is by arrow indication (it is two-way transmitting the connection nature, the transmission of direction of arrow presentation address identifier).To the present invention importantly network form a tree-like hierarchical structure.In other words, the node of network and the internodal acyclic graph (in network, not creating any node) that has been connected to form.
Root node R adopts preordering method for example will connect since 0 and numbers forward, is that each connects definite identifier.After this, root node connects the identifier that sends described connection by each.In the example of Fig. 1, use integer as identifier, represent to N by reference number 0.
If (except root node) started any node (being nodes X) and set up connection, nodes X is waited for its positional information on certain connects.Alternatively, node can send inquiry to adjacent node.If the positional information of receiving, nodes X are registered as this connection the connection of its father node in the tree network structure.The positional information that receives comprises a group identifier, first identifier declaration to the path of nodes X, which connection can be linked into next node from the root node of network by.Next identifier declaration can be more near nodes X from described next node by which connection, the rest may be inferred.In the example of this figure, separate to put between the identifier.
After receiving positional information, nodes X is determined the identifier (according to certain preordering method) of all other connections except the connection that therefrom receives this positional information.After this, nodes X connects the transmission positional information by each, and this positional information adds that by its self-position (it is identical with nodes X reception early) this connection identifier (CID constitutes.
Correspondingly, the positional information length of reception depends on the level of receiving node in the tree.For example in the example of Fig. 1, identifier is putting separate integer, and node A1 is from root node receiving position information 0 (zero), and the Node B 1 of following one deck is from node A1 receiving position information 0.0.The positional information that sends is indicated on the respective links in the figure.
When being established to the new connection of nodes X, this node offers these connection identifier (CIDs (to its numbering) and send positional information on these connects.If receive new location information, then further connect the new location information that transmission has this connection identifier (CID by other from the father node of nodes X.
Fig. 2 a...2f illustrated at node E, F and G and has been connected under the network condition that node A...D worked therein, according to method of the present invention how to work (Fig. 2 a).This figure the is shown in broken lines node of not working.Work node illustrate with solid line, if in the node mark address designator, then this node is also known its address (being its address in network).Correspondingly, empty node is not known their address.Obviously as can be seen, even node starts with any order, this method still can be worked from this example.
Under the situation of Fig. 2 a, in numerous nodes that needs add, only have node F to start, but it break from this network, because its father node (node E) does not start.Under the situation of Fig. 2 b, node E starts, thereby receives address 0.1 from Node B.Node E thereby know and lead to the described connection of its father node in the network.Then, node E is other existing link numbering of starting from scratch with all, and receives and sends himself address by these chains, appends the numbering of described link behind self address.Under this sample situation, an existing link is only arranged, it thus obtained numbering 0, transmission address 0.1.0 it on.This illustrates in Fig. 2 c.After this, node F knows its address (Fig. 2 d).Under Fig. 2 e situation, node G starts, thereby its father node (E) is observed " startup " of this link and provided a numbering (1) according to certain predetermined number method to it, the tabulation of renewal active hyperlink.Then, node E sends an identifier 0.1.1 (himself address add the above link identifiers) to node G.Under last situation (Fig. 2 f), all nodes have all been known their address (position in network).
Link identifiers can be by many different distribution.There is no need to provide numbering, because numbering does not provide any useful additional information with the order that link starts.For example the point on the compass can be used for numbering, and the link towards the north can have numbering 1, and the link of Souteern Exposure can have numbering 0.Another kind of scheme is more possible in practice, and be for example definite in the following manner identifier: if from certain special angle, for example treat this equipment from the front, then identifier changes in the selected direction, for example from left to right or from top to bottom.
The flowchart text of Fig. 3 the operation of individual node.After starting, node is positioned at the stage 31, and it waits for address message and link incident.The node of network can constantly send their address information, thereby this node receives the address immediately after starting.The link incident shows the interruption or the startup of certain link of node in this connection.Stage 31 is incipient stages, and normal transfer of data does not wherein take place.If node is found an address message (stage 32), the address that its storage receives and the identifier of described link, distribution marker are given operating other link, and send the child node (stage 34) of address to it.After this, this node changes to its normal condition (stage 35), and it carries out common transfer of data in this state.
If this node is observed a link incident in the stage 32, its upgrades the lists of links (stage 33) that it safeguards and returns the stage 31, can't insert normal condition in the stage 31, until receiving the address.
In normal condition (stage 35), node can be observed:
A) the link incident of child node (setting up) towards the link interruption of child node or towards the link of new child node;
B) new address message is if this node changes with top (more near father node) in network, perhaps
C) lead to the link interruption of father node
If in the link that situation has been set up new child node in a), the node updates lists of links also sends new address (stage 37).At situation b) in, node enters the stage 34, and the address that its storage receives and the identifier of this link are determined the identifier of operating other link and are sent the address to its child node.At situation c) in, node returns the incipient stage (stage 31), waits for the new address from father node.
The network node that uses preceding method can be a digital cross connect equipment for example, and in fact it can realize in many different ways.Implementation can for example change according to the difference of node control part (part of Control Node operation of equipment) position to some extent.Fig. 4 shows in the node device high level block diagram to those important parts of the present invention.This node (by reference number N indication) has 4 two-way connections (L1...L4) to adjacent node in this embodiment.In this sample situation, the control section CTRL of node is a separate unit, and it is that the total interface unit IF of this node is shared.This node is connected to network by interface unit IF, and this interface can for example be a 2Mbit/sPCM interface.Internodal transfer mode is unimportant to the present invention; For example any method based on frame can be used as transfer mode.
For node importantly, address process part (control unit CTRL) is received the information (promptly whether the signal of Jie Shouing can serve) whether described link is working from each interface unit.Represent this message with reference marker CR (carrier wave) in the figure.Reference marker DATA represents the bidirectional data transfers of carrying out between each interface unit IF and the control unit.
Fig. 5 describes the parts to the important control section CTRL of the present invention in detail.The input of control section is generated by decoding unit 51, decoding unit 51 from the interface unit verification that received this interface unit for example as calculated and a frame.The protocol Data Unit (PDU) that decoding unit is decoded from these frames and wherein comprised, and they are further sent to linkage unit 53.Data cell comprise the frame type that is received information, may be included in the address in the frame and be included in data in the frame.If type is for example normal (normal frame), linkage unit perhaps is connected to other parts of this node device further with data cell or be directly connected to another linkage unit.On sending direction, coding unit 52 generates a frame according to data cell PDU.
If the frame that receives comprises address information, linkage unit is connected to address processing unit 54 with data cell, and the latter is stored in the address that receives among the M1 of memory block, and this node also is stored in it self address among the M1 of this memory block.In addition, processing unit will be stored in towards the link identifiers of father node among the M2 of memory block, and the identifier of other link is stored among the M3 of memory block, and that M3 can also comprise which link of each particular moment is active/information that suppresses.
More than with the formal description of embodiment the present invention, root node only sends the identifier of described transmission link to its adjacent node in this embodiment.But root node can also send it self address except transmitting connection identifier (CID.Therefore, if the root node address for example is 0 in Fig. 1, it sends identifier 0.0 to node A1, and the latter further sends identifier 0.0.0 to Node B 1.Correspondingly, need the address designator that sends than long one deck described above in this case.
Although above example with reference to accompanying drawing has been described the present invention, obviously the present invention does not limit to therewith, can improve in the scope of the innovative idea of describing in set forth above and appended claim book.For example can directly not use the address designator that receives from father node address as node itself, but node distributes himself address (by handling the address designator that receives in a predefined manner, being a unique address designator thereby make final result) according to the address designator that receives from father node.
Claims (7)
1. method of in nodes of telecommunication network, distributing the address, this network comprises some node (A ... G), they link together by transmitting, thereby network has constituted tree structure, one of them node is root node (A), send the signal that comprises the used address date of node each other according to this method node
The method is characterized in that,
The root node of-network (A) transmits connection generation unique address identifiers for all of its use, and passes through to each address designator of transmission connection transmission of its adjacent node, and
-after receiving this address designator, other node of network a) connects for all transmission that they use, except they therefrom receive the connection of address designator, generate unique identifier, b) connect address designator of transmission to each described transmission, it comprises address designator itself that this node receives and corresponding to the identifier of described connection, thereby each node distributes it self address according to its received address designator.
2. according to the method for claim 1, it is characterized in that directly that it is the received address designator of each node is as it self address.
3. according to the method for claim 1, it is characterized in that the root node of network also sends it self address to its adjacent node except the address designator that this transmit to connect.
4. according to the method for claim 1, it is characterized in that, use integer as identifier.
5. according to the method for claim 1, it is characterized in that, transmit the identifier that connects and generate, have nothing to do and be connected the startup order with transmission according to predetermined principle.
6. according to the method for claim 5, it is characterized in that, generate identifier according to transmitting the physical location that connects in the node device.
7. according to the method for claim 1, it is characterized in that, use predetermined separator that the address designator that node received is separated from transmit connection identifier (CID, thereby generate the address designator that node was sent with series form.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| FI961359 | 1996-03-25 | ||
| FI961359A FI103544B1 (en) | 1996-03-25 | 1996-03-25 | Procedure for determining addresses in a data network node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1214831A CN1214831A (en) | 1999-04-21 |
| CN1099794C true CN1099794C (en) | 2003-01-22 |
Family
ID=8545727
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN97193323.5A Expired - Fee Related CN1099794C (en) | 1996-03-25 | 1997-03-24 | Method of assigning addresses in nodes of telecommunication network |
Country Status (6)
| Country | Link |
|---|---|
| CN (1) | CN1099794C (en) |
| AU (1) | AU2162297A (en) |
| DE (1) | DE19781632T1 (en) |
| FI (1) | FI103544B1 (en) |
| GB (1) | GB2325833B (en) |
| WO (1) | WO1997036406A1 (en) |
Families Citing this family (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3222086B2 (en) * | 1997-04-07 | 2001-10-22 | 矢崎総業株式会社 | Tree structure address setting method and system |
| GB2348569B (en) * | 1999-03-31 | 2003-11-05 | Ericsson Telefon Ab L M | IP Address allocation for mobile terminals |
| US6859821B1 (en) | 1999-07-19 | 2005-02-22 | Groove Networks, Inc. | Method and apparatus for prioritizing data change requests and maintaining data consistency in a distributed computer system equipped for activity-based collaboration |
| CN1319334C (en) * | 2003-01-28 | 2007-05-30 | 华为技术有限公司 | Protection method for core domain of multiple spanning tree in switching network |
| CN100387011C (en) * | 2004-03-15 | 2008-05-07 | 华为技术有限公司 | A node addressing method |
| CN100454861C (en) * | 2004-03-15 | 2009-01-21 | 华为技术有限公司 | Method of node addressing in cascade networking system |
| JP4780340B2 (en) * | 2005-03-04 | 2011-09-28 | 日本電気株式会社 | Node, network, correspondence creation method, and frame transfer program |
| CN100387018C (en) * | 2005-04-12 | 2008-05-07 | 华为技术有限公司 | Method for obtaining tree group network topological structure and address distributing method |
| CN100449997C (en) * | 2006-06-02 | 2009-01-07 | 华为技术有限公司 | Netting communication system and its node address distribution method |
| US8040823B2 (en) | 2007-01-08 | 2011-10-18 | Industrial Technology Research Institute | Method and system for network data transmitting |
| FR2918232B1 (en) * | 2007-06-28 | 2010-11-26 | Airbus France | METHODS AND DEVICES FOR THE COMMUNICATION OF DIAGNOSTIC DATA IN A REAL-TIME COMMUNICATION NETWORK |
| CN101577707B (en) * | 2008-05-09 | 2013-03-06 | 北京启明星辰信息技术股份有限公司 | Element identifier distribution method and application layer routing method based on element identifier |
| CN101841737B (en) * | 2009-03-20 | 2012-12-12 | 中国石油天然气集团公司 | Cross station address allocation system |
| CN102984185B (en) * | 2011-09-05 | 2015-12-16 | 北京大学 | A kind of synchronous method of distributed, multi-layer application system identification information and system |
| CN102307249B (en) * | 2011-09-28 | 2014-01-22 | 北京东土科技股份有限公司 | IP address automatic configuration method based on link layer topology |
| CN102946450B (en) * | 2012-12-06 | 2015-06-24 | 中国科学技术大学苏州研究院 | Address assignment method for resource-constrained nodes in tree-shaped ubiquitous network |
| EP3278544A1 (en) * | 2015-04-01 | 2018-02-07 | Intelligent Lumen, S.L.U. | Connecting lighting devices |
| WO2017216614A1 (en) * | 2016-06-17 | 2017-12-21 | Telefonaktiebolaget Lm Ericsson (Publ) | Generating unique random strings as element identifiers |
| US10033625B2 (en) * | 2016-12-07 | 2018-07-24 | Mediatek Singapore Pte. Ltd. | Loop avoidance in repeater networks |
| CN112787898B (en) * | 2020-12-29 | 2022-03-04 | 美的集团股份有限公司 | Device data communication method, device, electronic device and storage medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0634537B2 (en) * | 1987-01-12 | 1994-05-02 | 富士通株式会社 | Inter-device communication control method |
| US5027342A (en) * | 1989-05-03 | 1991-06-25 | The University Of Toronto Innovations Foundation | Local area network |
| US5394556A (en) * | 1992-12-21 | 1995-02-28 | Apple Computer, Inc. | Method and apparatus for unique address assignment, node self-identification and topology mapping for a directed acyclic graph |
| JP3297763B2 (en) * | 1993-02-01 | 2002-07-02 | ソニー株式会社 | Data transmission method, concentrator, and terminal device |
| FR2715787B1 (en) * | 1994-01-31 | 1996-03-29 | Hussein Zoghaib | Pulse train transmission system. |
| KR100417672B1 (en) * | 1995-06-30 | 2004-05-31 | 코닌클리케 필립스 일렉트로닉스 엔.브이. | Method and apparatus for routing messages within a network of nodes |
-
1996
- 1996-03-25 FI FI961359A patent/FI103544B1/en active
-
1997
- 1997-03-24 GB GB9818440A patent/GB2325833B/en not_active Expired - Fee Related
- 1997-03-24 AU AU21622/97A patent/AU2162297A/en not_active Abandoned
- 1997-03-24 DE DE19781632T patent/DE19781632T1/en not_active Ceased
- 1997-03-24 WO PCT/FI1997/000189 patent/WO1997036406A1/en active Application Filing
- 1997-03-24 CN CN97193323.5A patent/CN1099794C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| GB2325833A (en) | 1998-12-02 |
| FI961359A (en) | 1997-09-26 |
| WO1997036406A1 (en) | 1997-10-02 |
| FI103544B (en) | 1999-07-15 |
| FI961359A0 (en) | 1996-03-25 |
| AU2162297A (en) | 1997-10-17 |
| DE19781632T1 (en) | 1999-04-01 |
| GB9818440D0 (en) | 1998-10-21 |
| GB2325833B (en) | 2000-04-26 |
| CN1214831A (en) | 1999-04-21 |
| FI103544B1 (en) | 1999-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1099794C (en) | Method of assigning addresses in nodes of telecommunication network | |
| AU601571B2 (en) | Transfer of messages in a multiplexed system | |
| AU691337B2 (en) | Method and arrangement for process based message handling in a communication system | |
| EP0146966B1 (en) | Combined computer system | |
| CN1110210C (en) | Route finding in communications networks | |
| CN1378368A (en) | Net gate system and fault management method | |
| EP0698975A2 (en) | A method of multicasting | |
| EP0599480A1 (en) | Communication in a computer network | |
| CN1277375C (en) | Switching method between permanent connection and exchage connection in optical network | |
| EP0851707A2 (en) | Address assignment in an ATM switched network | |
| CN1139865A (en) | Method and equipment of responsing route selection control | |
| CN1230090A (en) | Communication system architecture and operating methods thereof | |
| US5029165A (en) | Method of allotting links and routing messages for a common channel type signalling transfer point | |
| CN1290089A (en) | Automatic telecommunication link identifying system | |
| EP0602830A2 (en) | Automatic network element identity information distribution apparatus and method | |
| US20020156925A1 (en) | Gateway system and integrated management method | |
| JPH1027147A (en) | Server address management system | |
| CN1812362A (en) | Gateway unit | |
| US5844895A (en) | ATM communications network | |
| US6600583B1 (en) | Optical internet router | |
| CN1127245C (en) | Communications system to transmit data packet with allocated routin information | |
| CN1139266C (en) | Signal service routing method for No.7 signal command network link group | |
| CN100488117C (en) | Method for automatically obtaining topological relation of telecommunication device | |
| KR0152390B1 (en) | Mobile telecommunication system | |
| CN1232585A (en) | Hierarchical synchronization system |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20030122 Termination date: 20100324 |