• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.522-541
• /
• 2016

Network virtualization provides an effective way to overcome the Internet ossification problem. As one of the main challenges in network virtualization, virtual network embedding refers to mapping multiple virtual networks onto a shared substrate network. However, existing heuristic embedding algorithms evaluate the embedding potential of the nodes simply by the product of different resource attributes, which would result in an unbalanced embedding. Furthermore, ignoring the hops of substrate paths that the virtual links would be mapped onto may restrict the ability of the substrate network to accept additional virtual network requests, and lead to low utilization rate of resource. In this paper, we introduce and extend five node attributes that quantify the embedding potential of the nodes from both the local and global views, and adopt the technique for order preference by similarity ideal solution (TOPSIS) to rank the nodes, aiming at balancing different node attributes to increase the utilization rate of resource. Moreover, we propose a novel two-stage virtual network embedding algorithm, which maps the virtual nodes onto the substrate nodes according to the node ranks, and adopts a shortest path-based algorithm to map the virtual links. Simulation results show that the new algorithm significantly increases the long-term average revenue, the long-term revenue to cost ratio and the acceptance ratio.

• 한국시뮬레이션학회논문지
• /
• 제14권2호
• /
• pp.93-103
• /
• 2005

This paper presents characteristics of a virtual human's navigation using a limited perception-based mapping. Previous approaches to virtual human navigation have used an omniscient perception requiring full layout of a virtual environment in advance. However, these approaches have a limitation on being a fundamental solution for a human-likeness of a virtual human, because behaviors of humans are basically based on their limited perception instead of omniscient perception. In this paper, we integrated Hill's mapping algorithm with a virtual human to experiment virtual human's navigation with the limited perception. This approach does not require full layout of the virtual environment, 360-degree's field of view, and vision through walls. In addition to static objects such as buildings, we consider enemy emergence that can affect an virtual human's navigation. The enemy emergence is used as the variable on the experiment of this present research. As the number of enemies varies, the changes in arrival rate and time taken to reach the goal position were observed. The virtual human navigates by two conditions. One is to take the shortest path to the goal position, and the other is to avoid enemies when the virtual human encounters them. The acquired result indicates that the virtual human's navigation corresponds to a human cognitive process, and thus this research can be a framework for human-likeness of virtual humans.

• Journal of Power Electronics
• /
• 제11권6호
• /
• pp.856-863
• /
• 2011

In this paper a novel method of the Ant Colony Optimization algorithm for rotor position estimation in Switched Reluctance Motors is presented. The data provided by the initial assumptions is one of the important aspects used to solve the problems relative to an Ant Colony algorithm. Considering the nature of a real ant colony, it was found that the ants have no primary data for deducing which is the shortest path in their initial iteration. They also do not have the ability to see the food sources at a distance. According to this point of view, a novel method is presented in which the rotor pole position relative to the corresponding stator pole in a switched reluctance motor is estimated with high accuracy using the active and inactive phase parameters. This new method gives acceptable results such as a desirable convergence together with an optimized and stable response. To the best knowledge of the authors, such an analysis has not been carried out previously.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권4호
• /
• pp.1187-1208
• /
• 2022

One of the main goals of wireless sensor networks (WSNs) is to utilize the energy of sensor nodes effectively and maximize the network lifetime. Thus, this paper proposed a routing protocol for WSNs based on virtual force disturbing mobile Sink node (VFMSR). According to the number of sensor nodes in the cluster, the average energy and the centroid factor of the cluster, a new cluster head (CH) election fitness function was designed. At the same time, a hexagonal fixed-point moving trajectory model with the best radius was constructed, and the virtual force was introduced to interfere with it, so as to avoid the frequent propagation of sink node position information, and reduce the energy consumption of CH. Combined with the improved ant colony algorithm (ACA), the shortest transmission path to Sink node was constructed to reduce the energy consumption of long-distance data transmission of CHs. The simulation results showed that, compared with LEACH, EIP-LEACH, ANT-LEACH and MECA protocols, VFMSR protocol was superior to the existing routing protocols in terms of network energy consumption and network lifetime, and compared with LEACH protocol, the network lifetime was increased by more than three times.

• Spatial Information Research
• /
• 제15권2호
• /
• pp.95-109
• /
• 2007

최근 도로네트워크 환경에서 위치기반 서비스를 제공하는데 있어서 2차원 공간 데이터를 기반으로 하고 있다. 3차원 데이터는 사용자에게 2차원 보다 친근감을 주는 중요한 매체가 되지만, 데이터의 크기가 커지기 때문에 이동단말기의 메모리 공간의 한계로 모든 데이터를 저장할 수 없게 되는 문제점이 발생한다. 본 논문에서는 도로네트워크에서 이동객체에게 3차원 데이터를 제공할 수 있는 연속원근질의를 정의하고 이를 처리하는 방법론을 제안하였다.

• 한국국방경영분석학회지
• /
• 제25권2호
• /
• pp.84-96
• /
• 1999

The purpose of this paper is to find the most vital arc in the minimum cost flow problem. The most vital arc is the arc whose removal results in the greatest influence in the costs or the amount of demands in a given minimum cost flow network. This problem can be well applied to the conflict situations such as military logistics network or communications network. In this situation, network user wants to know which arcs are the most vital to him so that he can reinforce these arcs against attack, while interdictor wants to destroy these arcs which increase the distance of the shortest path most through the network. When one of arcs is removed from the network of the minimum cost flow problem, two kinds of situations can be occurred ; breaking feasibility and increasing cost. In case of breaking feasibility, the rank of arcs are determined using the amount of modified flow in a related network which is made of modifying the optimal alternative of the minimum cost flow problem. The rank of arcs with the increased costs are determined by using a method which finds the directed cycle with the minimum cost in a related network.

• 인터넷정보학회논문지
• /
• 제5권5호
• /
• pp.129-138
• /
• 2004

스위치 노드(switch node)로 구성된 네트워크에서 멀티캐스팅을 위한 트리를 구성하는 것은 NP-complete로 알려진 스타이너 트리 문제(Stainer free problem)로 정형화된다. 현재의 멀티캐스트를 요구하는 서비스들은 대개 대용량의 멀티미디어 데이터를 요구하게 된다. 이러한 서비스들은 텍스트 기반의 서비스에 비해 서비스의 질(Quality of Service)이 아주 중요한 요소가 되고, QoS는 전송에 소요되는 시간에 매우 민감하게 반응한다. 단일 제약을 갖는 멀티캐스트 트리 문제에 적용되는 휴리스틱은 이미 많이 연구되었으나, 노드 연결도 제한과 평균 흡수를 고려하는 다중 제약이 있는 멀티캐스트 트리 문제에 적용되는 휴리스틱에 대한 연구는 없었다. 본 논문에서는 다중 제약을 만족하는 효율적인 멀티캐스트 트리 문제에 적용 가능한 알고리즘을 제안하고, 실험을 통하여 성능을 평가하였다.

• 대한산업공학회지
• /
• 제27권3호
• /
• pp.315-327
• /
• 2001

This paper considers the problem of operation sequencing in nonlinear process planning, which is the problem of selecting and sequencing operations required to produce a part with the objective of minimizing the sum of operation processing costs and machine, setup and tool change costs. Main constraints are the precedence relations among operations. The problem can be decomposed into two subproblems: operation selection and operation sequencing. We suggest four simulated annealing algorithms, which solve the two subproblems iteratively until a good solution is obtained. Here, the operation selection problem can be solved using a shortest path algorithm. Application of the algorithms is illustrated using an example. Also, to show the performances of the suggested algorithms, computational experiments were done on randomly generated test problems and the results are reported. In particular, one of the suggested algorithms outperforms an existing simulated annealing algorithm.

• 대한교통학회지
• /
• 제21권1호
• /
• pp.91-102
• /
• 2003

본 연구는 $\circled1$Cellular Automata(이하 CA)모형을 기반으로 대규모 네트워크에 적용 가능한 보다 현실적인 CA차량모형 구축. $\circled2$구축된 CA차량모형을 이용한 차량 모의실험기의 개발과 개발된 차량 모의실험기를 이용한 단기링크통행시간 예측으로 구성된다. 구축된 CA차량추종모형은 기존의 CA차량추종모형 보다 현실적으로 감속을 통한 정지과정을 설명하면서 거시적 지표인 교통량-밀도-속도관계를 설명하였다. 또한 링크의 유출교통량(Outflow)을 제어하기 위한 차량의 링크전이모형은 기존의 차량 링크전이모형에 비하여 보다 안정된 대기차량을 형성하였다. 단기링크통행시간 예측을 위한 차량모의실험기는 대규모 가로망에 적용이 가능하도록 차량묶음(Packet, 이하차량묶음)방식과 링크기반 모의실험방식으로 컴퓨터의 연산 수행속도 및 메모리를 효율적으로 처리할 수 있었으며, 기존의 시계열자료 예측기법에서 고려할 수 없었던 차량의 행태 및 링크 상에서 발생하는 이동류 과포화, 뒷막힘현상 등의 메커니즘을 고려함으로서 기존 시계열자료 예측기법에 비하여 우수한 예측력을 보였다.

• 대한건축학회논문집:계획계
• /
• 제34권11호
• /
• pp.85-94
• /
• 2018

This study aims to investigate how easy pedestrians get around within/through the "Apartment Complexes (AC), " a common style of high-rise multi-family housing in Korea. Over the past six decades, the AC has been the most conventional way to provide standardized housing efficiently to address the problems of the shortage of housing and the substandard housing, due to the explosion of urban population with the rapid industrialization. The AC is a huge chunk of homeogenous multi-family housing, mostly condos with decent infrastructure, including parks, pedestrian passages, schools, ect. Both in the new town development and urban renewal programs have utilized the advantages of the AC. Since the design principals of AC tend to adopt the "protective design" to prevent cars and pedestrians coming outside from passing it, it has been criticised for dissecting the continuity of socioeconomic context in neighborhoods. The neo-traditional planning urbanists, including Jane Jacobs, emphasize that smaller blocks and grid road newtworks are the key in improving social, cultural, and economic vitality of the neighborhoods, because these design concepts allow more pedestrians and different types of people to be mixed in a neighborhood. In this study, we first adopted objective measures for pedestrian accessibility and pedestrian efficiency. These measures were used to calculate the lengths of shortest paths from residential buildings to the edges of AC. We tested the difference in shortest paths between the current pedestrian networks of AC and hypothetical grid networks on the AC, and the relative difference is considered as the pedestrian efficiency, using the network analysis function of Geographic Information Systems (GIS) and Python programming. We found from the randomly selected 30 ACs that the existing non-grid road networks in ACs are worse than the hypothesized grid networks, in terms of pedestrian efficiency. In average, pedestrians in AC with the conventional road networks have to walk than 25%, 26%, and 27% longer than the networks of $125{\times}45m$, $100{\times}45m$, and $75{\times}45m$, respectively. With the t-test analysis, we found the pedestrian efficiency of AC with the conventional network is lower than grid-networks. Many new urbanists stress, easiness of walking is one of the most import elements for community building and social bonds. With the findings from the objective measures of pedestrian accessibility and efficiency, the AC would have limitations to attract people outside into the AC itself, which would increase dis-connectivity with adjacent areas.