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

Xiaoqin Chen

dblp:87/36 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2011
0000-0001-7328-2801ORCID · corroborated

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

Systems, architecture and hardware · 1Computer networks · 1 · 1 first-author

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
Routing and switching · 61% Wireless networking · 30% Physical-layer communications · 9%
Software engineering, system software, and programming languages
1 paper
Operating systems · 67% Compilers and program optimization · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 50% Parallel and multicore computing · 50%

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

TopicWeightPapersLastEvidence papers
Routing and switching
ad hoc network routing
0.112011
Channel-Aware Routing in MANETs with Route Handoff · IEEE Trans. Mob. Comput. 2011
Routing and switching › wireless routing
channel-aware routing
0.112011
Channel-Aware Routing in MANETs with Route Handoff · IEEE Trans. Mob. Comput. 2011
Wireless networking
mobile ad hoc networks
0.112011
Channel-Aware Routing in MANETs with Route Handoff · IEEE Trans. Mob. Comput. 2011
Operating systems › resource management › memory management › virtual memory
paging
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010
Compilers and program optimization
prefetching
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010
Operating systems › resource management › memory management
virtual memory
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010
Parallel and multicore computing › concurrent data structures
memory reclamation
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010
Cloud and datacenter computing
virtualization
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010
Physical-layer communications
fading channels
0.012011
Channel-Aware Routing in MANETs with Route Handoff · IEEE Trans. Mob. Comput. 2011

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

paging notification · 0.2adaptive prefetching · 0.2theoretical performance analysis · 0.1preemptive handoff · 0.1AOMDV extension · 0.1
YearPublicationVenuePosition
2011 Channel-Aware Routing in MANETs with Route Handoff
abstract
In wireless mobile ad hoc networks (MANETs), packet transmission is impaired by radio link fluctuations. This paper proposes a novel channel adaptive routing protocol which extends the Ad hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol to accommodate channel fading. Specifically, the proposed Channel-Aware AOMDV (CA-AOMDV) uses the channel average nonfading duration as a routing metric to select stable links for path discovery, and applies a preemptive handoff strategy to maintain reliable connections by exploiting channel state information. Using the same information, paths can be reused when they become available again, rather than being discarded. We provide new theoretical results for the downtime and lifetime of a live-die-live multiple path system, as well as detailed theoretical expressions for common network performance measures, providing useful insights into the differences in performance between CA-AOMDV and AOMDV. Simulation and theoretical results show that CA-AOMDV has greatly improved network performance over AOMDV.
Xiaoqin Chen, Haley M. Jones, Dhammika Jayalath
IEEE Trans. Mob. Comput.1
2010 Improving host swapping using adaptive prefetching and paging notifier
abstract
In a virtualized system, the hypervisor may be forced to reclaim memory by swapping out pages of guest operating systems (OSes) when the regular memory balancing mechanisms, such as page sharing and ballooning, fail to revoke enough memory for reallocation purpose, which always leads to serious performance degradation. In this paper, we introduce Adaptive Swap Prefetcher (ASP) and Host Swapping Notifier (HSN), the effective and lightweight solutions to gracefully reduce the degradation in system performance when host swapping is triggered. ASP smartly prefetches more pages from the host swap file as long as the good spatial locality persists so as to reduce disk transfers. The guest OS will be notified by HSN when the hypervisor evicts pages, which then hides those pages from its memory reclamation routines to eliminate unnecessary guest swapping and to prevent the occurrence of double paging anomaly. Currently ASP and HSN are implemented in KVM, experimental results show that guest performance can be improved by a factory of 1.4x and 2x respectively using ASP and HSN.
Wenzhi Chen, Huijun Chen, Xiaoqin Chen, Dapeng Huang
HPDC4
2007 Congestion-Aware Routing Protocol for Mobile Ad Hoc Networks
abstract
Congestion in mobile ad hoc networks leads to transmission delays and packet loss, and causes wastage of time and energy on recovery. Routing protocols which are adaptive to the congestion status of a mobile ad hoc network can greatly improve the network performance. In this paper, we propose a congestion-aware routing protocol for mobile ad hoc networks which uses a metric incorporating data-rate, MAC overhead, and buffer delay to combat congestion. This metric is used, together with the avoidance of mismatched link data-rate routes, to make mobile ad hoc networks robust and adaptive to congestion.
Xiaoqin Chen, Haley M. Jones, Dhammika Jayalath
VTC Fall1