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

Kiejin Park

dblp:44/1701 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
0since 2021 · last 2016
0000-0002-6872-2806ORCID · corroborated

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

Systems, architecture and hardware · 4Software engineering, systems software and programming languages · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSecurity and privacy · 1

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
Optical networks · 56% Datacenter networks · 44%

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

TopicWeightPapersLastEvidence papers
Optical networks
elastic optical networks
0.212016
Investigation on static routing and resource assignment of elastic all-optical switched intra-datacenter networks · Sci. China Inf. Sci. 2016
Datacenter networks
optical datacenter network
0.212016
Investigation on static routing and resource assignment of elastic all-optical switched intra-datacenter networks · Sci. China Inf. Sci. 2016
Optical networks › optical switching
all-optical switching
0.112016
Investigation on static routing and resource assignment of elastic all-optical switched intra-datacenter networks · Sci. China Inf. Sci. 2016

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

static routing · 0.2resource assignment · 0.2
YearPublicationVenuePosition
2016 Investigation on static routing and resource assignment of elastic all-optical switched intra-datacenter networks
Limei Peng, Kiejin Park, Chan-Hyun Youn
Sci. China Inf. Sci.2
2006 Survival of the Internet Applications: A Cluster Recovery Model
Khin Mi Mi Aung, Kiejin Park, Jong Sou Park
CCGRID2
2005 A rejuvenation methodology of cluster recovery
abstract
While traditional security mechanisms rely on preventive controls and those are very limited in surviving malicious attacks, we propose a novel approach of the security issue to cluster recovery. In this paper, we present the cluster recovery model with a software rejuvenation methodology, which is applicable in security field. We propose two formal approaches, stochastic and Markov decision process. And we estimate the possibility of surviving under unknown attacks. The basic idea of rejuvenation is to investigate the consequences for the exact respond time in face of attacks and rejuvenating the running software/service, refresh its internal state, and resume or restart it. These actions deter the intruder's progress, prevent from more serious damages and provide time to perform more detailed analysis.
Khin Mi Mi Aung, Kiejin Park, Jong Sou Park
CCGRID2
2005 A Survivability Model for Cluster System Under DoS Attacks
Khin Mi Mi Aung, Kiejin Park, Jong Sou Park, Howon Kim 0001, Byungil Lee
HPCC2
2005 A Survivability Model for Cluster System
Khin Mi Mi Aung, Kiejin Park, Jong Sou Park
ICA3PP2
2005 A Self-healing Mechanism for an Intrusion Tolerance System
Bumjoo Park, Kiejin Park
TrustBus2
2003 A New Availability Concept for (n, k)-way Cluster Systems Regarding Waiting Time
Kiejin Park, Jyh-Charn Liu
ICCSA (1)1
2002 Availability analysis and improvement of Active/Standby cluster systems using software rejuvenation
Kiejin Park
J. Syst. Softw.1
2002 A capacity planning model of unreliable multimedia service systems
Kiejin Park
J. Syst. Softw.1