• Title/Summary/Keyword: mobile buffers

Search Result 36, Processing Time 0.02 seconds

A Novel Efficient Up-Link Scheduler for IEEE 802.16m (IEEE802.16m을 위한 효율적인 상향링크 스케줄러 연구)

  • Cho, Da-Young;Oh, Hyuk-Jun;Hong, Sung-Woong;Oh, Il-Hyuk;Ko, Kyung-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.979-985
    • /
    • 2012
  • The design of an efficient scheduler is a key design factor in IEEE 802.16m systems, in order to support services with various QoS smoothly. Although conventional studies of schedules have been suggested, those had problems that are not able to satisfy the delay condition and make the through-put declined, because they only focused on a specific action scenario rather than reflecting practical action scenarios which have real-time and non-real-time traffics variously. In this paper, an efficient uplink scheduling algorithm is proposed for IEEE 802.16m system by introducing the concepts of Virtual Time(VT) and Virtual Finish Time(VFT) based priority determination, and separate buffers for each QoS class in the mobile terminal. Simulation results showed that the proposed scheme had satisfied the delay requirement of real-time services even with improved throughput performance compared to conventional methods.

A Mechanism for Seamless Mobility Service with the Network-based Preemptive Operations (네트워크 기반의 Preemptive 동작을 통한 끊김없는 서비스 제공 메커니즘)

  • Min, Byung-Ung;Chung, Hee-Chang;Kim, Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.54-57
    • /
    • 2007
  • Much researches have studied for seamless mobility service. Those focused on minimizing the delay time due to the handover. In this paper, we suggest seamless mobility service with the network-based preemptive operations. With these operations, if it's found that the MT(Mobile Terminal)'s handover using L2-trigger event, old access network buffers the delivering data. Therefore this can decrease the data drop rates. And also, this can deal with the ping-pong's phenomenon of MT. At the end of MT's movement, these operations can provide seamless mobility service sending buffered data after checking the MT's movement. This mechanism uses MPLS-LSP(MultiProtocol Label Switching-Label Switched Path) in core network for fast process.

  • PDF

CPWL : Clock and Page Weight based Disk Buffer Management Policy for Flash Memory Systems

  • Kang, Byung Kook;Kwak, Jong Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.2
    • /
    • pp.21-29
    • /
    • 2020
  • The use of NAND flash memory is continuously increased with the demand of mobile data in the IT industry environment. However, the erase operations in flash memory require longer latency and higher power consumption, resulting in the limited lifetime for each cell. Therefore, frequent write/erase operations reduce the performance and the lifetime of the flash memory. In order to solve this problem, management techniques for improving the performance of flash based storage by reducing write and erase operations of flash memory with using disk buffers have been studied. In this paper, we propose a CPWL to minimized the number of write operations. It is a disk buffer management that separates read and write pages according to the characteristics of the buffer memory access patterns. This technique increases the lifespan of the flash memory and decreases an energy consumption by reducing the number of writes by arranging pages according to the characteristics of buffer memory access mode of requested pages.

Proposed Message Transit Buffer Management Model for Nodes in Vehicular Delay-Tolerant Network

  • Gballou Yao, Theophile;Kimou Kouadio, Prosper;Tiecoura, Yves;Toure Kidjegbo, Augustin
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.1
    • /
    • pp.153-163
    • /
    • 2023
  • This study is situated in the context of intelligent transport systems, where in-vehicle devices assist drivers to avoid accidents and therefore improve road safety. The vehicles present in a given area form an ad' hoc network of vehicles called vehicular ad' hoc network. In this type of network, the nodes are mobile vehicles and the messages exchanged are messages to warn about obstacles that may hinder the correct driving. Node mobilities make it impossible for inter-node communication to be end-to-end. Recognizing this characteristic has led to delay-tolerant vehicular networks. Embedded devices have small buffers (memory) to hold messages that a node needs to transmit when no other node is within its visibility range for transmission. The performance of a vehicular delay-tolerant network is closely tied to the successful management of the nodes' transit buffer. In this paper, we propose a message transit buffer management model for nodes in vehicular delay tolerant networks. This model consists in setting up, on the one hand, a policy of dropping messages from the buffer when the buffer is full and must receive a new message. This drop policy is based on the concept of intermediate node to destination, queues and priority class of service. It is also based on the properties of the message (size, weight, number of hops, number of replications, remaining time-to-live, etc.). On the other hand, the model defines the policy for selecting the message to be transmitted. The proposed model was evaluated with the ONE opportunistic network simulator based on a 4000m x 4000m area of downtown Bouaké in Côte d'Ivoire. The map data were imported using the Open Street Map tool. The results obtained show that our model improves the delivery ratio of security alert messages, reduces their delivery delay and network overload compared to the existing model. This improvement in communication within a network of vehicles can contribute to the improvement of road safety.

Identification of Proteins in Egg White Using Ion Exchange Cartridge and RP-HPLC (이온교환 카트리지와 RP-HPLC를 이용한 난백 단백질의 확인)

  • Kim, Hyun Moon;Kim, Ah Reum;Lee, Chang Soo;Kim, In Ho
    • Korean Chemical Engineering Research
    • /
    • v.50 no.4
    • /
    • pp.713-717
    • /
    • 2012
  • Approximately forty proteins in egg white have been widely studied for their functional properties. To develop a procedure of separation for pure and non-altered proteins from egg white, purification study was conducted to isolate lysozyme, ovotransferrin, and ovalbumin. Ion exchange cartridge can selectively separate proteins from egg white, and reversed-phase HPLC (RP-HPLC) could identify separated proteins. Proteins in egg white were purified by HI trap ion exchange cartridge SP and Q with buffers pH 8.0 and 5.2. C18 column (Phenomenex, USA) was used for RP-HPLC analysis and isocratic mobile phase was used with acetonitrile (ACN)/distilled water (DW)/trifluoroacetic acid (TFA) in the ratio of 50/50/0.1. Comparing the retention times of standards in RP-HPLC experiments showed that ovotransferrin, ovalbumin, and lysozyme in egg white were eluted successively in the RP-HPLC column after the pretreatment in SP and Q ion exchange cartridges.

A Combined Call Control Algorithm based on Moving Speed and Bandwidth in Hierarchical Cellular Systems (계층셀 구조에서 이동 속도와 대역폭을 고려한 복합 호 처리 알고리즘)

  • Park, Jeong-Eun;Chae, Ki-Joon
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.299-313
    • /
    • 2002
  • Recently, the demand for mobile communications and multimedia services has rapidly increased so that conventional cellular system cannot fulfill the requirement of users (capacity and QoS) any more. Therefore, the hierarchical cellular system has been suggested in order to guarantee the QoS and to admit large population of users. IMT-2000 adopts the hierarchical cellular structure, which requires a call control algorithm capable of manipulating and utilizing the complicated structure of hierarchical cellular structure with handiness and efficiency. In this thesis, as an improvement of conventional combined algorithm, a new call control algorithm considering the moving speed of terminal and bandwidth is suggested. This algorithm employs buffers and guard channels to reduce the failure rate. Also, this algorithm considers the moving speed of terminal and bandwidth to elevate the efficiency. Furthermore, calls are handled separately according to the moving speeds of terminal and bandwidths to improve the QoS and reduce the handover rate. As an evaluation of the suggested algorithm, a model hierarchical cellular system is constructed and simulations are conducted with various types of traffic. As the result of the simulations, such indices as block rate, drop rate, channel utilization, and the number of inter layer handovers are examined to demonstrate the excellency fo the suggested algorithm.