• Title/Summary/Keyword: multiple server

Search Result 512, Processing Time 0.026 seconds

Generation and Management of Strong Passwords using an Ownership Verified Smartphone (소유권 확인된 스마트폰을 이용한 강력한 패스워드 생성 및 관리)

  • Park, Jun-Cheol
    • Smart Media Journal
    • /
    • v.9 no.1
    • /
    • pp.30-37
    • /
    • 2020
  • Enforcing additional authentication to password-based authentication, in addition to attempting to increase the security of the password itself, helps to improve the security of the password authentication scheme. For a well-known problem of using strong passwords that differ from site to site, we propose a scheme for password generation and management with an inherent supplementary authentication. Like the so-called password manager, the scheme retrieves and presents a strong site-specific password whenever requested without requiring the user to remember multiple passwords. Unlike the existing methods, however, the scheme permits the password retrieval process to proceed only through the authenticated user's ownership verified smartphone. Hence, even for sites not enforcing or supporting two-factor authentication, the logon process can benefit from the scheme's assurance of enhanced security with its two-factor equivalent authentication. The scheme can also prevent an attacker from impersonating a user or stealing secrets even when the stored information of the server for password retrieval service or the user's smartphone is leaked.

Data Replication and Migration Scheme for Load Balancing in Distributed Memory Environments (분산 인-메모리 환경에서 부하 분산을 위한 데이터 복제와 이주 기법)

  • Choi, Kitae;Yoon, Sangwon;Park, Jaeyeol;Lim, Jongtae;Bok, Kyoungsoo;Yoo, Jaesoo
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.1
    • /
    • pp.44-49
    • /
    • 2016
  • Recently, data has been growing dramatically along with the growth of social media and digital devices. A distributed memory processing system has been used to efficiently process large amounts of data. However, if a load is concentrated in a certain node in distributed environments, a node performance significantly degrades. In this paper, we propose a load balancing scheme to distribute load in a distributed memory environment. The proposed scheme replicates hot data to multiple nodes for managing a node's load and migrates the data by considering the load of the nodes when nodes are added or removed. The client reduces the number of accesses to the central server by directly accessing the data node through the metadata information of the hot data. In order to show the superiority of the proposed scheme, we compare it with the existing load balancing scheme through performance evaluation.

Multi-Attribute based on Data Management Scheme in Big Data Environment (빅 데이터 환경에서 다중 속성 기반의 데이터 관리 기법)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Cheol
    • Journal of Digital Convergence
    • /
    • v.13 no.1
    • /
    • pp.263-268
    • /
    • 2015
  • Put your information in the object-based sensors and mobile networks has been developed that correlate with ubiquitous information technology as the development of IT technology. However, a security solution is to have the data stored in the server, what minimal conditions. In this paper, we propose a data management method is applied to a hash chain of the properties of the multiple techniques to the data used by the big user and the data services to ensure safe handling large amounts of data being provided in the big data services. Improves the safety of the data tied to the hash chain for the classification to classify the attributes of the data attribute information according to the type of data used for the big data services, functions and characteristics of the proposed method. Also, the distributed processing of big data by utilizing the access control information of the hash chain to connect the data attribute information to a geographically dispersed data easily accessible techniques are proposed.

Development of Ship-Handling Simulator Web Framework (선박운항 시뮬레이터용 웹 프레임워크 개발에 관한 연구)

  • Kim, Hye-Jin;Oh, Jaeyong;Park, Sekil
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.23 no.2
    • /
    • pp.146-152
    • /
    • 2017
  • This paper proposes the ship-handling simulator framework using web technology to solve the complexity and non-scalability problems of a common simulator system. We analyze the essential functions of the existing simulator system, and selects web technologies to replace them. Based on this framework, we implemented core technologies for server and client system, and integrated a prototype of a ship-handling simulator system that can be accessed from a web browser. The prototype has verified that the simulation service can be used by multiple users at the same time without being restricted by time and place through the evaluation test, and it is hoped that it can be applied to various simulation fields in the future.

An Admission Control for End-to-end Performance Guarantee in Next Generation Networks (Next Generation Networks에서의 단대단 성능 보장형 인입제어)

  • Joung, Jin-Oo;Choi, Jeong-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8B
    • /
    • pp.1141-1149
    • /
    • 2010
  • Next Generation Networks (NGN) is defined as IP-based networks with multi-services and with multi-access networks. A variety of services and access technologies are co-existed within NGN. Therefore there are numerous transport technologies such as Differentiated Services (DiffServ), Multi-protocol Label Switching (MPLS), and the combined transport technologies. In such an environment, flows are aggregated and de-aggregated multiple times in their end-to-end paths. In this research, a method for calculating end-to-end delay bound for such a flow, provided that the information exchanged among networks regarding flow aggregates, especially the maximum burst size of a flow aggregate entering a network. We suggest an admission control mechanism that can decide whether the requested performance for a flow can be met. We further verify the suggested calculation and admission algorithm with a few realistic scenarios.

Design and Implementation of IEC 61162-4 based TLI Protocol for e-Navigation on Ship (선박의 통합정보처리를 위한 IEC 61162-4 기반 TLI 프로토콜 설계 및 구현)

  • Jang, Kil-Woong;Lee, Jang-Se;Park, Hyu-Chan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.2
    • /
    • pp.351-359
    • /
    • 2010
  • In this paper, we propose a transmission algorithm of the TLI protocol of the IEC 61162-4 standard to perform the e-Navigation on ship, and we design and implement the TLI protocol according to the proposed algorithm. The implemented protocol is a TCP/IP based protocol, and is a network protocol with the MAU and LNA components proposed in the IEC 61162-4 standard. In addition, it makes a data transmission over the network architecture based on client/server network model. In the implemented protocol, there are a communication between the MAU and the LNA in one host, and also a communication between the LNA and the LNA in each other hosts. In order to provide a variety of service in a host, every client host has a LNA and multiple MAUs. According to the standard specification and the proposed transmission algorithm, we designed and implemented the TLI protocol using object-oriented mechanism. We carried out the experiment under a simple network model similar to real ship environment, and confirmed that it successfully transmits and receives data between the hosts.

An Optimal Allocation Mechanism of Location Servers in A Linear Arrangement of Base Stations (선형배열 기지국을 위한 위치정보 서버의 최적할당 방식)

  • Lim, Kyung-Shik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.426-436
    • /
    • 2000
  • Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

  • PDF

An Efficient Dynamic Group Key Agreement for Low-Power Mobile Devices (저전력 모바일 장치에 적합한 효율적인 동적 그룹 키 동의)

  • Cho Seokhyang;Nam Junghyun;Kim Seungjoo;Won Dongho;Lee Hyejoo;Choi Jinsoo
    • The KIPS Transactions:PartC
    • /
    • v.12C no.2 s.98
    • /
    • pp.157-168
    • /
    • 2005
  • Group key agreement protocols are designed to provide a group of parties securely communicating over a public network with a session key. The mobile computing architecture is asymmetric in the sense of computational capabilities of participants. That is, the protocol participants consist of the stationary server(application servers) with sufficient computational Power and a cluster of mobile devices(clients) with limited computational resources. It is desirable to minimize the amount of computation performed by each group member in a group involving low-power mobile devices such as smart cards or personal digital assistants(PDAs). Furthermore we are required to update the group key with low computational costs when the members need to be excluded from the group or multiple new members need to be brought into an existing group. In this paper, we propose a dynamic group key protocol which offers computational efficiency to the clients with low-power mobile devices. We compare the total communicative and computational costs of our protocol with others and prove its suity against a passive adversary in the random oracle model.

Metadata Management of a SAN-Based Linux Cluster File System (SAN 기반 리눅스 클러스터 파일 시스템을 위한 메타데이터 관리)

  • Kim, Shin-Woo;Park, Sung-Eun;Lee, Yong-Kyu;Kim, Gyoung-Bae;Shin, Bum-Joo
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.367-374
    • /
    • 2001
  • Recently, LINUX cluster file systems based on the storage area network (SAN) have been developed. In those systems, without using a central file server, multiple clients sharing the whole disk storage through Fibre Channel can freely access disk storage and act as file servers. Accordingly, they can offer advantages such as availability, load balancing, and scalability. In this paper, we describe metadata management schemes designed for a new SAN-based LINUX cluster file system. First, we present a new inode structure which is better than previous ones in disk block access time. Second, a new directory structure which uses extendible hashing is described. Third, we describe a novel scheme to manage free disk blocks, which is suitable for very large file systems. Finally, we present how we handle metadata journaling. Through performance evaluation, we show that our proposed schemes have better performance than previous ones.

  • PDF

An Efficient 4K and 8K UHD Transmission Scheme on Convergence Networks with Broadcasting and LTE by using Coordinated Multi-Point Transmission System

  • Ryu, Youngsu;Park, Kyungwon;Wee, Jungwook;Kwon, Kiwon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.4092-4104
    • /
    • 2017
  • In this paper, an efficient 4K and 8K UHD(Ultra High Definition) transmission scheme is proposed on the convergence networks with broadcasting and LTE(Long Term Evolution) by using CoMP(Coordinated Multi-Point). A video data is compressed and divided into BL(Base Layer), E(Enhanced layer)1, E2 and E3 by scalable HEVC(High Efficiency Video Coding). The divided layers can be combined by the scalable HEVC such as mobile HD, full HD, 4K and 8K UHD(Ultra High Definition). The divided layers are transmitted through the convergence networks with DVB-T2(Digital Video Broadcasting-$2^{nd}$ Generation Terrestrial) broadcasting system and LTE CoMP. This scheme transmits mobile HD and full HD layers through DVB-T2 broadcasting system by using M-PLP(Multiple-physical Layer Pipes), and adaptively transmits 4K or 8K UHD layer through LTE CoMP with MMT(MPEG Media Transport) server. An adaptive transmitting and receiving scheme in the LTE CoMP system provides 4K or 8K UHD layer to a user according to the user status. The proposed scheme is verified by showing the system-level simulation results which is better BER(bit-error-rate) performance than the conventional scheme. The results show that the proposed scheme provides the stable video contents to the user especially at the cell edge.