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

Xian Cheng

dblp:92/1706 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
1since 2021 · last 2025
—ORCID · unresolved

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

Systems, architecture and hardware · 3 · 1 first-authorComputer networks · 3 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021

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 architecture, parallel and distributed computing, and storage systems
2 papers
Hardware reliability and fault tolerance · 36% Performance modeling and evaluation · 28% Interconnection networks and networks-on-chip · 12%
Computer networks
1 paper
Network performance modeling · 70% Wireless networking · 30%

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

TopicWeightPapersLastEvidence papers
Storage systems
buffer management
0.011992
A Finite Buffer Two Class Queue with Different Scheduling and Push-Out Schemes · INFOCOM 1992
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.011992
Reliability of a Class of Multistage Interconnection Networks · IEEE Trans. Parallel Distributed Syst. 1992
Performance modeling and evaluation › queueing models
priority queueing
0.011992
A Finite Buffer Two Class Queue with Different Scheduling and Push-Out Schemes · INFOCOM 1992
Performance modeling and evaluation
queueing models
0.011992
A Finite Buffer Two Class Queue with Different Scheduling and Push-Out Schemes · INFOCOM 1992
Hardware reliability and fault tolerance
reliability analysis
0.011992
Reliability of a Class of Multistage Interconnection Networks · IEEE Trans. Parallel Distributed Syst. 1992
Hardware reliability and fault tolerance
reliability modeling
0.011992
Reliability of a Class of Multistage Interconnection Networks · IEEE Trans. Parallel Distributed Syst. 1992
Distributed systems › fault tolerance › fault-tolerant protocols
reliable broadcast
0.011992
Reliability of a Class of Multistage Interconnection Networks · IEEE Trans. Parallel Distributed Syst. 1992
Hardware reliability and fault tolerance › reliability analysis
terminal reliability
0.011992
Reliability of a Class of Multistage Interconnection Networks · IEEE Trans. Parallel Distributed Syst. 1992
Network performance modeling › queueing analysis
polling
0.011989
Approximate analysis of asymmetric single-service token-passing systems · IEEE Trans. Commun. 1989
Network performance modeling
queueing analysis
0.011989
Approximate analysis of asymmetric single-service token-passing systems · IEEE Trans. Commun. 1989
Wireless networking › medium access control › conflict-free multiple access
token passing
0.011989
Approximate analysis of asymmetric single-service token-passing systems · IEEE Trans. Commun. 1989
Network performance modeling
approximate analysis
0.011989
Approximate analysis of asymmetric single-service token-passing systems · IEEE Trans. Commun. 1989

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

recursive analysis · 0.0markov queue analysis · 0.0bounding · 0.0simulation · 0.0approximate analysis · 0.0
YearPublicationVenuePosition
2025 A hybrid feature fusion deep learning framework for multi-source medical image analysis
Xian Cheng
Inf. Process. Manag.2
2017 A study of contagion in the financial system from the perspective of network analytics
Xian Cheng, Ji Wu 0004, Stephen Shaoyi Liao
Neurocomputing1
1994 Analysis of a Finite Buffer Queue with Different Scheduling and Push-Out Schemes
Ian F. Akyildiz, Xian Cheng
Perform. Evaluation2
1992 A Finite Buffer Two Class Queue with Different Scheduling and Push-Out Schemes
abstract
The authors analyze an M/sub 1/, M/sub 2//G/sub 1/, G/sub 2//1/N queue with different scheduling and push-out schemes. They present an exact method to compute loss probabilities, the distribution of the number of class 1 packets in the system and the mean waiting time of a class 1 packet. An approximate solution is given for the computation of the mean waiting time for class 2 packets. The model allows general service time distributions for classes 1 and 2, as well as a general service discipline and a divided buffer management scheme. Numerical examples are included, which consider the loss probabilities and mean waiting time simultaneously.>
Xian Cheng, Ian F. Akyildiz
INFOCOM1
1992 Reliability of a Class of Multistage Interconnection Networks
abstract
The reliability of extra-stage interconnection networks is discussed. Three types of reliability are analyzed: terminal reliability, which is the probability that at least one fault-free path exists between a given input-output pair: network reliability, which is the probability that at least one fault-free path exists between every input-output pair; and broadcast reliability, which is the probability that at least one fault-free path exists between a given input and all outputs. A recursive expression for the broadcast reliability is obtained. Tight bounds are derived for the network reliability. The numerical results indicate that for practical networks (i.e. when network reliability is at least 0.5) the difference between the upper bound and the lower bound is no more than 2% of the lower bound.>
Xian Cheng, Oliver C. Ibe
IEEE Trans. Parallel Distributed Syst.1
1990 Analysis of interconnected systems of token ring networks
Oliver C. Ibe, Xian Cheng
Comput. Commun.2
1989 Performance Analysis of Asymmetric Single-Buffer Polling Systems
Oliver C. Ibe, Xian Cheng
Perform. Evaluation2
1989 Approximate analysis of asymmetric single-service token-passing systems
abstract
Consideration is given to token-passing or polling systems in which the message arrival process, the message transmission time distribution, and the walk time vary from one station to another. An approximate analysis of these systems is obtained. The results obtained from the approximate analysis are compared against both simulation results and those obtained from two approximate methods that have been proposed earlier. For the special case of a symmetric system, it is shown that the approximate analysis is exact when the walk time is constant. Even when the walk time is exponentially distributed, it is shown that the approximate analysis gives an approximation error of less than 0.3% in the range of offered load that is generally of interest.>
Oliver C. Ibe, Xian Cheng
IEEE Trans. Commun.2