Fetching the paper…
Reading the bibliography…
The uplink of a cloud radio access network architecture is studied in which decoding at the cloud takes place via network function virtualization on commercial off-the-shelf servers.
R. L. Brooks, “On colouring the nodes of a network,” Mathematical Proceedings of the Cambridge Philosophical Society , vol. 37, no. 02, pp. 194–197, 1941
1941
Earlier work this paper cites.
A. Sánchez-Arroyo, “Determining the total colouring number is NP-hard,” Discrete Mathematics , vol. 78, no. 3, pp. 315–319, 1989
1989
Earlier work this paper cites.
H. C. Tijms, A First Course in Stochastic Models . John Wiley and Sons, 2003
2003
Earlier work this paper cites.
S. Janson, “Large deviations for sums of partly dependent random variables,” Random Structures & Algorithms , vol. 24, no. 3, pp. 234–248, 2004
2004
Earlier work this paper cites.
J. Dean and S. Ghemawat, “MapReduce: simplified data processing on large clusters,” Commun. of the ACM , vol. 51, no. 1, pp. 107–113, 2008
2008
Earlier work this paper cites.
G. Ananthanarayanan, S. Kandula, A. G. Greenberg, I. Stoica, Y. Lu, B. Saha, and E. Harris, “Reining in the outliers in Map-Reduce clusters using mantri.” in OSDI , vol. 10, no. 1, Oct., 2010, p. 24
2010
Earlier work this paper cites.
M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, “Spark: Cluster computing with working sets,” Proceeding of the 2nd USENIX conference on Hot topics in cloud computing , pp. 10–10, 2010
2010
Earlier work this paper cites.
Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory , vol. 56, no. 5, pp. 2307–2359, 2010
2010
Earlier work this paper cites.
U. Dötsch, M. Doll, H.-P. Mayer, F. Schaich, J. Segel, and P. Sehier, “Quantitative analysis of split base station processing and determination of advantageous architectures for LTE,” Bell Labs Technical Journal , vol. 18, no. 1, pp. 105–128, 2013
2013
Earlier work this paper cites.
G. Ananthanarayanan, A. Ghodsi, S. Shenker, and I. Stoica, “Effective straggler mitigation: Attack of the clones.” in NSDI , vol. 13, Apr., 2013, pp. 185–198
2013
Earlier work this paper cites.
N. Nikaein, R. Knopp, F. Kaltenberger, L. Gauthier, C. Bonnet, D. Nussbaum, and R. Ghaddab, “OpenAirInterface: an open LTE network in a PC,” in Proceedings of the 20th annual international conference on Mobile computing and networking . ACM, Sep., 2014, pp. 305–308
2014
Earlier work this paper cites.
P. Rost and A. Prasad, “Opportunistic hybrid arq—enabler of centralized-RAN over nonideal backhaul,” IEEE Wireless Communications Letters , vol. 3, no. 5, pp. 481–484, 2014
2014
Earlier work this paper cites.
G. Joshi, Y. Liu, and E. Soljanin, “On the delay-storage trade-off in content download from coded distributed storage systems,” IEEE Journal on Selected Areas in Communications , vol. 32, no. 5, pp. 989–997, 2014
2014
Earlier work this paper cites.
S. M. Ross, Introduction to Probability Models . Academic Press, 2014
2014
Earlier work this paper cites.
N. Nikaein, “Processing radio access network functions in the cloud: Critical issues and modeling,” in Proceedings of the 6th International Workshop on Mobile Cloud Computing and Services, . ACM, Apr., 2015, pp. 36–43
2015
Earlier work this paper cites.
I. Alyafawi, E. Schiller, T. Braun, D. Dimitrova, A. Gomes, and N. Nikaein, “Critical issues of centralized and cloudified LTE-FDD radio access networks,” in Communications (ICC), 2015 IEEE International Conference on . IEEE, Jun., 2015, pp. 5523–5528
2015
Cited alongside, same era.
——, “Coded MapReduce,” in Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton Conference on . IEEE, Oct., 2015, pp. 964–971
2015
Cited alongside, same era.
D. Wang, G. Joshi, and G. Wornell, “Using straggler replication to reduce latency in large-scale parallel computing,” ACM SIGMETRICS Performance Evaluation Review , vol. 43, no. 3, pp. 7–11, 2015
2015
Cited alongside, same era.
R. Mijumbi, J. Serrat, J.-L. Gorricho, N. Bouten, F. De Turck, and R. Boutaba, “Network function virtualization: State-of-the-art and research challenges,” IEEE Communications Surveys & Tutorials , vol. 18, no. 1, pp. 236–262, 2016
2016
Cited alongside, same era.
V. Q. Rodriguez and F. Guillemin, “Towards the deployment of a fully centralized cloud-RAN architecture,” in Wireless Communications and Mobile Computing Conference (IWCMC), 2017 13th International , Valencia, Spain, Jun., 2017, pp. 1055–1060
2017
Closest in time.
Y. Yang, P. Grover, and S. Kar, “Computing linear transformations with unreliable components,” IEEE Transactions on Information Theory , 2017
2017
Closest in time.
A. Severinson, A. Graell i Amat, and E. Rosnes, “Block-diagonal coding for distributed computing with straggling servers,” in Information Theory Workshop (ITW) , Nov., 2017, pp. 464–468
2017
Closest in time.
Q. Yu, M. Maddah-Ali, and S. Avestimehr, “Polynomial codes: An optimal design for high-dimensional coded matrix multiplication,” in Advances in Neural Information Processing Systems , 2017, pp. 4403–4413
2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
European Telecommunications Standards Institute, “Network function virtualisation (NFV); report on models and features for end-to-end reliability,” Technical Report GS NFV-REL 003, Apr., 2016
2016
Cited alongside, same era.
J. Liu, Z. Jiang, N. Kato, O. Akashi, and A. Takahara, “Reliability evaluation for NFV deployment of future mobile broadband networks,” IEEE Wireless Communications , vol. 23, no. 3, pp. 90–96, 2016
2016
Cited alongside, same era.
J. G. Herrera and J. F. Botero, “Resource allocation in NFV: A comprehensive survey,” IEEE Transactions on Network and Service Management , vol. 13, no. 3, pp. 518–532, 2016
2016
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded distributed computing: Straggling servers and multistage dataflows,” in Communication, Control, and Computing (Allerton), 2016 54th Annual Allerton Conference on . IEEE, Oct., 2016, pp. 164–171
2016
Cited alongside, same era.
——, “A unified coding framework for distributed computing with straggling servers,” in Globecom Workshops (GC Wkshps), 2016 IEEE . IEEE, Dec., 2016, pp. 1–6
2016
Cited alongside, same era.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” Proc. IEEE International Symposium on Information Theory , pp. 1143–1147, Jul., 2016
2016
Cited alongside, same era.
2016
Cited alongside, same era.
S. Dutta, V. Cadambe, and P. Grover, “Short-dot: Computing large linear transforms distributedly using coded short dot products,” Advances In Neural Information Processing Systems , pp. 2092–2100, 2016
2016
Cited alongside, same era.
G. Joshi, E. Soljanin, and G. Wornell, “Efficient redundancy techniques for latency reduction in cloud systems,” ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) , vol. 2, no. 2, p. 12, 2017
2017
Closest in time.
M. F. Aktas, P. Peng, and E. Soljanin, “Effective straggler mitigation: Which clones should attack and when?” ACM SIGMETRICS Performance Evaluation Review , vol. 45, no. 2, pp. 12–14, 2017
2017
Closest in time.
2017
Closest in time.
M. Aliasgari, J. Kliewer, and O. Simeone, “Coded computation against straggling decoders for network function virtualization,” Proc. IEEE International Symposium on Information Theory , pp. 711–715, Jun., 2018
2018
Closest in time.
European Telecommunications Standards Institute, “Cloud RAN and MEC: A perfect pairing,” ISBN No. 979-10-92620-17-7, Feb., 2018
2018
Closest in time.
——, “Cloud-ran modeling based on parallel processing,” IEEE Journal on Selected Areas in Communications , vol. 36, no. 3, pp. 457–468, 2018
2018
Closest in time.
S. Li, M. A. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A fundamental tradeoff between computation and communication in distributed computing,” IEEE Transactions on Information Theory , vol. 64, no. 1, pp. 109–128, 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.