• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.5
• /
• pp.62-70
• /
• 2016

Ensuring walkability in a city where pedestrians and vehicles coexist is an issue of critical importance. The relative relationship between vehicle transit and walkability improvements complicates the evaluation of walkability, which thus necessitates the formation of a quantitative standard by which a methodological measurement of walkability can be achieved inside the pedestrian network. Therefore, a model is determined whereby quantitative indices such as, but not limited to, experiences of accessibility, mobility, and convenience within the network are estimated. This research proposes the integration of space syntax theory and the logit path choice model in the evaluation of walkability. Space syntax theory assesses adequacy of the constructed pedestrian network through calculation of the link integration value, while the logit model estimates its safety, mobility, and accessibility using probability. The advantage of the integrated model hence lies in its ability to sufficiently reflect such evaluation measures as the integration value, mobility convenience, accessibility potential, and safety experienced by the demand in a quantitative manner through probability computation. In this research, the Dial Algorithm is used to arrive at a solution to the logit model. This process requires that the physical distance of the pedestrian network and the perceptive distance of space syntax theory be made equivalent. In this, the research makes use of network expansion to reflect wait times. The evaluation index calculated through the integrated model is reviewed and using the results of this sample network, the applicability of the model is assessed.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.193-202
• /
• 2007

In this paper, a performance evaluation model of the Multistage Interconnection Network(MIN) with the multiple-buffered crossbar switches under Hot-spot environment is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the MIN. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch. The performance of the multiple-buffered $a{\times}a$ crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes. Two important parameters of the network performance, throughput and delay, are then evaluated. To validate the proposed analysis model, the simulation is carried out on a Baseline network that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.725-730
• /
• 2022

Named Data Networking (NDN) is a representative technology of ICN that realizes the future Internet architecture. NDN searches for data by its content and not by its host IP address. The consumer generates an interest packet and sends it to the NDN network. The NDN network uses three tables such as CS, FIB, and PIT and forwards the received interest packet to the next hop. The producer transmits the data packet to the consumer through a name-based forwarding scheme. In this paper, we design and implement an ndnSIM-based NDN network and perform performance evaluation. We analyze the ndnSIM structure and develop a 6-node congested NDN network and a 9-node grid NDN network using ndnSIM. In the simulation, the performance of latency and throughput of the interest packet rate are measured. We analyze the effect of congestion on the latency and throughput of the NDN network. This approach will help researchers in the future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1773-1795
• /
• 2020

Unmanned aerial vehicles (UAVs) network are a very vibrant research area nowadays. They have many military and civil applications. Limited bandwidth, the high mobility and secure communication of micro UAVs represent their three main problems. In this paper, we try to address these problems by means of secure clustering, and a security clustering algorithm based on integrated trust value for UAVs network is proposed. First, an improved the k-means++ algorithm is presented to determine the optimal number of clusters by the network bandwidth parameter, which ensures the optimal use of network bandwidth. Second, we considered variables representing the link expiration time to improve node clustering, and used the integrated trust value to rapidly detect malicious nodes and establish a head list. Node clustering reduce impact of high mobility and head list enhance the security of clustering algorithm. Finally, combined the remaining energy ratio, relative mobility, and the relative degrees of the nodes to select the best cluster head. The results of a simulation showed that the proposed clustering algorithm incurred a smaller computational load and higher network security.

• Proceedings of the KSR Conference
• /
• 2011.05a
• /
• pp.1414-1419
• /
• 2011

In this paper we study the modeling to quantitatively assess the failure rate of USN system designed for fault-tolerant architecture, aiming at applying the world's best domestic USN technology to safety-critical railways. In order to apply the USN system to the safety-critical field like a train control sector that the failures of controllers may cause severe railway accidents such as train collision and derailment, the quantitative reliability and safety evaluation recommended in IEC 62278 must be preceded. We also develop the evaluation model for overall system failure rate for the distributed network structure, which is the characteristics of USN system. Especially, we allocate reliability targets to component units, and present an availability evaluation plan through the plan on the quantitative achievement of failure rate for sensor nodes, gateways, radio-communication network and servers, along with the failure rate model of the overall system considering network operational features.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2010.09a
• /
• pp.759-763
• /
• 2010

Currently available evaluation checklists are developed for specific purposed using different parameters and items determined by different weighting factors. Those items with different weighting are sometimes said that they are based on the engineering judgement and leap of faith and, therefore, there is a limitation to adapt those checklists for slope-stability evaluation in the field. This study reviews factors affecting Rock-slope stability, analyze the relationship between those factors and slope failures using artificial neural network, and proposed a slope-stability evaluation model for adequate weighting for the factors.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.119-131
• /
• 2008

The paper considers the computation method in the performance evaluation of cellular network in the phase-type distribution assumptions that the channel holding times induced from mobility are modeled by well-fitted distributions to reflect an actual situation. When ww consider a phase-type distribution model instead of exponential distribution, the complexity of the computation increase exponential even though the accuracy is improved. We consider an efficient numerical algorithm to compute the performance evaluations in cellular networks such as a handoff call dropping probability, new call blocking probability, and handoff arrival rate. Numerical experiment shows that numerical analysis results are well approximated to the results of simulation.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.492-499
• /
• 2002

Technology Management and R&D(Research and Development) have been one of the most difficult divisions for measurement and evaluation. In spite of these difficulties, the concern and importance of R&D has been dramatically increased. However, it is actually very difficult to manage more efficiently and effectively than any other departments of production, finance, marketing and so on. As criticizing the shortcomings of the traditional evaluation system in making decisions for corporate management which has only been focused on financial indices, so Kaplan & Norton has suggested the Balanced Scorecard (BSC) which can be managed Critical Success Factors(CSF) in accordance with corporate's strategy. The Analytic Network Process(ANP), though based on the Analytic Hierarchy Process, allows the decision makers to leap beyond the traditional hierarchy to the interdependent environment of network modeling. Basing on BSC, this study has developed the evaluation system for R&D which has used ANP transforming quantitative and qualitative indices to the quantifying scales in evaluating R&D.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2005.10a
• /
• pp.327-332
• /
• 2005

This paper aims to analysis for evaluation factor and success prediction of port innovative cluster. This paper is divided three factors such ac policy, source and operation. In addition, three factors are divided into the twelve detail factors. the weight of each factor is calculated by Kohonen Network. At the result, this paper places the priority on the source factor.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1007-1017
• /
• 1997

The existing survivability measure is defined as the only ratio of survival traffic volume on the given traffic demand. In this paper we suggest a new network survivability evaluation model. Sinceit depends on the importance of traffic, we can evaluatethe affect of telecommunication disaster. With the suggested evaluation model we formulate optimization models for restoration paths and traffic assinment on them. The optimization models are represented as mixed integer programming problems, which are difficult to find exact solutions. We develop heuristic algorithms according to the optimization models and apply them to an example network with 10 nodes and 17 links.