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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Shicai Qu

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

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

Computer 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
Network performance modeling · 44% Routing and switching · 44% Network optimization and economics · 13%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › loss systems
blocking probability		 0.011997
A new recursive algorithm for calculating end-to-end blocking probability with an arbitrary fixed nonhierarchical routing · IEEE Trans. Commun. 1997
Routing and switching › circuit switching
circuit-switched routing		 0.011997
A new recursive algorithm for calculating end-to-end blocking probability with an arbitrary fixed nonhierarchical routing · IEEE Trans. Commun. 1997
Network optimization and economics
resource allocation		 0.011997
A new recursive algorithm for calculating end-to-end blocking probability with an arbitrary fixed nonhierarchical routing · IEEE Trans. Commun. 1997

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

recursive algorithm · 0.0path-loss sequence analysis · 0.0
YearPublicationVenuePosition
1997 A new recursive algorithm for calculating end-to-end blocking probability with an arbitrary fixed nonhierarchical routing
abstract
This paper presents a new recursive algorithm for calculating end-to-end blocking probability (EEB) with an arbitrary fixed nonhierarchical routing (AFNR) in a circuit-switched network. The new algorithm improves the worst bound of the computation amount (WBCA) for the EEB of a node pair given by Chan (1980) 2/sup n-1/ times, where n is the number of the loss paths in the path-loss sequence. The amount of its practical computation may be far lower than WBCA, For an extreme case, sequential office-control (SOC) routing, it is proportional to the number of the completion paths from origination node to destination node.
Shicai Qu
 IEEE Trans. Commun.1