• Journal of IKEEE
• /
• v.18 no.2
• /
• pp.248-254
• /
• 2014

The hierarchical conference causes the data delay because the exchanged data between terminals in the conference go through the hierarchical structure. In this paper, we propose an algorithm which minimizes the average path distance between terminals in a non-incremental hierarchical conference, and which considers the computing resource. For terminals which want to join the ongoing hierarchical conference, our algorithm selects terminals that the new connection is possible among terminals in the conference with the computing resource consideration. Then, after all distance values between the selected terminals and terminals which want to join the ongoing hierarchical conference are computed, and the terminal-pair which have minimum distance value is selected, the ongoing hierarchical conference is extended with a connection of the terminal-pair which consists of a terminal among selected terminals and other terminal among terminals which want to join the ongoing hierarchical conference. This continues until all terminals are included in the conference. As the experimental results with the proposed non-incremental scheme, the hierarchical conference can be organized with 24% better performance than the earlier incremental scheme on the basis of average path distance between terminals.

• Journal of Digital Contents Society
• /
• v.18 no.6
• /
• pp.1119-1125
• /
• 2017

Genres and actions of stories can be used to classify stories, and used effectively as well for visualizing story properties. This paper proposes a Genre-Action coordinate system for visualizing story property data in 2-dimension that has similarities between the genre and action items along the axes, i.e. a property of spatial continuum. With the proposed Genre-Action coordinate system we found that the genre and action items in the axes are arranged according to their similarities and we were able to achieve a spatially meaningful visualization of story properties where the related data form clusters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2211-2232
• /
• 2018

The unstructured and semi-structured big data in social network poses new challenges in query retrieval. This requirement needs to be met by introducing quality retrieval time measures like indexing. Due to the huge volume of data storage, there originate the need for efficient index algorithms to promote query processing. However, conventional algorithms fail to index the huge amount of frequently obtained information in real time and fall short of providing scalable indexing service. In this paper, a new LIndex algorithm, which is a heuristic on Lucene is built on Neo4jHA architecture that holds the social network Big data. LIndex is a flexible and simplified adaptive indexing scheme that ascendancy decomposed shortest paths around term neighbors as basic indexing unit. This newfangled index proves to be effectual in query space pruning of graph database Neo4j, scalable in index construction and deployment. A graph query is processed and optimized beyond the traditional Lucene in a time-based manner to a more efficient path method in LIndex. This advanced algorithm significantly reduces query fetch without compromising the quality of results in time. The experiments are conducted to confirm the efficiency of the proposed query retrieval in Neo4j graph NoSQL database.

• Journal of Korean Society of Transportation
• /
• v.23 no.1
• /
• pp.103-114
• /
• 2005

The transit fare resulted from the renovation of public transit system in Seoul is basically determined based on the distance-based fare policy (DFP). In DFP, the total fare a passenger has to pay for is calculated by the basic-transfer-premium fare decision rule. The fixed amount of the basic fare is first imposed when a passenger get on a mode and it lasts within the basic travel distance. The transfer fare is additionally imposed when a passenger switches from one mode to another and the fare of the latter mode is higher than the former. The premium fare is also another and the fare of the latter begins to exceed the basic travel distance and increases at the proportion of the premium fare distance. The purpose of this study is to propose an algorithm for finding K number of paths, paths that are sequentially sorted based on total amount of transit fare, under DFP of the idstance-based fare policy. For this purpose, the link mode expansion technique is proposed in order to save notations associated with the travel modes. Thus the existing K shortest path algorithms adaptable for uni-modal network analysis are applicable to the analysis for inter-modal transportation networks. An optimality condition for finding the K shortest fare routes is derived and a corresponding algorithms is developed. The case studies demonstrate that the proposed algorithm may play an important role to provide diverse public transit information considering fare, travel distance, travel time, and number of transfer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1661-1670
• /
• 2016

In this paper, we present a risk prediction system and customized evacuation pathfinding algorithm in fire scenarios. For the risk prediction, we apply a multi-level clustering mechanism using collected temperature at sensor nodes throughout the network in order to predict the temperature at the time that users actually evacuate. Based on the predicted temperature and its reliability, we suggest an evacuation pathfinding algorithm that finds a suitable evacuation path from a user's current location to the safest exit. Simulation results based on FDS(Fire Dynamics Simulator) of NIST for a wireless sensor network consisting of 47 stationary nodes for 1436.41 seconds show that our proposed prediction system achieves a higher accuracy by a factor of 1.48. Particularly for nodes in the most reliable group, it improves the accuracy by a factor of up to 4.21. Also, the customized evacuation pathfinding based on our prediction algorithm performs closely with that of the ground-truth temperature in terms of the ratio of safe nodes on the selected path, while outperforming the shortest-path evacuation with a factor of up to 12% in terms of a safety measure.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.63-74
• /
• 2021

Location-based services (LBSs) are expected to process a large number of spatial queries, such as shortest path and k-nearest neighbor queries that arrive simultaneously at peak periods. Deploying more LBS servers to process these simultaneous spatial queries is a potential solution. However, this significantly increases service operating costs. Recently, batch processing solutions have been proposed to process a set of queries using shareable computation. In this study, we investigate the problem of batch processing moving k-nearest neighbor (MkNN) queries in dynamic spatial networks, where the travel time of each road segment changes frequently based on the traffic conditions. LBS servers based on one-query-at-a-time processing often fail to process simultaneous MkNN queries because of the significant number of redundant computations. We aim to improve the efficiency algorithmically by processing MkNN queries in batches and reusing sharable computations. Extensive evaluation using real-world roadmaps shows the superiority of our solution compared with state-of-the-art methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.914-924
• /
• 2020

In this study we developed artificial network generation model, which can generate on-line social network. The suggested model can represent not only scale-free and small-world properties, but also can produce networks with various values of topological characteristics through controlling two input parameters. For this purpose, two parameter K and P are introduced, K for controlling the strength of preferential attachment and P for controlling clustering coefficient. It is found out on-line social network can be generated with the combinations of K(0~10) and P(0.3~0.5) or K=0 and P=0.9. Under these combinations of P and K small-world and scale-free properties are well represented. Node degree distribution follows power-law. Clustering coefficients are between 0.130 and 0.238, and average shortest path distance between 5.641 and 5.985. It is also found that on-line social network properties are maintained as network node size increases from 5,000 to 10,000.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• Geomechanics and Engineering
• /
• v.22 no.6
• /
• pp.529-540
• /
• 2020

Water inrush is a major hazard for mining and excavation in deep coal seams or rock masses. It can be attributed to the coalescence of rock fractures in rock mass due to the interaction of fractures, hydraulic flow and stress field. One of the key technical challenges is to understand the course and mechanism of fluid flows in rock joint networks and fracture propagation and hence to take measures to prevent the formation of water inrush channels caused by possible rock fracturing. Several case observations of fluid flowing in rock joint networks and coupled fracture propagation in underground coal roadways are shown in this paper. A number of numerical simulations were done using the recently developed flow coupling function in FRACOD which simulates explicitly the fracture initiation and propagation process. The study has demonstrated that the shortest path between the inlet and outlet in joint networks will become a larger fluid flow channel and those fractures nearest to the water source and the working faces become the main channel of water inrush. The fractures deeper into the rib are mostly caused by shearing, and slipping fractures coalesce with the joint, which connects the water source and eventually forming a water inrush channel.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2892-2913
• /
• 2016

Network virtualization promises to play a dominant role in shaping the future Internet by overcoming the Internet ossification problem. However, due to the injecting of additional virtualization layers into the network architecture, several new security risks are introduced by the network virtualization. Although traditional protection mechanisms can help in virtualized environment, they are not guaranteed to be successful and may incur high security overheads. By performing the virtual network (VN) embedding in a security-aware way, the risks exposed to both the virtual and substrate networks can be minimized, and the additional techniques adopted to enhance the security of the networks can be reduced. Unfortunately, existing embedding algorithms largely ignore the widespread security risks, making their applicability in a realistic environment rather doubtful. In this paper, we attempt to address the security risks by integrating the security factors into the VN embedding. We first abstract the security requirements and the protection mechanisms as numerical concept of security demands and security levels, and the corresponding security constraints are introduced into the VN embedding. Based on the abstraction, we develop three security-risky modes to model various levels of risky conditions in the virtualized environment, aiming at enabling a more flexible VN embedding. Then, we present a mixed integer linear programming formulation for the VN embedding problem in different security-risky modes. Moreover, we design three heuristic embedding algorithms to solve this problem, which are all based on the same proposed node-ranking approach to quantify the embedding potential of each substrate node and adopt the k-shortest path algorithm to map virtual links. Simulation results demonstrate the effectiveness and efficiency of our algorithms.