• Title/Summary/Keyword: system throughput

Search Result 1,748, Processing Time 0.024 seconds

A Design of DiffServ Supporting Scheduler for uplink traffics in TDD/CDMA Networks (TDD/CDMA망에서의 업링크 트래픽을 위한 DiffServ 지원 스케줄러 설계)

  • Zang, Seog-Ku;Kim, Young-Han
    • The KIPS Transactions:PartC
    • /
    • v.12C no.5 s.101
    • /
    • pp.717-724
    • /
    • 2005
  • In this paper, we Propose an efficient scheduler well suited for the next-generation wireless networks that can support multimedia traffic having various requirements. The scheduler is designed to provide each of multimedia classes with differentiated services. In particular, the scheduler is intended to maximize throughput and minimize packet loss ratio. To apply the scheduler, we suppose that the wireless network is based on TDD/CDMA system The scheduler assigns a packet in a dedicated uplink-slot to the user within a frame to operate scheduling of packets transmitted by the users belonging to the specific class in an efficient manner. Such a manner also enables the scheduler to meet different QoS requirements. The paper also includes performance comparison with other schemes and analysis of the proposed scheduling algorithm by using simulation. We also analyze the proposed scheme by using simulation. The simulation compares the proposed scheduling algerian with previously proposed schemes in terms of the performance.

A Real-Time Disk Prefetch Scheme for Continuous Media Playback (연속매체 상영을 위한 실시간 디스크 프리팻칭 기법)

  • Lim Sung Chae
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.547-554
    • /
    • 2004
  • To play back CM (Continuous Media) in online mode, the multimedia system Is required to have a real-time disk scheduling scheme that can efficiently fulfill the strict temporal constraints of serviced CM streams to prevent hiccups. In general, such disk scheduling is performed based on the concept of periodic prefetching since a CM stream has a rather long Playback time. In this paper, we also propose a periodic prefetching scheme that runs by using real-time disk channels, called on-time delivery channels. Since the channels are generated from the bulk-SCAN algorithm and they can be allocated in a very flexible manner based on the EDF (earliest-deadline-first) algorithm, the proposed scheme provides a better Performance in terms of I/O throughput and the average response time, as well as hiccup-free playback of concurrent CM streams. To show that the proposed scheme outperforms other methods, we give some simulation results.

Performance Analysis of random access channels in multi-service multi-user OFDMA systems (다중 서비스 다중 사용자 OFDMA 시스템에서의 임의접근 채널 성능 분석)

  • Koo, In-Soo;Pham, Thi Hong Chau
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.141-151
    • /
    • 2008
  • In the paper, we analyze the performance of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems are available sub-channels and PN-codes. For given available sub-channels and PN-codes,' we analyze the performance of the random access channels of OFDMA systems in terms of the access success probability, the blocking probability, the access delay and the throughput per each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be used to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations in multi-service multi-user OFDMA systems.

  • PDF

Cross Compressed Replication Scheme for Large-Volume Column Storages (대용량 컬럼 저장소를 위한 교차 압축 이중화 기법)

  • Byun, Siwoo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.5
    • /
    • pp.2449-2456
    • /
    • 2013
  • The column-oriented database storage is a very advanced model for large-volume data analysis systems because of its superior I/O performance. Traditional data storages exploit row-oriented storage where the attributes of a record are placed contiguously in hard disk for fast write operations. However, for search-mostly datawarehouse systems, column-oriented storage has become a more proper model because of its superior read performance. Recently, solid state drive using MLC flash memory is largely recognized as the preferred storage media for high-speed data analysis systems. In this paper, we introduce fast column-oriented data storage model and then propose a new storage management scheme using a cross compressed replication for the high-speed column-oriented datawarehouse system. Our storage management scheme which is based on two MLC SSD achieves superior performance and reliability by the cross replication of the uncompressed segment and the compressed segment under high workloads of CPU and I/O. Based on the results of the performance evaluation, we conclude that our storage management scheme outperforms the traditional scheme in the respect of update throughput and response time of the column segments.

Mixed-Integer Programming based Techniques for Resource Allocation in Underlay Cognitive Radio Networks: A Survey

  • Alfa, Attahiru S.;Maharaj, B.T.;Lall, Shruti;Pal, Sougata
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.744-761
    • /
    • 2016
  • For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users. The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.

FDDI Throughput and Application Analysis of MAP Network Construction in Manufactruing Environment (제조 환경에서 MAP 네트워크 체제의 FDDI 효율과 적용 해석)

  • Kim, Jeong-Ho;Lee, Min-Nam;Lee, Sang-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.1
    • /
    • pp.95-105
    • /
    • 1995
  • An appendix to the MAP 3.0 specification notes that there are primary advantages to use of fiber optics : noise immunity, ability to run in difficult electrical environments, safety and high data rates. All of these may be quite useful in various manufacturing environments. In this paper, we study on construction schmes for a fiber-based 802.4 MAP system including the use of both bus and star topologies. We suggest passive star network and FDDI network for manufacturing environment. And then, we propose the FDDI protocol including the use a dual ring topology running at 100 Mbps to physical and datalink layer of MAT specification and analysis it's protocol and topology for abilities in manufacturing environments, We evaluate about applications service, time-critical processing and topology of two models in manufacturing environment.

  • PDF

High-Speed Inkjet Monitoring Module for Jetting Failure Inspection (잉크액적 토출불량 검출을 위한 고속 잉크젯 모니터링 모듈)

  • Shin, Dong-Youn
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.10
    • /
    • pp.1521-1527
    • /
    • 2010
  • Since inkjet printing is being employed in production lines of electronics and display industries, the tack time for inspection of jetting failure has become very important because the throughput of the inkjet printing system can be extended to the maximum limit by adopting a shorter jetting inspection time. The most popular method for inspecting jetting failure involves the use of a linear stage, a high magnification lens, and a charge coupled devicecamera. However, this conventional approach requires approximately 60 s to complete the jetting inspection and might not be suitable for a high-speed reciprocating jetting inspection in endurance tests due to the unwanted mechanical vibration. In this study, a novel concept of an inkjet monitoring module is introduced, which has an overall inspection time of 18 s. For the shorter tack time of jetting inspection, the parameters affecting the tack time are discussed in this paper.

Enhancement of Sensitivity in Interferometric Biosensing by Using a New Biolinker and Prebinding Antibody

  • Park, Jae-Sook;Lim, Sung-Hyun;Sim, Sang-Jun;Chae, Hee-Yeop;Yoon, Hyun-C.;Yang, Sang-Sik;Kim, Byung-Woo
    • Journal of Microbiology and Biotechnology
    • /
    • v.16 no.12
    • /
    • pp.1968-1976
    • /
    • 2006
  • Recombinant E. coli ACV 1003 (recA:: lacZ) was used to measure low concentrations of DNA-damaging chemicals, which produce $\beta$-galactosidase via an SOS regulon system. Very low $\beta$-galactosidase activities of less than 0.01 unit/ml, $\beta$-galactosidase produced through an SOS response corresponding to the 10 ng/ml (ppb) of DNA damaging chemicals in the environment, can be rapidly determined by using an alternative interferometric biosensor with optically flat thin films of porous silicon rather than by the conventional time-consuming Miller's enzyme assay as well as the ELISA method. fu order to enhance the sensitivity in the interferometry, it needs to obtain more uniform distribution and higher biolinking efficiency, whereas interferometric sensing is rapid, cheap, and advantageous in high throughput by using a multiple-well-type chip. In this study, pore size adjusted to 60 nm for the target enzyme $\beta$-galactosidase to be bound on both walls of a Si pore and a calyx crown derivative was apllied as a more efficient biolinker. Furthermore, anti-$\beta$-galactosidase was previously functionalized with the biolinker for the target $\beta$-galactosidase to be specifically bound. When anti-$\beta$-galactosidase was bound to the calyx-crown derivative-linked surface, the effective optical thickness was found to be three times as high as that obtained without using anti-$\beta$-galactosidase. The resolution obtained was very similar to that afforded by the time-consuming ELISA method; however, the reproducibility was still unsatisfactory, below 1 unit $\beta$-galactosidase/ml, owing to the microscopic non-uniform distribution of the pores in the etched silicon surface.

Efficient Complex Event Processing Scheme Considering Similar and Duplication Operations (유사 연산과 중복 연산을 고려한 효율적인 복합 이벤트 처리 기법)

  • Kim, Daeyun;Ko, Geonsik;Kim, Byounghoon;Noh, Yeonwoo;Lim, Jongtae;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.3
    • /
    • pp.370-381
    • /
    • 2017
  • Recently, a complex event processing system has been introduced to quickly and efficiently process real-time events in various applications. Since the existing complex event processing schemes do not consider the similarity and duplication of operators, they perform a lot of computations and consume memory. To solve such problems, this paper proposes an efficient complex event processing scheme considering similar operators and duplication operations. When the same primitive events have similar operations, the proposed scheme combines them into one virtual operator. For duplicated operations, the proposed scheme processes only one of them first, and then processes the others using the results of the already processed operation when the same operation is subsequently performed. It is shown through performance comparison that the proposed scheme outperforms the existing scheme in terms of the whole operation throughput.

Adaptive Sliding Mode Traffic Flow Control using a Deadzoned Parameter Adaptation Law for Ramp Metering and Speed Regulation

  • Jin, Xin;Eom, Myunghwan;Chwa, Dongkyoung
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.5
    • /
    • pp.2031-2042
    • /
    • 2017
  • In this paper, a novel traffic flow control method based-on ramp metering and speed regulation using an adaptive sliding mode control (ASMC) method along with a deadzoned parameter adaptation law is proposed at a stochastic macroscopic level traffic environment, where the influence of the density and speed disturbances is accounted for in the traffic dynamic equations. The goal of this paper is to design a local traffic flow controller using both ramp metering and speed regulation based on ASMC, in order to achieve the desired density and speed for the maintenance of the maximum mainline throughput against disturbances in practice. The proposed method is advantageous in that it can improve the traffic flow performance compared to the traditional methods using only ramp metering, even in the presence of ramp storage limitation and disturbances. Moreover, a prior knowledge of disturbance magnitude is not required in the process of designing the controller unlike the conventional sliding mode controller. A stability analysis is presented to show that the traffic system under the proposed traffic flow control method is guaranteed to be uniformly bounded and its ultimate bound can be adjusted to be sufficiently small in terms of deadzone. The validity of the proposed method is demonstrated under different traffic situations (i.e., different initial traffic status), in the sense that the proposed control method is capable of stabilizing traffic flow better than the previously well-known Asservissement Lineaire d'Entree Autoroutiere (ALINEA) strategy and also feedback linearization control (FLC) method.