• Title/Summary/Keyword: Logical network

Search Result 310, Processing Time 0.024 seconds

Design of an Algorithm for the Validation of SCL in Digital Substations

  • Jang, B.T.;Alidu, A.;Kim, N.D.
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.3 no.2
    • /
    • pp.89-97
    • /
    • 2017
  • The substation is a critical node in the power network where power is transformed in the power generation, transmission and distribution system. The IEC 61850 is a global standard which proposes efficient substation automation by defining interoperable communication and data modelling techniques. In order to achieve this level of interoperability and automation, the IEC 61850 (Part 6) defines System Configuration description Language (SCL). The SCL is an XML based file format for defining the abstract model of primary and secondary substation equipment, communications systems and also the relationship between them. It enables the interoperable exchange of data during substation engineering by standardizing the description of applications at different stages of the engineering process. To achieve the seamless interoperability, multi-vendor devices are required to adhere completely to the IEC 61850. This paper proposes an efficient algorithm required for verifying the interoperability of multi-vendor devices by checking the adherence of the SCL file to specifications of the standard. Our proposed SCL validation algorithm consists of schema validation and other functionalities including information model validation using UML data model, the Vendor Defined Extension model validation, the User Defined Rule validation and the IED Engineering Table (IET) consistency validation. It also integrates the standard UCAIUG (Utility Communication Architecture International Users Group) Procedure validation for quality assurance testing. Our proposed algorithm is not only flexible and efficient in terms of ensuring interoperable functionality of tested devices, it is also convenient for use by system integrators and test engineers.

Symmetry structured SPN block cipher algorithm (대칭구조 SPN 블록 암호 알고리즘)

  • Kim, Gil-Ho;Park, Chang-Soo;Cho, Gyeong-Yeon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.8
    • /
    • pp.1093-1100
    • /
    • 2008
  • Feistel and SPN are the two main structures in designing a block cipher algorithm. Unlike Feistel, an SPN has an asymmetric structure in encryption and decryption. In this paper we propose an SPN algorithm which has a symmetric structure in encryption and decryption. The whole operations in our SPN algorithm are composed of the even numbers of N rounds where the first half of them, 1 to N/2, applies function and the last half of them, (N+1)/2 to N, employs inverse function. Symmetry layer is executed to create a symmetry block in between function layer and inverse function layer. AES encryption and decryption algorithm, whose safety is already proved, are exploited for function and inverse function, respectively. In order to be secure enough against the byte or word unit-based attacks, 32bit rotation and simple logical operations are performed in symmetry layer. Due to the simplicity of the proposed encryption and decryption algorithm in hardware configuration, the proposed algorithm is believed to construct a safe and efficient cipher in Smart Card and RFID environments where electronic chips are built in.

  • PDF

Adaptive Differentiated Integrated Routing Scheme for GMPLS-based Optical Internet

  • Wei, Wei;Zeng, Qingji;Ye, Tong;Lomone, David
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.269-279
    • /
    • 2004
  • A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

A Design of Permission Management System Based on Group Key in Hadoop Distributed File System (하둡 분산 파일 시스템에서 그룹키 기반 Permission Management 시스템 설계)

  • Kim, Hyungjoo;Kang, Jungho;You, Hanna;Jun, Moonseog
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.4
    • /
    • pp.141-146
    • /
    • 2015
  • Data have been increased enormously due to the development of IT technology such as recent smart equipments, social network services and streaming services. To meet these environments the technologies that can treat mass data have received attention, and the typical one is Hadoop. Hadoop is on the basis of open source, and it has been designed to be used at general purpose computers on the basis of Linux. To initial Hadoop nearly no security was introduced, but as the number of users increased data that need security increased and there appeared new version that introduced Kerberos and Token system in 2009. But in this method there was a problem that only one secret key can be used and access permission to blocks cannot be authenticated to each user, and there were weak points that replay attack and spoofing attack were possible. Hence, to supplement these weak points and to maintain efficiency a protocol on the basis of group key, in which users are authenticated in logical group and then this is reflected to token, is proposed in this paper. The result shows that it has solved the weak points and there is no big overhead in terms of efficiency.

A Usability Evaluation on the Visualization of Information Extraction Output (정보추출결과의 시각화 표현방법에 관한 이용성 평가 연구)

  • Lee Jee-Yeon
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.39 no.2
    • /
    • pp.287-304
    • /
    • 2005
  • The goal of this research is to evaluate the usability of visually browsing the automatically extracted information. A domain-independent information extraction system was used to extract information from news type texts to populate the visually browasable knowledge base. The information extraction system automatically generated Concept-Relation-Concept triples by applying various Natural Language Processing techniques to the text portion of the news articles. To visualize the information stored in the knowledge base, we used PersoanlBrain to develop a visualization portion of the user interface. PersonalBrain is a hyperbolic information visualization system, which enables the users to link information into a network of logical associations. To understand the usability of the visually browsable knowledge base, IS test subjects were observed while they use the visual interface and also interviewed afterward. By applying a qualitative test data analysis method. a number of usability Problems and further research directions were identified.

A Study on WT-Algorithm for Effective Reduction of Association Rules (효율적인 연관규칙 감축을 위한 WT-알고리즘에 관한 연구)

  • Park, Jin-Hee;Pi, Su-Young
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.20 no.5
    • /
    • pp.61-69
    • /
    • 2015
  • We are in overload status of information not just in a flood of information due to the data pouring from various kinds of mobile devices, online and Social Network Service(SNS) every day. While there are many existing information already created, lots of new information has been created from moment to moment. Linkage analysis has the shortcoming in that it is difficult to find the information we want since the number of rules increases geometrically as the number of item increases with the method of finding out frequent item set where the frequency of item is bigger than minimum support in this information. In this regard, this thesis proposes WT-algorithm that represents the transaction data set as Boolean variable item and grants weight to each item by making algorithm with Quine-McKluskey used to simplify the logical function. The proposed algorithm can improve efficiency of data mining by reducing the unnecessary rules due to the advantage of simplification regardless of number of items.

Configuration Management for Multi-Level Security Information Technology Systems (IT 시스템의 다중 수준 보안을 위한 관리 환경 연구)

  • Kim, Jeom-Goo
    • Convergence Security Journal
    • /
    • v.10 no.4
    • /
    • pp.39-48
    • /
    • 2010
  • In a complex, secure IT system environment there will be groups of data that be segregated from one another, yet reside on the same system. Users of the system will have varying degrees of access to specific data. The Configuration Management(CM) of the information architecture, the physical architecture, user privileges and application security policies increases the complexity for operations, maintenance and security staff. This pager describes(current work to merge the capabilities of a network CM toll with those of a Computer Aided System Engineering(CASE) tool. The rigour of Systems Engineering(SE) modelling techniques can be used to deal with the complexities of multi-level information security. The SE logical and physical models of the same system are readily tailorable to document the critical components of both the information architecture and physical architecture that needs to be managed. Linking a user-friendly, physical CM tool with the extended capabilities of a CASE tool provide the basis for improved configuration management of secure IT systems.

CPM Bar Chart Technique for Construction Scheduling (CPM Bar Chart 기법을 활용한 일정계획)

  • Kim Kyung-Hwan;Kim Soo-Yoo;Kim Jae-Jun
    • Korean Journal of Construction Engineering and Management
    • /
    • v.5 no.5 s.21
    • /
    • pp.135-142
    • /
    • 2004
  • This paper proposes the CPM bar chart (CBC), a hybrid of the bar chart and the critical pad method (CPM). The CBC overcomes shortages of the fenced bar chart, while still keeping advantages. The fence with direction is applied instead of the broken fence, which triggers considerable problems to identify and apply in the fenced bar chart. In addition, the notorious task to find dummy activities is no longer required. Upon the benefits of simplicity in the bar chart and logical work sequence in the CPM network. the CBC provides a relatively easy way to create and understand a schedule, thus improving communication quality between project participants. With the advantages, the CBC can also be effectively applied to various scheduling techniques such as resource constrained scheduling, resource leveling, scheduling with activity split, delay impact analysis, etc.

Implementation of CoAP Protocol for USN Environment (CoAP 프로토콜 구현과 USN 환경 적용)

  • Min, Kyoung-Ju;Kim, Yong-Woon;Yoo, Sang-Keun;Kim, Hyoung-Jun;Jung, Heo-Kyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.5
    • /
    • pp.1189-1197
    • /
    • 2011
  • To manage sensing information such as temperature, humidity and so on efficiently, it is need to use special purpose protocol. In this reason, IETF WG proposed CoAP protocol, and it is on Internet draft. If it is possible to work on a specific protocol, sensor end-nodes and network devices will be managed efficiently. However, end-nodes have restricted resources, it is hard to applying to CoAP protocol directly. In this paper we analyse a CoAP protocol stack for USN. To verify this protocol quickly, at first we implemented CoAP protocol stack over PC environments. After the logical verification, we applied this protocol to the USN environment. To do this, we ported CoAP protocol to Cygwin environment, and proposed solutions for hardware dependencies, and it is verified through experiments.

Design of the Covered Address Generation using the Super Increasing Sequence in Wireless Networks (무선 네트워크에서의 초증가 수열을 통한 주소 은닉 기법 설계)

  • Choun, Jun-Ho;Kim, Sung-Chan;Jang, Kun-Won;Do, Kyung-Hwa;Jun, Moon-Seog
    • The KIPS Transactions:PartC
    • /
    • v.14C no.5
    • /
    • pp.411-416
    • /
    • 2007
  • The General security method of wireless network provides a confidentiality of communication contents based on the cryptographic stability against a malicious host. However, this method exposes the logical and physical addresses of both sender and receiver, so transmission volume and identification of both may be exposed although concealing that content. Covered address scheme that this paper proposes generates an address to which knapsack problem using super increasing sequence is applied, and replaces the addresses of sender and receiver with addresses from super increasing sequence. Also, proposed method changes frequently secret addresses, so a malicious user cannot watch a target system or try to attack the specific host. Proposed method also changes continuously a host address that attacker takes aim at. Accordingly, an attacker who tries to use DDoS attack cannot decide the specific target system.