• Title/Summary/Keyword: resource partitioning

Search Result 56, Processing Time 0.023 seconds

QoS-Aware Call Admission Control for Multimedia over CDMA Network (CDMA 무선망상의 멀티미디어 서비스를 위한 QoS 제공 호 제어 기법)

  • 정용찬;정세정;신지태
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.106-115
    • /
    • 2003
  • Diverse multimedia services will be deployed at hand on 3G-and-beyond multi-service CDMA systems in order to satisfy different quality of service (QoS) according to traffic types. In order to use appropriate resources efficiently the call admission control (CAC) as a major resource control mechanism needs to be used to take care of efficient utilization of limited resources. In this paper, we propose a QoS-aware CAC (QCAC) that is enabled to provide service fairness and service differentiation in accordance with priority order and that applies the different thresholds in received power considering different QoS requirements such as different bit error rates (BER) when adopting total received power as the ceil load estimation. The proposed QCAC calculates the different thresholds of the different traffic types based on different required BER applies it for admission policy, and can get service fairness and differentiation in terms of call dropping probability as a main performance metric. The QCAC is aware of the QoS requirement per traffic type and allows admission discrimination according to traffic types in order to minimize the probability of QoS violation. Also the CAC needs to consider the resource allocation schemes such as complete sharing (CS), complete partitioning (CP), and priority sharing(PS) in order to provide fairness and service differentiation among traffic types. Among them, PS is closely related with the proposed QCAC having differently calculated threshold per each traffic type according to traffic priority orders.

Adaptive Partitioning of the Global Key Pool Method using Fuzzy Logic for Resilience in Statistical En-Route Filtering (통계적 여과기법에서 훼손 허용도를 위한 퍼지 로직을 사용한 적응형 전역 키 풀 분할 기법)

  • Kim, Sang-Ryul;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.4
    • /
    • pp.57-65
    • /
    • 2007
  • In many sensor network applications, sensor nodes are deployed in open environments, and hence are vulnerable to physical attacks, potentially compromising the node's cryptographic keys. False sensing report can be injected through compromised nodes, which can lead to not only false alarms but also the depletion of limited energy resource in battery powered networks. Fan Ye et al. proposed that statistical en-route filtering scheme(SEF) can do verify the false report during the forwarding process. In this scheme, the choice of a partition value represents a trade off between resilience and energy where the partition value is the total number of partitions which global key pool is divided. If every partition are compromised by an adversary, SEF disables the filtering capability. Also, when an adversary has compromised a very small portion of keys in every partition, the remaining uncompromised keys which take a large portion of the total cannot be used to filter false reports. We propose a fuzzy-based adaptive partitioning method in which a global key pool is adaptively divided into multiple partitions by a fuzzy rule-based system. The fuzzy logic determines a partition value by considering the number of compromised partitions, the energy and density of all nodes. The fuzzy based partition value can conserve energy, while it provides sufficient resilience.

  • PDF

Development of an Official Method for Measurement of Fluazinam Residues for Quarantine of Imported and Exported Horticultural Products (수출입 원예작물의 검역을 위한 살균제 Fluazinam의 공정 잔류분석법 개발)

  • Kim, Gyeong-Ha;Ahn, Kyung-Geun;Kim, Gi-Ppeum;Hwang, Young-Sun;Chang, Moon-Ik;Kang, In-Kyu;Lee, Young Deuk;Choung, Myoung-Gun
    • Horticultural Science & Technology
    • /
    • v.34 no.1
    • /
    • pp.183-194
    • /
    • 2016
  • This experiment was conducted to establish an official determination method to measure fluazinam residue in horticultural crops for import and export using GC-ECD/MS. Fluazinam residue was extracted with acetone from fresh samples of four representative horticultural products, the vegetable crops green pepper and kimchi cabbage, and the fruit crops mandarin and apple. The acetone extract was diluted with saline water and n -hexane partitioning was used to recover fluazinam from the aqueous phase. Florisil column chromatography was additionally employed for final purification of the extract. Fluazinam was separated and quantitated by GC with ECD using a DB-17 capillary column. The horticultural crops were fortified with three different concentrations of fluazinam. Mean recoveries ranged from 82.5% to 99.9% in the four crops. The coefficients of variation were less than 10.0%. The quantitative limit of fluazinam detection was $0.004mg{\cdot}kg^{-1}$ in the four crop samples. GC/MS with selected-ion monitoring was also used to confirm the suspected residue. This analytical method was reproducible and sensitive enough to measure the residue of fluazinam in horticultural commodities for import and export.

Congestion Control Method of Area of Interest in Distributed Virtual Environment (분산가상환경에서 참여자 관심영역의 혼잡도 조절기법)

  • 유석종
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.4
    • /
    • pp.550-558
    • /
    • 2004
  • Previous researches on scalability problem of distributed virtual environment (DVE) have been mainly focused on spatial partitioning of area of interest (AOI). Congestion phenomena by avatar groups in AOI have been neglected relatively However, AOI congestion is highly related to scalability of DVE because it exhausts system resources such as network bandwidth and rendering time, and could be a bar to perform collaboration among participants. In this paper, this will be defined as the problem that must be solved for the realization of the scalable DVE, and a model will be proposed to measure and control congestion situation in AOI. The purposes of the proposed model are to prevent high density of participants in AOI, and to protect stable collaboration in DVE. For evaluation of the performance it is compared with a previous method by defining the resource cost model which is dynamically activated to AOI congestion.

  • PDF

Analytical Evaluation of FFR-aided Heterogeneous Cellular Networks with Optimal Double Threshold

  • Abdullahi, Sani Umar;Liu, Jian;Mohadeskasaei, Seyed Alireza
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3370-3392
    • /
    • 2017
  • Next Generation Beyond 4G/5G systems will rely on the deployment of small cells over conventional macrocells for achieving high spectral efficiency and improved coverage performance, especially for indoor and hotspot environments. In such heterogeneous networks, the expected performance gains can only be derived with the use of efficient interference coordination schemes, such as Fractional Frequency Reuse (FFR), which is very attractive for its simplicity and effectiveness. In this work, femtocells are deployed according to a spatial Poisson Point Process (PPP) over hexagonally shaped, 6-sector macro base stations (MeNBs) in an uncoordinated manner, operating in hybrid mode. A newly introduced intermediary region prevents cross-tier, cross-boundary interference and improves user equipment (UE) performance at the boundary of cell center and cell edge. With tools of stochastic geometry, an analytical framework for the signal-to-interference-plus-noise-ratio (SINR) distribution is developed to evaluate the performance of all UEs in different spatial locations, with consideration to both co-tier and cross-tier interference. Using the SINR distribution framework, average network throughput per tier is derived together with a newly proposed harmonic mean, which ensures fairness in resource allocation amongst all UEs. Finally, the FFR network parameters are optimized for maximizing average network throughput, and the harmonic mean using a fair resource assignment constraint. Numerical results verify the proposed analytical framework, and provide insights into design trade-offs between maximizing throughput and user fairness by appropriately adjusting the spatial partitioning thresholds, the spectrum allocation factor, and the femtocell density.

(A Network Fault Recovery Algorithm based on a Segment Automatic Restoration Scheme) (세그먼트 자동복구 기반의 네트워크 장애 복구 알고리즘)

  • Shin, Hae-Joon;Kim, Ryung-Min;Kim, Young-Tak
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.448-460
    • /
    • 2003
  • In this paper, we propose a network fault recovery algorithm based on a segment restoration scheme to reduce restoration time and restoration resource. The proposed segment restoration scheme is based on network partitioning which divides a large network into several small subnetworks. The restoration performance of the proposed segment restoration scheme depends on the size and the topology of subnetworks. Since most faults can be restored in a subnetwork, restoration time is reduced obviously. We compare and analyze restoration performance according to the size of subnetworks and restoration schemes. From simulation results, the proposed segment restoration scheme has the shortest restoration time compared with other restoration schemes. Especially the restoration performance of the proposed segment restoration scheme is better than the SLSP, which is also a segment-based restoration scheme, in terms of restoration time and required restoration resource capacity.

Feeding ecology of three tonguefishes, genus Cynoglossus (Cynoglossidae) in the Seto Inland Sea, Japan

  • Baeck, Gun-Wook;Park, Joo-Myun;Hashimoto, Hiroaki
    • Animal cells and systems
    • /
    • v.15 no.4
    • /
    • pp.325-336
    • /
    • 2011
  • Feeding ecology was compared among the three tonguefishes Cynoglossus abbreviatus, C. joyneri and C. robustus, collected from Seto Inland Sea, Japan, from June 2000 to May 2001. They are benthivores, consuming mainly gammarid amphipods, shrimps, crabs, gastropods, bivalves and ophiuroids. C. abbreviatus consumed greater proportions of ophiuroids whereas C. joyneri and C. robustus ate more amphipods and shrimps. While C. abbreviatus consumed mostly ophiuroids in all size classes, the diets of C. joyneri and C. robustus showed ontogenetic changes in feeding habits; smaller individuals of C. joyneri and C. robustus consumed gammarid amphipods, whereas larger C. joyneri ate shrimps and gastropods, and larger C. robustus fed mainly on gastropods, crabs, bivalves and polychaetes. Cluster analysis based on diet similarities emphasized that the three Cynoglossus species could be categorized on a size-related basis into three feeding groups: smaller C. joyneri and C. rubustus (<25 cm TL) could be classified as group A, and the larger of them (>25 cm TL) as group B, whereas C. abbreviatus was categorized as group C. This means that some degree of resource partitioning can occur among the three Cynoglossus species. The seasonal changes in the diets were also significant for the three Cynoglossus species.

Function of Habitat Heterogeneity for the Biodiversity and Demography of Population in Small Mammal Community (소척추동물군집에서 개체군 변동과 생물다양성 유지를 위한 서식지 이질성의 기능)

  • Lee, Sang-Don
    • The Korean Journal of Ecology
    • /
    • v.18 no.4
    • /
    • pp.513-513
    • /
    • 1995
  • The central theme of Habital heterogeneity is to provide animals with habital complexity or structural diversity and to allow resource partitioning among individuals. In turn, the leads to population stability because prey can escape more easily with more hiding places causing less population fluctuation. Species diversity is characterized due to more potential niches both horizontally and verticall. Empirically, in homogeneous habitats population was less abundant, reproduction and survival were lower, spacing behavior, competition and dispersal were higher than in heterogeneous habitats. The results imply that diversity and conservation of species can be maintained through providing heterogeneous habitats.

A genetic-algorithm-based high-level synthesis for partitioned bus architecture (유전자 알고리즘을 이용한 분할 버스 아키텍처의 상위 수준 합성)

  • 김용주;최기영
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.3
    • /
    • pp.1-10
    • /
    • 1997
  • We present an approach to high-level synthesis for a specific target architecture-partitioned bus architecture. In this approach, we have specific goals of minimizing data transfer length and number of buses in addition to common synthesis goals such as minimizing number of control steps and satisfying given resource constraint. Minimizing data transfer length and number of buses can be very important design goals in the era of deep submicron technology in which interconnection delay and area dominate total delay and area of the chip to be designed. in partitioned bus architecture, to get optimal solution satisfying all the goals, partitioning of operation nodes among segments and ordering of segments as well as scheduling and allocation/binding must be considered concurrently. Those additional goals may impose much more complexity on the existing high-level synthesis problem. To cope with this increased complexity and get reasonable results, we have employed two ideas in ur synthesis approach-extension of the target architecture to alleviate bus requirement for data transfer and adoption of genetic algorithm as a principal methodology for design space exploration. Experimental results show that our approach is a promising high-level synthesis mehtodology for partitioned bus architecture.

  • PDF

Parallel 2D-DWT Hardware Architecture for Image Compression Using the Lifting Scheme (이미지 압축을 위한 Lifting Scheme을 이용한 병렬 2D-DWT 하드웨어 구조)

  • Kim, Jong-Woog;Chong, Jong-Wha
    • Journal of IKEEE
    • /
    • v.6 no.1 s.10
    • /
    • pp.80-86
    • /
    • 2002
  • This paper presents a fast hardware architecture to implement a 2-D DWT(Discrete Wavelet Transform) computed by lifting scheme framework. The conventional 2-D DWT hardware architecture has problem in internal memory, hardware resource, and latency. The proposed architecture was based on the 4-way partitioned data set. This architecture is configured with a pipelining parallel architecture for 4-way partitioning method. Due to the use of this architecture, total latency was improved by 50%, and memory size was reduced by using lifting scheme.

  • PDF