WO2005011206A1 - Verfahren und netzknoten zur meldung mindestens eines ausgefallenen verbindungsweges innerhalb eines kommunikationsnetzes - Google Patents
Verfahren und netzknoten zur meldung mindestens eines ausgefallenen verbindungsweges innerhalb eines kommunikationsnetzes Download PDFInfo
- Publication number
- WO2005011206A1 WO2005011206A1 PCT/EP2004/051540 EP2004051540W WO2005011206A1 WO 2005011206 A1 WO2005011206 A1 WO 2005011206A1 EP 2004051540 W EP2004051540 W EP 2004051540W WO 2005011206 A1 WO2005011206 A1 WO 2005011206A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- network node
- routing
- path
- destination
- connection path
- Prior art date
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/22—Alternate routing
-
- 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/02—Topology update or discovery
- H04L45/026—Details of "hello" or keep-alive messages
-
- 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/24—Multipath
-
- 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/28—Routing or path finding of packets in data switching networks using route fault recovery
Definitions
- Method and network node for reporting at least one failed connection path within a communication network are described.
- the invention relates to a method according to the preamble of claims 1 and 8, and a network node according to the preamble of claim 9.
- routing For routing, routing or for the transmission of data packets with a destination address, such as Internet Protocol packets, or IP packets for short, or Protocol Data Units, or PDUs for short, from a sender to a receiver in a number of network nodes, such as routers, switches or Various routing methods are used for gateways, packet-switching data networks, such as Internet Protocol networks, IP networks for short, or Open System Interconnect networks, OSI networks for short.
- the routing determines the way in which the data packets get from the sender to the receiver, or respectively the destination, destination network node or destination system.
- RIP Raster Information Protocol
- OSPF Open Shortest Path First
- EIGRP Enhancend Inferior Gateway Routing Protocol
- the data packets are usually transmitted from the sender to the receiver or destination via the shortest or most effective route.
- Alternative routes are only calculated, determined and used in the event of an error.
- So-called multipath routing or multipath forwarding is used in order to achieve greater reliability against the transmission of data packets.
- successive packets or groups of packets, so-called flows are transmitted from the transmitter to the receiver in different or several ways in accordance with a fixed traffic distribution, which is determined by the traffic distribution weights assigned in each case.
- the traffic distribution weights determine the traffic load per route for a destination address.
- the traffic distribution weight is usually a value between 0 and 1, where 0 stands for no traffic and 1 for maximum traffic on a connection or a route.
- a traffic distribution weight of 1 means that all packets are sent this way.
- the traffic is divided up based on the weights. The sum of the traffic distribution weights to one
- the destination in a network node results in 1, i.e. 100% of the traffic.
- Other value systems can also be used for traffic distribution, for example percentages between 0% and 100%.
- a network node or a router has three routes to a destination or receiver, the traffic can be divided equally over all three routes. Each route would then have a traffic distribution weight of about 0.33. This would send a third of all packets or flows via one path each. Other distributions are also possible, for example 0.5 for the first, 0.3 for the second and 0.2 for the third way. With this distribution, 50% of the packets are sent via the first route, ie every second packet is forwarded via this route, 30% of the packets are sent via the second route and 20% of the packets via the third route. The distribution can be determined depending on the desired traffic flow, the load on the connections, distances per link, number of nodes to the destination or other criteria.
- a) more than one route, ie at least one alternative route, to the destination must be available in a network node. This enables a quick local reaction to link failures. Furthermore, b) the chaining of the multipath routing paths between the network nodes and across several network nodes must not lead to loops. Routing loops lead to the circling of packets in the network. Circulating packets increase the load on the links and network nodes in the data network, thus also reducing the transport capacity of the network and leading to considerable unnecessary packet delays or packet losses.
- FIG. 1 shows an arrangement of a part of a packet-switching data network, for example an Internet Protocol (IP) network, consisting of three network nodes R1, R2, R3, such as routers, switches, gateways or other similar switching devices, each via connections or links L12, L13, L32 are connected to each other in a triangle.
- IP Internet Protocol
- the network nodes R1 and R3 have connections to one, not shown
- Data packets for the destination D received by the network node R1 are sent to the network node R2 via the connection L12 and forwarded to the destination D.
- data packets received by the network node R3 for the destination D are sent to the network node R2 via the connection L32 and forwarded to the destination D.
- packets are considered that are sent via the network node or router R1 and the connection L12 to the network node or router R2 in order to be forwarded to their destination D by the network node R2. It is irrelevant whether there were other routes through the network under consideration for these packets in addition to the route via the network node R1.
- the network node R1 could initially also forward packets to the network node R2 via the connection L13 to the network node R3 , if they are passed on from there via the connection L32 to the network node R2.
- the network node R3 could forward packets to the network node R2 via the connection L13 to the network node R1 if they are forwarded from there via the connection L12 to the network node R2.
- the routing tables would then be, including the traffic distribution weights px and p 3 for the alternative routes:
- the probability p ⁇ p 3 arose that, for example, a packet from the network node R1 on the way to the network node R2 first via the connection L13 to the network node R3 and then again from the network node R3 would be forwarded via the connection L13 to the network node R1.
- the probability (P 1 P3) 2 this would happen to a packet twice in a row.
- the probability of sending a package back and forth n times would be (p ⁇ p 3 ) n .
- the forwarding of packets from network node R1 to network node R2 would thus not be realized in a loop-free manner.
- the solution to the problem mentioned is to refrain from traffic distribution and instead to give the network nodes locally applicable rules.
- the traffic distribution weight for the critical alternative paths, ie the potential loops, is set to the minimum value, ie to zero.
- the paths are kept in the routing table and are referred to as so-called "joker links".
- the nodes now use the rule that they only use the links provided with the minimum traffic distribution weight if the desired neighboring router or next hop can no longer be reached via any other path that has a positive weight.
- the advantage of this method is that in the case of multipath or multi-way routing in particular, an alternative route can be made available, with no packets circulating in the network.
- the method works without considering the origin address of packets and without network-wide status information.
- FIG. 1 shows the arrangement of a part of a packet-switching data network that has already been described in the introduction. Based on the procedure described there, the following entries for the destination D in the routing tables of the network nodes R1 and R3 result for the known method:
- a packet that arrives at the network node R1 for forwarding to the destination D is normally always forwarded directly to the network node R2 via the primary connection L12. Only when the network node R1 determines that the connection L12 has failed is the distribution weight changed locally, for example, and further packets to the destination D are forwarded to the network node R3 via the replacement routing path L13.
- the entries in the routing table of the network node Rl in the event of a connection L12 failure would then be: In node Rl:
- the network node R3 forwards the packets only directly via its primary connection L32 to the network node R2, since according to the same rule it only uses the entry for the destination D in its routing table which carries a positive weight.
- packets for destination D can only be sent back and forth between network node R1 and network node R3 if network node R2 fails or both connections L12 and L32 fail. This creates a "one-hop" routing loop between Rl and R3. If the traffic to destination D were to be lost as a result, there would be no greater damage, since destination D cannot be reached anyway due to the error.
- connection L13 and the resources in the network nodes R1 and R3 are also used by other traffic relationships, this traffic is massively impaired by the circling packets intended for the destination D between R1 and R3.
- the circling packets can overload the connection L13 and the network nodes or routers R1 and R3.
- An intuitively obvious option. would be to modify the so-called packet forwarding in the network node or router data path such that the network node or router never sends packets back to the node from which it received them. Even if technical solutions can be developed for this, they are quite complex and require a drastic modification of today's network node or router implementations.
- the object of the present invention is now to operate a communication network consisting of a plurality of network nodes in such a way that routing loops are avoided when using joker links and when connection paths fail.
- the advantage of the invention is that when joker links are used and two connection paths or connections fail, a circling of packets is prevented and thus overloading of connection paths or connections and network nodes is avoided.
- the invention specifies a method with which loops, which can occur when joker links are used and connection paths fail, are automatically recognized and interrupted without the involvement of a central unit.
- a message at the start of a fault and a message at the end of a fault is transmitted from one network node to its neighboring network node. This has the advantage that only a minimal number of messages are used for fault transmission.
- keep-alive messages are expanded and used for fault transmission.
- This has the advantage that a known message is used for fault transmission, which is also generated and transmitted very quickly and cyclically.
- the method according to the invention is explained in more detail below on the basis of the arrangement according to FIG. 1 already described in connection with the prior art.
- FIG. 1 shows the arrangement of a part of a packet-switching data network that has already been described in the introduction. Based on the procedure described there, a so-called one-hop loop occurs when both routers adjacent to the joker link, in the example the network nodes R1 and R3, each recognize a fault or an error in the direction of the network node R2 and autonomously detect the Activate the joker link in your direction.
- each of the two network nodes R1 and R3 is informed when the network node at the other end of the joker link, in the example R3 or R1, can no longer reach the network node R2.
- the network node Rl uses its joker link to the network node R3 to send data packets to the destination D or to the network node R2.
- the network node R1 now immediately informs the network node R3 of the failure of the connection L12.
- the network node R3 uses its joker link to the network node R1 if the connection L32 is disturbed or has failed to send data packets to the destination D or to the network node R2. According to the invention, the network node R3 immediately informs the network node R1 of the failure of the connection L32.
- connection path L12 which is the primary connection path of the network node R1 to the network node R3
- the network node R1 uses its joker link, which leads via the connection L13 to the network node R3, and transmits via it Replacement routing route data packets to destination D or to network node R2.
- the joker link has been used in the network node R1, it sends a message via the connection path L13 to the network node R3 that the connection L12 has failed and / or the network node R2 can no longer be reached directly via its primary connection path ,
- network node R3 After receiving and evaluating this message in network node R3, the latter knows that network node R1 can no longer reach network node R2 directly.
- the network node R3 is now controlled in such a way that the joker link via the connection path L13 to the network node R1 is no longer used for data packets which are sent to the destination D or network node R2. This can be done by deleting the joker link from the routing table of the network node R3. Likewise, the joker link can remain in the routing table and can be marked or flagged that this link is not currently being used. Many variants are conceivable here.
- the network node R3 knows that the destination D or the network node R2 can no longer be reached via the network node R1 and also not directly via the primary connection path from network node R3 to network node R2.
- the inactive joker link to the network node R1 which may still be present in the network node R3 is not used since it has already been marked or deleted. Incoming data packets for the destination D or the network node R2 are discarded in the network node R3 if the network node R2 cannot be reached via other network nodes.
- the network node R3 Immediately after the connection L32 has failed, the network node R3 sends a message to the network node R1 that the connection L32 has failed and / or the network node R2 can no longer be reached directly via its primary connection path.
- the network node R1 is then controlled in such a way that it takes its active joker link to the network node R3 out of operation for data packets to the destination D or to the network node R2 and discards data packets for the destination D if the destination D cannot be reached via other network nodes.
- the failed link is signaled, as described, by sending a message from network node R1 to network node R3 and / or vice versa.
- the signaling can be realized by a signal that repeats itself as long as the error persists.
- the signaling can be implemented by a cyclically repeating message with fault information.
- the message can be a protocol data unit, or PDU for short, or a packet.
- the signaling can be realized in that, in the error-free state, signals or messages are sent cyclically which are absent when a fault or an error occurs. Inverse operation and inverse control of the network node takes place here in relation to the previously described example. This means that if the messages are not received, an error is recognized and the response is analogous.
- the signaling can be implemented by a secure signal or message exchange, in which, for example, at the start of a fault or when a fault occurs is sent and another all-clear message is sent at the end of the fault.
- the signaling can also be implemented using a routing protocol or embedded in a routing protocol. It is important to ensure that the signaling occurs immediately after a fault occurs so that connection L13 is not overloaded. Usual routing protocols take too much time for this.
- the signaling can also be implemented by testing each connection path for errors using error monitoring with special, fast, so-called keep-alive packets.
- the packet format of these keep-alive packets or messages is expanded by fields, so that one or more network node numbers can be variably embedded or inserted. If a network node detects a fault in a connection path, it inserts the node number of the inaccessible network node into the keep-alive packets or into its keep-alive stream to the neighboring network node as long as the fault or error persists. As a result, the neighboring network node knows that the network node number inserted into the received keep-alive packets can no longer be reached via this network node and the activation of a joker link there would be ineffective.
- the network node R1 would activate its joker link to the network node R3 for data traffic to the destination D or to the network node R2 and in its messages or keep-alive packets which are via the Connection path L13 or replacement routing path to the network node R3 are sent, enter the network node number of the network node R2.
- the network node R3 thus knows that no connection path to the network node R2 or to the destination D is available via the network node R1. If the connection path L32 fails, the network node R3 does not even put its joker link into operation via the connection path L13 to the network node R1. Likewise, when the message with the fault information or the keep-alive packet with the fault information arrives, it could take the joker link out of operation or delete it in its routing table.
- network node R3 finds the node number of network node R2 in the keep-alive packets of network node R1. If the
- Network node R3 has a wildcard link to network node R2 or destination D via network node R1, it takes it out of operation.
- connection path L12 is again free of interference or a connection path exists again between network node R1 and network node R2, can the network node R3 use its wildcard -Start the Link (again).
- both network nodes R1 and R3 would insert or feed the node number of the network node R2 into the respective keep-alive packets and would not put both joker links into operation or out of operation ,
- a network node can have the network node number of an actually reachable one before commissioning a joker link Feed in network nodes, in the example network node R2, and only activate their joker link after a protection period. For example, n feed the node number into the keep-alive packet periods and only activate its joker link and remove the test node number that has been inserted as a test if the neighboring network node reports no error after a certain time.
- the process is characterized by the fact that it is very fast and prevents overloading of connection paths. This is particularly advantageous for the transmission of voice data (Voice over IP), since delays or losses of voice data in the case of overloaded connection paths are particularly disadvantageous. Routing protocols that exchange information about faulty or failed connection paths are much slower than the described method. In addition, a possibly unwanted re-routing is often triggered here.
- the method according to the invention can be implemented by an easy-to-implement software solution.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP04766259A EP1649644A1 (de) | 2003-07-25 | 2004-07-19 | Verfahren und netzknoten zur meldung mindestens eines ausgefallenen verbindungsweges innerhalb eines kommunikationsnetzes |
US10/566,010 US20070110079A1 (en) | 2004-07-19 | 2004-07-19 | Method and network nodes for reporting at least one dropped-out connection path withing a communication network |
US12/390,859 US20090154345A1 (en) | 2003-07-25 | 2009-02-23 | Method and network nodes for reporting at least one dropped-out connection path within a communication network |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10334104.8 | 2003-07-25 | ||
DE10334104A DE10334104A1 (de) | 2003-07-25 | 2003-07-25 | Verfahren und Netzknoten zur Meldung mindestens eines ausgefallenen Verbindungsweges innerhalb eines Kommunikationsnetzes |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/390,859 Continuation US20090154345A1 (en) | 2003-07-25 | 2009-02-23 | Method and network nodes for reporting at least one dropped-out connection path within a communication network |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005011206A1 true WO2005011206A1 (de) | 2005-02-03 |
Family
ID=34071917
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2004/051540 WO2005011206A1 (de) | 2003-07-25 | 2004-07-19 | Verfahren und netzknoten zur meldung mindestens eines ausgefallenen verbindungsweges innerhalb eines kommunikationsnetzes |
Country Status (5)
Country | Link |
---|---|
US (1) | US20090154345A1 (de) |
EP (1) | EP1649644A1 (de) |
CN (1) | CN1830184A (de) |
DE (1) | DE10334104A1 (de) |
WO (1) | WO2005011206A1 (de) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007033592A1 (en) * | 2005-09-20 | 2007-03-29 | Huawei Technologies Co., Ltd. | System for passive alarm propagation and suppression for packet based networks |
WO2021000236A1 (en) * | 2019-07-01 | 2021-01-07 | Lenovo (Beijing) Limited | Method and apparatus for reducing latency in communication system |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102005017021A1 (de) * | 2005-04-13 | 2006-10-19 | Siemens Ag | Verfahren und Vorrichtung zur Kommunikation zwischen Netzknotenelementen |
EP1905200A1 (de) * | 2005-07-01 | 2008-04-02 | Terahop Networks, Inc. | Nichtdeterministisches und deterministisches netzwerk-routing |
US8867338B2 (en) | 2006-09-19 | 2014-10-21 | Futurewei Technologies, Inc. | Faults Propagation and protection for connection oriented data paths in packet networks |
US8018843B2 (en) * | 2006-09-19 | 2011-09-13 | Futurewei Technologies, Inc. | Faults propagation and protection for connection oriented data paths in packet networks |
JP2008113955A (ja) * | 2006-11-07 | 2008-05-22 | Aruze Corp | ゲーム装置 |
US8300551B2 (en) * | 2009-01-28 | 2012-10-30 | Google Inc. | Ascertaining presence in wireless networks |
KR20120065611A (ko) * | 2010-12-13 | 2012-06-21 | 한국전자통신연구원 | 절전형 라우팅 정보를 이용한 라우터 장치 및 라우터 장치의 라우팅 방법 |
US8862774B2 (en) * | 2011-09-12 | 2014-10-14 | Cisco Technology, Inc. | Dynamic keepalive parameters for reverse path validation in computer networks |
KR102139721B1 (ko) * | 2013-08-29 | 2020-07-30 | 삼성전자주식회사 | 다중 경로 프로토콜에서 이중으로 네트워크 코딩을 적용하는 방법 및 그 장치 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5537468A (en) * | 1991-10-15 | 1996-07-16 | Siemens Aktiengesellschaft | Method for the non-hierarchical routing of traffic in a communications network |
US6392989B1 (en) * | 2000-06-15 | 2002-05-21 | Cplane Inc. | High speed protection switching in label switched networks through pre-computation of alternate routes |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4074182A (en) * | 1976-12-01 | 1978-02-14 | General Electric Company | Power supply system with parallel regulators and keep-alive circuitry |
US4679189A (en) * | 1985-11-27 | 1987-07-07 | American Telephone And Telegraph Company | Alternate routing arrangement |
US6865149B1 (en) * | 2000-03-03 | 2005-03-08 | Luminous Networks, Inc. | Dynamically allocated ring protection and restoration technique |
-
2003
- 2003-07-25 DE DE10334104A patent/DE10334104A1/de not_active Ceased
-
2004
- 2004-07-19 CN CNA2004800214965A patent/CN1830184A/zh active Pending
- 2004-07-19 WO PCT/EP2004/051540 patent/WO2005011206A1/de active Search and Examination
- 2004-07-19 EP EP04766259A patent/EP1649644A1/de not_active Withdrawn
-
2009
- 2009-02-23 US US12/390,859 patent/US20090154345A1/en not_active Abandoned
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5537468A (en) * | 1991-10-15 | 1996-07-16 | Siemens Aktiengesellschaft | Method for the non-hierarchical routing of traffic in a communications network |
US6392989B1 (en) * | 2000-06-15 | 2002-05-21 | Cplane Inc. | High speed protection switching in label switched networks through pre-computation of alternate routes |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007033592A1 (en) * | 2005-09-20 | 2007-03-29 | Huawei Technologies Co., Ltd. | System for passive alarm propagation and suppression for packet based networks |
US7599295B2 (en) | 2005-09-20 | 2009-10-06 | Futurewei Technologies, Inc. | System for passive alarm propagation and suppression for packet based networks |
WO2021000236A1 (en) * | 2019-07-01 | 2021-01-07 | Lenovo (Beijing) Limited | Method and apparatus for reducing latency in communication system |
Also Published As
Publication number | Publication date |
---|---|
US20090154345A1 (en) | 2009-06-18 |
DE10334104A1 (de) | 2005-02-17 |
CN1830184A (zh) | 2006-09-06 |
EP1649644A1 (de) | 2006-04-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP2070256B1 (de) | Verfahren zum rekonfigurieren eines kommunikationsnetzwerks | |
EP1532771B1 (de) | Testverfahren f r nachrichtenpfade in kommunikationsnetzen s owie netzelement | |
DE102011112852B4 (de) | Zugangsnetz-Doppelwegkonnektivität | |
DE3888818T2 (de) | Aufgeteilte Lastverteilung. | |
DE69017193T2 (de) | Automatische fehlererholung in einem paketnetz. | |
WO2004071028A1 (de) | Verfahren und anordnung zum routing von datenpaketen in einem paketvermittelnden datennetz | |
DE102007015539B4 (de) | Verfahren zum Rekonfigurieren eines Kommunikationsnetzwerks | |
EP3155763B1 (de) | Redundante übertragung von datentelegrammen in kommunikationsnetzwerken mit ringförmiger topologie | |
EP1897293A1 (de) | Verfahren zur bereitstellung von ersatzwegen als schnelle reaktion auf den ausfall eines links zwischen zwei routing-domänen | |
EP1476988A1 (de) | Lokales netzwerk, insbesondere ethernet-netzwerk mit redundanzeigenschaften sowie redundanzmanager für ein derartiges netzwerk | |
WO2005011206A1 (de) | Verfahren und netzknoten zur meldung mindestens eines ausgefallenen verbindungsweges innerhalb eines kommunikationsnetzes | |
EP1842343A1 (de) | Verfahren zur bestimmung der weiterleitungsrichtung von ethernet-frames | |
WO2005107179A1 (de) | Datenkommunikationsnetzwerk mit dezentralem kommunikationsmanagement | |
DE102007015449B4 (de) | Verfahren zum Rekonfigurieren eines Kommunikationsnetzwerks | |
EP2704370B1 (de) | Verfahren zur Nachrichtenübermittlung in einem redundant betreibbaren industriellen Kommunikationsnetz und Kommunikationsgerät für ein redundant betreibbares industrielles Kommunikationsnetz | |
DE10337465B4 (de) | Verfahren zum Routing von Datenpaketen in einem mehrere Netzknoten aufweisenden paketvermittelnden Kommunikationsnetz | |
DE60027423T2 (de) | Kommunikationseinrichtungen | |
DE102008017192A1 (de) | Verfahren zum Aufbau eines Netzwerks | |
DE10308614A1 (de) | Verfahren und Anordnung zum Routing von Datenpaketen in einem paketvermittelnden Datennetz | |
EP2182680B1 (de) | Verfahren zum Betrieb eines Kommunikationsnetzwerkes und Kommunikationskomponente | |
DE102020202521B4 (de) | Relaisvorrichtung | |
DE102007021922B4 (de) | Paketvermitteltes Kommunikationsnetzwerk und Verfahren zum Rekonfigurieren des Kommunikationsnetzwerks | |
EP3422641A1 (de) | Verfahren zur nachrichtenübermittlung in einem redundant betreibbaren industriellen kommunikationsnetz und kommunikationsgerät zu dessen durchführung | |
EP2290882B1 (de) | Verfahren zur mehrfachen Fehlerredundanz in Netzwerken mit Ringtopologien | |
DE69731830T2 (de) | Nachrichtenleitweglenkungsverfahren in einem Fernmeldenetz und Vorrichtung zur Durchführung des Verfahrens |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200480021496.5 Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2004766259 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2007110079 Country of ref document: US Ref document number: 10566010 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 2004766259 Country of ref document: EP |
|
DPEN | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101) | ||
WWP | Wipo information: published in national office |
Ref document number: 10566010 Country of ref document: US |