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

Zhongbin Zha

dblp:146/3587 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

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

Computer networks · 2 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 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
Transport protocols and congestion control · 54% Wireless networking · 23% Cellular and mobile networks · 23%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › mobile networks
mobile data networks
0.412020
Optimizing TCP Loss Recovery Performance Over Mobile Data Networks · IEEE Trans. Mob. Comput. 2020
Wireless networking
retransmission
0.412020
Optimizing TCP Loss Recovery Performance Over Mobile Data Networks · IEEE Trans. Mob. Comput. 2020
Transport protocols and congestion control › loss recovery
TCP loss recovery
0.412020
Optimizing TCP Loss Recovery Performance Over Mobile Data Networks · IEEE Trans. Mob. Comput. 2020
Transport protocols and congestion control
TCP performance
0.412020
Optimizing TCP Loss Recovery Performance Over Mobile Data Networks · IEEE Trans. Mob. Comput. 2020
Transport protocols and congestion control
flow control
0.112020
Optimizing TCP Loss Recovery Performance Over Mobile Data Networks · IEEE Trans. Mob. Comput. 2020

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

kernel implementation · 0.4emulation · 0.4
YearPublicationVenuePosition
2020 Optimizing TCP Loss Recovery Performance Over Mobile Data Networks
abstract
Recent advances in high-speed mobile networks have revealed new bottlenecks in ubiquitous TCP protocol deployed in the Internet. In addition to differentiating non-congestive loss from congestive loss, our experiments revealed two significant performance bottlenecks during the loss recovery phase: flow control bottleneck and application stall, resulting in degradation in QoS performance. To tackle these two problems, we first develop a novel opportunistic retransmission algorithm to eliminate the flow control bottleneck, which enables TCP sender to transmit new packets even if receiver's receiving window is exhausted. Second, application stall can be significantly alleviated by carefully monitoring and tuning the TCP sending buffer growth mechanism. We implemented and modularized the proposed algorithms in the Linux kernel thus they can plug-and-play with the existing TCP loss recovery algorithms easily. We evaluated our proposed algorithms over emulated and real experiments and showed that, compared to existing TCP loss recovery algorithms, the proposed optimization algorithms improve the bandwidth efficiency by up to 133 percent and completely mitigate RTT spikes, i.e., over 50 percent RTT reduction, over the loss recovery phase.
Ke Liu 0004, Zhongbin Zha, Wenkai Wan, Vaneet Aggarwal, Binzhang Fu, Mingyu Chen 0001
IEEE Trans. Mob. Comput.2
2015 Optimizing TCP loss recovery performance over mobile data networks
abstract
Recent advances in high-speed mobile networks have revealed new bottlenecks in ubiquitous TCP protocol deployed in the Internet. In addition to differentiating non-congestive loss from congestive loss, our experiments revealed two significant performance bottlenecks during loss recovery phase: flow control bottleneck and application stall, resulting in degradation in QoS performance. To tackle these two problems we firstly develop a novel opportunistic retransmission algorithm to eliminate the flow control bottleneck, which enables TCP sender to transmit new packets even if receiver's receiving window is exhausted. Secondly, the application stall can be significantly alleviated by carefully monitoring and tuning the TCP send buffer growth mechanism. We implemented and modularized the proposed algorithms in the Linux kernel thus they can plug-and-play with the existing TCP loss recovery algorithms easily. Using emulated experiments we showed that with the proposed optimization techniques the existing loss recovery algorithms can at most achieve 98.3% bandwidth utilization during loss recovery phase, and reduce RTT by at most 80% after loss recovery phase.
Zhongbin Zha, Ke Liu 0004, Binzhang Fu, Mingyu Chen 0001
SECON1
2014 DTail: a flexible approach to DRAM refresh management
abstract
DRAM cells must be refreshed (or rewritten) periodically to maintain data integrity, and as DRAM density grows, so does the refresh time and energy. Not all data need to be refreshed with the same frequency, though, and thus some refresh operations can safely be delayed. Tracking such information allows the memory controller to reduce refresh costs by judiciously choosing when to refresh different rows
Zehan Cui, Sally A. McKee, Zhongbin Zha, Yungang Bao, Mingyu Chen 0001
ICS3
2014 Moby: A mobile benchmark suite for architectural simulators
abstract
Mobile devices such as smartphones and tablets have become the primary consumer computing devices, and their rate of adoption continues to grow. The applications that run on these mobile platforms vary in how they use hardware resources, and their diversity is increasing. Performance and power limitations also vary widely across mobile platforms. Thus there is a growing need for tools to help computer architects design systems to meet the needs of mobile workloads. Full-system simulators are invaluable tools for designing new architectures, but we still need appropriate benchmark suites that capture the behaviors of emerging mobile applications. Current benchmark suites cover only a small range of mobile applications, and many cannot run directly in simulators due to their user interaction requirements. In this paper, we introduce and characterize Moby, a benchmark suite designed to make it easier to use full-system architectural simulators to evaluate microarchitectures for mobile processors. Moby contains popular Android applications, including a web browser, a social networking application, an email client, a music player, a video player, a document processing application, and a map program. To facilitate microarchitectural exploration, we port the Moby benchmark suite to the popular gem5 simulator. We characterize the architecture-independent features of Moby applications on the simulator and analyze the architecture-dependent features on a current-generation mobile platform. Our results show that mobile applications exhibit complex instruction execution behaviors and poor code locality, but current mobile platforms especially instruction-related components cannot meet their requirements.
Yongbing Huang, Zhongbin Zha, Mingyu Chen 0001, Lixin Zhang 0002
ISPASS2