• Title/Summary/Keyword: Distributed Server

Search Result 847, Processing Time 0.025 seconds

Research on a New Approach to Enhance IoT Security Using Blockchain Technology (블록체인 기술을 이용하여 IoT 보안 강화를 위한 새로운 접근방법 연구)

  • Hong, Sunghyuck
    • Journal of Digital Convergence
    • /
    • v.17 no.12
    • /
    • pp.235-241
    • /
    • 2019
  • The structure of the IoT can be divided into devices, gateways, and servers. First, the gateway collects data from the device, and the gateway sends data to the server through HTTP protocol, Websocket protocol, and MQTT protocol. The processing server then processes, analyzes, and transforms the data, and the database makes it easy to store and use this data. These IoT services are basically centralized structures with servers, so attacks on the entire platform are concentrated only on the central server, which makes hacking more successful than distributed structures. One way to solve this problem is to develop IoT that combines blockchain. Therefore, the proposed research suggests that the blockchain is a distributed structure, in which blocks containing small data are connected in a chain form, so that each node agrees and verifies the data with each other, thereby increasing reliability and lowering the probability of data forgery.

Efficient Load Balancing Scheme using Resource Information in Web Server System (웹 서버 시스템에서의 자원 정보를 이용한 효율적인 부하분산 기법)

  • Chang Tae-Mu;Myung Won-Shig;Han Jun-Tak
    • The KIPS Transactions:PartA
    • /
    • v.12A no.2 s.92
    • /
    • pp.151-160
    • /
    • 2005
  • The exponential growth of Web users requires the web serves with high expandability and reliability. It leads to the excessive transmission traffic and system overload problems. To solve these problems, cluster systems are widely studied. In conventional cluster systems, when the request size is large owing to such types as multimedia and CGI, the particular server load and response time tend to increase even if the overall loads are distributed evenly. In this paper, a cluster system is proposed where each Web server in the system has different contents and loads are distributed efficiently using the Web server resource information such as CPU, memory and disk utilization. Web servers having different contents are mutually connected and managed with a network file system to maintain information consistency required to support resource information updates, deletions, and additions. Load unbalance among contents group owing to distribution of contents can be alleviated by reassignment of Web servers. Using a simulation method, we showed that our method shows up to $50\%$ about average throughput and processing time improvement comparing to systems using each LC method and RR method.

Design of Protocol for Collaborative Multimedia Applications (협동적 멀티미디어 응용을 위한 프로토콜의 설계)

  • Hwang, Een-Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.1
    • /
    • pp.25-35
    • /
    • 2002
  • Many multimedia presentation applications involve retrieval of objects from more than one collaborating server. Presentations of objects from different collaborating servers might be interdependent. This implies that objects should be retrieved from remote servers and delivered continuously according to given time constraints. Such applications need an estimate of the avaliable network resources to each of the collaborating servers and local system resources in order to identify a schedule for retrieving the objects composing the presentation. A collaborating server can suggest modifications of the retrieval schedule depending on its load. these modifications can potentially affect the retrieval schedule for other collaborating applications. Hence, a sequence of negotiations has to be carried out with the collaborating servers in order to commit for a retrieval schedule of the objects composing the presentation. In this paper, we propose an application sub-layer protocol, RLCP(Resource Lock Commit Protocol), for handling the negotiation and commitment of the resources required for a collaborative multimedia presentation and apply it to distributed video presentation application.

Design of a effective Authorization Mechanism based on Kerberos (커버로스 기반의 효율적인 허가 메커니즘 설계)

  • Kim, Eun-Hwan;Jun, Moon-Seog
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.287-294
    • /
    • 2003
  • Authentication and authorization are essential functions for the security of distributed network environment. Authorization is determining and to decide whether a user or process is permitted to perform a particular operation. In this paper, we design an authorization mechanism to make a system more effective with Kerberos for authentication mechanism. In the authorization mechanism, Kerberos server operates proxy privilege server. Proxy privilege server manages and permits right of users, servers and services with using proposed algorithm. Also, privilege attribute certificate issued by proxy privilege server is used in delegation. We designed secure kerberos with proposed functions for effective authorization at the same time authentication of Kerberos mechanism.

Dynamic Load Balancing Mechanism for MMORPG (MMORPG를 위한 동적 부하 균등화 기법)

  • Lim, Chae-Gyun;Rho, Kyung-Taeg
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.5
    • /
    • pp.199-203
    • /
    • 2009
  • Recently, Massively Multiplayer Online Role-Playing Games (MMORPGs) has become increasingly popular, which continue to increase the number of game player. The volume of the game world also has been extended on a large scale. Existing Map-based distributed server architecture divides the game world into the rectangular regions and allocates the registered player in each region to the server responsible for that region. Players tend to concentrate in certain regions of the game world, which makes some special server overloaded. This paper proposes to change the boundary between servers to solve such a unbalanced load problem. Our proposed method first finds the overloaded server and then searches for its neighboring lightest loaded server to share with the overload evenly. Finally we implemented performance evaluation to demonstrate the efficiency of this approach.

  • PDF

Load Balance System for the SFC Based DLP solution (SFC 기반 DLP 솔루션을 위한 부하분산 시스템)

  • Song, Wang-Eun;Jung, Sou-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.4
    • /
    • pp.451-453
    • /
    • 2016
  • In this paper, we propose a Load Balance System for SFC based on DLP solution. SFC based on DLP solution does not distribute to the user data and each DLP server manages all traffic generated by the user device. When using existing algorithms such as the Load Balance Round Robin, Least Connection does not consider the resource usage of DLP server so traffic is not efficiently distributed due to different user traffic usage. It causes system failure and overload of the DLP server. Therefore, we propose the architecture of a Load Balance system for SFC based on DLP solution to perform the Load Balance based on the resource usage of DLP server through a LBM server in this paper.

A Key Management System for Cloud Services Based on Proxy Server Using Self-Creating Algorithm (셀프 생성 알고리즘을 사용한 프락시 서버를 기반으로 한 클라우드 서비스를 위한 키 관리 시스템)

  • Sung, Soonhwa;Youn, Cheong
    • Journal of KIISE
    • /
    • v.43 no.9
    • /
    • pp.1052-1059
    • /
    • 2016
  • A key role in cloud computing systems that is becoming an issue is implementing a database on untrusted cloud servers requiring the complexity of key management. This study proposes a key management system using Self Proxy Servers to minimize key executions and improve the performance of cloud services by generating Self-Creating Algorithms where the data owner is not directly concerned with related keys when a user sends an encrypted database a query. The Self Proxy Server supports active and autonomous key managements as a distributed server if any trouble should arise from a cloud key server and for an efficient cloud key management. Therefore, the key management system provides secure cloud services by supporting confidentiality of a cloud server database.

The Dynamic Group Authentication for P2P based Mobile Commerce (P2P 기반의 모바일 상거래를 위한 동적 그룹 인증)

  • Yun, Sunghyun
    • Journal of Digital Convergence
    • /
    • v.12 no.2
    • /
    • pp.335-341
    • /
    • 2014
  • To play the networked video contents in a client's mobile device in real time, the contents should be delivered to it by the contents server with streaming technology. Generally, in a server-client based commerce model, the server is in charge of both the authentication of the paid customer and distribution of the contents. The drawback of it is that if the customers' requests go on growing rapidly, the service quality would be degraded results from the problems of overloaded server or restricted network bandwidth. On the contrary, in P2P based networks, more and more the demand for service increasing, the service quality is upgraded since a customer can act as a server. But, in the P2P based network, there are too many servers to manage, it's possible to distribute illegal contents because the P2P protocol cannot control distributed servers. Thus, it's not suitable for commercial purposes. In this paper, the dymanic group authentication scheme is proposed which is suited to P2P based applications. The proposed scheme consists of group based key generation, key update, signature generation and verification protocols. It can control the seeder's state whether the seeder is joining or leaving the network, and it can be applied to hybrid P2P based commerce model where sales transactions are covered by the index server and the contents are distributed by the P2P protocol.

Architecture of SIP-based Effective Hybrid-type Multimedia Conference (SIP 기반의 효율적인 혼성형 멀티미디어 컨퍼런스 구조)

  • Lee, Ki-Soo;Jang, Choon-Seo;Jo, Hyun-Gyu
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.3
    • /
    • pp.17-24
    • /
    • 2007
  • SIP-based tightly coupled conference, which has a centrally located conference server for controlling and management, can be classified several models according to location of focus and mixer. These are centralized server model, endpoint server model, media server component model and distributed mixing model. However each model has its strength and weakness. In this paper, we propose and implement a SIP-based effective hybrid-type conference model which decreases amount of SIP signaling messages, lowers load of server media mixer, and can be easily expandable to large scale conference. In this model, when the number of participants exceeds a pre-defined limit, the conference server selects some participants which posses specific functions and let them share functions of notifications of conference state event package and media mixing. When each participant subscribes conference state event package to the server, it can indicates its possession of such functions by a specific header message. The server stores the indication to the conference information database, and later uses it to select participants for load sharing. The performance of our proposed model is evaluated by experiments.

Design of Thin-Client Framework for Application Sharing & Optimization of Data Access (애플리케이션 공유 및 데이터 접근 최적화를 위한 씬-클라이언트 프레임워크 설계)

  • Song, Min-Gyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.5
    • /
    • pp.19-32
    • /
    • 2009
  • In this paper, we design thin-client framework capable of application sharing & data access on the Internet, and apply related skills, such as X windows system, pseudo server, CODA file system, MPI(Message Passing Interface). We suggest a framework for the thin client to access data produced by working on a server optimally as well as to run server side application, even in the case of network down. Additionally, it needed to reflect all local computing changes to remote server when network is restored. To design thin client framework with these characteristics, in this paper, we apply distributed pseudo server and CODA file system to our framework, also utilize MPI for the purpose of more efficient computing & management. It allows for implementation of network independent computing environment of thin client, also provide scalable application service to numerous user through the elimination of bottleneck on caused by server overload. In this paper, we discuss the implementing method of thin client framework in detail.