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. © IFIP International Federation for Information Processing 2007.
CITATION STYLE
Mahmino, A., Lacan, J., & Fraboul, C. (2007). Enhancing guaranteed delays with network coding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 1229–1232). Springer Verlag. https://doi.org/10.1007/978-3-540-72606-7_119
Mendeley helps you to discover research relevant for your work.