References Lectures II, III, IV, V, VI [Ahslwede et al. 00] Network Information Flow Rudolf Ahlswede, Ning Cai, Shuo-­‐Yen Robert Li, and Raymond W. Yeung IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 4, JULY 2000 [KM01, 02, 03] Koetter, R.; Medard, M.; , "An algebraic approach to network coding," Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on , vol., no., pp.104, 2001 doi: 10.1109/ISIT.2001.935967 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=935967&isnumber=2
0241 Koetter, R.; Medard, M.; , "Beyond routing: an algebraic approach to network coding," INFOCOM 2002. Twenty-­‐First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE , vol.1, no., pp. 122-­‐ 130 vol.1, 2002 doi: 10.1109/INFCOM.2002.1019253 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1019253&isnumber=
21921 Ralf Koetter and Muriel Médard IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 5, OCTOBER 2003 An Algebraic Approach to Network Coding [HKMKE03, HMSEK03, WCJ03] Ho, T.; Koetter, R.; Medard, M.; Karger, D.R.; Effros, M.; , "The benefits of coding over routing in a randomized setting," Information Theory, 2003. Proceedings. IEEE International Symposium on , vol., no., pp. 442, 29 June-­‐4 July 2003 doi: 10.1109/ISIT.2003.1228459 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1228459&isnumber=
27553 Ho, T.; Karger, D.R.; Medard, M.; Koetter, R.; , "Network coding from a network flow perspective," Information Theory, 2003. Proceedings. IEEE International Symposium on , vol., no., pp. 441, 29 June-­‐4 July 2003 doi: 10.1109/ISIT.2003.1228458 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1228458&isnumber=
27553 Practical network coding PA Chou, Y Wu, K Jain -­‐ Annual Allerton Conference, 2003 [HMEK04] Tracey Ho, Muriel Medard, Michelle Effros and Ralf Koetter Network Coding for Correlated Sources Annual Allerton Conference [Lun et al. 04, 05] [LME04], [LMK05] D. S. Lun, M. Médard, and M. Effros. On coding for reliable communication over packet networks. In Proc. 42nd Annual Allerton Conference on Communication, Control, and Computing, pages 20-­‐29, September-­‐October 2004. Invited paper. D. S. Lun, M. Médard, R. Koetter, and M. Effros. Further results on coding for reliable communication over packet networks. In Proc. 2005 IEEE International Symposium on Information Theory (ISIT 2005), pages 1848-­‐1852, September 2005 [Dana et al. 04] A. F. Dana, R. Gowaikar, B. Hassibi, “On the capacity region of the broadcast problems over wireless erasure networks,"Proc. 42nd Annual Allerton Conf. on Communication, Control,and Computing, 2004 Pakzad et al. 05 Payam Pakzad, Christina Fragouli, Amin Shokrollahi: Coding Schemes for Line Networks CoRR abs/cs/0508124: (2005) Lun et al. 06 D. S. Lun, P. Pakzad, C. Fragouli, M. Médard, and R. Koetter. An analysis of finite-­‐
memory random linear coding on packet streams. In Proc. 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt '06), April 2006 [Fragouli et al. 07] Christina Fragouli, Desmond S. Lun, Muriel Médard, Payam Pakzad: On Feedback for Network Coding. CISS 2007: 248-­‐252 [DGPHE04] R. Gowaikar, A. F. Dana, R. Palanki, B. Hassibi, M. E_ros, \On the capacity of wireless erasure relay networks," Proc. IEEE ISIT 2004, Chicago, USA, pp. 401 [Lunetal04] D. S. Lun, M. Médard, T. Ho, and R. Koetter. Network coding with a cost criterion. In Proc. 2004 International Symposium on Information Theory and its Applications (ISITA 2004), October 2004. [Lunetal05] [LRKMAL05] D. S. Lun, N. Ratnakar, R. Koetter, M. Médard, E. Ahmed, and H. Lee. Achieving minimum cost multicast: A decentralized approach based on network coding. In Proc. IEEE Infocom 2005, volume 3, pages 1607-­‐1617, March 2005. [SC96] H.D. Sherali, G. Choi Operations Research Letters 19 (1996) 105113 107 2. Recovery of primal solutions in pure subgradient approaches [Park et al. 06] J.-­‐S. Park, M. Gerla, D. S. Lun, Y. Yi, and M. Médard. Codecast: A network-­‐coding based ad hoc multicast protocol. IEEE Wireless Commun. Mag., 13(5):76-­‐81, October 2006. [Lee et al. 02] On-­‐demand multicast routing protocol in multihop wireless mobile networks SJ Lee, W Su, M Gerla -­‐ Mobile Networks and Applications, 2002 [Hoetal06] Ho, T.; Medard, M.; Koetter, R.; Karger, D.R.; Effros, M.; Jun Shi; Leong, B.; , "A Random Linear Network Coding Approach to Multicast," Information Theory, IEEE Transactions on , vol.52, no.10, pp.4413-­‐4430, Oct. 2006 doi: 10.1109/TIT.2006.881746 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1705002&isnumber=
35980 [Lee et al. 07] Lee, M. Médard, K. Z. Haigh, S. Gowan, P. Rubel, “Minimum-­‐Cost Subgraphs for Joint Distributed Source and Network Coding”, the Third Workshop on Network Coding, Theory, and Applications, , paper #7, January 2007. [Katabi et al 05] September 2005, “The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments,” The Forty-­‐third Annual Allerton Conference on Communication, Control, and Computing, (Allerton 2005). [BM05] S. Biswas and R. Morris. ExOR: Opportunistic multi-­‐hoprouting for wireless networks. In Proceedings of ACM SIGCOMM, Aug. 2005 [Jaggi et al. 03] erratum should be 05 Jaggi, S.; Langberg, M.; Ho, T.; Effros, M.; , "Correction of adversarial errors in networks," Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on , vol., no., pp.1455-­‐1459, 4-­‐9 Sept. 2005 doi: 10.1109/ISIT.2005.1523584 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1523584&isnumber=
32581 [Shrader, Ephremides 06] Shrader, B.; Ephremides, A.; , "On the queueing delay of a multicast erasure channel," Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE , vol., no., pp.423-­‐427, 22-­‐
26 Oct. 2006 doi: 10.1109/ITW2.2006.323834 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4119332&isnumber=
4119226 [Eryilmaz et al. 06] Eryilmaz, A.; Ozdaglar, A.; Medard, M.; , "On Delay Performance Gains From Network Coding," Information Sciences and Systems, 2006 40th Annual Conference on , vol., no., pp.864-­‐870, 22-­‐24 March 2006 doi: 10.1109/CISS.2006.286588 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4067929&isnumber=
4067759 [Ahmed et al. 07] Ahmed, Ebad; Eryilmaz, Atilla; Medard, Muriel; Ozdaglar, Asuman E.; , "On the Scaling Law of Network Coding Gains in Wireless Networks," Military Communications Conference, 2007. MILCOM 2007. IEEE , vol., no., pp.1-­‐7, 29-­‐31 Oct. 2007 doi: 10.1109/MILCOM.2007.4454969 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4454969&isnumber=
4454733 [Ahmed et al. 06] Ahmed E., Eryilmaz A., Ozdaglar A., Medard M., “Economic Aspects of Network Coding”, Proceedings of the Forty-­‐fourth Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, September, 2006. [Sundararajan et al. 07] J.-­‐K. Sundararajan, Shah, D., and Médard,M., “On Queueing in Coded Networks -­‐ Queue Size Follows Degrees of Freedom,” invited paper, Information Theory Workshop, pp. 212-­‐217, July 2007. [Lucani et al 09] D. Lucani, Médard, M. and Stojanovic, M., “Random Linear Network Coding for Time-­‐
Division Duplexing: Field Size Considerations”, IEEE Globecom 2009 Communication Theory Symposium, November-­‐December 2009. D. Lucani, Médard, M. and Stojanovic, M., “Sharing Information in Time-­‐Division Duplexing Channels: A Network Coding Approach”, 2009 Annual Allerton Conference on Communication, Control, and Computing. D. Lucani, Médard, M. and Stojanovic, M., “Random Linear Network Coding for Time-­‐
Division Duplexing: Queueing Analysis”, ISIT, July 2009 D. Lucani, Médard, M. and Stojanovic, M., “Broadcasting in time-­‐division duplexing: A random linear network coding approach”, Netcod, June 2009. D. Lucani, Médard, M. and Stojanovic, M. , “Random Linear Network Coding For Time Division Duplexing: Energy Analysis”, ICC Communication Theory Workshop, June 2009. Lucani, D. E., Stojanovic, M., Médard, M., “Random Linear Network Coding for Time Division Duplexing: When To Stop Talking And Start Listening ”, INFOCOM, 2009. Lucani, D. E., Médard, M., Stojanovic, M., “On Coding for Delay -­‐ New Approaches Based on Network Coding in Networks with Large Latency ”, to appear in ITA, 2009. [Ng et al. 09] Ng, Médard, M. and Ozdaglar, A. , “Completion Time Minimization and Robust Power Control in Wireless Packet Networks”, ICC Communication Theory Workshop, June 2009. [Sundararajan et al. 09] J. Sundararajan, D. Shah, M. Medard, Michael Mitzenmacher, J. Barros, “Network coding meets TCP”, INFOCOM 2009, April 2009. [CY02] Ning Cai; Yeung, R.W.; , "Secure network coding," Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on , vol., no., pp. 323, 2002 doi: 10.1109/ISIT.2002.1023595 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1023595&isnumber=
21920 {FMSS04] Jon Feldman, Tal Malkin†, Rocco A. Servedio‡, Cliff Stein On the Capacity of Secure Network Coding Proc. 42nd Annual Allerton Conference on Communication, Control, and Computing, September 2004. [TM06] J. Tan, M. Médard, “Secure Network Coding with a Cost Criterion”, Netcod 2006 (Second Workshop on Network Coding, Theory, and Applications), April 2006. [JM04, LLF04] J. Jeong, and J. Ma, “Security analysis of multi-­‐path routing scheme in ad hoc networks,” Lecture Notes in Computer Science, vol. 3320, pp. 694 -­‐ 697, 2004. W. Lou, W. Liu, and Y. Fang, “SPREAD: Enhancing data confidentiality in mobile ad hoc networks,” Proc. -­‐ IEEE INFOCOM, vol. 4, pp. 2404 -­‐ 2413, 2004. [LMB07] Lima, Luisa; Medard, Muriel; Barros, Joao; , "Random Linear Network Coding: A free cipher?," Information Theory, 2007. ISIT 2007. IEEE International Symposium on , vol., no., pp.546-­‐550, 24-­‐29 June 2007 doi: 10.1109/ISIT.2007.4557282 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4557282&isnumber=
4557062 [LSP82] LESLIE LAMPORT, ROBERT SHOSTAK, and MARSHALL PEASE The Byzantine Generals Problem [P88] Perlman, R., "Network Layer Protocols with Byzantine Robustness", MIT LCS Tech report, 429, 1988. [MR97] D. Malkhi and M. Reiter, “A high-­‐throughput secure reliable multicast protocol,” Journal of Computer Security, vol. 5, pp. 113–127, 1997. [KMM98] K. P. Kihlstrom, L. E. Moser, and P. M. Melliar-­‐Smith, “The SecureRing protocols for securing group communication,” in Proc. 31st Annual Hawaii International Conference on System Sciences (HICSS). 1998, vol. 3, pp. 317–326, IEEE Computer Society Press. [CL99] Miguel Castro, Barbara Liskov: Practical Byzantine Fault Tolerance. OSDI 1999: 173-­‐186 [HLKMEK04] T. Ho, B. Leong, R. Koetter, M. Médard, M. Effros and D. R. Karger, "Byzantine Modification Detection in Multicast Networks Using Randomized Network Coding," International Symposium on Information Theory (ISIT) 2004. [KK07] R. Koetter and F. R. Kschischang, Coding for Errors and Erasures in Random Network Coding, to appear in IEEE Transactions on Information Theory, initially submitted in March, 2007. [JLHE05] Jaggi, S.; Langberg, M.; Ho, T.; Effros, M.; , "Correction of adversarial errors in networks," Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on , vol., no., pp.1455-­‐1459, 4-­‐9 Sept. 2005 doi: 10.1109/ISIT.2005.1523584 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1523584&isnumber=
32581 [JKLHDKM07] Jaggi, S.; Langberg, M.; Katti, S.; Ho, T.; Katabi, D.; Medard, M.; , "Resilient Network Coding in the Presence of Byzantine Adversaries," INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE , vol., no., pp.616-­‐624, 6-­‐
12 May 2007 doi: 10.1109/INFCOM.2007.78 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4215660&isnumber=
4215582 [ADMK05] S. Acedań ski, S. Deb, M. Médard, R. Koetter , “How Good is Random Linear Coding Based Distributed Networked Storage?”, NetCod 2005. [DPR05] erratum 06 Decentralized Erasure Codes for Distributed Networked Storage" A. G. Dimakis, V. Prabhakaran, K. Ramchandran, IEEE Transactions on Information Theory, June 2006. [GR05] "Network Coding for Large Scale Content Distribution", C. Gkantsidis, P. Rodriguez, IEEE/INFOCOM'05, Miami. March 2005. [DGWR07] Network Coding for Distributed Storage Systems Alexandros G. Dimakis, P. Brighten Godfrey, Yunnan Wu, Martin O. Wainwright and Kannan Ramchandran INFOCOM 2007, [CJL06] D. Charles, K. Jain, and K. Lauter, “Signatures for network coding,” in Proceedings of the 40th Annual Conference on Information Sciences [ZKMH07] F. Zhao, Kalker, T., Médard, M., and Han, K., “Signatures for Content Distribution with Network Coding,” ISIT (5 pages), July 2007. [FM] Minas Gjoka, Christina Fragouli, Pegah Sattari, Athina Markopoulou: Loss Tomography in General Topologies with Network Coding. GLOBECOM 2007: 381-­‐386 S. Teerapittayanon, Fouli, K., Médard, M., Montpetit, M.-­‐J., Shi, X., Seskar, I., and Gosain, A., “Network Coding as a WiMAX Link Reliability Mechanism”, MACOM 2012 S. Teerapittayanon, Fouli, K., Médard, M., Montpetit, M.-­‐J., Shi, X., Seskar, I., and Gosain, A., “Network Coding as a WiMAX Link Reliability Mechanism: An Experimental Demonstration”, MACOM 2012 W. Zeng, Ng, C., and Médard, M., “Joint Coding and Scheduling Optimization in Wireless Systems with Varying Delay Sensitivities”, SECON 2012 Haeupler, Kim, M. and Médard, M., “Optimality of Network Coding with Buffers”, Information Theory Workshop 2011 ParandehGheibi, Médard, M., Ozdaglar, A., and Shakkottai, S., “Avoiding Interruptions—
A QoE Reliability Function for Streaming Media Applications”, IEEE Journal on Selected Areas in Communications, special issue on “Trading rate for Delay at the Transport and Application Layers”, vol. 29, no. 5, May 2011, pp. 1064-­‐1074 ParandehGheibi, Médard, M., Ozdaglar, A., and Shakkottai, S., “Access-­‐Network Association Policies for Media Streaming in Heterogeneous Environments”, CDC 2010** M. Kim, Médard, M., and Barros, J., “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, Valuetools 2011 J. K. Sundararajan, Shah, D., Médard, M., Jakubczak, S., Mitzenmacher, M. and Barros, J., “Network Coding Meets TCP: Theory and Implementation”, invited paper, Proceedings of the IEEE, March 2011, pp. 490 – 512