• Title/Summary/Keyword: Cell-Based Scheme

Search Result 529, Processing Time 0.024 seconds

A Practical Connection Admission Control Scheme in ATM Networks (ATM망에서 실용적 연결수락제어 기법)

  • Kang, Koo-Hong;Park, Sang-Jo
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.181-187
    • /
    • 2002
  • Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.

A Novel Resource Scheduling Scheme for CoMP Systems

  • Zhou, Wen'an;Liu, Jianlong;Zhang, Yiyu;Yang, Chengyi;Yang, Xuhui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.650-669
    • /
    • 2017
  • Coordinated multiple points transmission and reception (CoMP) technology is used to mitigate the inter-cell interference, and increase cell average user normalized throughput and cell edge user normalized throughput. There are two kinds of radio resource schedule strategies in LTE-A/5G CoMP system, and they are called centralized scheduling strategy and distributed scheduling strategy. The regional centralized scheduling cannot solve interference of inter-region, and the distributed scheduling leads to worse efficiency in the utilize of resources. In this paper, a novel distributed scheduling scheme named 9-Cell alternate authorization (9-CAA) is proposed. In our scheme, time-domain resources are divided orthogonally by coloring theory for inter-region cooperation in 9-Cell scenario [6]. Then, we provide a formula based on 0-1 integer programming to get chromatic number in 9-CAA. Moreover, a feasible optimal chromatic number search algorithm named CNS-9CAA is proposed. In addition, this scheme is expanded to 3-Cell scenario, and name it 3-Cell alternate authorization (3-CAA). At last, simulation results indicate that 9/3-CAA scheme exceed All CU CoMP, 9/3C CU CoMP and DLC resource scheduling scheme in cell average user normalized throughput. Especially, compared with the non-CoMP scheme as a benchmark, the 9-CAA and 3-CAA have improved the edge user normalized throughput by 17.2% and 13.0% respectively.

Distributed Resource Partitioning Scheme for Intercell Interference in Multicellular Networks

  • Song, Jae-Su;Lee, Seung-Hwan
    • Journal of electromagnetic engineering and science
    • /
    • v.15 no.1
    • /
    • pp.14-19
    • /
    • 2015
  • In multicellular wireless networks, intercell interference limits system performance, especially cell edge user performance. One promising approach to solve this problem is the intercell interference coordination (ICIC) scheme. In this paper, we propose a new ICIC scheme based on a resource partitioning approach to enhance cell edge user performance in a wireless multicellular system. The most important feature of the proposed scheme is that the algorithm is performed at each base station in a distributed manner and therefore minimizes the required information exchange between neighboring base stations. The proposed scheme has benefits in a practical environment where the traffic load distribution is not uniform among base stations and the backhaul capacity between the base stations is limited.

Adaptive Multiuser MIMO Transmission in Wireless Systems with Cooperating Cells (셀간 협력 통신 기반의 적응적 다중 사용자 다중 안테나 전송 기법)

  • Lee, Jin-Hee;Ko, Young-Chai
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.24 no.2
    • /
    • pp.102-107
    • /
    • 2011
  • In multicell wireless systems with insufficient frequency reuse, user transmission will suffer other-cell interference (OCI). Cell cooperation is an effective way to mitigate OCI and increase the system sum rate. An adaptive scheme for serving one user in each cell was proposed in [1]. In this paper, we generalize that scheme by serving two users in each cell with adaptive zeroforcing beamforming (ZF) strategies. Based on our derived statistics of the signal-to-noise plus interference ratios, we choose the scheme to maximize the total ergodic sum-rate based on user locations. Through the numerical examples, we show that the total system sum rate can be improved by selecting appropriate transmitting strategy adaptively. As a result, our proposed system can explore spatial multiplexing gain without additional power and thus improves total system sum rate significantly.

A Cell Shaping Scheme using Traffic Characteristics in ATM Network (ATM Network에서 트래픽 특성에 의한 셀 쉐이핑)

  • Yoon, Seok-Hyun
    • KSCI Review
    • /
    • v.15 no.1
    • /
    • pp.17-23
    • /
    • 2007
  • The change of traffic by the CDV is entered in a condensed form in UPC/NPC, overflowing the buffer of the net and possibly causing its congestion. For this reason this paper proposes the Cell Spacing Scheme. As the Cell Spaing Scheme. two method is proposed; RAT based on the time in which cells enter the spacer and RDT based on the time in which cells come out from the spacer. This Paper Proposes the improved spacing sheme in which the departure time of the present cell determines the departure time of the next one, by combining with Leaky Bucket and using the traffic characteristics of ATM network.

  • PDF

Estimation and Prediction-Based Connection Admission Control in Broadband Satellite Systems

  • Jang, Yeong-Min
    • ETRI Journal
    • /
    • v.22 no.4
    • /
    • pp.40-50
    • /
    • 2000
  • We apply a "sliding-window" Maximum Likelihood(ML) estimator to estimate traffic parameters On-Off source and develop a method for estimating stochastic predicted individual cell arrival rates. Based on these results, we propose a simple Connection Admission Control(CAC)scheme for delay sensitive services in broadband onboard packet switching satellite systems. The algorithms are motivated by the limited onboard satellite buffer, the large propagation delay, and low computational capabilities inherent in satellite communication systems. We develop an algorithm using the predicted individual cell loss ratio instead of using steady state cell loss ratios. We demonstrate the CAC benefits of this approach over using steady state cell loss ratios as well as predicted total cell loss ratios. We also derive the predictive saturation probability and the predictive cell loss ratio and use them to control the total number of connections. Predictive congestion control mechanisms allow a satellite network to operate in the optimum region of low delay and high throughput. This is different from the traditional reactive congestion control mechanism that allows the network to recover from the congested state. Numerical and simulation results obtained suggest that the proposed predictive scheme is a promising approach for real time CAC.

  • PDF

A Modified Dynamic Weighted Round Robin Cell Scheduling Algorithm

  • Kwak, Ji-Young;Nam, Ji-Seung;Kim, Do-Hyun
    • ETRI Journal
    • /
    • v.24 no.5
    • /
    • pp.360-372
    • /
    • 2002
  • In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

  • PDF

Interference Resolving Radio Resource Allocation Scheme in a TDD-OFDMA/FDD-CDMA Hierarchical Over lay Cellular System

  • Lee, Yeonwoo;Kim, Kyung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.7
    • /
    • pp.862-869
    • /
    • 2013
  • In order to support a cell-independent traffic asymmetry, the conventional TDD system cannot avoid crossed time slot (CTS) interference. Moreover, the TDD/FDD hierarchical overlay cellular systems is taken into account as a generally accepted cell model in a heterogeneous radio environment. In this paper, we propose an interference resolving radio resource allocation technique in a TDD-OFDMA cellular system that overlays a FDD-CDMA cell. In our proposed scheme, we exploit under-used FDD-CDMA uplink resource by TDD mobile abiding by a region based time slot(TS) allocation which in turn mitigates CTS interference considerably. It is demonstrated that combined with under-used resource utilization scheme based on mobile's location, the proposed technique can reduce CTS interference considerably and support the asymmetric traffic in TDD system.

A Numerical Simulation based on Cell-centered Scheme for Contractive and Dilative Motion on Axisymmetric Micro-hydro machine (셀중심법에 의한 축대칭 극소 로봇의 압축팽창운동에 대한 수치적인 연구)

  • 강효길;김문찬;전호환
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.41 no.2
    • /
    • pp.90-97
    • /
    • 2004
  • Flow mechanism of contractive and dilative motion is numerically investigated to obtain a propulsive force in highly viscous fluid. An axisymmetric code is developed with unstructured grid system based on cell-centered scheme. It is validated by comparing with the results of Stokes approximation for the problem of uniform flow past a sphere in low Reynolds number(R$_{n}$=1). The validated code is applied to the simulation of contractive and dilative periodic motion of body whose results are quantitatively compared with the two dimensional case. In order to investigate the grid dependency, two different grids are applied to the present computations. The present study provides key information for the development of an axisymmetric Micro-hydro-robot.t.

Reuse Partitioning for Throughput and Fairness Improvement in OFDMA Based Relay System (OFDMA기반 Relay시스템에서 Throughput과 Fairness성능 향상을 위한 Reuse Partitioning기법)

  • Shim, Min-Kyu;Choi, Ho-Young;Hong, Dae-Hyoung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.9
    • /
    • pp.17-24
    • /
    • 2007
  • In this paper, we propose the sub-cell reuse partitioning among relays as an efficient resource reuse scheme in the relay-based OFDMA systems. If the frequency resource is reused among relays aggressively, we can increase the cell throughput. However, the interferences due to the frequency reuse may cause the fairness decrease due to the SINR degradation especially at the edge of RS sub-cells. In this paper, to make the cell throughput and fairness performance improved at the same time, we propose a sub-cell reuse partitioning scheme that divides a relay sub-cell into inner zone for aggressive reuse and outer zone for sparse reuse. The performance of the proposed scheme has been analyzed by computer simulation. We also applied a scheduling algorithm that can work together with the proposed sub-cell reuse partitioning scheme. Simulation results show that the proposed scheme can improve both the throughput and the fairness performances. In particular, when the scheduling is applied for the improvement of fairness, it is shown that the throughput performance can be enhanced more efficiently by the proposed scheme.