WO2002062022A2 - Method for improving resistance against network errors in a packet switched data network - Google Patents

Method for improving resistance against network errors in a packet switched data network Download PDF

Info

Publication number
WO2002062022A2
WO2002062022A2 PCT/DE2002/000322 DE0200322W WO02062022A2 WO 2002062022 A2 WO2002062022 A2 WO 2002062022A2 DE 0200322 W DE0200322 W DE 0200322W WO 02062022 A2 WO02062022 A2 WO 02062022A2
Authority
WO
WIPO (PCT)
Prior art keywords
φ
tr
rt
cn
pj
Prior art date
Application number
PCT/DE2002/000322
Other languages
German (de)
French (fr)
Other versions
WO2002062022A3 (en
Inventor
Andreas KIRSTÄDTER
Achim Autenrieth
Original Assignee
Siemens Aktiengesellschaft
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
Priority to DE10103953 priority Critical
Priority to DE10103953.0 priority
Application filed by Siemens Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Publication of WO2002062022A2 publication Critical patent/WO2002062022A2/en
Publication of WO2002062022A3 publication Critical patent/WO2002062022A3/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/02Arrangements for detecting or preventing errors in the information received by diversity reception
    • H04L1/06Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/06Arrangements for maintenance or administration or management of packet switching networks involving management of faults or events or alarms
    • H04L41/0654Network fault recovery
    • H04L41/0659Network fault recovery by isolating the faulty entity
    • H04L41/0663Network fault recovery by isolating the faulty entity involving offline failover planning
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/24Multipath
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/28Route fault recovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/56Routing software
    • H04L45/566Routing instructions carried by the data packet, e.g. active networks

Abstract

The invention relates to methods and devices wherein packet-specific forwarding occurs in packet switched data networks by means of active nodes with fast byte level processors which can be controlled by additional information transported in the packets.

Description

description

Method for improving the resistance network error in a packet switched data network

The invention relates to the improvement of the resistance to network failure or to increase the fault tolerance, particularly in high-speed switched networks, said network error tenzusammenbrüchen in the form of cable fracture, bone or occur in the form of malicious attacks and said failing network elements and the connections, or data streams affected so must be restored quickly as possible.

Principles regarding the transfer of data packets and the organization of an IP network, for example, from W. Richard Stevens, TCP / IP Illustrated, Vol. 1, Chapter 3, pages 33-53, Addison-Wesley, 1994, Reading, USA, known.

To make a connection between two nodes resilient to network failures, there is in principle the possibility to duplicate the information and to be transmitted over separate physical paths to the destination node, where the information is then, for example, correlated and selected. However, this is just transient disturbances or disorders which can be tolerated due to the system requirements, not satisfactory, since the data throughput is unnecessarily reduced or an unnecessary high transmission bandwidth is required.

The object underlying the invention is now to provide an apparatus and a method for improving the resistance network error in a packet switched data network, the above mentioned disadvantages are avoided in the / a. This object is achieved with regard to the apparatus by the features of claim 1 and concerning the method by the features of claim 5 or. 13 The further claims relate to advantageous embodiments of the device or the method according to the invention.

The invention essentially consists in that in a packet switched data network are controllable by active node with fast byte-level processors, the set information by entrained in packets intake, packet-specifically a different error handling can be made.

The invention is explained below with reference to an illustrated in FIGS embodiment. Here shows

Figure 1 shows a detail of a data network with normal and active nodes, and

Figure 2 shows the structure of an active node that contains a Bitlevel- processor.

In Figure 1 is a section of a packet-oriented data network with active node Anl ... AN4 and normal nodes N1 ... N4 shown. In this case, packets in the form of so-called C capsules that contain a normal load P and a feed I satzinfor ation. The Zusatzinfor ation I can consist of code fragments from references to these code fragments and / or after certain intervals synchronization marks S included. These code fragments may but in the active node AN2 effect decoding in the active node anl a duplication, or a correlation, a composition or selection, for example, in the active Node AN4 encode in the active node AN3. After the active node ANL the information or the duplicated information on physically separate paths Pl and P2 on the LO rl \ JP 1 1 P o cπ cn o (_π o (l ö l_J is. M ^ tr rt rt T σ Φ φ d • -o CΛ o α v φ>! S φ φ tr ii ^ α o iQ M dd

DJ DJ Φ φ P- Φ Φ PJ li φ P- P- Φ ι-io tr P- Φ ii ^ d φ dd P- φ Φ Φ P- dos d: d P- - O P d P d li o tr d Φ Φ rt rt rt P 1 d ^ d ^ d DJ li li d lf Hl α d Φ iQ 3 CΛ α ιp Φ Φ N d P- iP tr rt tr φ \ CΛ 3

P- P- P J π-: H P- 3 Φ tr P- O Φ tsi J d: Φ Φ cn ≥; CΛ cn M Φ ≥ dd; PJ φ H J "3 PJ Φ CΛ J φ Φ ω Φ CΛ d öd P) φ ö PP" i- tr 1 P- P- P- Φ φ P- OMP "

CΛ d P 1 P CΛ gd cn φ P CΛ • <Ό P Φ cn P) rt rt Φ t-1 dn Hi P ^ d iP od H 1 φ rt d Φ P D. π o Ό d O P- cn ri- rf H Φ d Φ H φ P- P- tr φ Φ Φ iQ P ON do DDO Φ o tr Φ φ tr Φ ι-i ιp Φ V i P- P tr rt * "φ tr HN d

0) d HOHN) φ wod cn d Φ Φ Φ φ Φ J tr PJ d Φ Φ = 3 "

Φ n <α d Φ d p + d r φ O tr ddn dd P- Hi rt Φ d d> P- ι- <o

Hl tr o 3 Φ φ Φ Hi H d) P- P- Φ ^ r + tr φ • d 1 cn P- ι-i P d iQ N d

H dd: P d - α li P- Φ P- H Φ rt Φ P- rf Φ w I d iP d i = O rt rt P> H- rt

PJ φ CΛ d 3 O: PJ CΛ φ dd DJ rt d o α li α φ nd CΛ P- Φ φ Q w P 0- CΛ P- Φ o d O ιp. - r + rt dd PJ tr tr o Φ s:? Φ φ O rt P "d

3 * P <Φ o rt d 3 P tr tr ö 1 P tr d P's: cn Φ Φ N rt cn d P d P P IV φ φ φ dd yes CD Φ φ d J Φ P O PJ φ P- P- P- φ H d cn 3 <! d SS d H n • Φ Φ CΛ d PP • ö CΛ ddd li ι-i LSI d CΛ CΛ CΛ rt O n tr Φ φ o ω r + tr Hi P r + P 1 φ Φ r + Φ d (- ■ Ό cn P Φ tr Φ P SJ li rt φ <! li Φ tr o d Φ Α P o "d Φ d tr cn Φ P oo rt rt d P d Φ Φ Φ H dood t tr cn d N od cn d r + φ PJ H H φ P- tr rt d tr cn dd

P H d Hi Φ P & ts. £ o P o Ό tr s: P) g P - - d ιp φ Φ d

3 iQ H dd N PJ PJ Φ + Φ r P r + tr φ: P tr pn CΛ φ dd? P do φ ω N tdd P t Φ li Φ Φ φ P Φ P "H Φ Φ nzd P do O: rt rt rt 21 ≥!

Cn iP PJ P- P) OP * dd li d φ P- P- rf t dt φ dd ιp ed P M J Φ rt Φ φ φ IC PJ p- 1 Hl d tr PJ dd cn rt s: P- iP α cn Φ d> d P f 1 tr P CΛ d rt rt d-- P <! d vP d <! 3 V s; <! PJ P- CΛ φ Φ H φ 3 nd: tr tr φ o Φ Hi tr φ Φ P- P- oo CΛ ι) Φ o Φ Φ ι-id P- cn P) d tr tr tr N

Φ P dd H dt P vP <5 ι- (d RL φ li P d P d OH φ s?:

P φ ω S "" Φ P rt J od J li P "rr P Φ Φ d Hi tr thousand Φ Φ

PJ tr cn dd li • d 3 rt φ P- P dn) ddd ι-in cn Φ tr φ φ d JH P- φ rt rt li

TJ PJ P- Φ s: • ι-i tr tr tr Φ P υ5 s: cn Φ d Φ P- Φ n dd f P- PJ Φ li =

DJ H CΛ pj: rt PJ ^ T3 Φ H Φ n

& S li d tr Φ Φ H P- CΛ d Φ tr tr PJ

? * r Φ Φ t o SP CΛ J ö P cn P tr Φ> Hi St. Φ tr d φ u cn rd P Φ

Φ tsi P d li d ι_ι. CΛ s O _ ^ Φ r + nd cn cn iP p- ι- (d Pl φ Φ d li li H- d φ H et P> Φ P- rt φ P- Φ 3 li ≤ Φ o Φ tr O φ PJ PJ rt cn I-1 tr d d iQ φ Φ tr d ö J CΛ CΛ lf d Φ Φ P- rt o rt d tr Φ ii d tu ιp P- "Λ Φ d P" H P- Φ • s: d rt Ό α Φ P d φ φ Φ 3 O ιP Φ Φ d) cn cn o $, d 1 d CΛ P- P-

D P- ι-i P r + d α s P: P "PJ Φ Φ O tr Φ s do: ω Φ Φ CΛ

Φ <! iQ φ Φ Φ Φ Φ • Φ α d iQ H P- P- PJ d ι-f S φ Ό rt li o Φ tr O H- PJ dd HH Φ Φ Φ • Φ Φ O Φ dd ü H- Φ P- ddd φ tr CΛ l-l. Ό Φ φ Hi d li P ιP C tr Φ cn d ω Φ o

P d Φ Φ CΛ CΛ INI <v JP Φ tö H dd Φ Φ P 1 -. φ Φ Φ li

H Φ P- CΛ d φ s: Φ d P) Ά CΛ dc} d J TJ tr cn φ Φ S ι- (cn 3

DJ dod Φ P J cn? ^ O <! • rf tr tp P) Φ ιP HHH) Ό φ P s: DJ

3 f T Φ P r + Φ li S! o φ Φ 3? ^ cn P- PJ P- Φ J nl li d o Φ P PJ rt 1 H φ d 1 α li Φ Φ rt φ T) d ^ fd iP P- Φ rf Φ n ö o P CΛ Φ Φ Φ d P P t 1 rd rt P rt? H φ φ d CΛ d

N φ P r + Ό φ PPP "<-r te) φ φ H Φ rt P- rt o nd li rt Φ d Φ

P P Φ Φ • P) Φ CΛ <P) Φ ö tr P Φ Φ N \ cn P iQ "

PJ d OH Hl li ιp Φ rt H r + Φ φ ^ PNH Φ Φ O Φ cn u li Ό rt cn cn d 3 d PJ PJ Φ CΛ P- O P- Φ 3 d dt P → dd cn CΛ ι- i Φ Φ s: O n O f? P »rt rt CΛ CΛ d Φ O o 1 d P 3 rt φ cn cn

Φ> o N n P P rt iQ φ φ P iQ PJ d P et Ό ιp et ιP "Φ d O? T) P- t-3 d φ Φ

CΛ rt O Φ d 3 cn rt ι-f Φ φ cn li dd P H rt Ό Hi? Ö tr d

P- P- CΛ rt Φ Φ dd O: H ιp Φ P cn d d O P- P- Φ tr * Φ P- O d r + P- φ P Pl 3 J Φ P- rt rt tr o d dd O ι-i cn. P d d H -3 tr Φ P> P Φ Φ d d r + 1 tr Φ Φ φ tr cn 1 d - - n rt P>

O Φ P P- odd Hl r + d dd P- cn tr φ 1 3 d O PJ P- Φ cn rt 1 P) Φ P 1 1 1 1 1 1 H

the operation in dependency can be performed by the payload. The benefits consist essentially in:

1. It will be required that allow for in-step processing with the normal transmission speed only simple byte-level processors for basic functions to increase the resilience to network errors such as duplication, comparison, correlation and selection.

2. These functions are contained in code fragments are executed encapsulated together with the payload in all active nodes along the transmission path.

3. The code fragments in the capsules can contain the choice of the transmission path (routing), which latches in Queues (Queuing), the data forming (shaping) and routing (forwarding) of packets as a function of the capsule contents.

4. It is possible to selectively duplicating packets, which saves bandwidth because for some services not all packets of a data stream must be protected.

5. A recalculation of the cyclic redundancy check (CRC) in active intermediate nodes, for example, suppress discard entire packets of single-bit errors.

Chen For compounds with very high Widerstandsfähigkeitsansprü-, a 1 + 1 protection scheme may for example be realized. The packages include code fragments for duplication of a packet for the search of multiple physically separate paths, where appropriate, the establishment of synchronization marks as well as for the correlation, the comparison and selection of packets. On the first active node ANL different paths are searched Pl and P2 for transmission to the destination node AN2. If two physically separate cυ ω ol \) P 1 P 1

Ui o cn o o Cn Cn

Tr tr d Φ P St.

Φ d N PJ li Φ P rt d Φ φ

H li

DJ tsi rt LP

IQ φ Φ

Φ P d St.

P rt dd

Φ P ddd rt = Φ Φ d d tr

PJ ι-i Φ

W <JH cn

Φ PJ P rt P "tr d

Φ Φ d P "^ tr

N α Φ z

Ϊ z φ

O: • • j be ι- (d Hi dd PJ Φ

Φ PJ Φ tr α ddn

O: P

Tf Φ tr φ rt P Φ

P- ii d d

O Φ rt PJ d li li

PJ PJ ω

P 1 <! iQ et o Φ Φ cn li d

^ IQ • tr d Φ N

O ≥ iQ; s: tr Φ PJ • ii tr tr φ oo dd P-

P φ Φ Φ

CΛ d P

PJ d ^ rt g Φ DJ p 3 Tf o N cn d PJ <! Φ cn tr o

3 P 1 li d

PJ

H Φ α

K o ιp d

P d Φ T)

Φ 1 1

Figure imgf000007_0001
1

ω co M to> P 1 cn o o cn cn cn o

0, z tr et LP; P ≥i <XOD cn LP ^ P 1 tr dd t →? Rx DJ rt o P ox cn cn rt N P d tr Φ φ φ d CΛ Φ Φ DJ cx d φ φ φ DJ P Φ Φ Φ odd tr d tr Φ φ Ω P- tr Ω Φ d Φ ι-i li P d: if et tr cn Φ CΛ d lP P 1 li P P P 3 P Hi P φ tr Φ tr li ii Φ P- tr

Figure imgf000008_0001
x ι-i rt Tf Φ Z cn H iQ di LP Hi DJ P φ Φ B cn cn CΛ Tf P LQ Ω Ω cx li Φ P> p:

PJ r + Φ i- 3 CΛ Hi P 'rf rt P J H <! - φ s: IT N P rt 3 dd 1-id PJ φ dd ι- ((X cx d rt = Ω P d Φ CΛ d Φ pj li: • φ P <1 P rt PJ LP dd Ω cx Hi P- P- Φ Φ φ tr tr φ N d d rt Φ ι-i cn tr t PZ - o P-

Φ iQ φ d LP tr Φ Φ Φ Φ cn rt P- li LP rt tr Φ cn cx Z ii 3 P 'P d P d dd dd li lf d lO P Φ P Φ ι- 1 CΛ (lP o φ O O: P- P- tr φ ii LP d φ P- φ Hl ^ O odd P- φ Hi P- ii d d d iQ ιp CΛ Ω x φ α

LP ≤ P- CΛ φ o P- <O l li W d PJ P- PJ Ω LP: LP Hl tr Φ Φ P- 1 x Ω tr P- Φ cn

P- Φ 3 Tf ii DDO PJ P- O φ 3 tr d tr d tr P- H Φ dd li Hi rt φ φ d φ P- P- LQ 3 cn dd φ P- PJ rt Φ P Ω PJ φ Ω Φ P P 1 cx J d φ Φ cx P rt PJ P Z iQ LQ? li • φ d P tr d CΛ φ φ ö

Φ J = d cx zd CΛ d 1 Φ PJ: 3 cn φ Φ? Rt Φ - - - tr li dd rt 3 O: C cn Φ φ rt + cx cx et d rt rt rt rt d Φ O rt φ n öd Thus Φ rt d tr Hi if d 3 pj: Φ tr Φ Φ p- <P- CΛ φ o Φ N li s Φ P- P- tr li cx d PJ CX 1 dd Φ DJ ι- (cn N LQ P- rt Φ P- x dd φ d φ rt <i

Φ Φ Φ H Tf cn x li d Φ d Φ (X Hl li P H H CJ dd ι-i Φ ι- (d tr d rt Ω P- CΛ rt • τ d Tf) H φ Φ d: P- Φ φ • ^ tr tr dd PP • if L o li P- CΛ PJ M o P- tr Φ P- li ^ ι-i Φ Φ LQ LQ cn x

Φ cx Φ CΛ d DJ d Φ 1-1: <! rt P- ü Öd Ω d li li H DDO PJ φ P d φ d Ω cn P- P- P- rt LP d d 3 Hl Φ DJ p- P- φ d φ O rt rt rt 3 d p H- d tr cn rt φ d d \ cx d N PJ dd ι-i rt φ rt N α cn • * "Q LP LQ φ H d NPP LQ d

Φ Φ J CΛ σ d J P d P Φ Hi P- φ φ N 1 J d: w 3 cn rt

<P H d: LP Ω d φ iP [Sl CΛ <P "Φ Φ CJ d PJ öd do LQ M tr rt rt tr IS.!

Φ P- tr φ tr cn ≤ Tf d: LP rt Φ Φ tr P- Tf li tr d tr d φ P- P- Φ P cn CΛ rt HO Φ d Φ P cn P Φ Φ P- li d Z φ Φ rt d Φ dd ii <i tr Ω

H "cx ii Ω P- 3 Φ CΛ CΛ Λ s: X d φ Φ p- li Hi & cx H LQ Φ N Tf ü d tr

≤ Φ O tr 3 Ω PJ N d φ o et LP ii P- P φ Φ z Tf li d P tr Φ

Lf Φ HJ P- tr od O: cx ii cn Φ tr φ φ H cx d: rt lf 3 t- Φ LP ds: 3 Φ rt φ Φ PJ li Hl Hl P- P- cn DJ li - 1 d DJ 0 - 1 H Hl "Φ Φ P d cx 3 Φ Ω φ O: ii Φ ι-i dd rt Ω φ Φ d Φ x LP CΛ cn Hi P- ddd St.

Φ Φ rt tr P- LP LP dd td N P tr tr φ z H dd OPO cn rt Φ d Φ ι-i tr P- rt dd d 1 H- Φ Φ ω d <d iP d LQ PJ rt rt φ li

• LP H φ N φ P <P ≥; o CΛ rt s: Φ P- 3 Φ CΛ P- LQ Φ iP tr LQ Φ H Hl

P Φ Ω dd li P 1 o rt rt Φ P- ι-id J li α Φ 3 Φ cn cn rt Φ. -. d P- O φ tr od H d α • n Φ ι-i if d φ rt P- ds: d PJ o cn H 3 3 li iQ φ et cx Φ • d CX 3 J Φ rt φ φ SD ö 3 Φ (X

Φ Φ Φ H H CΛ • x "• dd * H DJ d rt tr & P n P <! Φ dd Φ tr ≥. Φ HZ α • ^ H cn P Hi rt d Φ d PJ d ^ d Φ φ lf

Φ cx -0 Φ P 1 = J. ι- (fX Ω o h-> P ι- (Φ rt Ω Φ Φ Φ x rt Ω Φ li lf rt d Φ St. dd P + DJ P tr tr Φ φ JP "Φ tr dd <V d tr n> P ι- (J lf d P 1 x ι- (φ Φ P 3 PJ cn cn Φ α PJ N CX • <d <- 1 d

3 cx cx cx 1 CΛ P- Φ PJ et α rt rt Φ • Φ P rt Φ P- Φ Ω Φ Φ φ d

P d Φ Tf DJ Φ cn cn ≥i P O P P • H Ω Φ _ -. Φ P- P- P dn 1 H HH rt d Φ rt 3 Ω ddd <i cn O gd o ^ cn rt P- Φ tr Ω cn d d: 0- rt tr rt Φ P- Φ i .tau..sub.d cn Φ O Φ 3 xo Ω H tr Φ

Tf K tr P PJ Φ d d J NPP J. dd t O cn cn φ Z Φ P P- g öd

H P- φ d LP et; 1- Φ P- cn P d α li P- H- Φ Φ N Sö d

P 1 = lf P 1 et cn N Φ Φ DJ ≥! 0, Φ Ω φ P tr (___. Φ d 1-1 d tr Φ ι-idd Φ

Hi rt d tr P- CΛ CΛ rt H Φ iP tr 3 o ii d Φ 3 li a ^ φ Φ li dd

Φ LP li Ω Φ Ω 3 rt CX d φ Ω tr Φ φ ≤ Ξ Tf 1-1 d Hl d Ω LQ Φ

PJ tr Φ H tr d tr p- CΛ tr PJ Hi Φ <φ P- P- tr DJ P d od x LP P- Φ Φ P- H et CΛ rt Φ PJ H dd P- P- φ ι N-i 3 3 • ^ Ω cx dd H

Φ n φ d if 3 Ω rt Φ li 3 α P dd Φ (X Φ φ tr P dd Φ d lf tr d DJ <tr PJ Φ \ -> Φ rt P cn et (X P3 P tr Φ "tr Hi dd Tf

Φ Φ P Hi 3 Ω

LP Φ cn rf P 1 tr Ω φ LQ P dd h -1 Φ Ω LQ P 1 tr li d 1 d H * • r 't cn tr d Φ P Φ Φ do tr ^ P 1

Φ d 1 rt tr Ω 1 d 1 1 1 1 li

1 1 1 tr

In addition to a duplication and transmission via two separate paths even tripling, quadrupling, etc., and a corresponding number of physically separate paths, in principle, possible.

It should be noted that both a physical and a virtual connection can be understood as a connection.

The invention and further developments of the invention described can be implemented both in software and in hardware, for example by using a specific electrical circuit.

Furthermore, an implementation of the invention or one of its further developments is possible by a computer readable storage medium on which a computer program is stored which carries out the invention or development.

Finally, the invention or one of its developments can be implemented by a computer program product having a storage medium on which a computer program is stored which carries out the invention or an i rer developments.

Claims

claims
consist 1. A device for improving the resistance to network faults in a packet Determined-line data network, in which packets from capsules (C) in which in addition to the payload (P) additional information (I) can be transmitted and the active in the network node Anl ... AN4 are present, the easy controllable by the auxiliary information processor (BLP) have.
2. Device according to claim 1, wherein said processors are configured such that packets are duplicated, comparable correlated and selectable.
3. Device according to claim 1 or 2, wherein the additional information of the capsule contains a code fragment or a reference to this fragment.
4. Device according to one of the preceding claims, wherein the additional information of the capsule a synchronizing mark (S).
5. A method for improving the resistance to network faults in a packet switched data network, are transmitted in the packets in the form of capsules (C), in addition to a payload (P) additional information (I) for the control of simple processors (BLP) (in the active node AN) of the network included.
6. The method of claim 5, wherein only a first capsule of a sequence of packets containing additional information in the form of code fragments and the other capsules of this sequence only references to these code fragments.
7. The method of claim 5 or 6, are inserted in the in the additional information at specific time intervals, or a certain number of packets synchronous operation marks (S).
8. The method of claim 5 to 7, wherein in a first of the active nodes (ANL) packets duplicated as a function of the additional information and there previously determined physically separate paths (Pl, P2) to be transmitted further, in which said further transmitted are correlated, compared and selected packets in dependence of the entrained additional information in a second active node (AN2).
9. The method according to claim 8, in which each packet is duplicated and transmitted over physically separate paths, d
10. The method of claim 8, wherein the duplicated only package one or more types of packets and transmitted over separate physical paths.
11. The method according to claim 10, in which only I-frames of MPEG-encoded video stream sheet duplicated and transmitted over separate physical paths.
12. The method of claim 8, wherein m further transmissions are generated from a combination of n transmissions and physically separate paths are transmitted through to the original transmission paths.
13. A method for improving the resistance overall genüber network errors in a packet-switched data network, wherein the common node (N1 ... N4) are present, in which take place bit errors, a check at occurring single or multiple, and then a new request packets ( C) takes place at the end points of the transmission path, this network zel- or in which (in the active node AEN1 ... AN4) for input multiple errors a recalculation and correction of the payload is performed such that these errors remain undetected in normal nodes of a network and a new request of a package does not occur if these errors are tolerated by the requirement of application level ago.
PCT/DE2002/000322 2001-01-30 2002-01-30 Method for improving resistance against network errors in a packet switched data network WO2002062022A2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
DE10103953 2001-01-30
DE10103953.0 2001-01-30

Publications (2)

Publication Number Publication Date
WO2002062022A2 true WO2002062022A2 (en) 2002-08-08
WO2002062022A3 WO2002062022A3 (en) 2004-04-01

Family

ID=7672109

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2002/000322 WO2002062022A2 (en) 2001-01-30 2002-01-30 Method for improving resistance against network errors in a packet switched data network

Country Status (1)

Country Link
WO (1) WO2002062022A2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1587257A1 (en) * 2004-04-16 2005-10-19 Nortel Networks Limited Method and arrangement for selecting one of several nominally identical data streams

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0844792A2 (en) * 1992-06-19 1998-05-27 General Electric Company Method for arranging compressed video data for transmission over a noisy communication channel

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0844792A2 (en) * 1992-06-19 1998-05-27 General Electric Company Method for arranging compressed video data for transmission over a noisy communication channel

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
CARDOE R ET AL: "LARA: A PROTOTYPE SYSTEM FOR SUPPORTING HIGH PERFORMANCE ACTIVE NETWORKING" ACTIVE NETWORKS. INTERNATIONAL WORKING CONFERENCE, IWAN. PROCEEDINGS. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ACTIVE NETWORKS, XX, XX, 30. Juni 1999 (1999-06-30), Seiten 117-131, XP008001843 *
CHEN T M: "EVOLUTION TO THE PROGRAMMABLE INTERNET" IEEE COMMUNICATIONS MAGAZINE, IEEE SERVICE CENTER. PISCATAWAY, N.J, US, Bd. 38, Nr. 3, M{rz 2000 (2000-03), Seiten 124-128, XP000948531 ISSN: 0163-6804 *
CHUNG-SHENG LI ET AL: "Implementation and performance analysis of congestion-tolerant isochronous communication in ATM networks using diversified routing" COMMUNICATIONS, 1994. ICC '94, SUPERCOMM/ICC '94, CONFERENCE RECORD, 'SERVING HUMANITY THROUGH COMMUNICATIONS.' IEEE INTERNATIONAL CONFERENCE ON NEW ORLEANS, LA, USA 1-5 MAY 1994, NEW YORK, NY, USA,IEEE, 1. Mai 1994 (1994-05-01), Seiten 1341-1345, XP010126520 ISBN: 0-7803-1825-0 *
WETHERALL D J ET AL: "ANTS: a toolkit for building and dynamically deploying network protocols" OPEN ARCHITECTURES AND NETWORK PROGRAMMING, 1998 IEEE SAN FRANCISCO, CA, USA 3-4 APRIL 1998, NEW YORK, NY, USA,IEEE, US, 3. April 1998 (1998-04-03), Seiten 117-129, XP010272584 ISBN: 0-7803-4783-8 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1587257A1 (en) * 2004-04-16 2005-10-19 Nortel Networks Limited Method and arrangement for selecting one of several nominally identical data streams

Also Published As

Publication number Publication date
WO2002062022A3 (en) 2004-04-01

Similar Documents

Publication Publication Date Title
US5598410A (en) Method and apparatus for accelerated packet processing
US6909383B2 (en) Systematic encoding and decoding of chain reaction codes
US6173333B1 (en) TCP/IP network accelerator system and method which identifies classes of packet traffic for predictable protocols
EP1019833B1 (en) Mechanism for packet field replacement in a multi-layered switched network element
EP2363996B1 (en) Hashing algorithm for determining a default kernel receive queue
Chen et al. Commentaries on" Active networking and end-to-end arguments"
EP0823165B1 (en) Asynchronous packet switching
US5740375A (en) Forwarding internetwork packets by replacing the destination address
EP1342340B1 (en) Router and routing protocol redundancy
US7069495B2 (en) Bit error resilience for an internet protocol stack
US8135016B2 (en) System and method for identifying upper layer protocol message boundaries
Moser et al. Totem: A fault-tolerant multicast group communication system
US6976205B1 (en) Method and apparatus for calculating TCP and UDP checksums while preserving CPU resources
EP0418865A2 (en) Wireless signal transmission system with random access
US20010025315A1 (en) Term addressable memory of an accelerator system and method
EP1560376B1 (en) System-on-chip establishing paths between routers and method therefor
Shacham et al. Packet recovery in high-speed networks using coding and buffer management
US7836220B2 (en) Network direct memory access
JP3815562B2 (en) Data processing method, a communication system using the same, the data transmission apparatus, data receiving apparatus, and program
EP0513232B1 (en) Method of error recovery in a data communication system
US20020015405A1 (en) Error correction of important fields in data packet communications in a digital mobile radio network
US20020010790A1 (en) Architecture and addressing scheme for storage interconnect and emerging storage service providers
CA2226204C (en) Network addressing arrangement for backward compatible routing of an expanded address space
EP1665652B1 (en) Virtual switch for providing a single point of management
EP1543422B1 (en) Remote direct memory access enabled network interface controller switchover and switchback support

Legal Events

Date Code Title Description
AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR

AK Designated states

Kind code of ref document: A2

Designated state(s): JP US

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
122 Ep: pct application non-entry in european phase
WWW Wipo information: withdrawn in national office

Country of ref document: JP

NENP Non-entry into the national phase in:

Ref country code: JP