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

Soracha Nananukul

dblp:13/8473 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2002
—ORCID · none

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

Computer networks · 3 · 3 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
2 papers
Network performance modeling · 71% Cellular and mobile networks · 18% Internet architecture and protocols · 11%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › queueing analysis
queueing models of computer systems
0.122002
Efficiency and reliability of call admission control schemes using call-level behavior · IEEE Trans. Commun. 2002
Multiplexing of periodic arrival processes with different packet sizes · IEEE Trans. Commun. 2002
Cellular and mobile networks
call admission control
0.012002
Efficiency and reliability of call admission control schemes using call-level behavior · IEEE Trans. Commun. 2002
Network performance modeling › reliability analysis
performability analysis
0.012002
Efficiency and reliability of call admission control schemes using call-level behavior · IEEE Trans. Commun. 2002
Network performance modeling › queueing analysis › queueing performance
waiting time distribution
0.012002
Multiplexing of periodic arrival processes with different packet sizes · IEEE Trans. Commun. 2002
Internet architecture and protocols
packet scheduling
0.012002
Multiplexing of periodic arrival processes with different packet sizes · IEEE Trans. Commun. 2002
Internet architecture and protocols
quality of service
0.012002
Efficiency and reliability of call admission control schemes using call-level behavior · IEEE Trans. Commun. 2002

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

nearly completely decomposability approximation · 0.0m/m/c loss system · 0.0fluid traffic model · 0.0d/d/1 queue analysis · 0.0
YearPublicationVenuePosition
2002 Multiplexing of periodic arrival processes with different packet sizes
abstract
For the N * D/D/1 queue, the exact formulas for the virtual waiting time distribution and the waiting time distribution are well known. The exact formulas are extended to the case of the /spl Sigma/ N/sub k/D(X/sub k/)/D/1 queue, where different arrival processes can have different packet sizes. Numerical examples are also presented to illustrate their practical applications.
Soracha Nananukul
IEEE Trans. Commun.1
2002 Efficiency and reliability of call admission control schemes using call-level behavior
abstract
While the efficiency of call admission control (CAC) schemes can be improved by taking advantage of call-level behavior, it is also important to make sure that the reliability of the CAC schemes is maintained. This paper studies the reliability aspect of CAC schemes for the reference model that consists of the M/M/c loss system at the call level, and the bufferless link with single-class exponential on-off fluid traffic at the burst level. As a measure of reliability, the probability that an admitted call violates a loss-ratio target is used, and its analytic expression is derived for the reference model by using performability analysis and the nearly completely decomposability approximation. It is shown that the CAC schemes previously proposed to take advantage of call-level behavior are not acceptably reliable. In addition, it is shown that, for most cases in practice, if the reliability of a CAC scheme taking advantage of call-level behavior is to be maintained at a reasonable level, the improvement in efficiency relative to the static scheme will be small.
Soracha Nananukul
IEEE Trans. Commun.1
2000 Some issues in performance and design of the ATM/AAL2 transport in the UTRAN
abstract
The paper addresses the following issues related to the performance and design of the ATM/AAL2 transport in UTRAN (UMTS terrestrial radio access network): 1) it proposes an alternative AAL2 implementation method that has advantages over the widely-used method; 2) it studies the effect of the stringent delay requirement on the bandwidth requirement of the ATM/AAL2 transport; 3) it proposes the use of common part sublayer (CPS) packet shaping to deal with the burstiness of CBR-based dedicated channel (DCH) traffic caused by the periodic nature of the MAC layer of the UMTS radio interface; 4) it evaluates statistical multiplexing gain from the ATM/AAL2 transport as compared with TDM transport.
Soracha Nananukul, Yile Guo, Maunu Holma, Sami Kekki
WCNC1