Search for: All records | NSF Public Access

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Cache-Enabled Federated Learning Systems

https://doi.org/10.1145/3565287.3610264

Liu, Yuezhou; Su, Lili; Joe-Wong, Carlee; Ioannidis, Stratis; Yeh, Edmund; Siew, Marie (October 2023, ACM)

Full Text Available
Experimental Design Networks: A Paradigm for Serving Heterogeneous Learners Under Networking Constraints

https://doi.org/10.1109/TNET.2023.3243534

Li, Yuanyuan; Liu, Yuezhou; Su, Lili; Yeh, Edmund; Ioannidis, Stratis (February 2023, IEEE/ACM Transactions on Networking)

Full Text Available
Optimal Congestion-aware Routing and Offloading in Collaborative Edge Computing

https://doi.org/10.23919/WiOpt56218.2022.9930581

Zhang, Jinkun; Liu, Yuezhou; Yeh, Edmund (September 2022, IEEE)
Experimental Design Networks: A Paradigm for Serving Heterogeneous Learners under Networking Constraints

https://doi.org/10.1109/INFOCOM48880.2022.9796907

Liu, Yuezhou; Li, Yuanyuan; Su, Lili; Yeh, Edmund; Ioannidis, Stratis (May 2022, IEEE INFOCOM 2022 - IEEE Conference on Computer Communications)

Full Text Available
Joint User Association and Caching in Wireless Heterogeneous Networks with Backhaul

https://doi.org/10.1109/ICC42927.2021.9500762

Liu, Yuezhou; Alizadeh, Alireza; Vu, Mai; Yeh, Edmund (June 2021, ICC 2021 - IEEE International Conference on Communications)
null (Ed.)
Full Text Available
Fair Caching Networks

https://doi.org/10.1145/3453953.3453973

Liu, Yuezhou; Li, Yuanyuan; Ma, Qian; Ioannidis, Stratis; Yeh, Edmund (March 2021, ACM SIGMETRICS Performance Evaluation Review)
null (Ed.)
We study fair content allocation strategies in caching networks through a utility-driven framework, where each request achieves a utility of its caching gain rate. The resulting problem is NP-hard. Submodularity allows us to devise a deterministic allocation strategy with an optimality guarantee factor arbitrarily close to 1-1/e. When 0 < α ≤ 1, we further propose a randomized strategy that attains an improved optimality guarantee, (1 - 1/e)1-α, in expectation. Through extensive simulations over synthetic and real-world network topologies, we evaluate the performance of our proposed strategies and discuss the effect of fairness.
more » « less
Full Text Available
N-DISE: NDN-based data distribution for large-scale data-intensive science

https://doi.org/10.1145/3517212.3558087

Wu, Yuanhao; Mutlu, Faruk Volkan; Liu, Yuezhou; Yeh, Edmund; Liu, Ran; Iordache, Catalin; Balcas, Justas; Newman, Harvey; Sirvinskas, Raimondas; Lo, Michael; et al (September 2022, ICN '22: Proceedings of the 9th ACM Conference on Information-Centric Networking)

Full Text Available
Fair caching networks

https://doi.org/10.1016/j.peva.2020.102138

Liu, Yuezhou; Li, Yuanyuan; Ma, Qian; Ioannidis, Stratis; Yeh, Edmund (November 2020, Performance Evaluation)
null (Ed.)
Full Text Available