WO1997036406A1 - Procede permettant des affectations d'adresses au niveau des noeuds d'un reseau de telecommunications - Google Patents

Procede permettant des affectations d'adresses au niveau des noeuds d'un reseau de telecommunications Download PDF

Info

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
Application number
PCT/FI1997/000189
Other languages
English (en)
Inventor
Petri MIKKILÄ
Original Assignee
Nokia Telecommunications Oy
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nokia Telecommunications Oy filed Critical Nokia Telecommunications Oy
Priority to AU21622/97A priority Critical patent/AU2162297A/en
Priority to DE19781632T priority patent/DE19781632T1/de
Priority to GB9818440A priority patent/GB2325833B/en
Publication of WO1997036406A1 publication Critical patent/WO1997036406A1/fr

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

Definitions

  • 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.
  • 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.
  • 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).
  • 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.
  • the root node of the network has to be assigned an address at the installation of said nodal device (or at some other stage).
  • 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.
  • FIGS. 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.
  • 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.
  • 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.
  • Encircled nodes constitute a tree-like hierarchic structure, the root node of which is indicated by reference mark R.
  • Links i.e. transfer connections
  • 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.
  • integers are used as identifiers, indicated by reference marks 0 to N.
  • node X 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.
  • node X 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.
  • the length of the location information received depends on the Ievel of the receiving node in the tree.
  • 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.
  • 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.
  • 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.
  • 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).
  • 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.
  • the 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.
  • 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.
  • the node 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.
  • the node 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.
  • the node updates the linkage listing and sends a new address, if a link was established to a new child node (stage 37).
  • 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.
  • 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.
  • 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.
  • 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.
  • FIG. 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.
  • a coding unit 52 In transmission direction, a coding unit 52 generates a frame going out of the data units PDU.
  • 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.
  • 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).

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)
  • Computer And Data Communications (AREA)

Abstract

La présente invention concerne un procédé permettant d'affecter des adresses au niveau des noeuds d'un réseau de télécommunications. Un tel réseau comporte plusieurs noeuds (A...G) interconnectés par des connexions de transfert faisant que le réseau présente une structure arborescente, l'un des noeuds étant le noeud racine (A). Les noeuds émettent les uns aux autres des signaux contenant des données d'adresses utilisées par les noeuds. Pour mettre en oeuvre un procédé souple, facile à utiliser, le noeud racine (A) du réseau affecte à toutes les connexions de transfert qu'il utilise des identifiants d'adresses uniques puis il émet à son noeud adjacent, via la connexion de transfert concernée, chacun des identifiants d'adresses. Une fois qu'ils ont reçu les identifiants d'adresses, les autres noeuds du réseau (a) affectent des identifiants uniques à toutes les connexions de transfert qu'ils utilisent, sauf à la connexion par laquelle ils ont reçu l'identifiant d'adresse, puis (b) émettent à chacune de ces connexions de transfert un identifiant d'adresse constitué, non seulement de l'identifiant d'adresse reçu par le noeud lui-même, mais aussi de l'identifiant correspondant à la connexion considérée, chaque noeud utilisant l'identifiant d'adresse qu'il a reçue pour faire sa propre affectation d'adresse.
PCT/FI1997/000189 1996-03-25 1997-03-24 Procede permettant des affectations d'adresses au niveau des noeuds d'un reseau de telecommunications WO1997036406A1 (fr)

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 (de) 1996-03-25 1997-03-24 Verfahren zum Zuweisen von Adressen in Knoten eines Telekommunikationsnetzes
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
FI961359 1996-03-25
FI961359A FI103544B1 (fi) 1996-03-25 1996-03-25 Menetelmä osoitteiden määrittämiseksi tietoliikenneverkon solmuissa

Publications (1)

Publication Number Publication Date
WO1997036406A1 true WO1997036406A1 (fr) 1997-10-02

Family

ID=8545727

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/FI1997/000189 WO1997036406A1 (fr) 1996-03-25 1997-03-24 Procede permettant des affectations d'adresses au niveau des noeuds d'un reseau de telecommunications

Country Status (6)

Country Link
CN (1) CN1099794C (fr)
AU (1) AU2162297A (fr)
DE (1) DE19781632T1 (fr)
FI (1) FI103544B1 (fr)
GB (1) GB2325833B (fr)
WO (1) WO1997036406A1 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0871310A2 (fr) * 1997-04-07 1998-10-14 Yazaki Corporation Procédé et système pour allocation des adresses dans une structure en arbre
WO2001006364A2 (fr) * 1999-07-19 2001-01-25 Groove Networks, Inc. Procede permettant de lister les priorites des demandes de changement de donnees et de maintenir la coherence des donnees dans un systeme d'exploitation reparti equipe pour une collaboration dans des activites
EP1944926A2 (fr) 2007-01-08 2008-07-16 Industrial Technology Research Institute Procédé et système de distribution de données de réseau
CN1367974B (zh) * 1999-03-31 2011-08-17 艾利森电话股份有限公司 对移动终端的ip地址分配
CN101841737B (zh) * 2009-03-20 2012-12-12 中国石油天然气集团公司 一种交叉站地址分配系统
CN102946450A (zh) * 2012-12-06 2013-02-27 中国科学技术大学苏州研究院 树形泛在网络中资源受限节点的地址分配方法
CN102984185A (zh) * 2011-09-05 2013-03-20 北京大学 一种分布式、多层级应用系统标识信息的同步方法及系统
WO2016155820A1 (fr) * 2015-04-01 2016-10-06 Intelligent Lumen, S.L.U. Connexion de dispositifs d'éclairage
WO2017216614A1 (fr) * 2016-06-17 2017-12-21 Telefonaktiebolaget Lm Ericsson (Publ) Génération de chaînes aléatoires uniques en tant qu'identifiants d'éléments

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1319334C (zh) * 2003-01-28 2007-05-30 华为技术有限公司 一种交换网络中多生成树核心域的保护方法
CN100387011C (zh) * 2004-03-15 2008-05-07 华为技术有限公司 一种节点寻址方法
CN100454861C (zh) * 2004-03-15 2009-01-21 华为技术有限公司 级联组网系统中的节点寻址方法
JP4780340B2 (ja) * 2005-03-04 2011-09-28 日本電気株式会社 ノード，ネットワーク，対応関係作成方法及びフレーム転送プログラム
CN100387018C (zh) * 2005-04-12 2008-05-07 华为技术有限公司 树型组网拓扑结构的获取及地址分配方法
CN100449997C (zh) * 2006-06-02 2009-01-07 华为技术有限公司 一种组网通信系统及其节点地址的分配方法
FR2918232B1 (fr) * 2007-06-28 2010-11-26 Airbus France Procedes et dispositifs pour la communication de donnees de diagnostic dans un reseau de communication temps reel
CN101577707B (zh) * 2008-05-09 2013-03-06 北京启明星辰信息技术股份有限公司 元件标识分发方法及基于该元件标识的应用层路由方法
CN102307249B (zh) * 2011-09-28 2014-01-22 北京东土科技股份有限公司 一种基于链路层拓扑的ip地址自动配置方法
US10033625B2 (en) * 2016-12-07 2018-07-24 Mediatek Singapore Pte. Ltd. Loop avoidance in repeater networks
CN112787898B (zh) * 2020-12-29 2022-03-04 美的集团股份有限公司 设备数据通信方法、装置、电子设备及存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0275076A2 (fr) * 1987-01-12 1988-07-20 Fujitsu Limited Système de commande pour communication entre unités
EP0396084A2 (fr) * 1989-05-03 1990-11-07 The University Of Toronto Innovations Foundation Réseau local interconnecté en étoile tolérant les fautes
EP0614297A2 (fr) * 1993-02-01 1994-09-07 Sony Corporation Système de réseau à configuration en étoile
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 (fr) * 1994-01-31 1995-08-03 Hussein Zoghaib Systeme de transmission de trains d'impulsions
WO1997002680A1 (fr) * 1995-06-30 1997-01-23 Philips Electronics N.V. Procede et dispositif d'acheminement de messages dans un reseau de noeuds

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0275076A2 (fr) * 1987-01-12 1988-07-20 Fujitsu Limited Système de commande pour communication entre unités
EP0396084A2 (fr) * 1989-05-03 1990-11-07 The University Of Toronto Innovations Foundation Réseau local interconnecté en étoile tolérant les fautes
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 (fr) * 1993-02-01 1994-09-07 Sony Corporation Système de réseau à configuration en étoile
WO1995020849A1 (fr) * 1994-01-31 1995-08-03 Hussein Zoghaib Systeme de transmission de trains d'impulsions
WO1997002680A1 (fr) * 1995-06-30 1997-01-23 Philips Electronics N.V. Procede et dispositif d'acheminement de messages dans un reseau de noeuds

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0871310A2 (fr) * 1997-04-07 1998-10-14 Yazaki Corporation Procédé et système pour allocation des adresses dans une structure en arbre
EP0871310A3 (fr) * 1997-04-07 1999-06-16 Yazaki Corporation Procédé et système pour allocation des adresses dans une structure en arbre
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 (zh) * 1999-03-31 2011-08-17 艾利森电话股份有限公司 对移动终端的ip地址分配
WO2001006364A3 (fr) * 1999-07-19 2004-05-13 Groove Networks Inc Procede permettant de lister les priorites des demandes de changement de donnees et de maintenir la coherence des donnees dans un systeme d'exploitation reparti equipe pour une collaboration dans des activites
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 (fr) * 1999-07-19 2001-01-25 Groove Networks, Inc. Procede permettant de lister les priorites des demandes de changement de donnees et de maintenir la coherence des donnees dans un systeme d'exploitation reparti equipe pour une collaboration dans des activites
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 (fr) 2007-01-08 2008-07-16 Industrial Technology Research Institute Procédé et système de distribution de données de réseau
EP1944926A3 (fr) * 2007-01-08 2011-12-07 Industrial Technology Research Institute Procédé et système de distribution de données de réseau
CN101841737B (zh) * 2009-03-20 2012-12-12 中国石油天然气集团公司 一种交叉站地址分配系统
CN102984185A (zh) * 2011-09-05 2013-03-20 北京大学 一种分布式、多层级应用系统标识信息的同步方法及系统
CN102984185B (zh) * 2011-09-05 2015-12-16 北京大学 一种分布式、多层级应用系统标识信息的同步方法及系统
CN102946450A (zh) * 2012-12-06 2013-02-27 中国科学技术大学苏州研究院 树形泛在网络中资源受限节点的地址分配方法
WO2016155820A1 (fr) * 2015-04-01 2016-10-06 Intelligent Lumen, S.L.U. Connexion de dispositifs d'éclairage
WO2017216614A1 (fr) * 2016-06-17 2017-12-21 Telefonaktiebolaget Lm Ericsson (Publ) Génération de chaînes aléatoires uniques en tant qu'identifiants d'éléments
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
GB2325833A (en) 1998-12-02
FI961359A (fi) 1997-09-26
FI103544B (fi) 1999-07-15
FI961359A0 (fi) 1996-03-25
AU2162297A (en) 1997-10-17
CN1099794C (zh) 2003-01-22
DE19781632T1 (de) 1999-04-01
GB9818440D0 (en) 1998-10-21
GB2325833B (en) 2000-04-26
CN1214831A (zh) 1999-04-21
FI103544B1 (fi) 1999-07-15

Similar Documents

Publication Publication Date Title
WO1997036406A1 (fr) Procede permettant des affectations d'adresses au niveau des noeuds d'un reseau de telecommunications
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 (fr) Appareil et méthode d'enregistrement automatique d'informations d'identité d'éléments de réseau
JPH0783380B2 (ja) データ通信システム
JPH05122240A (ja) Ａｔｍ伝送におけるｖｐｉ，ｖｃｉ割り当て方式
CA2089726C (fr) Methode de determination de chemin de detour
US5537547A (en) Automatic network element identity information distribution apparatus and method
US6404740B1 (en) System for testing internal connectivity in ATM switching equipment
KR910004806B1 (ko) 공통선 신호방식 중계기의 신호링크 할당과 루팅방법
US7181534B2 (en) Address resolution protocol to map internet protocol addresses to a node transport identifier
EP0602823B1 (fr) Détection automatique des éléments de réseau accessibles
US20060236267A1 (en) Communications network planning system, method for creating communication network diagrams and control program for a communications network planning system
EP0602825B1 (fr) Intégration logique d'éléments multiples de réseau dans un réseau de gestion de télécommunication
EP0923269B1 (fr) Modélisation de possibilités en utilisant des chablons dans un système de gestion de réseau
KR0152390B1 (ko) 이동통신 시스템에서의 제어국과 기지국간의 다중화된 중계선 경로 구성 및 그 제어방법
US8127042B1 (en) Data driven connection rule/constraint engine applied to trail management
US20030223749A1 (en) Optical network management
Cisco Routing DECnet
Cisco Routing DECnet
EP0932278A1 (fr) Système de réseau
JPH07143140A (ja) ユニバーサル・リンク・コンフィギュレータ
US20020163930A1 (en) Methods and systems for interleaving data from multi-rate channels into a single interface
KR100348905B1 (ko) 파장분할다중 기반 인터넷 프로토콜 망 구조 및 파장 라우팅 방법

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