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

Cheul Shim

dblp:138/6692 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1996
—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 · 56% Cellular and mobile networks · 28% Content delivery and video streaming · 8%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
call admission control
0.011994
Modeling and call admission control algorithm of variable bit rate video in ATM networks · IEEE J. Sel. Areas Commun. 1994
Network performance modeling
queueing analysis
0.011994
Modeling and call admission control algorithm of variable bit rate video in ATM networks · IEEE J. Sel. Areas Commun. 1994
Network performance modeling › traffic modeling
video source modeling
0.011994
Modeling and call admission control algorithm of variable bit rate video in ATM networks · IEEE J. Sel. Areas Commun. 1994
Network optimization and economics › resource allocation
bandwidth allocation
0.011994
Modeling and call admission control algorithm of variable bit rate video in ATM networks · IEEE J. Sel. Areas Commun. 1994
Content delivery and video streaming › video traffic
variable-bit-rate video
0.011994
Modeling and call admission control algorithm of variable bit rate video in ATM networks · IEEE J. Sel. Areas Commun. 1994

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

three-state markov chain · 0.0bandwidth increasing algorithm · 0.0autoregressive model · 0.0
YearPublicationVenuePosition
1996 Wireless connection management over ATM networks
abstract
An architecture for integrating the wireless services into the network management architecture of future ATM networks is presented. Such integrated communication networks are motivated by an anticipated demand for wireless extension to the future ATM network. First, we briefly propose the AWN Binding Reference Model (ABRM) which can support the mobilities of wireless terminals over ATM networks. Here, we mainly treat the network management architecture related to the call connection and handoff. The proposed ABRM defines a conceptual framework for the creation, deployment, and management of PCS with end-to-end QOS over the ATM network. The ABRM incorporates monitoring and real-time control, management, communication, and abstraction primitives that are organized into five planes: the network and system management (N-plane), the resource control (M-plane), the connection management (C-plane), the user information transport (U-plane) and the data abstraction and management (D-plane). It can be extended as a open signaling architecture which operates on the various backbone networks such as TCP/IP and ATM network.
Cheul Shim, Seoung-Bum Lee
PIMRC1
1994 Modeling and call admission control algorithm of variable bit rate video in ATM networks
abstract
The authors propose a new method for the modeling and call admission control (CAC) of variable bit rate video source, which come to the front of ATM networks as hot issues nowadays. First, the modeling of video source is accomplished using the three-state Markov chains including the effects of scene change at which the bit rate of video source is abruptly increased. Also, using two AR models, they improve the defects which an AR model has in modeling a video source. In addition, they represent the analytical model of a video source so that a network manager can acquire the information which is very important in managing the entire networks. CAC is accomplished using the previously defined analytical model. A routing manager calculates the cell loss probability of a chosen VP where a new call is connected so that the routing manager decides whether this new call is accepted or not. This calculation is accomplished through the GB/D/1-S queuing system. Using BIA (bandwidth increasing algorithm), they check whether the calls rejected by the routing manager could be accepted if possible. Finally, the applicable procedures to suitable allocate bandwidth to each VP on a link are presented in detail.>
Cheul Shim, Intae Ryoo, Sang Bae Lee
IEEE J. Sel. Areas Commun.1