EP1500235A1 - Configuration automatique d'acheminement pour liaisons m3ua quasi-associees - Google Patents

Configuration automatique d'acheminement pour liaisons m3ua quasi-associees

Info

Publication number
EP1500235A1
EP1500235A1 EP03722297A EP03722297A EP1500235A1 EP 1500235 A1 EP1500235 A1 EP 1500235A1 EP 03722297 A EP03722297 A EP 03722297A EP 03722297 A EP03722297 A EP 03722297A EP 1500235 A1 EP1500235 A1 EP 1500235A1
Authority
EP
European Patent Office
Prior art keywords
network node
distance
message
information
network
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.)
Withdrawn
Application number
EP03722297A
Other languages
German (de)
English (en)
Inventor
Manfred Angermayr
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Siemens Corp
Original Assignee
Siemens AG
Siemens Corp
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 Siemens AG, Siemens Corp filed Critical Siemens AG
Publication of EP1500235A1 publication Critical patent/EP1500235A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/0016—Arrangements providing connection between exchanges
    • H04Q3/0025—Provisions for signalling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13109—Initializing, personal profile
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13176—Common channel signaling, CCS7
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13353—Routing table, map memory

Definitions

  • the present invention relates to a method for use in packet-based telecommunications systems, the method used to determine topological features of the network and to take these into account when selecting the route.
  • Network nodes in a telecommunications system can be designed for different functions.
  • a network node in the form of a signaling transfer point (STP) can be present in a network with separate user and signaling channels.
  • the signaling messages are only forwarded in such an STP.
  • the actual processing of the signaling information takes place in the so-called signaling end points (SEPs).
  • STP signaling transfer point
  • a network node can also be in the form of a 'gateway'. In this case, it forms a connecting network node between different networks.
  • a gateway with which signaling messages can be processed and / or forwarded is referred to as a signaling gateway (SG).
  • SG signaling gateway
  • an SG can connect an integrated services digital network (ISDN) to the Internet.
  • ISDN integrated services digital network
  • a 'media gateway' is used to create a connection-oriented telephone network with packet-based networks, for example connected to the internet.
  • the media gateway processes voice signals in particular for their further processing in the other network.
  • a 'Media Gateway Controller' is responsible for controlling the media gateways. In the signaling network, this acts as a SEP in the Internet protocol (IP) network.
  • An MGC is typically connected to the signaling system number 7 (Signaling System Nu 7, SS7) network via an SG.
  • SGs can be designed with STP functionality, in particular they can serve as routers for signaling messages. If signaling takes place via STPs, one speaks of 'quasi-associated' signaling.
  • Protocols that regulate the exchange of information are used for communication between the network nodes. If several protocols work together, this is called a protocol family.
  • An example of such a protocol family is the SS7, which is used in digital telecommunications networks for signaling between the network nodes.
  • the part of SS7 that regulates message transmission is called the 'Message Transfer Part' (MTP).
  • MTP 'Message Transfer Part
  • M3UA Level 3 User Adaptation'
  • the M3UA is connected to the MTP via an interworking function. With the M3UA, for example, the signaling between MGC and SG or between two SGs is transmitted.
  • the so-called 'dynamic configuration function' is also part of the M3UA protocol and is used to register an MGC with an SG.
  • the MGC sends the SG a registration message ('Registration Request'), which contains the address of the MGC in the SS7 network in the form of the 'point code'.
  • the MGC can be deregistered from a SG with its point code by means of a corresponding deregistration message.
  • SEPs have no transfer function. Therefore, registration messages relating to their own point code are sent out by them, but they do not forward other registration messages. This applies in particular to MGCs.
  • STPs or gateways can be used to route messages for transmission in a packet-based telecommunications network by forwarding the data packets in sections from one network node to the next.
  • the section on a route that is located between two network nodes is referred to below as a partial transmission link.
  • the data packets are routed through the network on the basis of information in the routing databases which are present in the network nodes.
  • the address of a data packet is usually specified by specifying the destination point code ('Destination Point Code', DPC).
  • the 'Routing Information Protocol' is a special 'Interior Gateway Protocol' (IGP) in the context of IP, which is used to distribute routing information in an autonomous network system.
  • IGP Interior Gateway Protocol
  • OSPF Open Shortest Path First'
  • the routes are set up manually by the operator for all possible destination addresses in every SG with STP functionality according to the current state of the art. If there are several possible routes - and this is the rule for safety reasons - the operator must manually assign priorities corresponding to the possible routes for each destination. This information is stored in the routing database. Changing this database is also only possible through manual intervention by the operator. This creates an administrative effort.
  • the route via which a message is sent depends on the current state of the routes.
  • STP the one of the available routes that has the highest priority is selected to send a message. If this fails, a replacement route with a lower priority is used.
  • the object of the invention is to automate the process of establishing a routing database in an SS7 network or in a network with corresponding properties as largely or partially as possible. This object is achieved with the methods specified in the independent patent claims. Advantageous embodiments of the invention are specified in the dependent claims.
  • information about a distance is sent from a network node, hereinafter referred to as 'A', in a first step a.) To its immediate neighboring network nodes as part of a registration message.
  • the network can be an SS7 network, for example.
  • the network node 'A' can in particular be a SEP, for example an MGC.
  • the immediate neighboring network nodes can in particular be STPs, for example in the form of SGs.
  • the registration message can be, for example, an MTP or an M3UA message.
  • 'Distance' here denotes the number of partial transmission links on a specific route between two network nodes. For example, the route from a network node 'k' to a network node 'm' has the value two if it runs from 'k' to ' m ' via a network node '1', because in this case there are two partial transmission links, the first of 'k ' after '1' and the second from '1' after 'm'.
  • Another ' tag ' for an additional parameter can be introduced into the already existing registration message as part of the implementation of the method according to the invention, with the aid of which the distance value can be specified.
  • This form of distance specification corresponds to the specification of a distance between two network nodes in the form of so-called 'hop counts'.
  • the distance information which is sent by 'A' in the above-mentioned first step of the method according to the invention relates to the distance from the network node 'A' to the network node 'A', that is to itself.
  • the distance in this case is thus the value zero.
  • the distance information sent by 'A' contains, in addition to the value itself, in particular the indication of the sender of the message, in our case the address of 'A', for example in the form of a point code.
  • network node 'A' sends at least one direct neighboring network node.
  • the aim here is that the method according to the invention can be carried out with all direct neighboring network nodes of 'A', at least if they act as STP, and 'A' sends the distance information accordingly to all these neighboring network nodes.
  • 'X' The distance value sent by 'A' in a receiving neighboring network node, hereinafter referred to as 'X' by way of example, is increased by one and in step c.) Together with the specification of the network node 'A' stored in the routing database of 'X'.
  • node 'A' now acts as the destination node for a potential future transmission. Therefore, the distance information received by 'X' is stored in 'X' after the increment carried out in step b.). For example, this information can be saved in the routing table of 'X'. In addition to the distance value itself, in particular the potential target network node - in our case al-'A '- and, as further routing information, the next neighboring network node to be controlled from' X 'on the route under consideration - in our case again 'A' - saved.
  • step d. The distance information modified by step b.) Is forwarded from 'X' to at least one direct neighboring network node of 'X', for example referred to as 'U' in the following.
  • This message can in turn take place, for example, as part of a registration message using the MTP or the M3UA protocol.
  • This distance information transmitted from 'X' contains, in addition to the distance value itself - in our example, one - in particular the indication of the potential target network node - in our case, therefore, 'A' - and the indication of the of the neighboring nodes of 'X' - in our example of "u" - made on this so Festge ⁇ laid route to be driven neighboring nodes - in our example 'X'.
  • steps b.) To d.) are now repeated.
  • the distance information sent from 'X' to 'U' is increased by one in 'U'
  • Step b. Stored in the routing database of 'U' (step c.)) And in turn forwarded to immediate neighboring network nodes (step d.)).
  • a network node does not always use the distance value that was calculated by the described increment in step b.)
  • transmitting the distance information If a smaller distance value for one in the routing database for the target network node concerned If there is an alternative route, this can be used for onward dispatch. In this way, information about the shortest possible route is disseminated.
  • this process is continued until a defined termination criterion is met. This could be the case, for example, if all network nodes registered in the network receive the distance information originating from ' A ' to have.
  • a termination criterion is that
  • each network node After a certain time, each network node receives distance information to potential target network nodes using the method according to the invention.
  • two or more distance information items are present in a network node for a specific destination network node, which relate to different routes and have different values.
  • the different routes for a potential destination network node are advantageously classified in the network node, in particular given different priorities, taking into account the distance values.
  • the routes with the smallest distance values are assigned the highest priority level. Routes with higher distance values and correspondingly lower priority levels can be set up as 'backup routes'.
  • Priorities can be taken into account for network nodes to the potential target network node, and transmission paths with high priorities can be preferred in particular.
  • route selection can be easily carried out, for example, in 'load sharing mode'.
  • a network node that has been made available to the network as a new network node is first registered with its neighboring network node as part of a registration message and step a.) Is carried out before it is used for the further transmission of other distance information in the context of Step b.) Is used. This supports a smooth procedure, especially if it is an SS7 network or a comparable network.
  • a distance to a potential target network node may change.
  • the network node concerned is registered again in the network by the described method.
  • the corresponding distance information for example in the routing table, is then updated in the network nodes which receive such a message.
  • an 'Application Server Process Up' (ASP UP) message or an 'Application Server Process Up Acknowledgment' (ASP UP ACK) message is exchanged between network nodes when the connection is established.
  • the ASP UP message or the ASP UP ACK message can be expanded accordingly, for example.
  • You can insert an info string in these messages, for example, which contains information about it (e.g. info string 'support automatic route configuration').
  • a network node therefore only registers destination network nodes with its neighboring network nodes if the corresponding neighboring network node itself is not at a shorter distance from this destination. If the corresponding neighboring network node is at the same distance from the destination, the destination is nevertheless registered so that any alternative routes can be set up using this information.
  • the MTP Level 3 procedure for sending so-called 'Preventive Transfer Prohibited' (preventive TFP) messages or a so-called 'Destination unavailable' (DUNA) message offers a further protection against circular routing if it is a M3UA connection. Such a message is sent to a neighboring network node that is currently used for routing. This prevents messages from swinging back and forth between two network nodes and thus ping-pong routing.
  • preventive transfer prohibited procedure For networks with automatic routing configuration, it is possible to extend the preventive transfer prohibited procedure by sending preventive transfer prohibited messages not only with regard to the routes that are currently in use, but with respect to all routes that are the same distance apart to the corresponding target network node, like the one currently used.
  • the information about this can be communicated when a new STP is set up become.
  • This information can be found in the information string of an ASP, for example
  • manual configuration can also be used to determine which network nodes can handle the automatic configuration procedure.
  • an STP or SG knows which SS7 target network nodes are directly connected to it with an SS7 linkset. Since there is a direct SS7 linkset (not via another STP) to such network nodes, the distance must be one. Distance information with a distance value of one can therefore also be forwarded to direct neighboring network nodes if the potential target network node is a network node on which the method according to the invention is not implemented. In this way, routing information regarding such potential target network nodes that are directly connected with SS7 links can also be integrated into the method.
  • a default value e.g. three
  • routes that have such network nodes as potential destination network nodes can be configured manually.
  • M3UA registration messages which are transmitted in accordance with the M3UA protocol
  • the corresponding information point code, distance, network work appearance
  • the routing information could be exchanged between the SGs via separate Transmission Control Protocol (TCP) / IP connections.
  • TCP Transmission Control Protocol
  • STPs in an SS7 network that are not connected to one another via the M3UA protocol in the process of automatic route configuration.
  • Fig. 5 shows an extended 'Preventive TFP' or DUNA rule.
  • Fig. 1 shows a schematic representation of a telecommunications network 1, the five network nodes' A '2,' X '3,' Y ' 4, ' U '5 and' V 6 and seven connections (7, 8, 9, 10, 11, 12, 13) between them as elements.
  • the network nodes 'X' 3, ⁇ '4,' U '5,' V 6 are signaling gateways (SGs) which act as signaling serve as transfer transfer points (STPs).
  • 'A' is a signaling end point (SEP), for example a media gateway controller (MGC).
  • SEP signaling end point
  • MCC media gateway controller
  • the short designation 'X' is used instead of 'network node' X '' or 'signaling gateway' X '', and analog short designations are used for the other network nodes.
  • Each of the network nodes has an address in the SS7 network, which is specified as a point code.
  • the point code of the destination network node is specified as the destination point code (DPC).
  • 'A' 2 has been set up as a new MGC in the network, is thus available to the network as a new network node and, according to the invention, is passed on to the other SGs 'X' 3, 'Y' 4, 'IT 5 and' V 6 is passed on.
  • 'A' 2 sends a message to its immediate neighbors 'X' 3 and 'Y' 4, in which the distance from 'A' to 'A', i.e. ' to itself' according to the definition given above the distance is specified with zero.
  • This can be done, for example, when using the M3UA protocol as part of a registration message. This is described below
  • the distance value is increased by one in each of them, because the distance from 'X' 3 to 'A' 2 is one, as well the distance from 'Y' 4 to 'A' 2.
  • This locally adapted distance information is stored, for example, in the respective 'routing databases' of the SGs 'X' 3 and 'Y' 4.
  • the highest possible priority is assigned in 'X' 3 and 'Y' 4 of the - direct - route to 'A' 2 defined in this way. This is in the routing database of 'X' 3 for example in the form
  • the information stored and processed in this way is forwarded by the SGs 'X' 3 and 'Y' 4 to other neighboring SGs.
  • the corresponding message from 'X' 2 to 'Y' 4 is:
  • This distance information is in turn incremented and stored in 'Y' 4. Since the route from 'Y' 4 via 'X' 3 to 'A' 2 is further than the direct route, the route 'YX' is given a lower priority, so that the routing database from 'Y' 4 is finally found : Routing to A
  • 'X' 3 the distance information in the example shown, sends to all of its immediate neighbor SGs, except at 'A' 2, for in 'A' 2 is the route by 'A' 2, the distance value zero in front, whereas in 'X' 3 for the route to ⁇ '2 the distance value one, that is to say a larger value, and according to the invention no distance information is sent in this case. Furthermore, 'U' 5 sends according to the invention
  • this message is not sent to 'X' 3 because 'X' 3 already has a route to 'A' 2 with a shorter distance.
  • Priority 1 VX, VY (dist 2) • Priority 2: VU (dist 3)
  • FIG. 2 shows the case in which the information that a previously registered route is no longer available is disseminated in the network by means of a registration message. All symbols and names have the same meaning as in FIG. 1, unless stated otherwise.
  • the situation is assumed to exist after the completion of the sequence example shown in FIG. 1.
  • the route that is no longer available in the example shown is the partial transmission route between 'A' 2 and 'Y' 4. This information is in the first step of ' A'
  • routing database of 'Y' 4 thus remains 'A' 2 for the potential target SG
  • Priority 1 YX (dist 2)
  • Priority 2 YV (dist 3)
  • FIG. 3 shows how, starting from the final state of the process shown in FIG. 2, a renewed registration of 'A' 2 is carried out at 'Y' 4. From 'A' 2 a new registration message is first sent to 'Y' 4:
  • the starting situation here is the one that has set in after the completion of the sequence shown in FIG. 1.
  • 'X' 3 sends a message with destination 'A' 2 via the route with the highest priority, i.e. 'XA'. If the partial transmission link between 'X' 3 and 'A' 2 fails, messages are sent from 'X' 3 via 'Y' 4 to 'A' 2.
  • a TFP or DUNA message regarding 'A' 2 is sent from 'X' 3 'Y' 4 sent. This message indicates 'Y' 4 that the connection 'YX' can no longer be used for a transmission with destination 'A' 2 until further notice. This is valid until 'X' 3 sends a TFA message again.
  • the SGs ' X ' 3,' Y '4,' U '5 and' V 6 each have a direct connection to 'A' 2 and are each connected to two immediate neighboring SGs, each via run two alternative routes with a distance of two, ie lower priority.
  • the 'Preventive TFP' rule has been extended. As soon as a SG currently uses a route to 'A' 2, not only a 'Preventive TFP' message is sent about the currently used route, but also on all those routes to 'A' 2 that are the same distance as the current one have used.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Procédé utilisé dans un réseau de télécommunication basé sur des paquets, qui est destiné en particulier à des noeuds de réseau fonctionnant en tant que points de transfert de signalisation, à l'aide duquel des informations concernant la topologie du réseau sont diffusées. Ces noeuds de réseau contiennent en particulier des informations sur les distances séparant les noeuds de réseau et des noeuds cibles potentiels pour des transmissions futures de messages. Ces informations peuvent être diffusées dans le cadre de messages d'enregistrement, par exemple à l'aide du protocole M3UA, et peuvent être utilisées dans les noeuds de réseau pour établir une base de données d'acheminement.
EP03722297A 2002-04-26 2003-04-24 Configuration automatique d'acheminement pour liaisons m3ua quasi-associees Withdrawn EP1500235A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10218809 2002-04-26
DE10218809 2002-04-26
PCT/DE2003/001335 WO2003092225A1 (fr) 2002-04-26 2003-04-24 Configuration automatique d'acheminement pour liaisons m3ua quasi-associees

Publications (1)

Publication Number Publication Date
EP1500235A1 true EP1500235A1 (fr) 2005-01-26

Family

ID=29264863

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03722297A Withdrawn EP1500235A1 (fr) 2002-04-26 2003-04-24 Configuration automatique d'acheminement pour liaisons m3ua quasi-associees

Country Status (3)

Country Link
US (1) US20050237944A1 (fr)
EP (1) EP1500235A1 (fr)
WO (1) WO2003092225A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
ATE502487T1 (de) 2005-11-30 2011-04-15 Nokia Siemens Networks Gmbh Verfahren und vorrichtung zum selbstkonfigurieren eines virtuellen vermittlungssystems
EP3098795B1 (fr) * 2007-04-05 2020-01-29 Siemens Schweiz AG Transmission d'un message dans un système de signalisation d'alarme sans fil à sauts multiples
CN101383840B (zh) * 2007-09-05 2011-12-21 华为技术有限公司 一种基于m3ua协议组网的网络、装置及消息传输方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5235599A (en) * 1989-07-26 1993-08-10 Nec Corporation Self-healing network with distributed failure restoration capabilities
EP0935368A1 (fr) * 1997-11-03 1999-08-11 Canon Kabushiki Kaisha Détection de chemin dans un réseau distribué
US6490244B1 (en) * 2000-03-09 2002-12-03 Nortel Networks Limited Layer 3 routing in self-healing networks
US7031288B2 (en) * 2000-09-12 2006-04-18 Sri International Reduced-overhead protocol for discovering new neighbor nodes and detecting the loss of existing neighbor nodes in a network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO03092225A1 *

Also Published As

Publication number Publication date
US20050237944A1 (en) 2005-10-27
WO2003092225A1 (fr) 2003-11-06

Similar Documents

Publication Publication Date Title
DE60022602T2 (de) Verfahren, Vorrichtung und Computerprogramm um Topologiedaten eines Link State Routing Netzwerkes aktuell zu halten
DE60037368T2 (de) Verfahren und Architektur zur Unterstüzung von mehreren Diensten in einem Etikettvermittlungsnetzwerk
EP2090037B1 (fr) Procédé d'implantation de chemins bidirectionnels de transmission de données dans un réseau maillé de communication sans fil
DE602005002382T2 (de) Verteilte dynamische Leitweglenkung
WO1996010308A1 (fr) Procede et dispositif d'adressage d'utilisateurs dans un reseau comprenant au moins deux segments
EP2055056A1 (fr) Procédé et noeud de réseau permettant d'acheminer des paquets de données dans des réseaux de communication
EP1348307A1 (fr) Systeme de transmission de signalisations entre differents reseaux
EP1397009B1 (fr) Méthode et dispositif de routage de messages dans les réseaux SS7
EP2775677A1 (fr) Procédé de transmission de paquets de données dans un réseau de données à partir d'une pluralité de noeuds de réseau
WO2004019565A1 (fr) Acheminement d'intra-domaine efficace dans des reseaux de commutation par paquets
EP1500235A1 (fr) Configuration automatique d'acheminement pour liaisons m3ua quasi-associees
EP1031241B1 (fr) Point de signalisation d'un reseau de signalisation
EP1108335B1 (fr) Systeme de signalisation d'un point de signalisation
DE10047131B4 (de) Verfahren zum Betreiben eines Zugangsnetzes
WO2020193138A1 (fr) Procédé de communication de données et programme informatique
DE102005028008A1 (de) Verfahren und unabhängiges Kommunikationsteilnetz zum Ermitteln labelvermittelter Routen in einem solchen Kommunikationsteilnetz
EP1317150B1 (fr) Procédé pour transmettre une identification d'une unité de noeud de réseau, dispositif associé et programme associé
EP1701557B1 (fr) Méthode pour la transmission de messages SS7, arrangement de réseau et élément de réseau
EP1234462B1 (fr) Procede et dispositif pour connecter des reseaux de communication
DE102004031717A1 (de) Effiziente Berechnung von Routingtabellen für ein Routing anhand von Zieladressen
EP1065901A2 (fr) Procédé d'établissement d'une connexion de télécommunication par un réseau interposé
EP1133195B1 (fr) Système et procédé de signalisation, ainsi qu'arrangement d'au moins deux points de signalisation avec des tels systèmes de signalisation pour économiser sur les voies de transmission
DE2225233C3 (de) Schaltungsanordnung fur Fernmeldevermittlungsnetze, insbesondere Fernsprechvermittlungsnetze, mit Einrichtungen zur Verkehrsmessung
EP2048834A1 (fr) Procédé, réseaux et noeuds de réseau pour la sélection d'une route
DE102004021651A1 (de) Verfahren zum Routing von Daten

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20040920

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20061101