EP1597873A1 - Verfahren und anordnung zum routing von datenpaketen in einem paketvermittelnden datennetz - Google Patents
Verfahren und anordnung zum routing von datenpaketen in einem paketvermittelnden datennetzInfo
- Publication number
- EP1597873A1 EP1597873A1 EP03727160A EP03727160A EP1597873A1 EP 1597873 A1 EP1597873 A1 EP 1597873A1 EP 03727160 A EP03727160 A EP 03727160A EP 03727160 A EP03727160 A EP 03727160A EP 1597873 A1 EP1597873 A1 EP 1597873A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- network node
- network
- connection
- routing
- packet
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 230000005540 biological transmission Effects 0.000 claims abstract description 6
- HVCNNTAUBZIYCG-UHFFFAOYSA-N ethyl 2-[4-[(6-chloro-1,3-benzothiazol-2-yl)oxy]phenoxy]propanoate Chemical compound C1=CC(OC(C)C(=O)OCC)=CC=C1OC1=NC2=CC=C(Cl)C=C2S1 HVCNNTAUBZIYCG-UHFFFAOYSA-N 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 2
- 230000001771 impaired effect Effects 0.000 description 1
- 230000007257 malfunction Effects 0.000 description 1
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/18—Loop-free operations
-
- 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/24—Multipath
- H04L45/243—Multipath using M+N parallel active paths
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/40—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
-
- 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/03—Topology update or discovery by updating link state protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/14—Multichannel or multilink protocols
Definitions
- the invention relates to a method according to the preamble of claim 1 and an arrangement according to the preamble of claim ⁇ .
- FIG. 1 shows an arrangement of part of a packet-switching data network, for example an Internet Protocol (IP) network, consisting of three network nodes A, B and D, such as routers, switches, gateways, network elements or other similar switching devices.
- IP Internet Protocol
- the network nodes A and B, B and D, and A and D are connected to one another via connections or links ab, bd and ad.
- Network nodes A and B have connections to a part of the data network, not shown, via which they receive data packets.
- Data packets are to be considered that arrive at the network node B from the part of the data network (not shown) and are to be forwarded to the destination network node D or to be routed or relayed.
- network node B In normal, so-called shortest path routing, network node B would always forward packets to network node D via connection bd, and network node A would always forward packets to network node D via connection ad
- the traffic is divided into two or more paths.
- the alternative route via network node A is suitable for this.
- network node B also forwards packets to network node D via the connection to network node A, where they are forwarded from there via connection ad to network node D.
- the network node A could forward packets to the network node D via the connection ab to the network node B, where they are forwarded from there via the connection bd to the network node D.
- the routing tables, including the traffic distribution weights p and p 3 would then be for the alternative routes:
- the probability p ⁇ p 3 was that, for example, a packet from network node B on the way to network node D only via the connection from to network node A and then again from network node A would be forwarded via the connection from to network node B. This would happen twice in a row Parcel with probability (p ⁇ p 3 ) 2 pass. The probability of sending a package back and forth n times would be (p ⁇ p 3 ) n . The forwarding of packets from network node B to network node D would thus not be implemented without loops.
- Equal Cost Multipath ECMP for short
- OSPF OSPF protocol
- UCMR Unequal Cost Multipath Routing
- CISCO's EIGRP protocol the choice of alternative routes to a destination is severely restricted by the fact that despite purely goal-based forwarding, the Packets loops must always be avoided.
- the mechanisms ECMP or UCMR in the example of FIG. 1 the alternative routes from network node B to network node D via network node A and from network node A to
- Network node D via network node B is not permitted or the connection ab may not be used.
- Joker-Link "method it is proposed to refrain from traffic distribution in cases such as the example described in FIG. 1 and instead to give the network nodes locally applicable rules.
- the traffic distribution weight for the critical alternative paths that is to say the potential loops, is reduced to the minimum Value, ie set to 0.
- the paths are kept in the routing table and are referred to as "joker links”.
- Corresponding routing tables would then be:
- the nodes now use the rule that they only use the links provided with the minimum traffic distribution weight if the desired neighboring network node or next hop can no longer be reached via any other path which has a positive weight.
- the advantage of this method is that in the case of multipath or multipath routing in particular, an alternative route can be made available, with no packets circulating in the network. See also the corresponding proposal in the earlier patent application.
- FIG. 2 shows an arrangement according to FIG. 1, with the proviso that the connection or the connecting path bd is realized by two connections or connecting paths bdl and bd2.
- connection paths connect the same network nodes with one another, they are usually used like a connection with a correspondingly increased total capacity.
- the object of the present invention is to improve existing routing methods in packet-switching data networks.
- connection paths as independent or separate transmission paths.
- the advantage of the invention is that in the case of parallel connections, the first connection, in the example shown in FIG. 2, the connection bdl, can be protected by the second connection, in the example by the connection bd2, or vice versa.
- no joker links in the example in network nodes B and A, have to be provided. As a result, the connection paths of the data network are used more economically.
- Figure 2 shows a part of a packet-switching data network.
- FIG. 3 shows a first expansion of the packet-switching data network according to FIG. 2.
- FIG. 4 shows a second extension of the packet-switching data network according to FIG. 3.
- FIG. 2 shows a part of a packet-switching data network already mentioned in the introduction.
- Traffic of different traffic classes is supported and transmitted in the packet-switching data network.
- Traffic in the lower classes such as * best effort "traffic, may be discarded in the event of a traffic jam.
- the remaining link alone In order to be able to convey the higher-quality traffic in the remaining routes in the event of a fault, the remaining link alone must take over the quality traffic.
- the connection routes are therefore in Normally only accordingly proportionately burdened with quality traffic.
- Low priority traffic is normally used to "fill up" unused capacity to allow full use of connection capacity.
- Data traffic of higher priority is, for example, transmission time-critical data traffic, such as voice data, which occur in Internet telephony or in so-called Voice over IP.
- Low-priority data traffic is, for example, email data traffic that can be transmitted with a low priority.
- Data traffic of higher priority can, for example, be transmitted via a first connection path and data traffic of lower priority via the second connection path of the parallel connection. If a connection path of the parallel connection paths is disturbed, the network accounts are controlled in such a way that low-priority data traffic is at least partially rejected and predominantly higher-priority data traffic is transmitted.
- the data traffic of higher and lower priority can be divided between the two transmission paths. This can be done by controlling the network node in accordance with known division methods of multipath or multipath routing. In the event of a fault, the router is controlled in such a way that at least the data traffic of higher priority is transmitted via the fault-free connection path and the remaining capacity is filled up with data traffic of lower priority.
- connection bd2 fails
- a joker link would have to be set in network node A in order to achieve a rapid protection reaction in the event of link failures.
- the neighboring node A is also protected by the invention.
- the joker link to network node B can be omitted and a traffic distribution can be carried out in accordance with the multipath or multipath routing. Since the network node B has two routes to the destination, no data traffic to the destination network node D is sent via network node A. Data traffic for destination network node D, which arrives at network node A from the part of the data network which is not shown, can be divided into two paths in accordance with multipath routing.
- the data traffic is sent directly to network node D via the connection ad.
- data traffic can be can be sent from to the network node B, which is always sent by this via one of the two connection paths bdl or bd2 to the destination network node D. Since network node B has two paths to network node D, it will not send any traffic back to network node A in accordance with a traffic distribution, with the result that the routing is implemented without loops. This directional traffic to network node B results in loop-free multipath or multipath routing.
- FIG. 3 shows an arrangement according to FIG. 2, with the proviso that a network node C is connected to network node B via a connection bc and to network node D via a connection cd.
- network node C can divide its traffic into two routes analogously to network node A, on the one hand the direct route via the connection cd and on the other hand via the connection bc to network node B, which handles the data traffic via the connection routes bdl and / or bd2 forwards to network node D.
- FIG. 4 shows an arrangement according to FIG. 3, with the proviso that a further network node E is provided, which is connected to network node C via a connection path ce and to network node D via a connection path ed.
- directional arrows are provided to clarify the data flow described. carry, which indicate the possible data flow for data packets to the destination network node D.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10308614A DE10308614A1 (de) | 2003-02-27 | 2003-02-27 | Verfahren und Anordnung zum Routing von Datenpaketen in einem paketvermittelnden Datennetz |
DE10308614 | 2003-02-27 | ||
PCT/DE2003/001050 WO2004077756A1 (de) | 2003-02-27 | 2003-03-31 | Verfahren und anordnung zum routing von datenpaketen in einem paketvermittelnden datennetz |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1597873A1 true EP1597873A1 (de) | 2005-11-23 |
Family
ID=32863953
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP03727160A Withdrawn EP1597873A1 (de) | 2003-02-27 | 2003-03-31 | Verfahren und anordnung zum routing von datenpaketen in einem paketvermittelnden datennetz |
Country Status (6)
Country | Link |
---|---|
US (1) | US20060067330A1 (de) |
EP (1) | EP1597873A1 (de) |
CN (1) | CN100477629C (de) |
BR (1) | BR0318138A (de) |
DE (1) | DE10308614A1 (de) |
WO (1) | WO2004077756A1 (de) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2421158B (en) * | 2003-10-03 | 2007-07-11 | Avici Systems Inc | Rapid alternate paths for network destinations |
US8213548B2 (en) * | 2006-04-04 | 2012-07-03 | Qualcomm Incorporated | Methods and apparatus for dynamic packet reordering |
CN101521628B (zh) * | 2009-01-16 | 2012-05-23 | 深圳市迈科龙电子有限公司 | 一种数据文件自动中转传输和路由的方法 |
CN102347885B (zh) * | 2010-07-29 | 2016-01-20 | 杭州华三通信技术有限公司 | 一种路由切换的方法和装置 |
EP3369222B1 (de) | 2015-10-26 | 2019-01-02 | ABB Schweiz AG | Verfahren, knoten und system zur herstellung von unabhängigen netzwerkpfaden |
EP3716537A1 (de) * | 2019-03-25 | 2020-09-30 | Siemens Aktiengesellschaft | Verfahren zur datenkommunikation, netzwerkknoten, computerprogramm und computerlesbares medium |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4905233A (en) * | 1987-11-23 | 1990-02-27 | Harris Corporation | Multiple path routing mechanism for packet communications network |
JP3654158B2 (ja) * | 2000-08-09 | 2005-06-02 | 日本電気株式会社 | パケット転送経路制御装置及びそれに用いるパケット転送経路制御方法 |
JP2002300193A (ja) * | 2001-03-30 | 2002-10-11 | Hitachi Ltd | ルータ |
US7007189B2 (en) * | 2001-05-07 | 2006-02-28 | Sun Microsystems, Inc. | Routing scheme using preferred paths in a multi-path interconnection fabric in a storage network |
US7366100B2 (en) * | 2002-06-04 | 2008-04-29 | Lucent Technologies Inc. | Method and apparatus for multipath processing |
-
2003
- 2003-02-27 DE DE10308614A patent/DE10308614A1/de not_active Ceased
- 2003-03-31 WO PCT/DE2003/001050 patent/WO2004077756A1/de active Application Filing
- 2003-03-31 BR BR0318138-3A patent/BR0318138A/pt not_active IP Right Cessation
- 2003-03-31 US US10/546,948 patent/US20060067330A1/en not_active Abandoned
- 2003-03-31 CN CN03826061.1A patent/CN100477629C/zh not_active Expired - Fee Related
- 2003-03-31 EP EP03727160A patent/EP1597873A1/de not_active Withdrawn
Non-Patent Citations (1)
Title |
---|
See references of WO2004077756A1 * |
Also Published As
Publication number | Publication date |
---|---|
DE10308614A1 (de) | 2004-09-16 |
WO2004077756A1 (de) | 2004-09-10 |
CN100477629C (zh) | 2009-04-08 |
CN1745548A (zh) | 2006-03-08 |
US20060067330A1 (en) | 2006-03-30 |
BR0318138A (pt) | 2006-02-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1584161A1 (de) | Verfahren und anordnung zum routing von datenpaketen in einem paketvermittelnden datennetz | |
EP1623541B1 (de) | Verfharen und netzknoten fuer eine selbst-regulierende, autonome und dezentrale verkehrsverteilung in einem mehrwege-netz | |
EP1532780B1 (de) | Effizientes intra-domain routing in paketnetzen | |
WO2004107677A1 (de) | Verfahren für eine verkehrsverteilung mittels hash-codes entsprechend einer soll-verkehrsverteilung in einem paketorientierten netz mit mehrwegerouting | |
WO2005013564A1 (de) | Verfahren für ein inter-domain mehrwege-routing | |
EP1597873A1 (de) | Verfahren und anordnung zum routing von datenpaketen in einem paketvermittelnden datennetz | |
EP1566039A1 (de) | Verfahren zur umleitung von datenpaketen bei lokal erkannten linkausfällen | |
EP1547324A2 (de) | Verfahren zur teilweisen erhaltung der paketreihenfolge bei verbindungsloser paketvermittlung mit alternativem routing | |
DE10334104A1 (de) | Verfahren und Netzknoten zur Meldung mindestens eines ausgefallenen Verbindungsweges innerhalb eines Kommunikationsnetzes | |
DE10337465B4 (de) | Verfahren zum Routing von Datenpaketen in einem mehrere Netzknoten aufweisenden paketvermittelnden Kommunikationsnetz | |
EP1514435B1 (de) | Ausfallsichere Anbindung eines Netzelementes an ein Kommunikationsnetz	 | |
DE10324370B4 (de) | Netzknoten eines paketvermittelnden Kommunikationsnetzes und Verfahren zur Verkehrsverteilung von Datenverkehr in einem paketvermittelnden Kommunikationsnetz | |
DE10328620B4 (de) | Verfahren und Netzknoten zur Wegesuche in einem paketvermittelnden Kommunikationsnetz | |
EP1530852B1 (de) | Verteilungsfächer für eine effiziente, ausfallsichere verkehrsverteilung in einem paketnetz | |
DE102006036565A1 (de) | Verfahren zur paketvermittelten Datenübertragung in einem Kommunikationsnetz | |
DE60305939T2 (de) | Methode für den Schutz des Anschlu es zwischen einer Transportnetznabe und einem zentralen Aufstellungsort/ POP | |
DE10340809A1 (de) | Optimierung der Routenbestimmung in einem Netz mit Mehrwege-Routing | |
WO2004112322A1 (de) | Verfahren zur nutzung von parallelen links in paketorientierten netzen mit mehrwegerouting | |
DE102022206121A1 (de) | Deadlock-freies lokales umleiten zur behandlung mehrerer lokaler verbindungsausfälle in hierarchischen netztopologien | |
WO2004066568A1 (de) | Verfahren zur umleitung von datenpaketen bei lokal erkannten linksausfällen durch mehrfachwegefindung | |
EP1733519A1 (de) | Verfahren zur steuerung des datenverkehrs in eimem paketnetz | |
DE102014106827A1 (de) | Verfahren und Anordnung zur verbindungslosen Datenübertragung | |
WO2005034442A1 (de) | Schnelle fehlerreaktion in lose vermaschten ip-netzen | |
DE19511250A1 (de) | Redundantes, zellen- bzw. paketorientiertes Kommunikationsnetz mit einer Mehrzahl von miteinander verbundenen Knoten | |
DE102006045713A1 (de) | Optimierte Verkehrsumleitung in Fehlerfällen für IP-Netze mit zusätzlichem Fehlerkorrekturmechanismus auf einer unteren Schicht |
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: 20050722 |
|
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 |
|
AX | Request for extension of the european patent |
Extension state: AL LT LV MK |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: WINKLER, CHRISTIAN Inventor name: SCHOLLMEIER, GERO |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: WINKLER, CHRISTIAN Inventor name: SCHOLLMEIER, GERO |
|
DAX | Request for extension of the european patent (deleted) | ||
RBV | Designated contracting states (corrected) |
Designated state(s): DE ES GB IT NL |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG |
|
RAP3 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS S.P.A. |
|
RAP3 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG |
|
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: 20110618 |