Sangjin Han

dblp:87/6455 · DBLP profile ↗
← Back
15ranked-venue papers
7as first author
1since 2021 · last 2023
0000-0001-7391-4805ORCID · corroborated

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

Computer networks · 6 · 3 first-authorSoftware engineering, systems software and programming languages · 5 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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
6 papers
Software-defined and programmable networks · 76% Internet architecture and protocols · 12% Routing and switching · 8%
Computer architecture, parallel and distributed computing, and storage systems
8 papers
Cloud and datacenter computing · 67% GPUs and heterogeneous computing · 25% Hardware accelerators and domain-specific architectures · 8%
Network and information security
2 papers
Network security · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
network function virtualization
0.832018
Elastic Scaling of Stateful Network Functions · NSDI 2018
NetBricks: Taking the V out of NFV · OSDI 2016
E2: a framework for NFV applications · SOSP 2015
Software-defined and programmable networks › network function
stateful network functions
0.312018
Elastic Scaling of Stateful Network Functions · NSDI 2018
Cloud and datacenter computing
autoscaling
0.312018
Elastic Scaling of Stateful Network Functions · NSDI 2018
Software-defined and programmable networks
software network functions
0.212016
NetBricks: Taking the V out of NFV · OSDI 2016
Cloud and datacenter computing
resource disaggregation
0.212016
Network Requirements for Resource Disaggregation · OSDI 2016
Cloud and datacenter computing
cluster resource management and scheduling
0.212015
E2: a framework for NFV applications · SOSP 2015
Internet architecture and protocols
network i/o
0.112012
MegaPipe: A New Programming Interface for Scalable Network I/O · OSDI 2012
Operating systems › kernel
kernel design
0.112012
MegaPipe: A New Programming Interface for Scalable Network I/O · OSDI 2012
Network security
SSL acceleration
0.112011
SSLShader: Cheap SSL Acceleration with Commodity Processors · NSDI 2011
GPUs and heterogeneous computing › GPU computing
cryptographic acceleration
0.112011
SSLShader: Cheap SSL Acceleration with Commodity Processors · NSDI 2011
Routing and switching › router architecture
software router
0.112010
PacketShader: a GPU-accelerated software router · SIGCOMM 2010
Network security › secure communication › secure communication protocol
TLS
0.112010
Accelerating SSL with GPUs · SIGCOMM 2010
Hardware accelerators and domain-specific architectures
cryptographic accelerator
0.112010
Accelerating SSL with GPUs · SIGCOMM 2010
GPUs and heterogeneous computing
GPU computing
0.112010
PacketShader: a GPU-accelerated software router · SIGCOMM 2010
GPUs and heterogeneous computing
packet processing
0.112010
PacketShader: a GPU-accelerated software router · SIGCOMM 2010
Cloud and datacenter computing
datacenter network
0.112016
NetBricks: Taking the V out of NFV · OSDI 2016
Internet architecture and protocols
packet processing
0.112015
E2: a framework for NFV applications · SOSP 2015
Cloud and datacenter computing
network i/o
0.012012
MegaPipe: A New Programming Interface for Scalable Network I/O · OSDI 2012
Routing and switching
packet forwarding
0.012010
PacketShader: a GPU-accelerated software router · SIGCOMM 2010

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

programming interface · 0.4network i/o · 0.4GPU parallelization · 0.2
YearPublicationVenuePosition
2023 Highway Condition Analysis and Traffic Safety Monitoring System Through Analysis of Time-Series Data from LiDAR-based Probe Vehicle
abstract
Recently, various approaches have been developed for traffic analysis systems, ranging from Vehicle Detection Systems (VDS) to Mobile Detection Systems (MDS). However, VDS has limitations. For example, in actual driving situations such as intersections or exits, each lane may have different traffic conditions, revealing the limitations of traffic information provided by conventional VDS. In this paper, we propose a methodology to efficiently monitor the traffic condition and safety on the road by utilizing a LiDAR sensor installed on a vehicle to collect continuous traffic information about surrounding vehicles. To implement the Mobile Detection System (MDS), we collect point cloud data from LiDAR and detect the position and size of vehicles using a deep learning-based voxel-RCNN. We then convert the data into traffic information for analysis. Furthermore, we propose an efficient method for analyzing road hazards by introducing the MTTC method based on the TTC for hazard assessment. To evaluate the performance of the proposed method, we compare its reliability with that of conventional VDS and perform road hazards analysis using LiDAR-based probe vehicles with data collected directly from highways in Korea.
Hongjin Kim, Sangjin Han, Wonjong Kim
SMC3
2018 Elastic Scaling of Stateful Network Functions
Shinae Woo, Justine Sherry, Sangjin Han, Sue B. Moon, Sylvia Ratnasamy, Scott Shenker
NSDI3
2016 Network Requirements for Resource Disaggregation
Peter Xiang Gao, Akshay Narayan 0001, Sagar Karandikar, Sangjin Han, Rachit Agarwal 0001, Sylvia Ratnasamy, Scott Shenker
OSDI5
2016 NetBricks: Taking the V out of NFV
Aurojit Panda, Sangjin Han, Keon Jang, Melvin Walls, Sylvia Ratnasamy, Scott Shenker
OSDI2
2015 E2: a framework for NFV applications
abstract
By moving network appliance functionality from proprietary hardware to software, Network Function Virtualization promises to bring the advantages of cloud computing to network packet processing. However, the evolution of cloud computing (particularly for data analytics) has greatly benefited from application-independent methods for scaling and placement that achieve high efficiency while relieving programmers of these burdens. NFV has no such general management solutions. In this paper, we present a scalable and application-agnostic scheduling framework for packet processing, and compare its performance to current approaches.
Shoumik Palkar, Chang Lan, Sangjin Han, Keon Jang, Aurojit Panda, Sylvia Ratnasamy, Luigi Rizzo, Scott Shenker
SOSP3
2013 Network support for resource disaggregation in next-generation datacenters
abstract
Datacenters have traditionally been architected as a collection of servers wherein each server aggregates a fixed amount of computing, memory, storage, and communication resources. In this paper, we advocate an alternative construction in which the resources within a server are disaggregated and the datacenter is instead architected as a collection of standalone resources.
Sangjin Han, Norbert Egi, Aurojit Panda, Sylvia Ratnasamy, Guangyu Shi, Scott Shenker
HotNets1
2013 Large-Scale Computation Not at the Cost of Expressiveness
Sangjin Han, Sylvia Ratnasamy
HotOS1
2012 MegaPipe: A New Programming Interface for Scalable Network I/O
Sangjin Han, Scott Marshall, Byung-Gon Chun, Sylvia Ratnasamy
OSDI1
2011 SSLShader: Cheap SSL Acceleration with Commodity Processors
Keon Jang, Sangjin Han, Seungyeop Han, Sue B. Moon, KyoungSoo Park
NSDI2
2010 Building a single-box 100 Gbps software router
abstract
Commodity-hardware technology has advanced in great leaps in terms of CPU, memory, and I/O bus speeds. Benefiting from the hardware innovation, recent software routers on commodity PC now report about 10 Gbps in packet routing. In this paper we map out expected hurdles and projected speed-ups to reach 100 Gbps in packet routing on a single commodity PC. With careful measurements, we identify two notable bottlenecks for our goal: CPU cycles and I/O bandwidth. For the former, we propose reducing per-packet processing overhead with software-level optimizations and buying extra computing power with GPUs. To improve the I/O bandwidth, we suggest scaling the performance of I/O hubs that limits packet routing speed to well before 50 Gbps.
Sangjin Han, Keon Jang, KyoungSoo Park, Sue B. Moon
LANMAN1
2010 PacketShader: a GPU-accelerated software router
abstract
We present PacketShader, a high-performance software router framework for general packet processing with Graphics Processing Unit (GPU) acceleration. PacketShader exploits the massively-parallel processing power of GPU to address the CPU bottleneck in current software routers. Combined with our high-performance packet I/O engine, PacketShader outperforms existing software routers by more than a factor of four, forwarding 64B IPv4 packets at 39 Gbps on a single commodity PC. We have implemented IPv4 and IPv6 forwarding, OpenFlow switching, and IPsec tunneling to demonstrate the flexibility and performance advantage of PacketShader. The evaluation results show that GPU brings significantly higher throughput over the CPU-only implementation, confirming the effectiveness of GPU for computation and memory-intensive operations in packet processing.
Sangjin Han, Keon Jang, KyoungSoo Park, Sue B. Moon
SIGCOMM1
2010 Accelerating SSL with GPUs
abstract
SSL/TLS is a standard protocol for secure Internet communication. Despite its great success, today's SSL deployment is largely limited to security-critical domains. The low adoption rate of SSL is mainly due to high computation overhead on the server side.
Keon Jang, Sangjin Han, Seungyeop Han, Sue B. Moon, KyoungSoo Park
SIGCOMM2
2010 Node distribution-based localization for large-scale wireless sensor networks
Sangjin Han, Sanghoon Lee 0001, Jongjun Park, Sangjoon Park
Wirel. Networks1
2007 Coexistence Performance Evaluation of IEEE 802.15.4 Under IEEE 802.11B Interference in Fading Channels
abstract
The IEEE 802.15.4 standard specifies the physical and medium access control layers designed for low-rate wireless personal area networks. Its operational frequency band includes the 2.4 GHz industrial, scientific and medical band, which is also used by other IEEE 802 wireless standards. This paper presents the coexistence model of IEEE 802.15.4 with IEEE 802.1 lb interference in fading channels and proposes two adaptive channel allocation schemes. The first avoids the IEEE 802.15.4 interference only and the second avoids both of the IEEE 802.15.4 and the IEEE 802.11b interferences. Numerical results show that by selecting a channel which gives the maximum signal to noise ratio to the system, the proposed algorithms are effective for avoiding the interferences and for max-imizing the network capacity.
Sangjin Han, Sanghoon Lee 0001, Yeonsoo Kim
PIMRC1
2007 The Reverse-Link Capacity Analysis of Multihop Cellular Networks over Multi-Cell Environments
abstract
In this paper, a framework of link capacity analysis for the uplink MCN (Multi-hop Cellular Network) is presented, and the goal of which is to increase link capacity while mitigating the effect of interference. An overlaid network architecture is employed as the network topology : the multi-hop (single-hop) network at the outer (inner) region of the cell. In order to verify the improvement in capacity accrued from the inter-network cooperation, inter-network and intra-network interferences are redefined. In a simulation, the MCN exhibits a significant increase of 1.2 ~ 1.8 times in link capacity compared to a cellular network.
Sangjin Han, Sungjun Ham, Sanghoon Lee 0001
PIMRC2