Enhancing guaranteed delays with network coding

Abstract

For networks providing QoS guarantees, this paper determines and evaluates the worst case end-to-end delays for strategies based on network coding and multiplexing. It is shown that the end-to-end delay does not depend on the same parameters with the two strategies. This result can be explained by the fact that network coding can cope with congestions better than classical routing because it processes simultaneously packet from different flows. In counterpart, additional delays like algebraic combinations of packets are added