• Title/Summary/Keyword: Distributed Computing.

Search Result 1,279, Processing Time 0.024 seconds

Agile Framework for SOA-based Application Development (SOA 기반 애플리케이션 개발을 위한 Agile 프레임워크)

  • Shin, Seung-Woo;Kim, Haeng-Kon
    • The KIPS Transactions:PartD
    • /
    • v.16D no.1
    • /
    • pp.55-64
    • /
    • 2009
  • Various business model and computing environments are currently merged into web services and many web related application products are also develop. Most of IT enterprises in Korea use the Service-oriented architecture (SOA) whenever they develop the web applications. SOA is an approach to loosely coupled, protocol independent, standards-based distributed computing where software resources available on the network are considered as Services. SOA is believed to become the future enterprise technology solution that promises the agility and flexibility the business users have been looking for by leveraging the integration process through composition of the services spanning multiple enterprises. But, There are no specific development methodology to apply into SOA standard model until now. The developer uses the currently existing methodology to develop the application with SOA. The users have some limitations to use it. In this paper, we suggest a Frameworks for applying agile methodology into SOA to address the productivity and quality of small web related project. We design and implement a frameworks architecture for applying the agile method into SOA and describe the process model to implement it. We finally evaluate the frameworks with productivity, flexibility and maintainability.

A Study on Non-Fungible Token Platform for Usability and Privacy Improvement (사용성 및 프라이버시 개선을 위한 NFT 플랫폼 연구)

  • Kang, Myung Joe;Kim, Mi Hui
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.11
    • /
    • pp.403-410
    • /
    • 2022
  • Non-Fungible Tokens (NFTs) created on the basis of blockchain have their own unique value, so they cannot be forged or exchanged with other tokens or coins. Using these characteristics, NFTs can be issued to digital assets such as images, videos, artworks, game characters, and items to claim ownership of digital assets among many users and objects in cyberspace, as well as proving the original. However, interest in NFTs exploded from the beginning of 2020, causing a lot of load on the blockchain network, and as a result, users are experiencing problems such as delays in computational processing or very large fees in the mining process. Additionally, all actions of users are stored in the blockchain, and digital assets are stored in a blockchain-based distributed file storage system, which may unnecessarily expose the personal information of users who do not want to identify themselves on the Internet. In this paper, we propose an NFT platform using cloud computing, access gate, conversion table, and cloud ID to improve usability and privacy problems that occur in existing system. For performance comparison between local and cloud systems, we measured the gas used for smart contract deployment and NFT-issued transaction. As a result, even though the cloud system used the same experimental environment and parameters, it saved about 3.75% of gas for smart contract deployment and about 4.6% for NFT-generated transaction, confirming that the cloud system can handle computations more efficiently than the local system.

Design and Implementation of a Transparent Security Infrastructure using Filter and Transformer (필터와 트랜스포머를 이용한 투명한 보안기반의 설계 및 구현)

  • Kim, Yong-Min;Lee, Do-Heon;Noh, Bong-Nam;Choi, Rak-Man;Ine, So-Ran
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.4
    • /
    • pp.975-983
    • /
    • 1998
  • In these days, information communication systems are based on both open distributed computing technologies and object-oriented techniques like inheritance, encapsulation and object reuse to support various system configuration and application. As information systems are interconnected through unsecure networks, the need for the secure information exchange is more critical than before. In this paper, we have designed and implemented a transparent CORBA-basce Security infrastructure with authentication, security context association, access control and security information management to support a secure applications in distributed object environment. SESAME Ver. 4 was adopted as an external security service to manage user privilege attributes and to distribute keys for data encryption, decryption and integrity. Using filter and transformer with an interface to Object Request Broker, it provides a transparent security service to applications. The filter objects are special classes that allow additional parameters to be inserted into messages before they are sent and removed just after they are received. The transformer objects are special classes that allow direct access to the byte stream of every messages for encryption and decryption before it is sent and just after it is received. This study is to implement the access control interceptor(ACI) and the secure invocation interceptor(SII) of secure ORB defined in CORBA using filter and transformer.

  • PDF

Performance Analysis of TCAM-based Jumping Window Algorithm for Snort 2.9.0 (Snort 2.9.0 환경을 위한 TCAM 기반 점핑 윈도우 알고리즘의 성능 분석)

  • Lee, Sung-Yun;Ryu, Ki-Yeol
    • Journal of Internet Computing and Services
    • /
    • v.13 no.2
    • /
    • pp.41-49
    • /
    • 2012
  • Wireless network support and extended mobile network environment with exponential growth of smart phone users allow us to utilize the network anytime or anywhere. Malicious attacks such as distributed DOS, internet worm, e-mail virus and so on through high-speed networks increase and the number of patterns is dramatically increasing accordingly by increasing network traffic due to this internet technology development. To detect the patterns in intrusion detection systems, an existing research proposed an efficient algorithm called the jumping window algorithm and analyzed approximately 2,000 patterns in Snort 2.1.0, the most famous intrusion detection system. using the algorithm. However, it is inappropriate from the number of TCAM lookups and TCAM memory efficiency to use the result proposed in the research in current environment (Snort 2.9.0) that has longer patterns and a lot of patterns because the jumping window algorithm is affected by the number of patterns and pattern length. In this paper, we simulate the number of TCAM lookups and the required TCAM size in the jumping window with approximately 8,100 patterns from Snort-2.9.0 rules, and then analyse the simulation result. While Snort 2.1.0 requires 16-byte window and 9Mb TCAM size to show the most effective performance as proposed in the previous research, in this paper we suggest 16-byte window and 4 18Mb-TCAMs which are cascaded in Snort 2.9.0 environment.

Strengthening security structure of open Blockchain platform to enhance privacy protection of DApp users (DApp 사용자의 프라이버시 보호 강화를 위한 공개형 블록체인 플랫폼 보안구조 강화방안)

  • Hwang, Seonjin;Ko, DongHyun;Bahk, Taeu;Choi, Yoon-ho
    • Journal of Internet Computing and Services
    • /
    • v.21 no.3
    • /
    • pp.1-9
    • /
    • 2020
  • Along with the growth of Blockchain, DApp (Distributed Application) is getting attention. As interest in DApp grows, market size continues to grow and many developers participate in development. Many developers are using API(Application Programming Interface) services to mediate Blockchain nodes, such as Infura, for DApp development. However, when using such a service, there is a serious risk that the API service operator can violate the user's privacy by 1 to 1 matching the account address of the Transaction executed by the DApp user with the IP address of the DApp user. It can have an adverse effect on the reliability of public Blockchains that need to provide users with a secure DApp service environment. The proposed Blockchain platform is expected to provide user privacy protection from API services and provide a reliable DApp use environment that existing Blockchain platforms did not provide. It is also expected to help to activate DApp and increase the number of DApp users, which has not been activated due to the risk of an existing privacy breach.

Analysis of Posting Preferences and Prediction of Update Probability on Blogs (블로그에서 포스팅 성향 분석과 갱신 가능성 예측)

  • Lee, Bum-Suk;Hwang, Byung-Yeon
    • Journal of KIISE:Databases
    • /
    • v.37 no.5
    • /
    • pp.258-266
    • /
    • 2010
  • In this paper, we introduce a novel method to predict next update of blogs. The number of RSS feeds registered on meta-blogs is on the order of several million. Checking for updates is very time consuming and imposes a heavy burden on network resources. Since blog search engine has limited resources, there is a fix number of blogs that it can visit on a day. Nevertheless we need to maximize chances of getting new data, and the proposed method which predicts update probability on blogs could bring better chances for it. Also this work is important to avoid distributed denial-of-service attack for the owners of blogs. Furthermore, for the internet as whole this work is important, too, because our approach could minimize traffic. In this study, we assumed that there is a specific pattern to when a blogger is actively posting, in terms of days of the week and, more specifically, hours of the day. We analyzed 15,119 blogs to determine a blogger's posting preference. This paper proposes a method to predict the update probability based on a blogger's posting history and preferred days of the week. We applied proposed method to 12,115 blogs to check the precision of our predictions. The evaluation shows that the model has a precision of 0.5 for over 93.06% of the blogs examined.

IoT Middleware for Effective Operation in Heterogeneous Things (이기종 사물들의 효과적 동작을 위한 사물인터넷 미들웨어)

  • Jeon, Soobin;Han, Youngtak;Lee, Chungshan;Seo, Dongmahn;Jung, Inbum
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.9
    • /
    • pp.517-534
    • /
    • 2017
  • This paper proposes an Internet of Things (IoT) middleware called Middleware for Cooperative Interaction of Things (MinT). MinT supports a fully distributed IoT environment in which IoT devices directly connect to peripheral devices, easily constructing a local or global network and sharing their data in an energy efficient manner. MinT provides a sensor abstract layer, a system layer and an interaction layer. These layers enable integrated sensing device operations, efficient resource management, and interconnection between peripheral IoT devices. In addition, MinT provides a high-level API, allowing easy development of IoT devices by developers. We aim to enhance the energy efficiency and performance of IoT devices through the performance improvements offered by MinT resource management and request processing. The experimental results show that the average request rate increased by 25% compared to existing middlewares, average response times decreased by 90% when resource management was used, and power consumption decreased by up to 68%. Finally, the proposed platform can reduce the latency and power consumption of IoT devices.

Data Acquisition System Applying TMO for GIS Preventive Diagnostic System (GIS 예방진단시스템을 위한 TMO 응용 데이터 수집 시스템)

  • Kim, Tae-Wan;Kim, Yun-Gwan;Jang, Cheon-Hyeon
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.481-488
    • /
    • 2009
  • GIS is used to isolate large power electrical equipment using SF6 gas. While GIS has simple structure, it has few break down, relatively high reliability. But it is hard to check up faults for reason of pressure. Faults of GIS should have a ripple effect on community and be hard to recovery. Consequently, GIS imports a preventive diagnostic system to find internal faults in advance. It is most important that reliability on the GIS preventive diagnostic system, because it estimates abnormality of system by analysis result of collected data. But, exist system which used central data management is low efficiency, and hard to guarantee timeliness and accuracy of data. To guarantee timeliness and accuracy, the GIS preventive diagnostic system needs accordingly to use a real-time middleware. So, in this paper, to improve reliability of the GIS preventive diagnostic system, we use a middleware based on TMO for guaranteeing timeliness of real-time distributed computing. And we propose an improved GIS preventive diagnostic system applying data acquisition, monitoring and control methods based on the TMO model. The presented system uses the Communication Control Unit(CCU) for distributed data handling which is supported by TMO. CCU can improve performance of the GIS preventive diagnostic system by guaranteeing timeliness of data handling process and increasing reliability of data through the TMO middleware. And, it has designed to take full charge of overload on a data acquisition task had been processed in an exist server. So, it could reduce overload of the server and apply distribution environment from now. Therefore, the proposed system can improve performance and reliability of the GIS preventive diagnostic system and contribute to stable operation of GIS.

Long-term Location Data Management for Distributed Moving Object Databases (분산 이동 객체 데이타베이스를 위한 과거 위치 정보 관리)

  • Lee, Ho;Lee, Joon-Woo;Park, Seung-Yong;Lee, Chung-Woo;Hwang, Jae-Il;Nah, Yun-Mook
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.2 s.17
    • /
    • pp.91-107
    • /
    • 2006
  • To handling the extreme situation that must manage positional information of a very large volume, at least millions of moving objects. A cluster-based sealable distributed computing system architecture, called the GALIS which consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone, was proposed. In this paper, we proposed a valid time management and time-zone shifting scheme, which are essential in realizing the long-term location data subsystem of GALIS, but missed in our previous prototype development. We explain how to manage valid time of moving objects to avoid ambiguity of location information. We also describe time-zone shifting algorithm with three variations, such as Real Time-Time Zone Shifting, Batch-Time Zone Shifting, Table Partitioned Batch-Time Zone Shifting, Through experiments related with query processing time and CPU utilization, we show the efficiency of the proposed time-zone shifting schemes.

  • PDF

An Efficient Peer Isolation Prevention Scheme in Pure P2P Network Environments (순수 P2P 네트워크 환경에서의 효율적인 피어 고립 방지 기법)

  • Kim Young-jin;Eom Young Ik
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.1033-1042
    • /
    • 2004
  • According to the arbitration mechanism among the peers in the network, the P2P networking environments can be classified into hybrid P2P networking environments and pure P2P networking environments. In hybrid P2P networking environments, each peer gets continual services from the servers that arc operational most of the time, and so, network isolation does not occur because every peer can always keep connection to the server. In pure P2P networking environments, however, every peer directly connects to another peer without server intervention, and so, network isolation can occur when the per mediating the connection is terminated. In this paper, we propose a scheme for each peer to keep connection information of other peers by maintaining IDs of its neighbor peers, to reconnect to another peers when the mediating peer fails to work. and, for efficiency. to balance the number of connections that should be maintained by each peer. With our mechanism, each pier in the network can continuously maintain connection to the network and get seamless services from other peers. Through the simulation, we ascer-tained that network isolation does not occur in the pure P2P network adopting our mechanism and that our mechanism distributes and balances the connections that are maintained by each peer. We also analyzed the total network traffic and the mean number of hops for the connections made by each peer according to the recommended number of connections that is established at system setup time.