<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>J. Sun | NIULAB</title><link>http://network.ee.tsinghua.edu.cn/authors/j.-sun/</link><atom:link href="http://network.ee.tsinghua.edu.cn/authors/j.-sun/index.xml" rel="self" type="application/rss+xml"/><description>J. Sun</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en</language><lastBuildDate>Sun, 01 Jan 2023 00:00:00 +0000</lastBuildDate><image><url>http://network.ee.tsinghua.edu.cn/media/icon_hu_7d2a9e6dbe042ff1.png</url><title>J. Sun</title><link>http://network.ee.tsinghua.edu.cn/authors/j.-sun/</link></image><item><title>Optimizing Task-Specific Timeliness With Edge-Assisted Scheduling for Status Update</title><link>http://network.ee.tsinghua.edu.cn/publication/optimizing-task-025/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>http://network.ee.tsinghua.edu.cn/publication/optimizing-task-025/</guid><description/></item><item><title>SMDP-Based Dynamic Batching for Efficient Inference on GPU-Based Platforms</title><link>http://network.ee.tsinghua.edu.cn/publication/smdp-efficient-inference-286/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>http://network.ee.tsinghua.edu.cn/publication/smdp-efficient-inference-286/</guid><description/></item><item><title>A UoI-Optimal Policy for Timely Status Updates with Resource Constraint</title><link>http://network.ee.tsinghua.edu.cn/publication/auoi-optimal-043/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>http://network.ee.tsinghua.edu.cn/publication/auoi-optimal-043/</guid><description/></item><item><title>Age-Optimal Scheduling for Heterogeneous Traffic with Timely-Throughput Constraint</title><link>http://network.ee.tsinghua.edu.cn/publication/age-optimal-047/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>http://network.ee.tsinghua.edu.cn/publication/age-optimal-047/</guid><description/></item><item><title>Age-Optimal Scheduling for Heterogeneous Traffic with Timely-Throughput Constraint</title><link>http://network.ee.tsinghua.edu.cn/publication/age-optimal-176/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>http://network.ee.tsinghua.edu.cn/publication/age-optimal-176/</guid><description/></item><item><title>Closed-Form Whittle's Index-Enabled Random Access for Timely Status Update</title><link>http://network.ee.tsinghua.edu.cn/publication/closed-form-058/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>http://network.ee.tsinghua.edu.cn/publication/closed-form-058/</guid><description/></item><item><title>Timely Status Update Based on Urgency of Information with Statistical Context</title><link>http://network.ee.tsinghua.edu.cn/publication/timely-status-174/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>http://network.ee.tsinghua.edu.cn/publication/timely-status-174/</guid><description/></item><item><title>Optimizing Information Freshness in Broadcast Network with Unreliable Links and Random Arrivals: An Approximate Index Policy</title><link>http://network.ee.tsinghua.edu.cn/publication/optimizing-information-191/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>http://network.ee.tsinghua.edu.cn/publication/optimizing-information-191/</guid><description/></item></channel></rss>