`a`
Advances in Mathematics of Communications (AMC)
 

The one-out-of-k retrieval problem and linear network coding
Pages: 95 - 112, Issue 1, February 2016

doi:10.3934/amc.2016.10.95      Abstract        References        Full text (404.3K)           Related Articles

Giuseppe Bianchi - Dipartimento di Ingegneria Elettronica, Università degli Studi di Roma - Tor Vergata, Via del Politecnico, 1 00133 - Roma, Italy (email)
Lorenzo Bracciale - Dipartimento di Ingegneria Elettronica, Università degli Studi di Roma - Tor Vergata, Via del Politecnico, 1 00133 - Roma, Italy (email)
Keren Censor-Hillel - Department of Computer Science, Technion, Haifa 32000, Israel (email)
Andrea Lincoln - 160 Sunrise Dr, Woodside, CA 94062, United States (email)
Muriel Médard - Room 36-512F, 77 Massachusetts Avenue, Cambridge, MA 02139, United States (email)

1 F. M. Buckley and P. K. Pollett, Limit theorems for discrete-time metapopulation models, Probab. Surveys, 7 (2010), 53-83.       
2 L. Chen, T. Ho, S. H. Low, M. Chiang and J. C. Doyle, Optimization based rate control for multi-cast with network coding, in 26th IEEE Int. Conf. Comp. Commun. 2007, 1163-1171.
3 R. W. R. Darlings and J. R. Norris, Differential equation approximations for Markov chains, Probab. Surveys, 5 (2008), 37-79.       
4 F. De Pellegrini, R. El-Azouzi and F. Albini, Interplay of contact times, fragmentation and coding in DTNs, in 11th Int. Symp. Modeling Optim. Mobile Ad Hoc Wireless Networks, 2013, 580-587.
5 S. Deb, M. Medard and C. Choute, Algebraic gossip: a network coding approach to optimal multiple rumor mongering, IEEE Trans. Inf. Theory, 52 (2006), 2486-2507.       
6 A. G. Dimakis V. Prabhakaran and K. Ramchandran, Decentralized erasure codes for distributed networked storage, IEEE Trans. Inf. Theory, 52 (2006), 2809-2816.       
7 P. Erdős and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci., 5 (1960), 17-61.       
8 L. Keller, E. Atsan, K. Argyraki and C. Fragouli, SenseCode: Network coding for reliable sensor networks, ACM Trans. Sen. Netw., 9 (2013), #25.
9 T. G. Kurtz, Solutions of ordinary differential equations as limits of pure jump Markov processes, J. Appl. Probab., 7 (1970), 49-58.       
10 Y. Lin, B. Li and B. Liang, Efficient network coded data transmissions in disruption tolerant networks, in The 27th IEEE Conf. Comp. Commun., 2008, 2180-2188.
11 M. Luby, LT codes, in The 43rd Ann. IEEE Symp. Found. Comp. Sci., 2002, 271-280.
12 A. Oppenheim, R. Schafer and J. Buck, Discrete-Time Signal Processing, Printice Hall Inc., New Jersey, 1989.
13 L. Sassatelli and M. Medard, Inter-session network coding in delay-tolerant networks under Spray-and-Wait routing, Model. Optim. Mob. Ad Hoc Wirel. Netw., 10 (2012), 103-110.
14 J. Widmer and J. Y. Le Boudec, Network coding for efficient communication in extreme networks, in ACM SIGCOMM Workshop Delay-Tolerant Networking, 2005, 284-291.
15 S. K. Yoon and Z. J. Haas, Application of linear network coding in delay tolerant networks, in Second Int. Conf. Ubiquitous Future Networks (ICUFN), 2010, 338-343.
16 X. Zhang, G. Neglia, J. Kurose, D. Towsley and H. Wang, Benefits of network coding for unicast application in disruption-tolerant networks, IEEE/ACM Trans. Networking, 21 (2013), 1407-1420.

Go to top