• 제목/요약/키워드: Shared Information

검색결과 2,119건 처리시간 0.025초

멀티캐스트 환경에서 향상된 처리율을 갖는 공유 다중 버퍼 ATM스위치의 VLSI 설계 (VLSI design of a shared multibuffer ATM Switch for throughput enhancement in multicast environments)

  • Lee, Jong-Ick;Lee, Moon-Key
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
    • /
    • pp.383-386
    • /
    • 2001
  • This paper presents a novel multicast architecture for shared multibuffer ATM switch, which is tailored for throughput enhancement in multicast environments. The address queues for multicast cells are separated from those for unicast cells to arbitrate multicast cells independently from unicast cells. Three read cycles are carried out during each cell slot and multicast cells have chances to be read from shared buffer memory(SBM) in the third read cycle provided that the shared memory is not accessed to read a unicast cell. In this architecture, maximum two cells are queued at each fabric output port per time slot and output mask choose only one cell. Extensive simulations are carried out and it shows that the proposed architecture has enhanced throughput comparing with other multicast schemes in shared multibuffer switch architecture.

  • PDF

도심 캠퍼스 공유공간의 공간 구조 변화에 대한 연구 - 그리드락의 반대 개념으로서의 공유 캠퍼스로의 변화에 대하여 - (A Study on the Change of Spatial Structures of Shared Space at Urban Campuses - The opposite concept of Gridlock upon the change to shared campuses -)

  • 강은기;백진
    • 대한건축학회논문집:계획계
    • /
    • 제34권11호
    • /
    • pp.145-156
    • /
    • 2018
  • Urban campus, one of the main urban facilities, is the representative place that is struggling with 'gridlock'. Due to privatization of space among different departments and space shortages, gridlock has been occurring as a result. The urban campus trying to solve this problem by changing the quality of space, especially the structure of the shared space, which is expected to be the solution to the grid lock problem. The main purpose of this study is to investigate the structural change in the university's shared space based on paradigm transition. The theoretical consideration is to analyze the spatial characteristics of university shared space that appear at different stages through a new perspective that compares the gridlock phenomenon and the shared paradigm. The framework of the analysis of the shared space, which has recently been restructured, is classified into the spatial characteristics of collaborative space, the creative space, and the common/complex space. In addition, these spatial characteristics are again analyzed through the division of legislative facility classification, management governance subject, area, building location and layout, exposure to the outside as well as the analysis of student and staff entry and exit, sharing structure of site and space, and the classification of program characteristics. The results are as follows: The restructured space is systemized so that the management governance of each space would be connected to each other to share information and space. Furthermore, the spatial boundary between colleges or between campus spaces are not only physically, but categorically clear. The restructured space has semi (or in-between)-spatial characteristics such as the intersection in inside and outside of the pedestrian's circulation and the mixture of programs. This study could serve as principal references in presenting the systematic analysis of directions of the shared spatial structure for the urban campus where new educational space is required due to the changes in the university system.

Efficient key generation leveraging wireless channel reciprocity and discrete cosine transform

  • Zhan, Furui;Yao, Nianmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권5호
    • /
    • pp.2701-2722
    • /
    • 2017
  • Key generation is essential for protecting wireless networks. Based on wireless channel reciprocity, transceivers can generate shared secret keys by measuring their communicating channels. However, due to non-simultaneous measurements, asymmetric noises and other interferences, channel measurements collected by different transceivers are highly correlated but not identical and thus might have some discrepancies. Further, these discrepancies might lead to mismatches of bit sequences after quantization. The referred mismatches significantly affect the efficiency of key generation. In this paper, an efficient key generation scheme leveraging wireless channel reciprocity is proposed. To reduce the bit mismatch rate and enhance the efficiency of key generation, the involved transceivers separately apply discrete cosine transform (DCT) and inverse discrete cosine transform (IDCT) to pre-process their measurements. Then, the outputs of IDCT are quantified and encoded to establish the bit sequence. With the implementations of information reconciliation and privacy amplification, the shared secret key can be generated. Several experiments in real environments are conducted to evaluate the proposed scheme. During each experiment, the shared key is established from the received signal strength (RSS) of heterogeneous devices. The results of experiments demonstrate that the proposed scheme can efficiently generate shared secret keys between transceivers.

Trade-off between Resource Efficiency and Fast Protection for Shared Mesh Protection

  • Cho, Choong-hee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권7호
    • /
    • pp.2568-2588
    • /
    • 2021
  • Shared mesh protection (SMP) protects traffic against failures occurring in a working path, as with linear protection, and allows resource sharing of protection paths with different endpoints. The SMP mechanism coordinates multiple protection paths that require shared resources when failures occur on multiple working paths. When multiple failures occur in SMP networks sharing limited resources, activation can fail because some of the resources in the protection path are already in use. In this case, a node confirming that a resource is not available has the option to wait until the resource is available or to withdraw activation of the protection path. In this study, we recognize that the protection switching time and the number of protected services can be different, depending on which option is used for SMP networks. Moreover, we propose a detailed design for the implementation of SMP by considering options and algorithms that are commonly needed for network nodes. A simulation shows the performance of an SMP system implemented with the proposed design and utilizing two options. The results demonstrate that resource utilization can be increased or protection switching time can be shortened depending on the option selected by the network administrator.

Dualband Shared-Aperture Microstrip Antenna for Reflectarray Feeding Structure of LEO Satellite System

  • Bagas Satriyotomo;Ji-Woong Hyun;Seongmin Pyo
    • 전기전자학회논문지
    • /
    • 제28권1호
    • /
    • pp.20-25
    • /
    • 2024
  • This paper presents a new dualband shared-aperture microstrip antenna to operate in the S-Band of 2 GHz and X-Band of 8 GHz, for a Low Earth Orbit satellite antenna system. The proposed antenna incorporates two types of patches those are a rectangular loop-shaped for the S-Band and a square patch for the X-Band. Each patch are optimized for its respective operating band with minimal interference. The proposed antenna achieves a bandwidth of 16 MHz in the S-Band and 572 MHz in the X-Band. The highest gain is measured 7.14 dBi at 1.99 GHz and 7.95 dBi at 7.88 GHz. The proposed antenna exhibits half power beamwidths of 85 degree and 80 degree at 1.99 GHz and 7.88 GHz, respectively. The proposed dualband shared-aperture microstrip antenna may be a good candidate for as a feeding system of a dualband reflectarray antenna With its unidirectional radiation pattern from excellent agreement between simulation and measurement results.

Blockchain Technology and the Creation of Trust : Focusing on Transparency, Immutability and Availability

  • Kim, Kee-Joo;Lee, Myung-Suk
    • 한국컴퓨터정보학회논문지
    • /
    • 제27권3호
    • /
    • pp.79-90
    • /
    • 2022
  • '신뢰'란 사람이나 사물에 대해 '믿고 의지하는 것'이면서, 동시에 특정 공동체나 사회의 기반이자 존속의 필수 조건이다. 블록체인 기술이 어떻게 신뢰를 만드는지는, 관련 정보를 참여자 모두가 공유하는 기술이라는 점에서 그 답을 찾을 수 있다. 공유의 기술인 블록체인은 그 기술 자체로 투명성, 불변성, 가용성이라는 세 가지 특징을 가진다. 공유하기 때문에 투명하고, 공유하기 때문에 불변, 곧 수정하거나 삭제하기 어려우며, 공유하기 때문에 일부 장애가 발생해도 전체 시스템은 정상 운영된다. 이 블록체인 기술을 기반으로 만들어지는 신뢰가 가진 의의는 다음과 같이 세 가지 측면에서 정리할 수 있다. 첫째는 신뢰의 문제를 기술과 연결해 이해하는 것, 둘째는 정보와 신뢰의 관계를 이해하고 본격적으로 주목하기 시작한다는 것, 셋째는 확대된 정보처리 능력을 토대로 중앙의 매개 없이 대규모의 구체적인 상호관계를 맺을 수 있게 되었다는 점이다.

Dynamic data Path Prediction in Network Virtual Environment

  • Jeoung, You-Sun;Ra, Sang-Dong
    • Journal of information and communication convergence engineering
    • /
    • 제5권2호
    • /
    • pp.83-87
    • /
    • 2007
  • This research studies real time interaction and dynamic data shared through 3D scenes in virtual network environments. In a distributed virtual environment of client-server structure, consistency is maintained by the static information exchange; as jerks occur by packet delay when updating messages of dynamic data exchanges are broadcasted disorderly, the network bottleneck is reduced by predicting the movement path by using the Dead-reckoning algorithm. In Dead-reckoning path prediction, the error between the estimated and the actual static values which is over the threshold based on the shared object location requires interpolation and multicasting of the previous location by the ESPDU of DIS. The shared dynamic data of the 3D virtual environment is implementation using the VRML.

콘텐츠 적응화 시스템에 SOP(Shared Object Page)를 도입한 개선된 캐싱 기법 (An Enhancing Caching Technique by the SOP(Shared Object Page) for Content Adaptation Systems)

  • 장서영;정호영;강수용;차재혁
    • 디지털콘텐츠학회 논문지
    • /
    • 제8권1호
    • /
    • pp.41-50
    • /
    • 2007
  • 오늘날 우리는 인터넷에 연결된 PC뿐만 아니라, 이동형 기기인 휴대전화, 무선 인터넷을 이용하는 PDA, 노트북, 그리고 D-TV 등을 통해서도 웹서버에 접근하여 콘텐츠 형태의 정보를 얻고 있다. 본 연구에서는 이러한 환경을 지원하기 위하여 각각의 적응화된 컨텐츠를 저장하는 것을 기반으로 하며, 이를 다양한 기기를 지닌 사용자에게 활용하기 위해 페이지 정보를 지니는 메타 데이터를 적용하는 웹 캐싱 기법(SOP)를 제안한다.

  • PDF

분담목록용 형식으로서의 KORMARC 형식에 관한 연구 (A Study on the KORMARC Format for Shared Cataloging System)

  • 최석두;이상헌
    • 정보관리학회지
    • /
    • 제8권1호
    • /
    • pp.16-32
    • /
    • 1991
  • 분담목록 및 분담목록시스템의 개념을 일별하고, KORMARC 형식을 분담목록용 형식으로 사용했을 때, 제어번호, 국립중앙도서관 복본 및 기타 정보표시, 로컬정보, 서지데이터의 갱신정보, 목록전거 MARC의 구분, 사용코드의 표시, 관제 관칭의 처리, 딜리미터코드, 보고서처리 등의 부분에서 어떻게 보완하는 것이 바람직할 것인가에 대하여 논하였다.

  • PDF

Shared Memory Model over a Switchless PCIe NTB Interconnect Network

  • Lim, Seung-Ho;Cha, Kwangho
    • Journal of Information Processing Systems
    • /
    • 제18권1호
    • /
    • pp.159-172
    • /
    • 2022
  • The role of the interconnect network, which connects computing nodes to each other, is important in high-performance computing (HPC) systems. In recent years, the peripheral component interconnect express (PCIe) has become a promising interface as an interconnection network for high-performance and cost-effective HPC systems having the features of non-transparent bridge (NTB) technologies. OpenSHMEM is a programming model for distributed shared memory that supports a partitioned global address space (PGAS). Currently, little work has been done to develop the OpenSHMEM library for PCIe-interconnected HPC systems. This paper introduces a prototype implementation of the OpenSHMEM library through a switchless interconnect network using PCIe NTB to provide a PGAS programming model. In particular, multi-interrupt, multi-thread-based data transfer over the OpenSHMEM shared memory model is applied at the implementation level to reduce the latency and increase the throughput of the switchless ring network system. The implemented OpenSHMEM programming model over the PCIe NTB switchless interconnection network provides a feasible, cost-effective HPC system with a PGAS programming model.