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

Jaime Jungok Bae

dblp:61/5678 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 1992
—ORCID · none

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

Computer networks · 4 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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
4 papers
Network performance modeling · 49% Transport protocols and congestion control · 24% Internet architecture and protocols · 16%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › queueing analysis
finite buffer queue
0.011992
Analysis of Individual Packet Loss in a Finite Buffer Queue with Heterogeneous Markov Modulated Arrival Process: A Study of Traffic Burstiness and Priority Packet Discarding · INFOCOM 1992
Network performance modeling › point process
markov modulated arrival processes
0.011992
Analysis of Individual Packet Loss in a Finite Buffer Queue with Heterogeneous Markov Modulated Arrival Process: A Study of Traffic Burstiness and Priority Packet Discarding · INFOCOM 1992
Network performance modeling › packet loss
packet loss analysis
0.011992
Analysis of Individual Packet Loss in a Finite Buffer Queue with Heterogeneous Markov Modulated Arrival Process: A Study of Traffic Burstiness and Priority Packet Discarding · INFOCOM 1992
Network performance modeling › queueing analysis
queueing models of computer systems
0.011992
Analysis of Individual Packet Loss in a Finite Buffer Queue with Heterogeneous Markov Modulated Arrival Process: A Study of Traffic Burstiness and Priority Packet Discarding · INFOCOM 1992
Internet architecture and protocols
ATM networks
0.011991
Survey of traffic control schemes and protocols in ATM networks · Proc. IEEE 1991
Transport protocols and congestion control
error control
0.011991
Survey of traffic control schemes and protocols in ATM networks · Proc. IEEE 1991
Transport protocols and congestion control › error control
error recovery
0.011991
Evaluation of the Effects of Protocol Processing Overhead in Error Recovery Schemes for a High-Speed Packet Switched Network: Link-by-Link versus Edge-to-Edge Schemes · IEEE J. Sel. Areas Commun. 1991
Transport protocols and congestion control › congestion management
preventive congestion control
0.011991
Survey of traffic control schemes and protocols in ATM networks · Proc. IEEE 1991
Internet architecture and protocols › traffic management
traffic control
0.011991
Survey of traffic control schemes and protocols in ATM networks · Proc. IEEE 1991
Wireless networking
collision resolution
0.011988
The robustness and performance of tree algorithms in an unshared feedback error environment · INFOCOM 1988
Physical-layer communications › multiple access
multiple-access network
0.011988
The robustness and performance of tree algorithms in an unshared feedback error environment · INFOCOM 1988
Network performance modeling
throughput and delay analysis
0.011988
The robustness and performance of tree algorithms in an unshared feedback error environment · INFOCOM 1988
Physical-layer communications
feedback error
0.011988
The robustness and performance of tree algorithms in an unshared feedback error environment · INFOCOM 1988

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

markov-modulated poisson process · 0.0continuous-time and discrete-time queueing analysis · 0.0traffic source modeling · 0.0queueing theory · 0.0queueing analysis · 0.0laplace transform · 0.0simulation · 0.0robustness analysis · 0.0
YearPublicationVenuePosition
1992 Analysis of Individual Packet Loss in a Finite Buffer Queue with Heterogeneous Markov Modulated Arrival Process: A Study of Traffic Burstiness and Priority Packet Discarding
abstract
The authors consider a queuing system with a finite buffer and multiple heterogeneous arrival streams. They focus on Markov modulated arrival processes with different burstings and investigate the loss of individual arrival streams when the parameters of the heterogeneous arrival streams are varied. The analysis includes both continuous-time and discrete-time treatments of multiplexed heterogeneous Markov modulated arrivals. Loss probabilities are derived for a priority packet discarding scheme. A new characterization of an arrival stream is introduced, referred to as a self-loss, and it is used to qualitatively predict the effects of multiplexing bursty streams with nonbursty streams. The effectiveness of priority packet discarding is also investigated through numerical examples.>
Jaime Jungok Bae, Tatsuya Suda, Rahul Simha
INFOCOM1
1991 Evaluation of the Effects of Protocol Processing Overhead in Error Recovery Schemes for a High-Speed Packet Switched Network: Link-by-Link versus Edge-to-Edge Schemes
abstract
The authors investigate the effects of protocol processing overhead on the performance of error recovery schemes. The focus is on the edge-to-edge error recovery scheme, in which retransmissions of erred packets only take place between source and destination nodes. An approximation is obtained for the Laplace transform for the distribution of the end-to-end packet transfer delay, considering the processing time required for error recovery. The performance of the link-by-link error recovery scheme, in which retransmissions take place between adjacent nodes, is evaluated and compared to the performance of the edge-to-edge scheme. Numerical results from a tandem queuing network model show that for a network with very-high-speed/low-error-rate channels, an edge-to-edge scheme gives a smaller packet transmission delay than a link-by-link scheme for both go-back-N and selective-repeat retransmission procedures, while keeping the packet loss probability sufficiently small.>
Jaime Jungok Bae, Tatsuya Suda, Naoya Watanabe
IEEE J. Sel. Areas Commun.1
1991 Survey of traffic control schemes and protocols in ATM networks
abstract
The authors survey a number of important research topics in ATM (asynchronous transfer mode) networks. The topics covered include mathematical modeling of various types of traffic sources, congestion-control and error-control schemes for ATM networks, and priority schemes to support multiple classes of traffic. Standard activity for ATM networks and future research problems in ATM are also presented. It is shown that the cell-arrival process for data sources can be modeled by a simple Poisson process. However, voice sources or video sources require more complex processes because of the correlation among cell arrivals. Due to the effects of high-speed channels, preventive control is more effective in ATM networks than reactive control. Due to the use of optical fibers in ATM networks, the channel error rate is very small. The effects of propagation delay and processing time become significant in such high-speed networks. These fundamental changes trigger the necessity to reexamine the error-control schemes used in existing networks. Due to the diversity of service and performance requirements, the notion of multiple traffic classes is required, and separate control mechanisms should be used according to the traffic classes. The priority scheme is shown to be an effective method to support multiple classes of traffic.>
Jaime Jungok Bae, Tatsuya Suda
Proc. IEEE1
1989 The Robustness and Performance of Tree Collision Resolution Algorithms in an Unshared Feedback Error Environment
Tatsuya Suda, Jaime Jungok Bae, David C. Baxter
Comput. Networks ISDN Syst.2
1988 The robustness and performance of tree algorithms in an unshared feedback error environment
abstract
A discussion is presented of the robustness of the Capetanakis collision resolution algorithm for multiple-access networks. In particular, they show that the algorithm is robust against errors that cause different stations to see different feedback information on the results of the transmission attempts, and they quantify, using simulation, the performance (throughput/delay) degradation caused by those unshared errors.>
Tatsuya Suda, Jaime Jungok Bae, David C. Baxter
INFOCOM2