Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jennifer R. Fox

dblp:184/4619 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 56% Network performance modeling · 44%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › wireless data broadcast
on-demand broadcast
0.212016
Scaling of On-Demand Broadcast Scheduling in Stressed Networks · IEEE Trans. Commun. 2016
Network performance modeling › delay analysis
response time analysis
0.212016
Scaling of On-Demand Broadcast Scheduling in Stressed Networks · IEEE Trans. Commun. 2016
Wireless networking › reliable wireless communication › mission-critical wireless communication
public safety communication network
0.112016
Scaling of On-Demand Broadcast Scheduling in Stressed Networks · IEEE Trans. Commun. 2016

Methods — techniques the papers use, named apart from their topics

scaling analysis · 0.2lower bound derivation · 0.2
YearPublicationVenuePosition
2016 Scaling of On-Demand Broadcast Scheduling in Stressed Networks
abstract
The United States is deploying the broadband wireless network for public safety and emergency response. While this will provide a foundational network when disasters or other emergencies appear, the network capacity could still be insufficient when large scale emergency events, such as earthquakes or flooding, happen. On-demand broadcast is a possible solution to address this situation, but its effectiveness remains unknown. In this paper, we aim to uncover the effectiveness of on-demand broadcast at different situations. Specifically, we study the scaling of average response time on the information requests with regard to the indicators of the content diversity - the number of distinct content files and the content popularity distribution. To achieve this goal, we first derive the lower bound of the average response time. We further investigate broadcast for streaming videos and uncover that parallel broadcast could have the same lower bound as the sequential broadcast under certain conditions. Based on the lower bound we derived, we evaluate the scaling of response time with regard to the number of files under different distributions. We further provide numerical results to demonstrate the accuracy of the approximation and the value of the lower bound on evaluating the optimality of a basic heuristic on-demand broadcast scheme.
Jiazhen Zhou, Jennifer R. Fox, Rose Qingyang Hu, Yi Qian 0001
IEEE Trans. Commun.2