• Title/Summary/Keyword: Dynamic access time

Search Result 281, Processing Time 0.025 seconds

Dynamic Bandwidth Allocation Algorithm with Two-Phase Cycle for Ethernet PON (EPON에서의 Two-Phase Cycle 동적 대역 할당 알고리즘)

  • Yoon, Won-Jin;Lee, Hye-Kyung;Chung, Min-Young;Lee, Tae-Jin;Choo, Hyun-Seung
    • The KIPS Transactions:PartC
    • /
    • v.14C no.4
    • /
    • pp.349-358
    • /
    • 2007
  • Ethernet Passive Optical Network(EPON), which is one of PON technologies for realizing FTTx(Fiber-To-The-Curb/Home/Office), can cost-effectively construct optical access networks. In addition, EPON can provide high transmission rate up to 10Gbps and it is compatible with existing customer devices equipped with Ethernet card. To effectively control frame transmission from ONUs to OLT EPON can use Multi-Point Control Protocol(MPCP) with additional control functions in addition to Media Access Control(MAC) protocol function. For EPON, many researches on intra- and inter-ONU scheduling algorithms have been performed. Among the inter-ONU scheduling algorithms, IPS(Interleaved Polling with Stop) based on polling scheme is efficient because OLT assigns available time portion to each ONU given the request information from all ONUs. Since the IPS needs an idle time period on uplink between two consecutive frame transmission periods, it wastes time without frame transmissions. In this paper, we propose a dynamic bandwidth allocation algorithm to increase the channel utilization on uplink and evaluate its performance using simulations. The simulation results show that the proposed Two-phase Cycle Danamic Bandwidth Allocation(TCDBA) algorithm improves the throughput about 15%, compared with the IPS and Fast Gate Dynamic Bandwidth Allocation(FGDBA). Also, the average transmission time of the proposed algorithm is lower than those of other schemes.

Distributed arbitration scheme for on-chip CDMA bus with dynamic codeword assignment

  • Nikolic, Tatjana R.;Nikolic, Goran S.;Djordjevic, Goran Lj.
    • ETRI Journal
    • /
    • v.43 no.3
    • /
    • pp.471-482
    • /
    • 2021
  • Several code-division multiple access (CDMA)-based interconnect schemes have been recently proposed as alternatives to the conventional time-division multiplexing bus in multicore systems-on-chip. CDMA systems with a dynamic assignment of spreading codewords are particularly attractive because of their potential for higher bandwidth efficiency compared with the systems in which the codewords are statically assigned to processing elements. In this paper, we propose a novel distributed arbitration scheme for dynamic CDMA-bus-based systems, which solves the complexity and scalability issues associated with commonly used centralized arbitration schemes. The proposed arbitration unit is decomposed into multiple simple arbitration elements, which are connected in a ring. The arbitration ring implements a token-passing algorithm, which both resolves destination conflicts and assigns the codewords to processing elements. Simulation results show that the throughput reduction in an optimally configured dynamic CDMA bus due to arbitration-related overheads does not exceed 5%.

Adaptive Random Access Algorithm for HIPERLAN/2 (HIPERLAN/2를 위한 적응적 랜덤 액세스 알고리즘)

  • Song Young-keum;Lee Jong-kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5B
    • /
    • pp.310-316
    • /
    • 2005
  • In this paper, we proposed and evaluated ARAH(Adaptive Random Access algorithm for HIPERLAN/2) to improve system performance. In this paper, HIPERLAN/2 uses OFDM(Orthogonal Frequency Division Multiplexing) modulation scheme to select appropriate PHY mode by Radio Channel Quality, Proposed the ARAH scheme uses these 7 PHY mode when mobile terminal determines the RCH(Random CHannel) number for random access. In this paper, these 7 PHY mode divided into two group, good and bad, and will be given high priority to mobile terminals which are in a good group. In the result of performance evaluation. ARAH algorithm, ARAH has a better performance of throughput and delay than existing algorithm.

Role based access control of healthcare information system for Mobile environments (모바일 환경에 적합한 헬스 케어 정보 시스템에서의 역할기반 접근제어)

  • Lee You-Ri;Park Dong-Gue
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.3 s.35
    • /
    • pp.119-132
    • /
    • 2005
  • The health care system revolutionized by the use of information and communication technologies. Computer information processing and electronic communication technologies play an increasingly important role in the area of health care. We propose a new role based access control model for pervasive health care systems, which changed location, time, environment information. Also our model can be solved the occurrence of an reduction authority problem to pervasive health care system at emergency environment. We propose a new role based access control model for pervasive health care systems, which combines role-to-role delegations, negative permission, context concept and dynamic context aware access control. With out approach we aim to preserver the advantages of RBAC and offer groat flexibility and fine-grained access control in pervasive healthcare information systems.

  • PDF

Design and Implementation of Real-time Shortest Path Search System in Directed and Dynamic Roads (방향성이 있는 동적인 도로에서 실시간 최단 경로 탐색 시스템의 설계와 구현)

  • Kwon, Oh-Seong;Cho, Hyung-Ju
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.4
    • /
    • pp.649-659
    • /
    • 2017
  • Typically, a smart car is equipped with access to the Internet and a wireless local area network. Moreover, a smart car is equipped with a global positioning system (GPS) based navigation system that presents a map to a user for recommending the shortest path to a desired destination. This paper presents the design and implementation of a real-time shortest path search system for directed and dynamic roads. Herein, we attempt to simulate real-world road environments, while considering changes in the ratio of directed roads and in road conditions, such as traffic accidents and congestions. Further, we analyze the effect of the ratio of directed roads and road conditions on the communication cost between the server and vehicles and the arrival times of vehicles. In this study, we compare and analyze distance-based shortest path algorithms and driving time-based shortest path algorithms while varying the number of vehicles to search for the shortest path, road conditions, and ratio of directed roads.

A Design for Improving Performance of Dynamic Traffic in High Rate WPAN (고속 WPAN의 동적 트래픽 성능 개선을 위한 구조 설계)

  • Kim, Ji-Eun;Lee, Sang-Jae;Jeon, Young-Ae;Choi, Sang-Sung
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2005.11a
    • /
    • pp.121-124
    • /
    • 2005
  • The High Rate Wireless Personal Area Networks (WPAN) is mainly targeted to consumer electronics and portable communication devices which need high rates and QoS. To achieve these goals, the WPAN provides data rates up to 1Gbps and adopts a Time Division Multiple Access (TDMA) MAC protocol. Since IEEE 802.15.3 MAC is based on TDMA scheme, it has good performance in dealing with real traffics. But it does not give better results for dynamic traffic. For dynamic traffic, IEEE 802.15.3 MAC needs a kind of request and response policy that brings about the degradation of performance in order to adapt to network changes. To overcome this problem and enhance the data throughput, this paper proposes a superframe structure which uses the Enhanced Contention Access Period (ECAP) to transmit data during sleep-CTA in PM mode.

  • PDF

Performance Evaluation of SSD-Index Maintenance Schemes in IR Applications

  • Jin, Du-Seok;Jung, Hoe-Kyung
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.4
    • /
    • pp.377-382
    • /
    • 2010
  • With the advent of flash memory based new storage device (SSD), there is considerable interest within the computer industry in using flash memory based storage devices for many different types of application. The dynamic index structure of large text collections has been a primary issue in the Information Retrieval Applications among them. Previous studies have proven the three approaches to be effective: In- Place, merge-based index structure and a combination of both. The above-mentioned strategies have been researched with the traditional storage device (HDD) which has a constraint on how keep the contiguity of dynamic data. However, in case of the new storage device, we don' have any constraint contiguity problems due to its low access latency time. But, although the new storage device has superiority such as low access latency and improved I/O throughput speeds, it is still not well suited for traditional dynamic index structures because of the poor random write throughput in practical systems. Therefore, using the experimental performance evaluation of various index maintenance schemes on the new storage device, we propose an efficient index structure for new storage device that improves significantly the index maintenance speed without degradation of query performance.

A Study on the Variable and Dynamic Salt According to Access Log and Password (접속로그와 패스워드에 따른 가변 및 동적솔트에 관한 연구)

  • Jeong, Jinho;Cha, Youngwook;Kim, Choonhee
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.1
    • /
    • pp.58-66
    • /
    • 2021
  • The user's password must be encrypted one-way through the hash function and stored in the database. Widely used hash functions such as MD5 and SHA-1 have also been found to have vulnerabilities, and hash functions that are considered safe can also have vulnerabilities over time. Salt enhances password security by adding it before or after the password before putting it to the hash function. In the case of the existing Salt, even if it is randomly assigned to each user, once it is assigned, it is a fixed value in a specific column of the database. If the database is exposed to an attacker, it poses a great threat to password cracking. In this paper, we suggest variable-dynamic Salt that dynamically changes according to the user's password during the login process. The variable-dynamic Salt can further enhance password security during login process by making it difficult to know what the Salt is, even if the database or source code is exposed.

Reliable Dynamic TDMA Scheme with new Packing method for Image Transmission over Link-16 (Link-16에서 이미지 전송을 위한 신뢰성 기반의 동적 TDMA 기법과 새로운 패킹 방법)

  • Baek, Hoki;Lim, Jaesung;Koo, Jayeul;Jin, Jeonghwan;Chun, Philseong;Oh, Ilhyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1045-1053
    • /
    • 2012
  • Link-16 is a widely used TDL (Tactical Data Link) which uses TDMA (Time Division Multiple Access). Link-16 is a very low rate system, so it supports small size of data like tactical message and voice. However, there are related works to transmit situation awareness information like image due to the increasing interest about EBO(Effect-Based Operation), recently. Special TDMA scheduling is needed not static TDMA of Link-16 for image transmission because image data has much larger size than the existing tactical data. In this paper, we proposed Link-16K which enhances the Link-16 MAC. The proposed Link-16K is compatible with Link-16, and includes dynamic TDMA, new packing method, and an efficient retransmission scheme for image transmission effectively. We can see that image transmission delay is reduced and channel utilization is increased through simulation results of proposed idea.

Feedback-Assisted Multipolling Scheme for Real-Time Multimedia Traffics in Wireless LANs (무선 LAN에서 실시간 멀티미디어 트래픽을 위한 피드백 기반의 다중폴링 방법)

  • Kim Sun-Myeng;Cho Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6B
    • /
    • pp.495-507
    • /
    • 2006
  • In wireless local area networks (WLANs), the successful design of scheduling algorithm is a key factor in guaranteeing the various quality of service (QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a multipolling-based dynamic scheduling algorithm for providing delay guarantees to multimedia traffics such as MPEG streams. The dynamic algorithm exploits the characteristics of MPEG stream, and uses mini frames for feedback control in order to deliver dynamic parameters for channel requests from stations to the point coordinator (PC) operating at the access point (AP). In this scheme, the duration of channel time allocated to a station during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to conventional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.