Yu Sang
Yu Sang
Verified email at temple.edu
Title
Cited by
Cited by
Year
Provably efficient algorithms for joint placement and allocation of virtual network functions
Y Sang, B Ji, GR Gupta, X Du, L Ye
IEEE INFOCOM 2017-IEEE Conference on Computer Communications, 1-9, 2017
1042017
The power of waiting for more than one response in minimizing the age-of-information
Y Sang, B Li, B Ji
GLOBECOM 2017-2017 IEEE Global Communications Conference, 1-6, 2017
212017
Throughput characterization of node-based scheduling in multihop wireless networks: A novel application of the gallai-edmonds structure theorem
B Ji, Y Sang
Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc …, 2016
62016
Node-based service-balanced scheduling for provably guaranteed throughput and evacuation time performance
B Ji, GR Gupta, Y Sang
IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer …, 2016
52016
Waiting But Not Aging: Optimizing Information Freshness Under the Pull Model
F Li, Y Sang, Z Liu, B Li, H Wu, B Ji
IEEE/ACM Transactions on Networking, 2020
42020
Improving timeliness of information through replicating requests
C Skinner, Y Sang, B Ji
2016 IEEE 37th Sarnoff Symposium, 1-2, 2016
42016
Node-based service-balanced scheduling for provably guaranteed throughput and evacuation time performance
Y Sang, GR Gupta, B Ji
IEEE Transactions on Mobile Computing 17 (8), 1938-1951, 2017
22017
Waiting but not Aging: Age-of-Information and Utility Optimization Under the Pull Model.
F Li, Y Sang, Z Liu, B Li, H Wu, B Ji
arXiv preprint arXiv:1912.08722, 2019
12019
INFORMATION-UPDATE SYSTEMS: MODELS, ALGORITHMS, AND ANALYSIS
Y Sang
Theses and Dissertations, 2019
2019
A Worst-Case Approximate Analysis of Peak Age-of-Information Via Robust Queueing Approach
Z Liu, Y Sang, B Li, B Ji
The system can't perform the operation now. Try again later.
Articles 1–10