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.

Jung-Bong Suk

dblp:13/3033 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2017
0000-0002-7844-3747ORCID · reported

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

Computer networks · 5 · 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
2 papers
Wireless networking · 99% Network performance modeling · 1%

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

TopicWeightPapersLastEvidence papers
Wireless networking
link adaptation
0.212016
Link Adaptation Strategies for Real-Time Video Transmission Over IEEE 802.11ac DL-MU · IEEE Trans. Commun. 2016
Wireless networking
WLAN
0.212016
Link Adaptation Strategies for Real-Time Video Transmission Over IEEE 802.11ac DL-MU · IEEE Trans. Commun. 2016
Wireless networking
medium access control
0.112016
Link Adaptation Strategies for Real-Time Video Transmission Over IEEE 802.11ac DL-MU · IEEE Trans. Commun. 2016
Network performance modeling
queueing analysis
0.011988
Analysis and optimization of pacing window flow control with admission delay · INFOCOM 1988
Network performance modeling › queueing analysis
matrix-geometric methods
0.011988
Analysis and optimization of pacing window flow control with admission delay · INFOCOM 1988

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

mathematical modeling · 0.2convex optimization · 0.2simulation · 0.0matrix-geometric solution · 0.0markovian queueing analysis · 0.0
YearPublicationVenuePosition
2017 Network utility maximization in uplink multiuser wireless LANs
Mojtaba Aajami, Jung-Bong Suk
Comput. Commun.2
2016 Link Adaptation Strategies for Real-Time Video Transmission Over IEEE 802.11ac DL-MU
abstract
Multimedia video applications on mobile devices become pervasive and basically crept into every part of our life. Historically, the wireless standards tend to make the LAN faster and now we have the latest version 11 ac with new advanced features like multi-user (MU) transmission on downlinks. Basically, the LAN standards extend in two different directions. First, increasing performance while reducing the power consumption. Second, as the wireless LAN has become so successful, new concepts, such as Internet of Things, lead to the problem of the interference since many devices use the same frequency spectrum at the same time. While downlink MU feature tries to reduce the interference problem, setting up the LAN for the devices to have a fair opportunities within the network is of high importance. As the IEEE 802.11 ac standard left the fairness to the implementation, in this paper, we present practical schemes to deal with this issue in video streaming applications. The proposed schemes are mathematically modeled and their tractable optimal solutions are presented and verified. The simulation studies show that the proposed schemes meet the fairness criteria while guaranteeing the required quality and performance.
Ali A. Khavasi, Jung-Bong Suk
IEEE Trans. Commun.2
2013 Combining opportunistic routing and network coding: A multi rate approach
abstract
The inherent characteristics of the wireless channel, such as broadcast communication and high variability in channel quality, make it difficult to achieve high throughput in wireless mesh networks (WMNs). However, some innovative techniques like wireless inter-flow network coding and opportunistic routing leverage the broadcast nature of the wireless channel to improve the throughput. In addition, in order to cope with channel quality variation, the transmission rate can be adjusted using a rate adaptation algorithm. In this paper, we study how these fundamental techniques collaborate and how they can be combined into an integrated solution. We suggest Multi Rate Opportunistic Routing-aware Network Coding (MRORNC) as an integrated cross-layer approach that jointly determines the coded packet, potential next hops, and transmission rate using a novel metric. The simulation results demonstrate that the suggested approach can achieve higher throughput compared to the rate-oblivious opportunistic routing-aware network coding solutions.
Mojtaba Aajami, Hae-Ryeon Park, Jung-Bong Suk
WCNC3
2010 Bandwidth Guarantee per Session for Video Transmission over IEEE 802.11e HCCA
abstract
According to the current IEEE 802.11e HCCA standard, if more than three video sessions are to be in service in a WSTA, some of them must share the TXOP because the number of TSIDs assigned to video transmission is two. In order to resolve the problem, we devise a method in which up to 15 video sessions can be accommodated by slightly modifying the frame structure while maintaining the compatibility with the current standard. Experimental results show that our method guarantees the transmission bandwidth requested by each video session.
Young-Hwan Kim, Hae-Ryeon Park, Jung-Bong Suk
CCNC3
1997 Simulative study on the performance improvement of conflict resolution schemes in Manhattan Street Network
Chang-Wook Bae, Jung-Bong Suk
Comput. Commun.3
1988 Analysis and optimization of pacing window flow control with admission delay
abstract
An analysis is provided of queuing models in virtual route networks for which a pacing window flow control mechanism is used. An input queue is introduced to describe the waiting system where messages prevented from entering the network are stored in first-come, first-served manner. Both finite and infinite capacity are considered. The model leads to a Markovian queuing system, which is fully solved by matrix-geometric methods. The analytical results show that the optimal window size which maximizes the power criterion including the admission delay is nearly twice the number of hops (nodes of the network) for the model with infinite input-queue capacity. This rule of thumb also applies to the finite-capacity model with certain restrictions. Simulations are presented to verify the analytical results.>
Jung-Bong Suk, Christos G. Cassandras
INFOCOM1