• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.480-482
• /
• 1998

최근, 멀티캐스트 기법을 사용하는 멀티미디어 응용 프로그램들이 인터넷에 등장하고 있다. 이들 응용 프로그램들의 성공 여부는 수신자들에게 전송되는 음성/영상의 품질에 의해 좌우된다. 인터넷은 응용프로그램의 QoS(Quality of Service) 에 대한 요구를 보장할 수 없기 때문에 멀티케스트 트래픽(multicast traffic)을 위하여 인터넷의 성능을 최대한 효율적으로 이용할 수 있도록 흐름제어에 대한 많은 연구가 진행되고 있다. 그 중 IVS(INRIA Video conferencing System)에서 제안한 멀티캐스트 트래픽 흐름제어 알고리즘은 수신자가 주기적으로 전달하는 RTCP 의 패킷손실 정보에 의해 송신자가 전송율을 조절하는 것이다. 그러나 이 알고리즘은 네트워크 상태가 무부하(unload)임에도 불구하고 느린 피드백으로 인하여 가용 네트워크 대역폭을 빠르게 파악하지 못하기 때문에, TCP트래픽과 경쟁 상태에서 네트워크 대역폭을 불공정(unfairness)하게 사용하게 되고 네트워크 상태에 알맞는 전송율을 결정하지 못한다. 본 논문에서는 더욱 공정하게 대역폭을 공유할 수 있고 전체 링크 이용율을 높이는 두 가지 기법을 제안한다. 첫째, 측정된 네트워크 혼잡상태에 따라 RTCP 피드백의 전송 빈도를 동적으로 조절하는 것이다. 둘째, TCP와 같이 전송율을 증가/감소시킴으로써 공정하게 네트워크를 공유하도록 하는 것이다. 본 논문에서는 이 두 가지 기법들이 TCP 트래픽에 영향을 주지 않고 또한 RTCP피드백의 양을 증가시키지 않으면서도 공정하게 네트워크 대역폭을 공유함으로써 링크의 이용율을 높일 수 있다는 것을 시뮬레이션을 통하여 보여준다.안 모니터링 기 능 등으로 조사되었다.도 멜-켑스트럼을 사용한 경우 67.5%, K-L계수를 사용한 경우 75.3%로 7.8%의 향상된 인식률을 보였으며 K-L계수와 회귀계수를 결합한 경우에서도 비교적 높은 인식률을 보여 숫자음에 대해서도 K-L계수의 유효성을 확인할 수 있었다..rc$ 구입할 때 중점적으로 살펴보는 사항은 신선도와 순수재래종 여부, 위생상태였다. 한편 소비자가 언제나 구입할 수 없다는 의견이 85.2%나 되어 원활한 공급과 시장조성이 아직 정착되지 않고 있었다. $\bigcirc$ 현재 유통되고 있는 재래종닭은 소비자 대부분이 잡종으로 인식하고 있었으며, 재래종과 일반육계와의 구별은 깃털색, 피부색, 정강이색등 외관상으로 구별하고 있었다. 체중에 대한 반응은 너무 작다는 의견이었고, 식품으로의 인식도는 비교적 고급식품으로 인식하고 있다. $\bigcirc$ 재래종닭고기의 브랜드화에 대한 견해는 젊고 소득이 높은 계층에서 브랜드화의 필요성을 강조하고 있다. $\bigcirc$ 재래종달걀의 소비형태는 대부분의 소비자가 좋아하였으나 아직 먹어보지 못한 응답자가 많았다. 재래종달걀의 맛에 대해서는 고소하고 독특하여 차별성을 느끼고 있었다. $\bigcirc$ 재래종달걀의 구입장소는 계란판매점(축협.농협), 슈퍼, 백화점, 재래닭 사육 농장등 다양하였으며 포장단위는 10개를 가장 선호하였고, 포장재료는 종이, 플라스틱, 짚의 순으로 좋아하였다. $\bigcirc$ 달걀의 가격은 200원정도를 적정하다고 하였으며, 크기는 (평균 52g)는 가장 적당하다고

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1844-1866
• /
• 2011

In a home network system, each customer electronic device has the control data format chosen by its manufacturing company and there are various types of digital devices and protocols. Besides the mutual operating environments among the various devices are dissimilar. Affected by the characteristics explained above, home network systems can hardly support the crucial functions, such as data compatibility, concurrency control, and dynamic plug-in. Thus, the home network system shows relatively poor reusability. In this paper, we suggest design technique of configurable framework, which can widely support the variability, to increase the reusability of the home network system. We extract the different parts of the home network system as variation points, and define them as the variability types. We design a structure of configurable framework, and suggest customization technique of configurable framework through selection technique and plug-in technique. Also, we prove the reusability by applying the proposed framework and it methods to real-world home network systems and analyzing the measurement results of these case studies using software metrics. We can expect the proposed approach provides better reusability than the existing them by analyzing those measurement results.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.48 no.1
• /
• pp.35-45
• /
• 2020

This study focused on the park as a space to support the behavior of urban citizens in modern society. Modern city parks are not spaces that play a specific role but are used by many people, so their function and meaning may change depending on the user's behavior. In addition, current online data may determine the selection of parks to visit or the usage of parks. Therefore, this study analyzed the change of behavior in Yeouido Park, Yeouido Hangang Park, and Yangjae Citizen's Forest from 2000 to 2018 by utilizing a time series analysis. The analysis method used Big Data techniques such as text mining and social network analysis. The summary of the study is as follows. The usage behavior of Yeouido Park has changed over time to "Ride" (Dynamic Behavior) for the first period (I), "Take" (Information Communication Service Behavior) for the second period (II), "See" (Communicative Behavior) for the third period (III), and "Eat" (Energy Source Behavior) for the fourth period (IV). In the case of Yangjae Citizens' Forest, the usage behavior has changed over time to "Walk" (Dynamic Behavior) for the first, second, and third periods (I), (II), (III) and "Play" (Dynamic Behavior) for the fourth period (IV). Looking at the factors affecting behavior, Yeouido Park was had various factors related to sports, leisure, culture, art, and spare time compared to Yangjae Citizens' Forest. The differences in Yangjae Citizens' Forest that affected its main usage behavior were various elements of natural resources. Second, the behavior of the target areas was found to be focused on certain main behaviors over time and played a role in selecting or limiting future behaviors. These results indicate that the space and facilities of the target areas had not been utilized evenly, as various behaviors have not occurred, however, a certain main behavior has appeared in the target areas. This study has great significance in that it analyzes the usage of urban parks using Big Data techniques, and determined that urban parks are transformed into play spaces where consumption progressed beyond the role of rest and walking. The behavior occurring in modern urban parks is changing in quantity and content. Therefore, through various types of discussions based on the results of the behavior collected through Big Data, we can better understand how citizens are using city parks. This study found that the behavior associated with static behavior in both parks had a great impact on other behaviors.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.120-122
• /
• 2015

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1621-1630
• /
• 2009

There is a lot of recent research to provide services of dynamic distributed contents in P2P-based distributed environment. Distributed services of contents objects, however, have problems in QoS and dynamic management of segments. This paper proposed a new segment management method for the service of P2P-based distributed contents. The proposed method manages groups by the SGM(Segment Group Manager). The SGM manages streaming efficiently by the grouping of segments to be served in P2P environment. The segments in the same group cooperate for improved QoS using the management structure based on the distance and relationship. The distance-based management structure is for the improvement of retrieval efficiency while the relationship-based management structure is for the improvement of service ratio. The simulation results of the proposed method showed improvements in average transmission efficiency and average service rate. The improvement is 8% - 30% in average transmission efficiency and 10% - 30% in average service rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.245-248
• /
• 2009

Recently, Many studies have been progressing to path-finding with dynamic information on the Terminal Based Navigation System(TBNS). However, the most of existing algorithms are based on $A{\ast}$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, two abstract graph(AG) that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. The abstract graph is a simple graph of real road network. The method of using the abstract graph is proposed for reducing dependency of heuristic and exploring cost. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost but $AG^C$ has worse performance than $AG^H$ exploring cost.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.23-34
• /
• 2010

As the number of user increases according to the improvement of the network, the multi-thread schemes are used to process the service requests of several users who are connected simultaneously. The static thread pool scheme has the problem of occupying a static amount of system resources. On the other hand, the dynamic thread pool scheme can control the number of threads according to the users' requests. However, it has disadvantage that this scheme cannot react to the requests which are larger than the maximum value assigned. In this paper, a web server using a learning-based dynamic thread pool scheme is suggested, which will be running on a server programming of a multi-thread environment. The suggested scheme adds the creation of the threads through the prediction of the next number of periodic requests using Auto Regressive scheme with the web server apache worker MPM (Multi-processing Module). Unlike previous schemes, in order to set the exact number of the necessary threads during the unchanged number of work requests in a certain period, K-Nearest Neighbor algorithm is used to learn the number of threads in advance according to the number of requests. The required number of threads is set by comparing with the previously learned objects. Then, the similar objects are selected to decide the number of the threads according to the request, and they create the threads. In this paper, the response time has decreased by modifying the number of threads dynamically, and the system resources can be used more efficiently by managing the number of threads according to the requests.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.31-37
• /
• 2009

In the two-way relay channel, the relay employ Amplify-and-Forward (AF) or Decode-and-Forward (DF) protocol, and broadcast the network-coded signal to both user. In the system, DF protocol provides maximum throughput at low signal to noise ratio(SNR). On the other hand, at high SNR, AF protocol provides maximum throughput. The paper propose active transmission scheme which employ Amplify-and-Forward or Decode-and-Forward protocol based on received SNR at the relay over Two-way relay channel. The optimal threshold is investigated numerically for switching the protocol. Through numerical results, we confirm that the proposed scheme outperforms conventional schemes over two-way relay channel.

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.183-191
• /
• 2005

In a sender-initiated load sharing algorithms, sender(overloaded processor) continues to send unnecessary request messages for load transfer until receiver(underloaded processor) is found while the system load is heavy. Therefore, it yields many problems such as low CPU utilization and system throughput because of inefficient inter-processor communications until the sender receives an accept message from the receiver in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load sharing in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off is determined by the proposed GA to decrease unnecessary request messages.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1303-1310
• /
• 2007

In IEEE 802.11b wireless network, stations synchronize themselves to the beacons periodically sent by the access point (AP) when they are running in low power mode. Stations stay awake for enough time to receive beacon because it is delayed in AP if the wireless channel has been being used by other traffic at each scheduled instant. In this paper, we propose a method that measures the delay of received beacons and calculates wake-up interval of station to receive the next one. Beacon transmission delay at the AP is analyzed. The proposed method is simulated and its characteristics are described in the analysis. The result measured in terms of station's wake-up interval shows some enhancement in energy consumption.