• Title/Summary/Keyword: 분산 자원

Search Result 1,472, Processing Time 0.027 seconds

A Session Key Establishment Scheme in Mobile Ad-Hoc Networks (이동 애드혹 네트워크에서 세션 키 설정 방안)

  • 왕기철;정병호;조기환
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.4
    • /
    • pp.353-362
    • /
    • 2004
  • Mobile Ad-Hoc network tends to expose scarce computing resources and various security threats because all traffics are carried in air along with no central management authority. To provide secure communication and save communication overhead, a scheme is inevitable to serurely establish session keys. However, most of key establishment methods for Ad-Hoc network focus on the distribution of a group key to all hosts and/or the efficient public key management. In this paper, a secure and efficient scheme is proposed to establish a session key between two Ad-Hoc nodes. The proposed scheme makes use of the secret sharing mechanism and the Diffie-Hellman key exchange method. For secure intra-cluster communication, each member node establishes session keys with its clusterhead, after mutual authentication using the secret shares. For inter-cluster communication, each node establishes session keys with its correspondent node using the public key and Diffie-Hellman key exchange method. The simulation results prove that the proposed scheme is more secure and efficient than that of the Clusterhead Authentication Based Method(1).

A Multiple-Way Partitioning of a Network When the Cost of the Net Which Connects K Subsets is K(K-1)/2 (K개의 집합에 연결이 있는 네트에 K(K-1)/2의 비용을 주는 경우의 네트워크의 다중 분할)

  • Jang, Woo-Choul;Kim, In-Ki;Kim, Kyung-Sik
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.11
    • /
    • pp.20-26
    • /
    • 1994
  • In this paper, we propose an algorithm on partitioning a network into several subsets where the cost of a net which connects nodes in k subsets is given as k(k-1)/2 indicating the typical pattern of complete graphs. This problem is one of generalizations for multiple-way partitioning proposed by Sanchis. $^{[5]}$ Its solution can be applied to resource allocation problem in distributed systems. The proposed algorithm expanded the algorithm of Fiduccia and Mattheyses$^{[3]}$ to handle the multiple-way partitioning simultaneously. It has time and space complexity linear to the size of the network. To evaluate the performance of the proposed algorithm, we implemented also a traditional cluster growth method which groups connected nodes for nets, and compared experimental results with those of the proposed algorithm. The proposed algorithm shows some enhancement made.

  • PDF

Data Resource Management under Distributed Computing Environment (분산 컴퓨팅 환경하에서의 데이타 자원 관리)

  • 조희경;안중호
    • Proceedings of the Korea Database Society Conference
    • /
    • 1994.09a
    • /
    • pp.105-129
    • /
    • 1994
  • The information system of corporations are facing a new environment expressed by miniaturization, decentralization and Open System. It is therefore of utmost importance for corporations to adapt flexibly th such new environment by providing for corresponding changes to their existing information systems. The objectives of this study are to identify this new environment faced by today′s information system and develop effective methods for data resource management under this new environment. In this study, it is assumed that the new environment faced by information systems can be specified as Distributed Computing Environment, and in order to achieve such system, presents Client/server architecture as its representative computing structure, This study defines Client/server architecture as a computing architecture which specialize the fuctionality of the client system and the server system in order to have an application distribute and perform cooperative processing at the best platform. Furthermore, from among the five structures utilized in Client/server architecture for distribution and cooperative processing of application between server and client this study presents two different data management methods under the Client/server environment; one is "Remote Data Management Method" which uses file server or database server and. the other is "Distributed Data Management Method" using distributed database management system. The result of this study leads to the conclusion that in the client/server environment although distributed application is assumed, the data could become centralized (in the case of file server or database server) or decentralized (in the case of distributed database system) and the data management method through a distributed database system where complete responsibility and powers with respect to control of data used by the user are given not only is it more adaptable to modern flexible corporate environment, but in terms of system operation, it presents a more efficient data management alternative compared to existing data management methods in terms of cutting costs.

  • PDF

A Dynamic Data Grid Replication Strategy Based on Internet Architecture (인터넷 구조 기반의 동적 데이터 그리드 복제 정책)

  • Kim, Jun-Sang;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.1-6
    • /
    • 2008
  • Data grid shares distributed large data via wide-band network. Such grid environment consumes much time for large data transmission. Because it is implemented on internet as physical network. Many replication strategies were proposed for solving this problem, but they are not optimal in real Data grid environments. Because they were proposed that based on logical topology without consideration of real internet architecture. Grid data access time is largely influenced by internet architecture as physical network of Data grid. In this paper, we propose a new data replication strategy RSIA(Replication Strategy based on Internet Architecture) based on internet architecture. The RSIA places replicas considering structural hierarchy in each element of internet, and avoid the performance bottlenecks to reduce system performance degradation when a data transfer. Through simulation, we show that the proposed RSIA data replication strategy improves the performance of Data Grid environment compared with previous strategies.

A Study on the Development of Collaborative Model for Archiving an Electronic Book (전자책 아카이빙을 위한 협력모형 개발에 관한 연구)

  • Cho, Hyun-Yang;Jang, Bo-Sung;Yoo, Bo-Hyeon
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.21 no.4
    • /
    • pp.161-178
    • /
    • 2010
  • The purpose of this study is to develop a collaborative model for the archiving and preservation of an electronic book(e-book). In this study the way of the archiving and preservation for the e-book to deal with the technology evolution was suggested. Accordingly, the survey was made for obtaining the present status of the production and distribution of the domestic Online e-book. It is the same as the operation status of the archiving and preservation for the Online e-book worldwide. A collaborative model for accessible to preserved data, regardless of time period, was proposed for archiving the e-book, based on the OAIS reference model. There are three different models, suggested for domestic; the safe place model by law, the individual preservation/Peer-to-Peer model, and the preservation center model for e-book archiving. Among them, the safe place model by law was proposed for the optimum model of archiving an e-book at present.

Redundancy operation method for a distributed public address system (분산형 전관방송 시스템의 이중화 운영 방법)

  • Ryu, Taeha;Kim, Seungcheon
    • Journal of the Korea Convergence Society
    • /
    • v.11 no.8
    • /
    • pp.47-53
    • /
    • 2020
  • In the case of a failure due to equipment deterioration in the public address system or a worker's mistake during construction, broadcasting becomes impossible. In this situation, we have designed a more advanced management broadcast system that can broadcast. The broadcasting service is operated using main broadcasting device, and local broadcasting device operates separately only in the local area. If the main broadcasting device becomes inoperable, the procedure for transferring the control activates the device with the local broadcasting devices based on data backed up by the main controller. This paper proposes an improved method of the conventional emergency broadcasting device duplication method. The existing method could not use the standby equipment in the normal state, but in the proposed method, the standby equipment can be used as local broadcasting equipment in usually. This method enables stable system operation while minimizing resource waste due to redundant configuration of expensive devices.

A Study on a 4-Stage Phased Defense Method to Defend Cloud Computing Service Intrusion (Cloud Computing 서비스 침해방어를 위한 단계별 4-Stage 방어기법에 관한 연구)

  • Seo, Woo-Seok;Park, Dea-Woo;Jun, Moon-Seog
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.5
    • /
    • pp.1041-1051
    • /
    • 2012
  • Attack on Cloud Computing, an intensive service solution using network infrastructure recently released, generates service breakdown or intrusive incidents incapacitating developmental platforms, web-based software, or resource services. Therefore, it is needed to conduct research on security for the operational information of three kinds of services (3S': laaS, PaaS, SaaS) supported by the Cloud Computing system and also generated data from the illegal attack on service blocking. This paper aims to build a system providing optimal services as a 4-stage defensive method through the test on the attack and defense of Cloud Computing services. It is a defense policy that conducts 4-stage, orderly and phased access control as follows: controlling the initial access to the network, controlling virtualization services, classifying services for support, and selecting multiple routes. By dispersing the attacks and also monitoring and analyzing to control the access by stage, this study performs defense policy realization and analysis and tests defenses by the types of attack. The research findings will be provided as practical foundational data to realize Cloud Computing service-based defense policy.

A Security Protocol for Swarming Technique in Peer-to-Peer Networks (피어 투 피어 네트워크에서 스워밍 기법을 위한 보안 프로토콜)

  • Lee, Kwan-Seob;Lee, Kwan-Sik;Lee, Jang-Ho;Han, Seung-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.9
    • /
    • pp.1955-1964
    • /
    • 2011
  • With fast deployment of high-speed networks and various online services, the demand for massive content distribution is also growing fast. An approach that is increasingly visible in communication research community and in industry domain is peer-to-peer (P2P) networks. The P2P swarming technique enables a content distribution system to achieve higher throughput, avoid server or network overload, and be more resilient to failure and traffic fluctuation. Moreover, as a P2P-based architecture pushed the computing and bandwidth cost toward the network edge, it allows scalability to support a large number of subscribers on a global scale, while imposing little demand for equipment on the content providers. However, the P2P swarming burdens message exchange overheads on the system. In this paper, we propose a new protocol which provides confidentiality, authentication, integrity, and access control to P2P swarming. We implemented a prototype of our protocol on Android smart phone platform. We believe our approach can be straightforwardly adapted to existing commercial P2P content distribution systems with modest modifications to current implementations.

Implement of Call blocking Probabilities in Mobile Communication Networks (이동통신 네트워크에서 호 블록킹 확률의 개선 방안)

  • Park, Sang-Hyun;Oh, Youn-Chil;Lee, Young-Seok;Yang, Hae-Kwon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.1
    • /
    • pp.67-74
    • /
    • 2009
  • This paper presents a method of improving the service availability by distributing the traffic of voice/data calls over the multi-layer cells in a mobile communication network. The traffic model is described and the call handling performance is analyzed. In our method, a fast moving call is moved to and serviced in the upper layer cell. A call is also moved upward when an overflow occurs. But unlike other methods, the call that is moved upward in the overflow case is the one which has the longest sojourn time in the cell. Moreover, when the call that was moved upward due to overflow condition stays longer than a certain period of time in the upper layer cell, the system moves the call back to the lower layer in order to save the more expensive resources of the upper layer cell. Call handling performance of this method evaluated from M/M/C/K models shows clear improvement with respect to call blocking probability and forced termination probability.

A Framework for Dynamic Growing of Web Service Applications based on ESB and Agent (웹 서비스 애플리케이션의 동적 성장을 위한 ESB와 에이전트 기반 프레임워크)

  • Lee, Chang-Ho;Kim, Jin-Han;Lee, Jae-Jeong;Lee, Byung-Jeong
    • The KIPS Transactions:PartA
    • /
    • v.14A no.7
    • /
    • pp.409-420
    • /
    • 2007
  • Software adaptation may be required to interact between heterogeneous platforms and to react to rapid change of environment in ubiquitous computing. Web service provides a way to use heterogeneous and distributed services or resources to utilize and organize them. But it is not easy to retrieve appropriate services when we search services because web service lacks of semantic information. Semantic web service provides additional information of services, but it does not support a method to match them in various ways. We can adapt and extend web applications by using web service, but a method for management and administration is still needed. Therefore in this paper, we propose a framework for dynamic growing of web service applications based on ESB(Enterprise Service Bus) and agent and provide a prototype to show its usefulness.