• Title/Summary/Keyword: 분산 자원

Search Result 1,472, Processing Time 0.035 seconds

Analysis the Overhead of IEEE 802.11 RTS/CTS Handshake in Ad-hoc Networks Based Multipath Routing (다중경로 라우팅 기반 Ad-hoc Networks에서 IEEE 802.11 RTS/CTS 핸드세이크 오버헤드 분석)

  • Kim, Hyun-Chang;Lee, Jai-Yong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.33-44
    • /
    • 2008
  • Multipath routing protocols with load balance, fault tolerance, aggregated bandwidth in Ad-hoc Networks provide improved throughput and reliable route as compared with singlepath routing protocols. However, multipath routing protocols have not been explored thoroughly in the domain of overhead in Ad-hoc Networks. In this paper, we analyze and compare on-demand singlepath and multipath routing with IEEE 802.11 DCF in terms of Routing overhead and MAC overhead. The results reveals that in comparison with singlepath routing protocol, multipath routing mechanism creates more overheads but provides better performance in congestion and capacity provided that the route length is within a certain upper bound which is derivable. The analytical results are further confirmed by simulation.

Labeling network applicaion study policy settings for optimized transmission of multimedia internet (멀티미디어 인터넷망의 최적화 전송을 위한 라벨링망 응용 정책설정 고찰)

  • Gu, Hyun-Sil;Hwang, Seong-kyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.8
    • /
    • pp.1780-1784
    • /
    • 2015
  • Traditional IP routing, see only the Destination Address When Forwarding Layer 3 routing and exchange information and Destination-Based Routing Lookup is required for all Hop. Thus, all routers Full Internet routing information, the route information of more than about 120,000 may require. Therefore, the router configuration, which can be dispersed in the environment, the traffic load is required in accordance with this congestion. In this study, a unique characteristic of the Internet in the environment of an existing network Best Effect for QoS guarantee and hardware high speed switching of large multimedia data transmitted using a Labeling for forwarding a packet environment configuration is required. Video Stream Broadcast Transport Labeling rather than in much of the higher performance of the multi-step policy to most of the Video Stream Packet deulim was fixed to Labeling Header Format proposes a method of applying an effective QoS policy to a more simplified policy.

The Economic and Environmental Impact of the Small Hydropower Development in Korea: A CGE Analysis (소수력 발전 확대의 경제.환경적 효과: 연산일반균형모형 분석)

  • Kim, Jae-Joon;Park, Sung-Je
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2011.05a
    • /
    • pp.106-106
    • /
    • 2011
  • 소수력은 온실가스 배출량이 적은 친환경 청정에너지원이면서 지역의 분산전원에 기여할 수 있는 유용한 자원으로 평가되고 있다. 이러한 여건은 소수력발전 사업이 전력의 smart grid 구축 효과로 인해 가장 큰 효율성을 달성할 수 있을 것으로 기대된다. 국내 소수력발전은 1500Mw의 부존량을 가진 것으로 평가되고 있으나 계절적 편중으로 인한 가동률 부족, 경제성 부족 등으로 활발한 보급이 이루어지지 않고 있다. 특히 신재생에너지 확대 전략에도 불구하고 지원금 등 경제적 인센티브 부족으로 인해 민간부문의 참여는 상당히 저조하다. 그럼에도 불구하고 수력에너지는 환경친화적이고 잠재성이 큰 신재생에너지로 온실가스 저감과 에너지 확보에 기여할 수 있다. 특히 수력에너지는 민간투자의 어려움이 존재하므로 정부의 장기적인 기술개발투자 및 효율성 확대 정책이 중요하다. 본 연구에서는 소수력 확대의 경제 환경적 효과를 평가해보기 위해 연산일반균형모형 (CGE :Computable General Equilibrium Model)을 구축한다. 본 연구는 다음과 같이 수행되었다. 첫째, 수력발전부문과 수도사업을 구분하고 사회회계행렬을 작성하였으며, 전력부문에서 수력발전을 포함한 다단계 생산구조를 가정하였다. 둘째, 일반균형모형 방정식 체계를 작성하고 모형의 파라미터 추정 등 보정(Calibration) 작업을 수행하였다. 셋째, 국가 중기 온실가스저감 시나리오를 적용한 전망을 수행하고 소수력 확대(투자지원) 시나리오를 구축한다. 본 연구는 저감수단으로 탄소세를 부과하였다. 끝으로, 소수력 발전 보급 확대의 경제적, 환경적 파급효과를 계산하였다. 분석결과, 소수력 발전 잠재 성장을 반영한 수력에너지 비중은 약 2020년에 약 4.5% 까지 증가하는 것으로 나타났다. 이로 인한 온실가스 저감 기여분은 약 3%에 이르는 것으로 계산 되었다. 또한 수도사업과 비에너지 제조업의 산업비중은 증가하였다. 이러한 결과는 소수력 발전 확대가 화석연료 대체를 통한 지속가능한 에너지 수요에 기여하고 지역개발과 물산업 발전 등 경제적 파급효과 등을 유발할 수 있음을 시사한다. 또한 본 연구에서 고려하지 못한 소수력 기술 개발은 에너지 대체 촉진으로 인한 온실가스 저감과 녹색성장에 기여할 것이다.

  • PDF

Self-Configuration System based on Context Adaptiveness (상황적응기능기반 자가구성 시스템)

  • Lee, Seung-Hwa;Lee, Eun-Seok
    • The KIPS Transactions:PartD
    • /
    • v.12D no.4 s.100
    • /
    • pp.647-656
    • /
    • 2005
  • This paper proposes an adaptive resource self-management system that collects system resources, user information, and usage patterns as context information for utilization in self-configuration. This system ill ease the system maintenance burden on users by automation of large part of configuration tasks such as install, reconfiguration and update, and will also decrease cost and errors. Working from the gathered context information, this system allows users to select appropriate components and install them for user's system context. This also offers a more personalized configuration setting by using user's existing application setting and usage pattern. To avoid the overload on central server to transfer and manage related files, we employ Peer-to-Peer method. h prototype was developed to evaluate the system and a comparison study with the conventional methods of manual configuration and MS-IBM systems was conducted to validate the proposed system in terms of functional capacity, install time and etc.

An Embodiment of High Energy Physics Data Grid System (고에너지물리 데이타 그리드 시스템의 구현)

  • Cho Ki-Hyeon;Han Dae-Hee;Kwon Ki-Hwan;Kim Jin-Cheol;Yang Yu-Chul;Oh Young-Do;Kong Dae-Jung;Suh Jun-Suhk;Kim Dong-Hee;Son Dong-Chul
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.7
    • /
    • pp.390-398
    • /
    • 2006
  • The objective of the High Energy Physics(HEP) is to understand the basic properties of elementary particles and their interactions. The CMS(Compact Muon Solenoid) experiment at CERN which will produce a few PetaByte of data and the size of collaboration is around 2000 physicists. We cannot process the amount of data by current concept of computing. Therefore, an area of High Energy Physics uses a concept of Tier and Data Grid. We also apply Data Grid to current High Energy Physics experiments. In this paper, we report High Energy Physics Data Grid System as an application of Grid.

An Internet Multicast Routing Protocol with Region-based Tree Switching (지역망간의 트리전환을 이용하는 인터넷 멀티캐스트 라우팅 프로토콜)

  • Kim, Won-Tae;Park, Yong-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.234-243
    • /
    • 2000
  • We design a modified network architecture with condsidering current Internet network model and traffic characteristics, and propose EDCBT(Enhanced Dispersed Core-based Tree) multicast routing protocol, which enhances scalabity, reliability, end-to-end delay and resource utilization EDBCT adopts bidirectional dispersed shared trees and manages both of intradomain and interdomain multicast trees for a multicast group. Each regional multicast tree is estabilshed from its core router and they are interconnected by the operation between border routers on edges of each regional network. As a result, interdomain multicast tree can be easily established. We introduce a new concept named RBTS(Region-based Tree Switching), which dramatically enhances QoS and network utilization. Finally, protocol performance and the effect of core router location are evaluated with MIL3 OPNet network simulator, in terms of end-to-end delay, packet loss and throughput.

  • PDF

A Bayesian Inference Model for Landmarks Detection on Mobile Devices (모바일 디바이스 상에서의 특이성 탐지를 위한 베이지안 추론 모델)

  • Hwang, Keum-Sung;Cho, Sung-Bae;Lea, Jong-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.1
    • /
    • pp.35-45
    • /
    • 2007
  • The log data collected from mobile devices contains diverse meaningful and practical personal information. However, this information is usually ignored because of its limitation of memory capacity, computation power and analysis. We propose a novel method that detects landmarks of meaningful information for users by analyzing the log data in distributed modules to overcome the problems of mobile environment. The proposed method adopts Bayesian probabilistic approach to enhance the inference accuracy under the uncertain environments. The new cooperative modularization technique divides Bayesian network into modules to compute efficiently with limited resources. Experiments with artificial data and real data indicate that the result with artificial data is amount to about 84% precision rate and about 76% recall rate, and that including partial matching with real data is about 89% hitting rate.

Design and Performance Analysis of A Novel P2P-SIP Architecture for Network-based Mobility Support in Intelligent Home Networks (지능형 홈네트워크에서 네트워크 기반의 이동성 지원을 위한 P2P-SIP 구조의 설계 및 성능분석)

  • Kim, SeungWon;Jeong, JongPil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.7
    • /
    • pp.293-302
    • /
    • 2013
  • Home network providers have many worries about providing home network services with an expandable, reliable, flexible and low-cost structure according to the expanding market environment. The existing client-server system has various problems such as complexity and high costs in providing home network services. In this paper we propose the P2P-SIP structure. P2P communication terminal supporting access of distributed resources provides functions which the existing SIP-based network devices have. Because diverse terminals in a home network access through networks, also, partitioning network domains with home gateways to manage, and applying the network-based PMIPv6(Proxy Mobile IPv6) technology considering mobility of terminals would help to have a more efficient home network structure. Especially, the proposed P2P-SIP structure proves itself as a very efficient structure to have an outstanding expandability among different home networks in a region, and to reduce maintenance costs.

Priority-Based Dynamic Intent Assignment Method in Wi-Fi Direct Environments (Wi-Fi Direct 환경에서 우선순위 기반의 동적 Intent 할당 방안)

  • Lee, Jae-ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.5
    • /
    • pp.565-573
    • /
    • 2016
  • Wi-Fi Direct standard technology(Wi-Fi Peer to Peer Technical Specifications v1.2, 2010) was designed for allowing peer to peer communication between two or more devices and various products which have been currently manufactured such as smart phone and smart TV have already provided this technical function. In this technology the role of Coordinator in Wi-Fi infrastructure would be matched to GO(Group Owner) which needs relatively high energy resource and computation power due to the high probability for allowing 3rd-party connection, however, the current standard specification would be limited in terms of energy distribution because it has not included a process to determine the role of GO. To address above problem, this paper classified considerable parameters into the general parameters for the physicality of devices and the specific parameters for considering the role position depending on use-case scenario, and proposed a new method called DIVA to help efficiently determining GO role from the member devices of Wi-Fi Direct network. Furthermore the effect of this mechanism was proved via simulation-based experiments.

Implementation of a Layer-7 Web Clustering System on Linux with Performance Enhancements via Recognition of User Request Rate Variations (리눅스에서 레이어-7 웹 클러스터링 시스템의 구현 및 사용자 요청률 차이의 인식에 기반한 성능 개선)

  • Hong Il-gu;Noh Sam H.
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.68-79
    • /
    • 2005
  • The popularity of Web service is ever increasing. As the number of services and clients continue to increase, the problem of providing a system that scales with this increase is becoming more difficult. A costly and ineffective method is to buy a new system that is more powerful every time the load becomes unbearable. h more cost effective solution is to expand the system as the need arises. This is the approach taken in Web cluster systems. However, providing effective scalability in a Web cluster system is stil1 an open issue. In this study, we implement a Web cluster system based on Layer 7 switching technique on Linux. The implementation is based on a design proposed and implemented by Aron et al., but on the FreeBSD. Though the design li the same, due to the vast difference between the FreeBSD and Linux, the implementation presented in this paper is totally new. We also propose the Dual Scheduling (DS) load distribution algorithm that distributes the requests to the system resources by observing the variations in the request rate. We show through measurement on our implementation that the DS alorithm performs considerably bettor than previous algorithms.