Ian Kim Teck Tan

Ian Kim Teck Tan

Auto-generated profile, based on publicly available information

Ian Kim Teck Tan


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2010
Verified
Conference Paper
Closed access
AYAsrul H. Yaacob
Asrul H. Yaacob
ITIan K.T. Tan
Ian K.T. Tan
SCSuFong Chien
SuFong Chien
HTHon Khi Tan
Hon Khi Tan
An early warning system on potential attacks from networks will enable network administrators or even automated network management software to take preventive measures. This is needed as we move towards maximizing the utilization of the network with new paradigms such as Web Services and Software As A Service. This paper introduces a novel approach through using Auto-Regressive Integrated Moving Average (ARIMA) technique to detect potential attacks that may occur in the network. The solution is able to provide feedback through its predictive capabilities and hence provide an early warning system. With the affirmative results, this technique can serve beyond the detection of Denial of Service (DoS) and with sufficient development; an automated defensive solution can be achieved.

1 July 2008 in ACM SIGOPS Operating Systems Review
Verified
Journal Article
Open access
Chee-Siang WongChee-Siang Wong
Chee-Siang Wong
ITIan Tan
Ian Tan
RKRosalind Deena Kumari
Rosalind Deena Kumari
FWFun Wey
Fun Wey
The Operating System scheduler is designed to allocate the CPU resources appropriately to all processes. The Linux Completely Fair Scheduler (CFS) design ensures fairness among tasks using the thread fair scheduling algorithm. This algorithm ensures allocation of resources based on the number of threads in the system and not within executing programs. This can lead to fairness issue in a multi-threaded environment as the Linux scheduler tends to favor programs with higher number of threads. We illustrate the issue of fairness through experimental evaluation thus exposing the weakness of the current allocation scheme where software developers could take advantage by spawning many additional threads in order to obtain more CPU resources. A novel algorithm is proposed as a solution towards achieving better fairness in the Linux scheduler. The algorithm is based on weight readjustment of the threads created in the same process to significantly reduce the unfair allocation of CPU resources in multi-threaded environments. The algorithm was implemented and evaluated. It demonstrated promising results towards solving the raised fairness issue. We conclude this paper highlighting the limitations of the proposed approach and the future work in the stated direction.

6 December 2024
Verified
Conference Paper
Open access
PLPei Yee Liew
Pei Yee Liew
ITIan K. T. Tan
Ian K. T. Tan

1 January 2008
Verified
Conference Paper
Closed access
Chee-Siang WongChee-Siang Wong
Chee-Siang Wong
ITI.K.T. Tan
I.K.T. Tan
RKR.D. Kumari
R.D. Kumari
JLJ.W. Lam
J.W. Lam
WFW. Fun
W. Fun
The design of an Operating System (OS) scheduler is meant to allocate its resources appropriately to all applications. In this paper, we present the scheduling techniques used by two Linux schedulers: O(1) and Completely Fair Scheduler (CFS). CFS is the Linux kernel scheduler that replaces the O(1) scheduler in the 2.6.23 kernel. The design goals of CFS are to provide fair CPU resource allocation among executing tasks without sacrificing interactive performance. The ability to achieve good fairness in distributing CPU resource among tasks is important to prevent starvation. However, these design goals have never been scientifically evaluated despite the fact that there are many conventional operating system benchmarks that are geared towards measuring systems performance in terms of throughput. We therefore scientifically evaluate the design goals of CFS by empirical evaluation. We measure the fairness and interactivity performance by using fairness and interactivity benchmarks. To provide a meaningful representation of results, comparisons of O(1) and CFS kernel schedulers of the open source Linux OS are used. Our experience indicates the CFS does achieve its design goals.

1 January 2012
Verified
Conference Paper
Closed access
PHPoo Kuan Hoong
Poo Kuan Hoong
OCOng Kok Chien
Ong Kok Chien
ITI.K.T. Tan
I.K.T. Tan
CTChoo-Yee Ting
Choo-Yee Ting
Having prior road condition knowledge for planned or unplanned journeys will be beneficial in terms of not only time but potentially cost. Being able to obtain real-time information will further enhance these benefits. Current systems rely on huge infrastructure investments by governments to install cameras, road sensors and billboards to keep motorists informed. These efforts can only be, at best, available at pre-identified hotspots. Radio broadcast is an alternative, where they rely on reports by other motorists. However, such reports are often delayed and not tailored to individual motorist. Seeing the limitations of existing approaches to obtain real-time road conditions, this research work leverages on mobile devices that provide context sensitive information to propose a predictive analytics framework based on a Bayesian Network for road condition prediction. This paper aims to contribute to (i) defining a set of evidences (variables) that could potentially be utilized for road condition prediction and (ii) construction of a Bayesian Network model to predict road conditions. In conclusion, we presented a novel approach to provide potentially unlimited coverage of road traffic conditions with substantially reduced infrastructure investments