Abstract
Network coding theory is the most general study of transmission of information in networks whose vertices may perform nontrivial encoding and decoding operations on data as it passes through the network. A solution to a network coding problem is a specification of a coding function on each edge of the network. This specification is subject to constraints that ensure the existence of a protocol by which the messages on each vertex’s outgoing edges can be computed from the data it received on its incoming edges. In directed acyclic graphs it is clear how to verify these causality constraints, but in graphs with cycles this becomes more subtle because of the possibility of cyclic dependencies among the coding functions. Sometimes the system of coding functions is serializable — meaning that the cyclic dependencies (if any) can be “unraveled” by a protocol in which a vertex sends a few bits of its outgoing messages, waits to receive more information, then send a few more bits, and so on — but in other cases, there is no way to eliminate a cyclic dependency by an appropriate sequencing of partial messages. How can we decide whether a given system of coding functions is serializable? When it is not serializable, how much extra information must be transmitted in order to permit a serialization? Our work addresses both of these questions. We show that the first one is decidable in polynomial time, whereas the second one is NP-hard, and in fact it is logarithmically inapproximable.
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
Adler, M., Harvey, N.J.A., Jain, K., Kleinberg, R., Lehman, A.R.: On the capacity of information networks. In: Proc. of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 241–250 (2005)
Blasiak, A., Kleinberg, R.: The serializability of network codes. CoRR, abs/1001.1373 (2010)
Erez, E., Feder, M.: Efficient network codes for cyclic networks. In: Proc. 2005 International Symposium on Information Theory (ISIT), pp. 1982–1986 (2005)
Harvey, N.J.A., Kleinberg, R., Lehman, A.R.: On the capacity of information networks. IEEE Transactions on Information Theory 52(6), 2345–2364 (2006)
Harvey, N.J.A., Kleinberg, R., Nair, C., Wu, Y.: A “chicken & egg” network coding problem. In: Proc. 2007 IEEE International Symposium on Information Theory (ISIT), pp. 131–135 (2007)
Jain, K., Vazirani, V., Yeung, R.W., Yuval, G.: On the capacity of multiple unicast sessions in undirected graphs. In: Proc. 2005 IEEE International Symposium on Information Theory, ISIT (2005)
Koetter, R., Medard, M.: An algebraic approach to network coding. IEEE/ACM Transactions on Networking 11(5), 782–795 (2003)
Kramer, G., Savari, S.: Edge-cut bounds on network coding rates. Journal of Network and Systems Management 14(1), 49–67 (2006)
Lehman, A.R.: Network Coding. PhD thesis, MIT (2005)
Yeung, R.W.: A First Course in Information Theory. Springer, Heidelberg (2002)
Yeung, R.W., Li, S.-Y.R., Cai, N., Zhang, Z.: Network Coding Theory. Now Publishers (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blasiak, A., Kleinberg, R. (2010). The Serializability of Network Codes. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-14162-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14161-4
Online ISBN: 978-3-642-14162-1
eBook Packages: Computer ScienceComputer Science (R0)