• Title/Summary/Keyword: Directory System

Search Result 184, Processing Time 0.023 seconds

The design of AIN SDF Server about the application of the X.500 for supporting the SCF/SDF in AIN (AIN에서 SCF/SDF 인터페이스에 X.500 적용을 위한 AIN SDF Server 설계)

  • Park, Mun-Seong;O, Ju-Byeong;Jin, Byeong-Un;Kim, Hye-Gyu;Park, Seong-Yeol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.5
    • /
    • pp.655-666
    • /
    • 1995
  • Advanced Intelligent Network(AIN) and X.500 directory service have similarity in between. X.500 capabilities and the requirements for the Service Control Function(SCF) to Service Data Function(SDF) in AIN. As an interface, SCF can be mapping as a Directory User Agent(DUA) and SDF can be mapping as a Directory System Agent(DSA). Based on the concepts, X.500 directory can be applied to AIN. In this paper we suggest to apply the X.500 DSP to the SDF/SDF interface to perform a distribution function. Also we show that the SCF-SDF/SDF-SDF relationship can be possible under applying X.500 DAP/DSP within the set of Capability Set 1 (CS1),CS2 and CS3. Finally, based on the above contents, we introduce the designed schematic of AIN SDF Server System for a distributed processing in AIN and design the X.500 schema of Universal Personal Telecommunication(UPT) service for supporting AIN SDF Server.

  • PDF

Comparison of Directory Structures for SAN Based Very Large File Systems (SAN 환경 대용량 파일 시스템을 위한 디렉토리 구조 비교)

  • 김신우;이용규
    • The Journal of Society for e-Business Studies
    • /
    • v.9 no.1
    • /
    • pp.83-104
    • /
    • 2004
  • Recently, information systems that require storage and retrieval of huge amount of data are becoming used widely. Accordingly, research efforts have been made to develop Linux cluster file systems in the SAN environment in which clients themselves can manage metadata and access data directly. Also a semi-flat directory structure based on extendible hashing has been proposed to support fast retrieval of files[1]. In this research, we have designed and implemented the semi-flat extendible hash directory under the Linux system. In order to evaluate the practicality of the directory, we have also implemented the B+-tree based directory and experimented the performance. According to the performance comparisons, the extendible hash directory has the better performance at insert, delete, and search operations. On the other hand, the B+-tree directory is better at sorting files.

  • PDF

A Method of Data Hiding in a File System by Modifying Directory Information

  • Cho, Gyu-Sang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.8
    • /
    • pp.85-93
    • /
    • 2018
  • In this research, it is proposed that a method to hide data by modifying directory index entry information. It consists of two methods: a directory list hiding and a file contents hiding. The directory list hiding method is to avoid the list of files from appearing in the file explorer window or the command prompt window. By modifying the file names of several index entries to make them duplicated, if the duplicated files are deleted, then the only the original file is deleted, but the modified files are retained in the MFT entry intact. So, the fact that these files are hidden is not exposed. The file contents hiding is to allocate data to be hidden on an empty index record page that is not used. If many files are made in the directory, several 4KB index records are allocated. NTFS leaves the empty index records unchanged after deleting the files. By modifying the run-list of the index record with the cluster number of the file-to-hide, the contents of the file-to-hide are hidden in the index record. By applying the proposed method to the case of hiding two files, the file lists are not exposed in the file explorer and the command prompt window, and the contents of the file-to-hide are hidden in the empty index record. It is proved that the proposed method has effectiveness and validity.

Design of JNDS using JACE group communication system (JACE 그룹통신시스템을 이용한 JNDS의 설계)

  • 문남두;김진홍;안건태;박양수;이명준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.284-286
    • /
    • 2000
  • 명명(Naming) 서비스 및 디렉토리(Directory) 서비스는 네트워크에 연결된 사용자 PC, 서버, palm, 인터넷 응용서비스, 네트워크 장치, 자바 객체 등에 표준 이름을 부여하여 관련된 다양한 정보를 논리적으로 접근할 수 있도록 지원하는 서비스이다. JNDI(Java Naming and Directory Interface)는 기업 내에서 사용되는 다양한 명명 서비스와 디렉토리 서비스에 대하여 단일의 인터페이스를 사용하여 관리할 수 있도록 지원한다. 본 논문에서는 그룹통신 시스템인 JACE 시스템을 이용하여 동일한 서비스를 제공하는 분산된 명명 서비스와 디렉토리 서비스가 프로세스 그룹으로 동작될 수 있는 JNDS(Java Naming and Directory System)의 설계에 관하여 기술한다.

  • PDF

Dynamic Limited Directory Scheme for Distributed Shared Memory Systems (분산공유 메모리 시스템을 위한 동적 제한 디렉터리 기법)

  • Lee, Dong-Gwang;Gwon, Hyeok-Seong;Choe, Seong-Min;An, Byeong-Cheol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.1098-1105
    • /
    • 1999
  • The caches in distributed shared memory systems enhance the performance by reducing memory access latency and communication overhead, but they must solve the cache coherence problem. This paper proposes a new directory protocol to solve the cache coherence problem and to improve the system performance in distributed shared memory systems. To maintain the cache coherence of shared data, processors within a limited distance reduce the communication overhead by using a bit-vector like the full directory scheme. Processors over a limited distance store pointers in a directory pool. Since the bit-vector and the directory pool remove the unnecessary cache invalidations, the proposed scheme reduces the communication traffic and improves the system performance. The dynamic limited directory scheme reduces the communication traffic up to 66 percents compared with the limited directory scheme and the number of directory access up to 27 percents compared with the dynamic pointer allocation scheme.

  • PDF

A Study on the Meta Search System and the Curriculum-oriented Directory System for Youth in Science (청소년 대상 과학분야 메타검색시스템과 교과별 디렉토리시스템 연구)

  • Kwak, Seung-Jin
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.38 no.2
    • /
    • pp.189-212
    • /
    • 2004
  • The purpose of this study is to design the meta search system and the curriculum-oriented directory system for youth in science and to prove the efficiency of the systems through evaluating the usability. To attain the purpose of this study, both of the quality and quantity research method were used and questionnaire, interview. observation, thinking aloud method were used to collect a data for research. The result of this study is that the meta search system supplying convenient information use environment about the distributed information sources has higher usability than the individual search system. And the curriculum-oriented directory system supplying accessibility related with the class has higher usability than the subject-oriented directory system.

A Study on the Directory Classification Schemes of the Design Portal Site (디자인 전문 포탈 사이트의 디렉토리 구축체계에 관한 연구)

  • 임경란
    • Archives of design research
    • /
    • v.15 no.2
    • /
    • pp.223-232
    • /
    • 2002
  • As the Internet becomes widespread as a significant tool of obtaining information, there is a growing demand for a system to efficiently organize and manage information on the Internet. Accordingly, research on the directory classification structure that directly affects the efficiency of a users information search is actively investigated in every field. The study intends to suggest an efficient classification structure by comparing and analyzing the directory classification structure of current design portal sites with the theory of literature classification structure, in order to increase the efficiency of search according to the directory classification structure of design sector.

  • PDF

Development of an Intermediary Gateway Prototype System for Directory Services -Focusing on 'News, Media' Class of Major Internet Directories- (디렉토리 서비스 중개 게이트웨이 모형 구축 -주요 검색포털의 뉴스, 미디어 분야를 중심으로-)

  • Kim, Sung-Won;Kim, Tae-Soo
    • Journal of the Korean Society for information Management
    • /
    • v.23 no.1 s.59
    • /
    • pp.99-119
    • /
    • 2006
  • The most widely used information searching method in the current internet environment is the keyword-based one, which has certain limitations in terms of precision and recall. Most major internet portals provide directory-based searching as a means to complement these limitations. However, that they adopt different classification schemes brings significant inconvenience to the users, and it consequently suggests a need to develop mapping gateway to provide cross-portal, or cross-directory information searching. In this context, this study attempts to develop a prototype system of intermediary gateway for integrated search, using the directory services of three major portals, Naver, Yahoo and Empas, and test its performance.

Tourist Information Schema Design Using X.500 Directory (X.500 디렉토리를 이용한 관광 정보 스키마 설계)

  • Park, Mun-Seong;O, Ju-Byeong;Yang, Hae-Cheol;Lee, Yong-Jun;Lee, Jae-Gwang
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1027-1036
    • /
    • 1996
  • X.500 Directory is an application level protocol in the Open Systems Interconnection(OSI) 7 layer's reference model adopted by the international Standards Organization (ISO). It manages effectively needed information for the communication service, and is a service to support the functions that the user can approach conveniently. Tourist information is distribution on several locations. The access of distributed information is similar to X.500 directory service. Therefore, we design of Tourist Information System(TIS) and directory schema using X.500 directory services. To define tourist information, we also propose Directory Information Tree(DIT) of locality architecture and several new object classes, such as museum, mountain, sea, hotel, etc.

  • PDF

Design and Implementation of Android Consolidation Directory Application for Social Network Service (소셜 네트워크 서비스를 위한 안드로이드 주소록 어플리케이션의 설계 및 구현)

  • Park, Ho-Youn;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.2
    • /
    • pp.273-280
    • /
    • 2011
  • Mobile directory has offered just the same function until now, SNS service also has offered for our to meet other people and liaise between person and person. But it has a important thing which can not offer direct to liaise between person and person. In this paper, we has developed the "SNS Consolidation Directory" for solve the problem which needs to modern people with. A main purpose of SNS Consolidation Directory will develop the smart directory which offer to improve SNS service and personal relation supervision. This system function has initial search, anniversary, birthday alarm, using the UI contact frequency, SNS service and directory exchange.