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

Piu Wong

dblp:84/8704 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2010
—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 · 50% Network performance modeling · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › throughput analysis
throughput distribution
0.112010
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks · IEEE Trans. Mob. Comput. 2010
Wireless networking
wireless network protocols
0.112010
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks · IEEE Trans. Mob. Comput. 2010
Performance modeling and evaluation
stochastic analysis
0.012010
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks · IEEE Trans. Mob. Comput. 2010

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

mean-field approximation · 0.2ising model analogy · 0.2
YearPublicationVenuePosition
2010 Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
abstract
This work started out with our discovery of a pattern of throughput distributions among links in IEEE 802.11 networks from experimental results. This pattern gives rise to an easy computation method, which we term back-of-the-envelop (BoE) computation. For many network configurations, very accurate results can be obtained by BoE within minutes, if not seconds, by simple hand computation. This allows us to make shortcuts in performance evaluation, bypassing complicated stochastic analysis. To explain BoE, we construct a theory based on the model of an “ideal CSMA network” (ICN). The BoE computation method emerges from ICN when we take the limit c \to 0, where c is the ratio of the mean backoff countdown time to the mean transmission time in the CSMA protocol. Importantly, we derive a new mathematical result: the link throughputs of ICN are insensitive to the distributions of the backoff countdown time and transmission time (packet duration) given the ratio of their means c. This insensitivity result explains why BoE works so well for practical 802.11 networks, in which the backoff countdown process is one that has memory, and in which the packet size can be arbitrarily distributed. Our results indicate that BoE is a good approximation technique for modest-size networks such as those typically seen in 802.11 deployments. Beyond explaining BoE, the theoretical framework of ICN is also a foundation for fundamental understanding of very-large-scale CSMA networks. In particular, ICN is similar to the Ising model in statistical physics used to explain phenomena arising out of the interactions of a large number of entities. Many new research directions arise out of the ICN model.
Soung Chang Liew, Caihong Kai, Hang Ching Leung, Piu Wong
IEEE Trans. Mob. Comput.4