Abstract
Network coding (NC) has been proposed as a way to compress flows of packets by combining different packets, provided that there is sufficient redundancy through multiple transmission paths so that the receiving nodes can then decode the flows to reconstruct all of the individual packets. However NC does introduce additional computational overhead, and also creates different additional delays which are the subject of this paper. In particular, we evaluate the queueing and delay performance of NC at intermediate nodes of a store and forward packet network when the cross-encoding of packets is restricted within disjoint subsets of the traffic streams so that packets from different subsets cannot be encoded together. We propose a round robin scheduling scheme for serving these disjoint subsets, and present a queueing model for a single encoding node that captures the effect of NC. The model is analyzed approximately using a decoupling approach, and can be used to predict the additional delays incurred by packets in nodes that use NC. The accuracy of the analytical solution is validated via simulations.
Research supported by the EU FP6 CASCADAS and FP7 DIESIS Projects of the EU Future and Emerging Technologies Program.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Cai, N., Li, S.Y., Yeung, R.: Network information flow. IEEE Transactions on Information Theory 46(4), 1204–1216 (2000)
Abdelrahman, O.H., Gelenbe, E.: Queueing performance under network coding. In: IEEE Information Theory Workshop, 2009 (ITW 2009), Volos, Greece (2009)
Gelenbe, E., Iasnogorodski, R.: A queue with server of walking type (autonomous service). Annales de l’institut Henri Poincaré (B) Probabilités et Statistiques 16(1), 63–73 (1980)
Gelenbe, E., Mitrani, I.: Analysis and synthesis of computer systems. Academic Press, London (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdelrahman, O.H., Gelenbe, E. (2009). Approximate Analysis of a Round Robin Scheduling Scheme for Network Coding. In: Bradley, J.T. (eds) Computer Performance Engineering. EPEW 2009. Lecture Notes in Computer Science, vol 5652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02924-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-02924-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02923-3
Online ISBN: 978-3-642-02924-0
eBook Packages: Computer ScienceComputer Science (R0)