A method of handling data traffic in a data network, the method comprising: a node (110, 120, 130; 900; 1100; 1200) of the data network configuring multiple redundant links for transmission of data packets , the data packets being classified into data packets of multiple different classes and the data packets being replicated to obtain, for each of the redundant links, a redundant version of the data packets ; characterized by for each of the redundant links, the node (110, 120, 130; 900; 1100; 1200) configuring a corresponding resource contingent based on a worst case calculation of a delay experienced by a data packet on the redundant link; wherein for a first one of the classes all redundant versions of the data packets are marked with a first indication that the data packet is a guaranteed data packet which is subject to a guarantee that the data packet is not dropped and not delayed by more than a certain delay limit; wherein for a second one of the classes, at least one of the redundant versions of the data packets is marked with a second indication that the data packet is a guaranteed data packet which is subject to the guarantee while at least one other of the redundant versions of the data packets is marked with a third indication that the data packet is a non-guaranteed data packet which is not subject to the guarantee, wherein for each of the redundant links the node (110, 120, 130; 900; 1100; 1200) configures the resource contingent with a maximum amount of resources which is more than a minimum amount of resources required to meet the guarantee, and wherein on each of the redundant links the non-guaranteed data packets are forwarded based on excess resources in excess of the minimum amount required to meet the guarantee. a node (110, 120, 130; 900; 1100; 1200) of the data network configuring multiple redundant links for transmission of data packets , the data packets being classified into data packets of multiple different classes and the data packets being replicated to obtain, for each of the redundant links, a redundant version of the data packets ; characterized by for each of the redundant links, the node (110, 120, 130; 900; 1100; 1200) configuring a corresponding resource contingent based on a worst case calculation of a delay experienced by a data packet on the redundant link; wherein for a first one of the classes all redundant versions of the data packets are marked with a first indication that the data packet is a guaranteed data packet which is subject to a guarantee that the data packet is not dropped and not delayed by more than a certain delay limit; wherein for a second one of the classes, at least one of the redundant versions of the data packets is marked with a second indication that the data packet is a guaranteed data packet which is subject to the guarantee while at least one other of the redundant versions of the data packets is marked with a third indication that the data packet is a non-guaranteed data packet which is not subject to the guarantee, wherein for each of the redundant links the node (110, 120, 130; 900; 1100; 1200) configures the resource contingent with a maximum amount of resources which is more than a minimum amount of resources required to meet the guarantee, and wherein on each of the redundant links the non-guaranteed data packets are forwarded based on excess resources in excess of the minimum amount required to meet the guarantee. <EOS>