• Title/Summary/Keyword: 분산 자원

Search Result 1,472, Processing Time 0.029 seconds

A Traffic Model based on the Differentiated Service Routing Protocol (차별화된 서비스제공을 위한 트래픽 모델)

  • 인치형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10B
    • /
    • pp.947-956
    • /
    • 2003
  • The current IP Routing Protocolspacket networks also need to provide the network QoS based of DiffServ, RSVP, MPLStraffic model which is standardized as IETF reference model for NGN. The first topic of this paper is to propose Traffic-Balanced Routing Protocol(TBRP) to process existing best effort traffic. TBRP will process low priority interactive data and background data which is not sensitive to dealy. Secondly Hierarchical Traffic-Traffic-Scheduling Routing Protocol(HTSRP) is also proposed. HTSRP is the hierarchical routing algorithm for backbone and access networkin case of fixed-wireless convergence network. Finally, HTSRP_Q is proposed to meet the QoS requirement when user want interactive or streaming packet service. This protocol will maximize the usage of resources of access layer based on the QoS parameters and process delay-sensitive traffic. Service classes are categorized into 5 types by the user request, such as conversational, streaming, high priority interactive, low priority interactive, and background class. It could be processed efficiently by the routing protocolstraffic model proposed in this paper. The proposed routing protocolstraffic model provides the increase of efficiency and stability of the next generation network thanks to the routing according to the characteristic of the specialized service categories.

Dynamic Analysis Framework for Cryptojacking Site Detection (크립토재킹 사이트 탐지를 위한 동적 분석 프레임워크)

  • Ko, DongHyun;Jung, InHyuk;Choi, Seok-Hwan;Choi, Yoon-Ho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.4
    • /
    • pp.963-974
    • /
    • 2018
  • With the growing interest in cryptocurrency such as bitcoin, the blockchain technology has attracted much attention in various applications as a distributed security platform with excellent security. However, Cryptojacking, an attack that hijack other computer resources such as CPUs, has occured due to vulnerability to the Cryptomining process. In particular, browser-based Cryptojacking is considered serious because attacks can occur only by visiting a Web site without installing it on a visitor's PC. The current Cryptojacking detection system is mostly signature-based. Signature-based detection methods have problems in that they can not detect a new Cryptomining code or a modification of existing Cryptomining code. In this paper, we propose a Cryptojacking detection solution using a dynamic analysis-based that uses a headless browser to detect unknown Cryptojacking attacks. The proposed dynamic analysis-based Cryptojacking detection system can detect new Cryptojacking site that cannot be detected in existing signature-based Cryptojacking detection system and can detect it even if it is called or obfuscated by bypassing Cryptomining code.

A Study on Preservation Metadata Elements for Research Information (연구정보를 위한 보존 메타데이터 요소 개발에 관한 연구: 경제·인문사회연구회 연구관리시스템을 중심으로)

  • Kim, Pan-Jun
    • Journal of the Korean Society for information Management
    • /
    • v.27 no.4
    • /
    • pp.169-191
    • /
    • 2010
  • This study aimed at developing preservation metadata elements and its applications for research information which is considered as a valuable digital resource these days. Specifically, the developed preservation metadata intends to provide a basis for the research information of the government-funded research institutes in economic and social science fields which are major knowledge producers of national policy. To ensure the interoperability of the research information across various departments and organizations, this study compared the elements from the CERIF(European Standard) and those from the PREMIS Data Dictionary which is based on OAIS reference model (ISO 14721). Based on this comparative analysis, this study developed complementary preservation metadata elements based on the two standards' characteristics. Consequently, this study suggested a new preservation metadata elements and its applications that are compatible between the two systems and can be implemented in practice.

Brand Development Strategy for Local Identity Establishment -Focused on Yeosu City's Brand Development for Marine Products- (지역적 아이덴티티확립을 위한 브랜드개발전략 -여수시수산물 브랜드개발을 중심으로-)

  • Choi, Souk
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.2
    • /
    • pp.140-149
    • /
    • 2008
  • With the advent of local autonomy, local governments are seeking balanced regional development through the decentralization of the central government's authority. In line with this trend, each province has begun to recognize the significance of local identity as a means to promote regional development, and this recognition contributed to developing various brands using local resources. However, a number of these brands are similar to one another because they were developed without thoroughly analyzing and strategically differentiating local identities from one another. Thus, this study aims to propose local characteristics and consumer consciousness that need to be considered in local speciality brand development through practical marine product brand development cases representing Yeosu's local characteristics. This study intends to contribute to setting an effective direction of marine product branding by applying local color to brand development strategies and brand identity elements and by suggesting post-management and promotion plans of local brand positioning.

A mobile P2P a farming support system implementation which uses JXTA (JXTA를 이용한 모바일 P2P 영농 지원 시스템 구현)

  • Bae, Il-Ho;Cho, Ai-Ri;Min, Hae-Ran;Lee, Gwang;Lee, Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.579-582
    • /
    • 2004
  • File share system in client/server method requires server of High performance and capacity and this server is very expensive and management is complex and is been influenced much to flatform. Also, extension of correct memory or hard drive etc. causes a lot of expenses to server. While, may minimise human who happen by buying high-capacity server by dispersing file public ownership way unuse expensive server in client/serve. way who put up files in PC(client) to a sewer and manage files and make use of only client computers because public ownership of data and government official in P2P(peer to peer) environment, waste of material resources. Many people are interested to P2P by such reason, researches that use P2P to connection field to be Moba that have Gakgwangbatgo current are gone vigorously.

  • PDF

Design of OpenStack Cloud Storage Systems - Applying Infiniband Storage Network and Storage Virtualization Performance Evaluation (인피니밴드 스토리지 네트워크를 적용한 오픈스택 클라우드 스토리지 시스템의 설계 및 스토리지 가상화 성능평가)

  • Heo, Hui-Seong;Lee, Kwang-Soo;Pirahandeh, Mehdi;Kim, Deok-Hwan
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.7
    • /
    • pp.470-475
    • /
    • 2015
  • Openstack is an open source software that enables developers to build IaaS(Infrastructure as a Service) cloud platforms. Openstack can virtualize servers, networks and storages, and provide them to users. This paper proposes the structure of Openstack cloud storage system applying Infiniband to solve bottlenecking that may occur between server and storage nodes when the server performs an I/O operation. Furthermore, we implement all flash array based high-performance Cinder storage volumes which can be used at Nova virtual machines by applying distributed RAID-60 structures to three 8-bay SSD storages and show that Infiniband storage networks applied to Openstack is suitable for virtualizing high-performance storage.

Mortality and Potential Years of Life Lost comparison of lung cancer between Korea and OECD countries (우리나라와 OECD 국가 간의 폐암 사망률과 잠재수명손실연수(PYLL)에 관한 비교)

  • Kim, Dong-Seok;Kang, Soo-Won;Park, Ji-Won
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.7
    • /
    • pp.2515-2521
    • /
    • 2010
  • The aim of this study is to analyze the mortality and potential years of life lost (PYLL) by malignant neoplasm of lung between OECD countries and Korea. Based on the result, we tried to point out a problem on mortality caused malignant neoplasm of lung to make the best strategy for policy and education on public health. Using the ANOVA analysis between Korean and OECD countries, the lung cancer-induced mortality and PYLL in total and gender-specific Korean population were greater after 21th century than before. In particular, the PYLL was sharply elevated than the mortality. Taken together, the present study indicated that the lung cancer-induced PYLL between Korean and OECD countries can be more important parameter.

Energy-efficient Query Processing of Constrained Nearest Neighbor Queries on the Wireless Broadcasting Environments (무선방송환경에서 에너지 효율적인 제한된 최근접 질의 처리)

  • Lee, Myong-Soo;Ryu, Byung-Gul;Oh, Jae-Oh;Lee, Sang-Keun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.191-200
    • /
    • 2009
  • Location based services (LBSs) have drawn huge attention as the growing number mobile devices and wireless technology demand more pervasive information access. In LBSs, Constraint nearest neighbor queries are one of the important queries of human to fulfill his desired quickly through wireless technology. We propose new query processing of constrained nearest neighbor query on the air to support mobile clients which demand optimal uses of wireless broadcast channel and using minimum battery power of client. First we proposed NN query processing with constrained region and then explain the novel NN query processing with various types of constraints. We have proposed novel algorithms to support Constrained Nearest Neighbor queries on the air based on Distributed Spatial Index and Bitmap-based Spatial Index.

Design and implementation of a Shared-Concurrent File System in distributed UNIX environment (분산 UNIX 환경에서 Shared-Concurrent File System의 설계 및 구현)

  • Jang, Si-Ung;Jeong, Gi-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.617-630
    • /
    • 1996
  • In this paper, a shared-concurrent file system (S-CFS) is designed and implemented using conventional disks as disk arrays on a Workstation Cluster which can be used as a small-scale server. Since it is implemented on UNIX operating systems, S_CFS is not only portable and flexible but also efficient in resource usage because it does not require additional I/O nodes. The result of the research shows that on small-scale systems with enough disks, the performance of the concurrent file system on transaction processing applications is bounded by the bottleneck of CPUs computing powers while the performance of the concurrent file system on massive data I/Os is bounded by the time required to copy data between buffers. The concurrent file system,which has been implemented on a Workstation Cluster with 8 disks,shows a throughput of 388 tps in case of transaction processing applications and can provide the bandwidth of 15.8 Mbytes/sec in case of massive data processing applications. Moreover,the concurrent file system has been dsigned to enhance the throughput of applications requirring high performance I/O by controlling the paralleism of the concurrent file system on user's side.

  • PDF

Knowledge Preconditions for Composition of Semantic Web Services (시맨틱 웹서비스 조합을 위한 지식 전제조건)

  • Kim Sang-Kyun;Lee Kyu-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.9
    • /
    • pp.888-900
    • /
    • 2005
  • Several researches have been proposed to formalize the knowledge preconditions problem - j.e., an action or a plan is epistemically feasible. However, since the feasibility is only checked at design-time and is assumed that it will also 1)e feasible at run-time, it is not suitable in the context of Semantic Web services composition, where many agents should share the limited resources required for the execution of Web services composition. Therefore, in this paper, we formalize a transactionally executable Web services composition which enables to guarantee its atomicity. Moreover, in order to formalize the transactional executability, we propose $TL-ALCFK_{NF}$ which extends TL-ALCF with the modal operators K and A. Based on $TL-ALCFK_{NF}$, we show how to carry out the epistemic reasoning with TL-ALCF as a language to represent Semantic Web services composition.