• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.111-120
• /
• 2012

As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry were suggested based on the distributed hash table, these systems are limited to $log_2N$ for performance efficiency. For this enhanced performance efficiency limited, the article herein suggests group routing algorithm. The suggested algorithm is a node-to-group routing algorithm which divides circular address space into groups and uses a concept of pointer representing each group, which is an algorithm where routing is performed based on pointer. To evaluate algorithm performance, a comparative analysis was conducted on average hops, routing table size, and delayed transmission for chord and routing, a signature algorithm in P2P systems. Therefore, enhanced performance is verified for comparative items from the simulation results.

• Journal of the Korea Convergence Society
• /
• v.11 no.12
• /
• pp.383-390
• /
• 2020

The present study was conducted to examine the differences and correlations between verbal fluency and story comprehension according to the working memory(WM) capacity, and to find out what WM factors influence the linguistic competence in Alzheimer's disease(AD) and vascular dementia(VaD) groups each consisting of 15 patients. The results of their performance produced firstly significant differences in phonemic fluency, story comprehension, delayed recall and recognition task between the two groups. Further analysis shows that VaD group had significant correlations between the scores of story comprehension and the recognition test scores additionally. These findings suggest that it is possible to differentiate the two groups even by story comprehension tasks and WM. In conclusion, the clinical application of the results is likely to contribute to appropriate treatment plans and effective interventions for elderly with AD and VaD as well as to improve the classification criteria for both types of dementia.

• Spatial Information Research
• /
• v.20 no.2
• /
• pp.137-153
• /
• 2012

Until now, many indexing methods that can reduce update cost have been proposed for managing massive moving objects. Because indexing methods for moving objects have to be updated periodically for managing moving objects that change their location data frequently. However these kinds indexing methods occur big load that exceed system capacity when the number of moving objects increase dramatically. In this paper, we propose the update frequency reducing method to combine MapReduce and existing indices. We use the update request grouping method for each moving object by using MapReduce. We decide to update by comparing the latest data and the oldest data in grouping data. We reduce update frequency by updating the latest data only. When update is delayed, for the data should not be lost and updated periodically, we store the data in a certain period of time in the hash table that keep previous update data. By the performance evaluation, we can prove that the proposed method reduces the update frequency by comparison with methods that are not applied the proposed method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.40-47
• /
• 2009

Recently, dynamic proxy caching has been proposed on the distributed environment so that media objects by user's requests can be served directly from the proxy without contacting the server. However, it makes caching challenging due to multimedia large sizes, low latency and continuous streaming demands of media objects. To solve the problems caused by streaming demands of media objects, this paper has been proposed the grouping scheme with fuzzy filtering based on partition and mapping. For partition and mapping, this paper divides media block segments into fixed partition reference block(R$_f$P) and variable partition reference block(R$_v$P). For semantic relationship, it makes fuzzy relationship to performs according to the fixed partition temporal synchronization(T$_f$) and variable partition temporal synchronization(T$_v$). Simulation results show that the proposed scheme makes streaming service efficiently with a high average request response time rate and cache hit rate and with a low delayed startup ratio compared with other schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2653-2663
• /
• 1997

The successive and parallel interference cancellation schemes are two well-known types of multi-stage interference cancellation schemes using the conventional correlator receivers as a basic building block, which has been known to significantly improve the performance of DS/CDMA system in the multiple access communication. Performance comparison between these two schemes is made strictly based on the analytical and it has been shown that the successive interference cancellation (SIC) scheme is more resistant to fading than the parallel interference cancellation (PIC) scheme. We further investigate the performance of the successive IC scheme subject to the delay constraint, which may be imposed typically on most of service applications with a real-time transmission requirement, including speech and video applications. Our analysis demonstrates that the performance may be significantly improved by the groupwise successive interference cancellation (GSIC) scheme, which can be properly optimized to meet the given delay constraint.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.197-203
• /
• 2002

This paper proposes a new agent based mechanism called a Multicast Handoff Agent (MHA) to reduce handoff latency for IP multicast. The MHA acts as a proxy for an Internet Group Management Protocol (IGMP) of Mobile Nodes (MNs) at each Base Station (BS) and keeps information for members of multicast groups in a cell. When an MN moves to a next cell, the MHA immediately sends unsolicited reports without waiting for the IGMP query. The mechanism was evaluated through simulation and analysis and compared with the IGMPv2 for micro-mobility and the IGMP traffic. Simulation results show that handoff latency for micro-mobility can be largely reduced and the IGMP control traffic on the wireless links during the duration of membership can be eliminated. Thus, this mechanism is superior to the existing mechanism in both micro-mobility and battery duration, as the need not to reply to a query conserves battery power.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.1-7
• /
• 2021

In this paper, optimized media data retrieval and transmission based on the Hybrid CDN/P2P architecture and selective storage through user's prediction of requestability enable seamless data transfer to users and reduction of unnecessary traffic. We also propose a new media management method to minimize the possibility of transmission delay and packet loss so that media can be utilized in real time. To this end, we construct each media into logical segments, continuously compute weights for each segment, and determine whether to store segment data based on the calculated weights. We also designate scattered computing nodes on the network as local groups by distance and ensure that storage space is efficiently shared and utilized within those groups. Experiments conducted to verify the efficiency of the proposed technique have shown that the proposed method yields a relatively good performance evaluation compared to the existing methods, which can enable both initial latency reduction and seamless transmission.

• Journal of Educational Research in Mathematics
• /
• v.15 no.1
• /
• pp.75-105
• /
• 2005

This study explored a mathematical modeling flow and the effect of interactions among students and between a student and Excel on modeling in a small group modeling environment with Excel. This is a case study of three 8th graders' modeling activity using Excel during their extra lessons. The conclusions drawn from this study are as follows: First, small group modeling using Excel was formed by formulating 4∼10 modeling cycles in each task. Students mainly formed tables and graphs and refined and simplified these models. Second, students mainly formed tables, algebraic formulas and graphs and refined tables considering each variable in detail by obtaining new data with inserting rows. In tables, students mainly explored many expected cases by changing the values of the parameters. In Graphs, students mainly identified a solution or confirmed the solution founded in a table. Meanwhile, students sometimes constructed graphs without a purpose and explored the problem situations by graphs mainly as related with searching a solution, identifying solutions that are found in the tables. Thus, the teacher's intervention is needed to help students use diverse representations properly in problem situations and explore floatingly and interactively using multi-representations that are connected numerically, symbolically and graphically. Sometimes students also perform unnecessary activities in producing data by dragging, searching a solution by 'trial and error' and exploring 'what if' modeling. It is considered that these unnecessary activities were caused by over-reliance on the Excel environment. Thus, the teacher's intervention is needed to complement the Excel environment and the paper-and-pencil environment properly.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.39-48
• /
• 2008

Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.44-53
• /
• 2000

The waiting delays of users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes an unfair service to users and increases the possibility of higher reneging rates. This paper proposes an adaptive batch scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. The proposed scheme selects dynamically multiple videos in given intervals based on the service patterns which reflect the popularity distribution(Zipf-distribution) and resource utilizations. Experimental results of simulations show that the proposed scheme improves about 20-30 percentage of average waiting time and reduces significantly the starving requesters comparing with those of conventional methods such as FCFS and MQL.