• Title/Summary/Keyword: non-uniform traffic

Search Result 36, Processing Time 0.024 seconds

Performance Analysis of CMAP-WDMA MAC Protocol for Metro-WDMA Networks

  • Yun, Chang-Ho;Cho, A-Ra;Park, Jong-Won;Lim, Yong-Kon
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.4
    • /
    • pp.480-488
    • /
    • 2009
  • A channel-shared modified accelerative pre-allocation wavelength division multiple access (CMAP-WDMA) media access control (MAC) has been proposed for metro-WDMA networks, as an extension of modified pre-allocation wavelength division multiple access (MAP-WDMA) MAC protocol. Similarly, CAP WDMA as an extension of accelerative pre-allocation wavelength division multiple access (AP-WDMA) MAC protocol. Performance of CMAP- and CAP-WDMA was extensively investigated under several channel sharing methods (CSMs), asymmetric traffic load patterns (TLPs), and non-uniform traffic distribution patterns (TDPs). The result showed that the channel utilization of the CMAP-WDMA always outperforms that of CAP-WDMA at the expense of longer channel access delay for channel shared case while CMAP-WDMA provided higher channel utilization at specific network conditions but always shorter channel access delay than CAP-WDMA for non-channel shared case. Additionally both for CMAP- and CAP-WDMA, determining an effective CSM is a critical design issue because TDPs and TLPs can be neither managed nor expected while CSM is manageable, and the CSM supporting the best channel utilization can be recommended.

Aerodynamic analysis on the step types of a railway tunnel with non-uniform cross-section

  • Li, Wenhui;Liu, Tanghong;Huo, Xiaoshuai;Guo, Zijian;Xia, Yutao
    • Wind and Structures
    • /
    • v.35 no.4
    • /
    • pp.269-285
    • /
    • 2022
  • The pressure-mitigating effects of a high-speed train passing through a tunnel with a partially reduced cross-section are investigated via the numerical approach. A compressible, three-dimensional RNG k-ε turbulence model and a hybrid mesh strategy are adopted to reproduce that event, which is validated by the moving model test. Three step-like tunnel forms and two additional transitions at the tunnel junction are proposed and their aerodynamic performance is compared and scrutinized with a constant cross-sectional tunnel as the benchmark. The results show that the tunnel step is unrelated to the pressure mitigation effects since the case of a double-step tunnel has no advantage in comparison to a single-step tunnel, but the excavated volume is an essential matter. The pressure peaks are reduced at different levels along with the increase of the excavated earth volume and the peaks are either fitted with power or logarithmic function relationships. In addition, the Arc and Oblique-transitions have very limited gaps, and their pressure curves are identical to each other, whereas the Rec-transition leads to relatively lower pressure peaks in CPmax, CPmin, and ΔCP, with 5.2%, 4.0%, and 4.1% relieved compared with Oblique-transition. This study could provide guidance for the design of the novel railway tunnel.

Performance Comparison of Synchronization Methods for CC-NUMA Systems (CC-NUMA 시스템에서의 동기화 기법에 대한 성능 비교)

  • Moon, Eui-Sun;Jhang, Seong-Tae;Jhon, Chu-Shik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.4
    • /
    • pp.394-400
    • /
    • 2000
  • The main goal of synchronization is to guarantee exclusive access to shared data and critical sections, and then it makes parallel programs work correctly and reliably. Exclusive access restricts parallelism of parallel programs, therefor efficient synchronization is essential to achieve high performance in shared-memory parallel programs. Many techniques are devised for efficient synchronization, which utilize features of systems and applications. This paper shows the simulation results that existing synchronization methods have inefficiency under CC-NUMA(Cache Coherent Non-Uniform Memory Access) system, and then compares the performance of Freeze&Melt synchronization that can remove the inefficiency. The simulation results present that Test-and-Test&Set synchronization has inefficiency caused by broadcast operation and the pre-defined order of Queue-On-Lock-Bit (QOLB) synchronization to execute a critical section causes inefficiency. Freeze&Melt synchronization, which removes these inefficiencies, has performance gain by decreasing the waiting time to execute a critical section and the execution time of a critical section, and by reducing the traffic between clusters.

  • PDF

The Call Control Scheme for Multiple Cells CDMA System Under Non-Uniform Traffic Distribution (비균일 부하를 가진 다중 셀 CDMA시스템에서의 호 제어 기법)

  • 이동명
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.737-743
    • /
    • 2004
  • In this paper, we propose the call control scheme that can improve the capacity of the wireless system for the non-uniform traffic load distribution and the multiple types of services in multiple cells CDMA system. The number of mobile stations that can be served simultaneously in a base station is limited by the amount of total interference received in CDMA system. Further, the average number of mobile stations in each cell may not be uniformly distributed. Considering this factors, the call admission control scheme using the effective bandwidth concept is adapted in this paper. Thus, the bandwidth for a new call can be varied dynamically for reducing the blocking rate of new calls and the dropping rate of handoff calls. The suggested call control scheme is experimented through a simulation by dynamically assigning the bandwidth to new and handoff calls. The simulation results show that the proposed call control scheme can accommodate more mobile stations than the other methods in multiple cells environment.

  • PDF

A study of Routing algorithm of USN for the Telemedicine (원격의료지원을 위한 USN 라우팅 알고리즘에 대한 연구)

  • Yun, Chan-Young
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.11a
    • /
    • pp.716-720
    • /
    • 2006
  • In this paper, we designed and proposed new routing algorithm that can support a variety of vital-sign traffic characteristic and could be applicable to USN for telemedicine by using adaptive transmission power level and increase frequency of routing request message. In proposed routing algorithm, when an emergency vital-sign traffic is applied, we use large transmission power to reduce route query response time and make the priority order in route process. On the other hand, for non emergency vital-sign traffic, we use low transmission power and adaptive decrease frequency of routing request message. which is insensitive to delay. The proposed scheme should be better QoS performance in complex USN than conventional method, which is performed based on uniform transmission power level.

  • PDF

p-Persistent MAC Protocol for WDM Ring Networks

  • So, Won-Ho;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9B
    • /
    • pp.589-597
    • /
    • 2007
  • In this paper, a WDM metro ring consisting of access nodes with $FT-FR^n$ (Fixed Transmitter - n Fixed Receivers) is considered. A trade-off exists between node throughput and transmission fairness because the access nodes share wavelength channels. In order to eliminate the transmission unfairness and to increase throughput, the p-persistent medium access control (MAC) protocol is proposed: each node uses an empty optical slot to transmit a packet and make it available with the extraction of a transferred packet at the source access node, called source-stripping. The local empty slot can be used to transfer a head-of-line packet in the local buffer with probability p or it is used for the next downstream nodes with 1-p. The proposed MAC protocol provides better node throughput than the non-persistent protocol and exhibits better fairness index than the 1-persistent protocol in WDM ring networks. In addition, numerical analysis shows that the proposed MAC protocol maximizes the node throughput under uniform traffic conditions. For more detailed results, we use the network simulation under Poisson and self-similar traffic. Furthermore, unpredictable traffic constructed by the combination of the former and the latter is also considered. The reasonable probability of the p-persistent protocol for a given architecture can be determined through simulation.

Uniform Fractional Band CAC Scheme for QoS Provisioning in Wireless Networks

  • Rahman, Md. Asadur;Chowdhury, Mostafa Zaman;Jang, Yeong Min
    • Journal of Information Processing Systems
    • /
    • v.11 no.4
    • /
    • pp.583-600
    • /
    • 2015
  • Generally, the wireless network provides priority to handover calls instead of new calls to maintain its quality of service (QoS). Because of this QoS provisioning, a call admission control (CAC) scheme is essential for the suitable management of limited radio resources of wireless networks to uphold different factors, such as new call blocking probability, handover call dropping probability, channel utilization, etc. Designing an optimal CAC scheme is still a challenging task due to having a number of considerable factors, such as new call blocking probability, handover call dropping probability, channel utilization, traffic rate, etc. Among existing CAC schemes such as, fixed guard band (FGB), fractional guard channel (FGC), limited fractional channel (LFC), and Uniform Fractional Channel (UFC), the LFC scheme is optimal considering the new call blocking and handover call dropping probability. However, this scheme does not consider channel utilization. In this paper, a CAC scheme, which is termed by a uniform fractional band (UFB) to overcome the limitations of existing schemes, is proposed. This scheme is oriented by priority and non-priority guard channels with a set of fractional channels instead of fractionizing the total channels like FGC and UFC schemes. These fractional channels in the UFB scheme accept new calls with a predefined uniform acceptance factor and assist the network in utilizing more channels. The mathematical models, operational benefits, and the limitations of existing CAC schemes are also discussed. Subsequently, we prepared a comparative study between the existing and proposed scheme in terms of the aforementioned QoS related factors. The numerical results we have obtained so far show that the proposed UFB scheme is an optimal CAC scheme in terms of QoS and resource utilization as compared to the existing schemes.

A Novel Adaptive Routing Algorithm for Delay-Sensitive Service in Multihop LEO Satellite Network

  • Liu, Liang;Zhang, Tao;Lu, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3551-3567
    • /
    • 2016
  • The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.

Dynamic Frequency Reuse Scheme Based on Traffic Load Ratio for Heterogeneous Cellular Networks (이종 셀룰러 네트워크 환경에서 트래픽 비율에 따른 동적 주파수 재사용 기법)

  • Chung, Sungmoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2539-2548
    • /
    • 2015
  • Overcoming inter-cell interference and spectrum scarcity are major issues in heterogeneous cellular networks. Static Frequency reuse schemes have been proposed as an effective way to manage the spectrum and reduce ICI(Inter cell Interference) in cellular networks. In a kind of static frequency reuse scheme, the allocations of transmission power and subcarriers in each cell are fixed prior to system deployment. This limits the potential performance of the static frequency reuse scheme. Also, most of dynamic frequency reuse schemes did not consider small cell and the network environment when the traffic load of each cell is heavy and non-uniform. In this paper, we propose an inter-cell resource allocation algorithm that dynamically optimizes subcarrier allocations for the multi-cell heterogeneous networks. The proposed dynamic frequency reuse scheme first finds the subcarrier usage in each cell-edge by using the exhaustive search and allocates subcarrier for all the cells except small cells. After that it allocates subcarrier for the small cell and then iteratively repeats the process. Proposed dynamic frequency reuse scheme performs better than previous frequency reuse schemes in terms of the throughput by improving the spectral efficiency due to it is able to adapt the network environment immediately when the traffic load of each cell is heavy and non-uniform.

Capacity Improvement with Dynamic Channel Assignment and Reuse Partitioning in Cellular Systems

  • Chen Steven Li;Chong Peter Han Joo
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.13-20
    • /
    • 2006
  • In cellular mobile communications, how to achieve optimum system capacity with limited frequency spectrum is one of the main research issues. Many dynamic channel assignment (DCA) schemes have been proposed and studied to allocate the channels more efficiently, thus, the capacity of cellular systems is improved. Reuse partitioning (RP) is another technique to achieve higher capacity by reducing the overall reuse distance. In this paper, we present a network-based DCA scheme with the implementation of RP technique, namely dynamic reuse partitioning with interference information (DRP-WI). The scheme aims to minimize the effect of assigned channels on the availability of channels for use in the interfering cells and to reduce their overall reuse distances. The performance of DRP-WI is measured in terms of blocking probability and system capacity. Simulation results have confirmed the effectiveness of DRP-WI scheme. Under both uniform and non-uniform traffic distributions, DRP-WI exhibits outstanding performance in improving the system capacity. It can provide about 100% capacity improvement as compared to conventional fixed channel assignment scheme with 70 system channels.