WO1997036406A1 - Method of assigning addresses in nodes of a telecommunication network - Google Patents
Method of assigning addresses in nodes of a telecommunication network Download PDFInfo
- Publication number
- WO1997036406A1 WO1997036406A1 PCT/FI1997/000189 FI9700189W WO9736406A1 WO 1997036406 A1 WO1997036406 A1 WO 1997036406A1 FI 9700189 W FI9700189 W FI 9700189W WO 9736406 A1 WO9736406 A1 WO 9736406A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- address
- nodes
- network
- identifier
- Prior art date
Links
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
- Computer And Data Communications (AREA)
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
METHOD OF ASSIGNING ADDRESSES IN NODES OF A TELECOMMUNICATION
NETWORK
The invention relates to a method of assigning addresses in nodal devices of a telecommunication network having a tree-like topology, according to the preamble of the attached claim 1.
In this description, intersections of transfer connections of a tele¬ communication system are called nodal devices or nodes. A node can be any device or equipment that is able to interfere in clock synchronization, e.g. a branching or cross-connect device.
The nodes of a telecommunication network have to know their own addresses (i.e. locations) in the network, because the role of the node in the network (configuration etc.) depends on the address. An address information is necessary also in order that the node may route messages in the network. Many modern telecommunication protocols use logical addresses not informing unambiguously the physical location of the device. In an internet address, for instance, the host section informs which device is in question in one network, from which, however, no conclusions can be drawn about the physical location of the device in said network. The nodal device shall be as- signed a logical address at the installation stage of the network and also when the nodal device is moved to another location in the network. An address is assigned typically by configuring a logical address for each device manually. This can take place e.g. by means of a network management system from a network management workstation of a network operator, or by assigning at first each nodal device at commissioning in a centralized manner an address corresponding to the intended location of the node in the network, and subse¬ quently, each node is moved to its own location.
A drawback of such methods is the great amount of work required, especially when a big network shall be installed (which means a large number of nodes).
Another drawback is the inflexibility associated with such methods in situations of changing the network, because a new address must be config¬ ured manually for all such nodes the location of which in the network has changed. The object of the present invention is to effect an improvement for overcoming the above drawbacks by providing a novel method of assigning
addresses in the nodes of a telecommunication network having a tree-like to¬ pology and consisting of point-to-point connections. This object is achieved by means of the method according to the invention, which is characterized in what is described in the characterizing portion of the attached claim 1. The idea of the invention is to form node addresses in the nodes of a tree-like network structure automatically by assigning unique identifiers to all (point-to-point) transfer connections except to the connection leading to a par¬ ent node, and by transmitting to each node situated lower down in the tree-like structure (a child node) an address identifier consisting both of an address identifier received from the parent node and of an identifier assigned to said connection. Because the root node of the network has no parent node, it transmits either an address identifier consisting merely of the identifier as¬ signed to the connection or an address identifier consisting of the own fixed address identifier of the root node and of the identifier assigned to the connec- tion.
When the method according to the invention is used, only the root node of the network has to be assigned an address at the installation of said nodal device (or at some other stage). Subsequently, the other nodes (nodal devices) of the network receive automatically an information of their location with respect to the root node. Accordingly, the address of the node is assigned automatically in a predetermined manner on the basis of the location of the node. Additionally, when devices are changed or new ones are installed, a re¬ configuration of addresses is avoided.
The solution according to the invention is very advantageous espe- cially in networks where nodal devices are physically situated at such locations that they are difficult to access.
In the following, the invention and its preferred embodiments are described in greater detail by way of example with reference to the attached drawings, in which Figure 1 illustrates the general principle of the method according to the invention,
Figures 2a...2f illustrate the operation of the method according to the invention in situations of changing the network,
Figure 3 is a flow chart describing the operation of an individual nodal device,
Figure 4 is a high-level block diagram of those parts of the node which are substantial for the invention, and
Figure 5 illustrates the parts of the nodal device which are substan¬ tial for the invention. The starting point of the method according to the invention is that only the root node of the network is assigned (manually) an address when the nodal device in question is installed. On the other hand, the other individual nodal devices do not need to know their own addresses (i.e. locations) in the network when they are started. The other individual nodal devices know only that they have a number of point-to-point connections to other nodes. One of these connections is a connection to the parent node of said nodal device in the tree structure, but in the initial situation (when a node is started) the node does not need to know, which of its connections is the connection concerned.
The principle of the method according to the invention will be de- scribed in the following with reference to Figure 1. Encircled nodes constitute a tree-like hierarchic structure, the root node of which is indicated by reference mark R. Links (i.e. transfer connections) between the nodes are indicated by arrows (the transfer connections are naturally bidirectional, the arrow direction representing transmission of address identifiers). Essential for the invention is that the network constitutes a tree-like hierarchic structure. In other words, the nodes of the network and the connections between them form an acyclic graph (no nodes are produced in the network).
The root node R determines identifiers for each connection e.g. by numbering the connections from zero onwards by using a predetermined method. Subsequently, the root node transmits over each connection the identifier of said connection. In the example case of the figure, integers are used as identifiers, indicated by reference marks 0 to N.
When any node (i.e. node X), except the root node, has started and connections have been established, node X waits for information of its location over some connection. Alternatively, the node may send an inquiry to adjacent nodes. When receiving the location information, node X registers this connec¬ tion as the connection leading to its parent node in the tree-like network structure. The location information received consists of a set of identifiers, the first one informing over which connection there is access from the root node of the network to next node on the way to node X. The next node informs the connection over which there is access from said next node closer to node X,
etc. In the example of the figure, the identifiers are separated from each other by a dot.
After having received the location information, node X determines identifiers (according to a predetermined method) for all other connections ex- cept the one from which the location information was received. Subsequently, node X transmits over each connection a location information consisting of its own location (which is the same as was received by node X earlier) added by the identifier of the connection in question.
Accordingly, the length of the location information received depends on the Ievel of the receiving node in the tree. In the example of Figure 1 , for instance, in which the identifiers are integers separated from each other by a dot, node A1 receives location information 0 (zero) from the root node and node B1 at next Ievel receives location information 0.0 from node A1. The lo¬ cation data transmitted are indicated in the figure at the corresponding link. When new connections then are established to node X, the node provides them with identifiers (numbers them) and transmits location informa¬ tion over them. If a new location information is received from the parent node of node X, it is transmitted further over other connections, provided with the identifier of the connection in question. Figures 2a...2f illustrate how the method according to the invention functions in a situation in which nodes E, F and G are connected to a network in which nodes A... D are already operational (Figure 2a). The figures show in broken lines the nodes not yet operating. The nodes which operate are shown with an unbroken line, and if an address identifier is denoted inside the node, the node also knows its address (i.e. its location in the network). Accordingly, empty nodes do not know their address yet. From the example, it appears that the method is functioning, even if the nodes start in an arbitrary order.
In the situation of Figure 2a, only node F among the nodes to be added has started, but it is disengaged from the network, because its parent node (node E) has not yet started. In the situation of Figure 2b, node E has started, whereby it receives an address 0.1 from node B. Node E thus knows that said connection leads to its parent node in the network. Node E numbers then all other existing links beginning from zero and transmits over them its own address, after which is added the number of said link. In this example case, there is only one existing link, which thus gets the number zero and over which is transmitted the address 0.1.0. This is illustrated in Figure 2c. After
this, node F knows its address (Figure 2d). In case of Figure 2e, node G starts, whereby its parent node (E) observes the "starting" of the link and up¬ dates the list of active links by providing it with a number (one) according to a predetermined numbering method. Node E then sends node G an identifier 0.1.1 (own address added by the identifier of said link). In the final situation (Figure 2f) all nodes know their addresses (locations in the network).
Link identifiers can be assigned in many different ways. It is not worth while to give numbers in the same order as the links start, because numbering does not give any useful additional information then. Points of compass, for instance, could be utilized for the numbering, a link towards north could be provided with number one and a link towards south could be zero. Another alternative, more probable in the practice, is to determine identifiers for instance in such a way that when the device is looked at from a certain di¬ rection, e.g. from the front, the identifiers change in the selected direction, e.g. from the left to the right or from above downwards.
The flow chart of Figure 3 illustrates the operation of an individual node. After having started, the node is at stage 31 , where it waits for an ad¬ dress message and a link event. The nodes of the network can send their ad¬ dress information continuously, whereby the node receives the address imme- diately after having started. Link event signifies in this connection a breaking or starting of some link of the node. Stage 31 is the starting stage, where no normal data transmission occurs. When a node observes an address message (stage 32), it stores the received address and the identifier of said connection, assigns identifiers to the other links in operation and transmits addresses to its child nodes (stage 34). Subsequently, the node changes to its normal state (stage 35), where it performs normal data transmission.
If the node observes a link event at stage 32, it updates the linkage listing maintained by it (stage 33) and returns to stage 31 , from where there is no access to the normal state until after the address has been received. In normal state (stage 35), the node is able to observe: a) a link event of a child node (a link leading to a child node breaks or a link to a new child node is established) b) a new address message, if changes occur in the network above the node (closer to the root node), or c) a breaking of a link leading to a parent node.
In case a), the node updates the linkage listing and sends a new address, if a link was established to a new child node (stage 37). In case b), the node moves to stage 34, where it stores the received address and the identifier of the connection in question, determines identifiers for the other links in operation and sends the addresses to its child nodes. In case c), the node moves back to the starting stage (stage 31) to wait for a new address from the parent node.
The node of a network using a method as described above can be e.g. a digital cross-connect device and it can be implemented in many different ways in practice. The way of implementation can vary e.g. according to where a control section of the node (the section that controls the operation of the nodal device) is located. Figure 4 shows a high-level block diagram of those parts of the nodal device which are substantial for the invention. The node (indicated by reference mark N) has in this case four bidirectional connections (L1...L4) to adjacent nodes. In this example case, the control section CTRL of the node is a separate unit, which is common to all interface units IF of the node. The node is connected to the network through the interface units IF, the interface can be e.g. a 2 Mbit/s PCM interface. The transfer mode between the nodes is not essential for the invention; any frame-based method can be used as transfer mode, for instance.
It is essential for the node that the address processing section (control unit CTRL) receives from each interface unit an information of whether said link is in operation (i.e. whether the signal to be received is serviceable). This message is indicated in the figure by reference mark CR (carrier). Refer- ence mark DATA denotes bidirectional data transmission taking place be¬ tween each interface unit IF and the control unit.
Figure 5 illustrates in greater detail the parts of the control section CTRL which are essential for the invention. The input of the control section is formed by a decoding unit 51 , which receives from the interface unit e.g. a frame for which the interface unit has calculated a checksum. The decoding unit decodes from the frames the Protocol Data Units (PDU) contained therein and transmits them further to a connection unit 53. The data units contain in¬ formation of the type of the frame received, the address possibly included in the frame and the data included in the frame. If the type is e.g. normal (normal frame), the connection unit connects the data units further either directly to
another connection unit or to other parts of the nodal device. In transmission direction, a coding unit 52 generates a frame going out of the data units PDU.
If the received frame contains address information, the connection unit connects the data unit to an address processing unit 54, which stores the received address in a storage area M1, where the node has its own address stored. Additionally, the processing unit stores the identifier of the link leading to the parent node in a storage area M2 and the identifiers of the other links in a storage area M3, which also may contain the information of which link is ac¬ tive/passive at each particular time. The invention is described above as an embodiment in which the root node transmits to its adjacent node only the identifier of said transfer con¬ nection. However, the root node may transmit except the identifier of the transfer connection also its own address. Consequently, if the address of the root node is e.g. zero in Figure 1 , it transmits to node A1 the identifier 0.0, which further transmits the identifier 0.0.0 to node B1. Accordingly, the ad¬ dress identifier to be transmitted becomes in this case one Ievel longer than above.
Though the invention has been described above referring to the ex¬ amples of the attached drawings, it is obvious that the invention is not re- stricted to that but it can be modified within the scope of the inventive idea set forth above and in the attached claims. It is for instance possible that the ad¬ dress identifier received from the parent node is not used directly as the ad¬ dress of the node itself, but the node assigns its own address according to the address identifier received from the parent node (by processing the address identifier received in a predetermined manner so that the final result is a unique address identifier).
Claims
1. A method of assigning addresses in nodes of a telecommunica¬ tion network, which network comprises several nodes (A...G) connected to- gether by transfer connections so that the network constitutes a tree-like structure, one of the nodes being the root node (A), according to which method the nodes transmit to each other signals containing address data used by the nodes, characterized in that - the root node (A) of the network forms unique address identifiers for 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) form unique identifiers for all transfer connections they use, except for the connection from which they received the address identifier, and b) transmit to each of said transfer connections an address identifier, which com¬ prises the address identifier received by the node itself and the identifier cor¬ responding to said connection, whereby each node assigns its own address by means of the address identifier it has received.
2. A method according to claim 1, cha racterized in that each node uses the address identifier it has received directly as its own ad¬ dress.
3. A method according to claim 1, characterized in that the root node of the network transmits except the address identifier of the transfer connection also its own address to its adjacent node.
4. A method according to claim 1, cha racte rized in that integers are used as identifiers.
5. A method according to claim 1, c haracterized in that the identifiers of the transfer connections are formed according to a predeter- mined principle irrespective of in which order the transfer connections are started.
6. A method according to claim 5, cha racterized in that the identifiers are formed according to the physical location of the transfer connection in the nodal device.
7. A method according to claim 1, c ha racterized in that the address identifier transmitted by the node is formed in serial form by sepa- rating the address identifier received by the node from the identifier of the transfer connection with a predetermined separator.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AU21622/97A AU2162297A (en) | 1996-03-25 | 1997-03-24 | Method of assigning addresses in nodes of a telecommunication network |
| DE19781632T DE19781632T1 (en) | 1996-03-25 | 1997-03-24 | Method for assigning addresses in nodes of a telecommunications network |
| GB9818440A GB2325833B (en) | 1996-03-25 | 1997-03-24 | Method of assigning addresses in nodes of a telecommunication network |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| FI961359A FI103544B (en) | 1996-03-25 | 1996-03-25 | Procedure for determining addresses in a data network node |
| FI961359 | 1996-03-25 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO1997036406A1 true WO1997036406A1 (en) | 1997-10-02 |
Family
ID=8545727
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/FI1997/000189 WO1997036406A1 (en) | 1996-03-25 | 1997-03-24 | Method of assigning addresses in nodes of a telecommunication network |
Country Status (6)
| Country | Link |
|---|---|
| CN (1) | CN1099794C (en) |
| AU (1) | AU2162297A (en) |
| DE (1) | DE19781632T1 (en) |
| FI (1) | FI103544B (en) |
| GB (1) | GB2325833B (en) |
| WO (1) | WO1997036406A1 (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0871310A2 (en) * | 1997-04-07 | 1998-10-14 | Yazaki Corporation | Tree structure address setting method and system for embodying the same |
| WO2001006364A2 (en) * | 1999-07-19 | 2001-01-25 | 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 |
| EP1944926A2 (en) | 2007-01-08 | 2008-07-16 | Industrial Technology Research Institute | Method and system for network data trasmitting |
| CN1367974B (en) * | 1999-03-31 | 2011-08-17 | 艾利森电话股份有限公司 | IP address allocation for mobile terminals |
| CN101841737B (en) * | 2009-03-20 | 2012-12-12 | 中国石油天然气集团公司 | Cross station address allocation system |
| CN102946450A (en) * | 2012-12-06 | 2013-02-27 | 中国科学技术大学苏州研究院 | Address assignment method for resource-constrained nodes in tree-shaped ubiquitous network |
| CN102984185A (en) * | 2011-09-05 | 2013-03-20 | 北京大学 | A synchronization method and a system for identification information of a distributed multi-level application system |
| WO2016155820A1 (en) * | 2015-04-01 | 2016-10-06 | 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 |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1319334C (en) * | 2003-01-28 | 2007-05-30 | 华为技术有限公司 | Protection method for core domain of multiple spanning tree in switching network |
| CN100454861C (en) * | 2004-03-15 | 2009-01-21 | 华为技术有限公司 | Method of node addressing in cascade networking system |
| CN100387011C (en) * | 2004-03-15 | 2008-05-07 | 华为技术有限公司 | A node addressing method |
| CN101171802B (en) * | 2005-03-04 | 2010-06-02 | 日本电气株式会社 | Node, network, creating method of corresponding relation for transmitting information in network |
| 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 |
| 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 |
| CN102307249B (en) * | 2011-09-28 | 2014-01-22 | 北京东土科技股份有限公司 | IP address automatic configuration method based on link layer topology |
| 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 |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0275076A2 (en) * | 1987-01-12 | 1988-07-20 | Fujitsu Limited | Control system for communication between units |
| EP0396084A2 (en) * | 1989-05-03 | 1990-11-07 | The University Of Toronto Innovations Foundation | Fault-tolerant star interconnected local area network |
| EP0614297A2 (en) * | 1993-02-01 | 1994-09-07 | Sony Corporation | Star configuration network system |
| 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 |
| WO1995020849A1 (en) * | 1994-01-31 | 1995-08-03 | Hussein Zoghaib | System for the transmission of pulse streams |
| WO1997002680A1 (en) * | 1995-06-30 | 1997-01-23 | Philips Electronics N.V. | A method and apparatus for routing messages in a network of nodes |
-
1996
- 1996-03-25 FI FI961359A patent/FI103544B/en active
-
1997
- 1997-03-24 AU AU21622/97A patent/AU2162297A/en not_active Abandoned
- 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
- 1997-03-24 DE DE19781632T patent/DE19781632T1/en not_active Ceased
- 1997-03-24 GB GB9818440A patent/GB2325833B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0275076A2 (en) * | 1987-01-12 | 1988-07-20 | Fujitsu Limited | Control system for communication between units |
| EP0396084A2 (en) * | 1989-05-03 | 1990-11-07 | The University Of Toronto Innovations Foundation | Fault-tolerant star interconnected 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 |
| EP0614297A2 (en) * | 1993-02-01 | 1994-09-07 | Sony Corporation | Star configuration network system |
| WO1995020849A1 (en) * | 1994-01-31 | 1995-08-03 | Hussein Zoghaib | System for the transmission of pulse streams |
| WO1997002680A1 (en) * | 1995-06-30 | 1997-01-23 | Philips Electronics N.V. | A method and apparatus for routing messages in a network of nodes |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0871310A2 (en) * | 1997-04-07 | 1998-10-14 | Yazaki Corporation | Tree structure address setting method and system for embodying the same |
| EP0871310A3 (en) * | 1997-04-07 | 1999-06-16 | Yazaki Corporation | Tree structure address setting method and system for embodying the same |
| US6125365A (en) * | 1997-04-07 | 2000-09-26 | Yazaki Corporation | Tree structure address setting method for automatically assigning addresses for a plurality of relay units connected in a tree |
| CN1367974B (en) * | 1999-03-31 | 2011-08-17 | 艾利森电话股份有限公司 | IP address allocation for mobile terminals |
| WO2001006364A3 (en) * | 1999-07-19 | 2004-05-13 | 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 |
| 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 |
| US7490126B2 (en) | 1999-07-19 | 2009-02-10 | Microsoft Corporation | Method and apparatus for generating data change requests containing data consistency information in a peer-to-peer collaborative computer system |
| WO2001006364A2 (en) * | 1999-07-19 | 2001-01-25 | 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 |
| US8024404B2 (en) | 1999-07-19 | 2011-09-20 | Microsoft Corporation | Method and apparatus for designating endpoints in a collaborative computer system to facilitate maintaining data consistency |
| EP1944926A2 (en) | 2007-01-08 | 2008-07-16 | Industrial Technology Research Institute | Method and system for network data trasmitting |
| EP1944926A3 (en) * | 2007-01-08 | 2011-12-07 | Industrial Technology Research Institute | Method and system for network data trasmitting |
| CN101841737B (en) * | 2009-03-20 | 2012-12-12 | 中国石油天然气集团公司 | Cross station address allocation system |
| CN102984185A (en) * | 2011-09-05 | 2013-03-20 | 北京大学 | A synchronization method and a system for identification information of a distributed multi-level application system |
| CN102984185B (en) * | 2011-09-05 | 2015-12-16 | 北京大学 | A kind of synchronous method of distributed, multi-layer application system identification information and system |
| CN102946450A (en) * | 2012-12-06 | 2013-02-27 | 中国科学技术大学苏州研究院 | Address assignment method for resource-constrained nodes in tree-shaped ubiquitous network |
| WO2016155820A1 (en) * | 2015-04-01 | 2016-10-06 | 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 |
| US10855650B2 (en) | 2016-06-17 | 2020-12-01 | Telefonaktiebolaget Lm Ericsson (Publ) | Generating unique random strings as element identifiers |
Also Published As
| Publication number | Publication date |
|---|---|
| FI103544B1 (en) | 1999-07-15 |
| FI961359A (en) | 1997-09-26 |
| GB2325833A (en) | 1998-12-02 |
| CN1099794C (en) | 2003-01-22 |
| AU2162297A (en) | 1997-10-17 |
| GB9818440D0 (en) | 1998-10-21 |
| DE19781632T1 (en) | 1999-04-01 |
| FI961359A0 (en) | 1996-03-25 |
| FI103544B (en) | 1999-07-15 |
| GB2325833B (en) | 2000-04-26 |
| CN1214831A (en) | 1999-04-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO1997036406A1 (en) | Method of assigning addresses in nodes of a telecommunication network | |
| US4466060A (en) | Message routing in a computer network | |
| US6477566B1 (en) | Method and system of providing improved network management data between a plurality of network elements and a management system for increasing a flow and decreasing an amount of data transfer | |
| US6160795A (en) | Network communication | |
| EP0602824B1 (en) | Automatic network element identity information registration apparatus and method | |
| JPH0783380B2 (en) | Data communication system | |
| JPH05122240A (en) | Vpi vci allocation system in atm transmission | |
| CA2089726C (en) | Detour path determination method | |
| US5537547A (en) | Automatic network element identity information distribution apparatus and method | |
| US6404740B1 (en) | System for testing internal connectivity in ATM switching equipment | |
| KR910004806B1 (en) | Method for routing and assigning signal link of common signal transfer repeater | |
| US7181534B2 (en) | Address resolution protocol to map internet protocol addresses to a node transport identifier | |
| EP0602823B1 (en) | Automatic detection of reachable network elements | |
| US20060236267A1 (en) | Communications network planning system, method for creating communication network diagrams and control program for a communications network planning system | |
| EP0602825B1 (en) | Logical integration of multiple network elements in a telecommunications management network | |
| EP0923269B1 (en) | Capability modeling using templates in network management system | |
| US8127042B1 (en) | Data driven connection rule/constraint engine applied to trail management | |
| US20030223749A1 (en) | Optical network management | |
| Cisco | Routing DECnet | |
| Cisco | Routing DECnet | |
| EP0932278A1 (en) | Network system | |
| JPH07143140A (en) | Universal link configurator | |
| KR100348905B1 (en) | Network Structure of Internet Protocol over WDM | |
| JP3255238B2 (en) | Communication control processor | |
| JPH06105904B2 (en) | Communication method between local networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| WWE | Wipo information: entry into national phase |
Ref document number: 97193323.5 Country of ref document: CN |
|
| AK | Designated states |
Kind code of ref document: A1 Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH HU IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK TJ TM TR TT UA UG US UZ VN YU AM AZ BY KG KZ MD RU TJ TM |
|
| AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH KE LS MW SD SZ UG AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF |
|
| DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| ENP | Entry into the national phase |
Ref document number: 9818440 Country of ref document: GB Kind code of ref document: A |
|
| NENP | Non-entry into the national phase |
Ref document number: 97534061 Country of ref document: JP |
|
| RET | De translation (de og part 6b) |
Ref document number: 19781632 Country of ref document: DE Date of ref document: 19990401 |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 19781632 Country of ref document: DE |
|
| 122 | Ep: pct application non-entry in european phase | ||
| NENP | Non-entry into the national phase |
Ref country code: CA |
|
| REG | Reference to national code |
Ref country code: DE Ref legal event code: 8607 |
|
| REG | Reference to national code |
Ref country code: DE Ref legal event code: 8607 |