• Title/Summary/Keyword: non-realtime simulation

Search Result 30, Processing Time 0.031 seconds

Alternative LSP Allocation for Considering QoS in MPLS Networks (MPLS 망에서 QoS를 고려한 복구경로 할당)

  • 양형규;이병호
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.5
    • /
    • pp.11-18
    • /
    • 2004
  • In this paper, we propose the alternative LSP allocation for MPLS networks required more confidence. In the first place, we must classify the user traffics by the QoS parameter. We assigned altermative LSPs on realtime traffics and then allocated alternative LSPs of non-realtime traffics. The proposed algorithm can provide more confidential alternative LSP by priority method for relatively high cost realtime traffic error. And the proposed algorithm can improve the shortage of network resources what is occured by using a few links when altermative LSPs are setup. The validity of the proposed algorithm has been justified in performance by analysis through simulation results using the program tool and comparison with conventional methods. Also, that improves 9% more than existing method in the recovery ratio-one is 89%, the other is 98%, respectively.

Opportunistic Scheduling with QoS Constraints for Multiclass Services HSUPA System

  • Liao, Dan;Li, Lemin
    • ETRI Journal
    • /
    • v.29 no.2
    • /
    • pp.201-211
    • /
    • 2007
  • This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

  • PDF

Multimedia Service Scheduling Algorithm for OFDMA Downlink (OFDMA 다운링크를 위한 멀티미디어 서비스 스케줄링 알고리즘)

  • Jang, Bong-Seog
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.2
    • /
    • pp.9-16
    • /
    • 2006
  • This paper proposes a scheduling algorithm for efficiently processing multimedia pakcet services in OFDMA physical system of the future broadband wireless access networks. The scheduling algorithm uses wireless channel state estimation, and allocates transmission rates after deciding transmission ordering based on class and priority policy. As the result, the proposed scheduling algorithm offers maximum throughput and minimum jitter for realtime services, and fairness for non-realtime services. In simulation study, the proposed algorithm proves superior performances than traditional round robin method.

  • PDF

Resource Allocation Based on the Type of Handovers in Overlaid Macro-Femto Networks

  • Lee, Jong-Chan;Lee, Moon-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.1
    • /
    • pp.49-57
    • /
    • 2016
  • In this paper we propose the resource allocation scheme for the overlaid macro-femtocell networks, which considers the type of handovers such as the inter-macrocell, macrocell-to-femtocell, femtocell-to-macrocell, or inter-femtocell in order to guarantee Quality of Service (QoS) and expand the accommodation capacity. Our proposed scheme takes into account the movement of mobile terminals, the QoS degradation, or the load control which trigger handovers in the overlaid networks, before it allocates resources dynamically. Moreover it considers QoS requirements of realtime or non-realtime mobile multimedia services such as video communication, Video on Demand (VoD) and dataa services. Simulation results show that our scheme provides better performances than the conventional one with respect to the outage probability, data transmission throughput and handover failure rate.

Dynamic Frequency Allocation in OFDMA Cellular Networks (OFDMA 셀룰러 망에서 동적 주파수 할당 방법)

  • Lee, Jong-Chan;Lee, Gi-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.6
    • /
    • pp.2992-2998
    • /
    • 2013
  • The future mobile communication system can support not only voice but also multimedia applications such as data, image and video. It requires greater resources than the voice-oriented mobile system. We propose user and sub-channel priority based resource allocation for mobile multimedia services in the OFDMA systems. Our method is able to guarantee QoS continuity of realtime services and carry the maximum number of non-realtime subscriber. Simulation is focused on total throughput and blocking rate. The simulation results show that our proposed method provides a better performance than the conventional method.

Policy-based End-to-End QoS Provision for 3G Networks Using DiffServ-aware MPLS (3G 네트워크상에서 정책기반 End-to-End QoS 지원을 위한 DiffServ-aware MPLS)

  • Choi Sung-Gu;Jun Kyung-Koo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.349-354
    • /
    • 2006
  • In 3G networks interworking with external IP-based networks, provision of end-to-end QoS to packet-based services is a critical issue. In this paper, we propose DiffServ-aware Multiple Protocol Label Switching(MPLS) as a new policy enforcement means. With the adoption of the proposed DiffServ-aware MPLS, it is feasible to provide differentiated QoS provision with the help of DiffServ as well as to improve network utilization by using multiple paths based on MPLS. We verify the effectiveness of our proposed policy enforcement means through a simulation in which realtime traffic and non-realtime traffic are served together.

BDLR:A New Routing Algorithm for ISPN (통합 서비스 패킷 망을 위한 BDLR 라우팅 알고리즘)

  • Cha, Mi-Lee;Lee, Gwang-Il;Park, Nam-Hun;Kim, Sang-Ha
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.5
    • /
    • pp.1308-1318
    • /
    • 1997
  • This paper proposes a new touthind algorithm, the Bandwidth-Delay-Loss based Routing(BDLR) algotithm, which supports the selection of an effcienet routing path by cinsidering the characteristics and QoS requirements of intergarted servies over the Untegrated Serives Packet Network(ISPN), and also compareas it with other touting algorithms by simulating their perfomances on the various combinations of the realtime and non-realtime traffic over the ISPN. The simulation shows that the BDLR algorithm takes great advantages on transmisson dealy, the satisfiability of QoS requirements, and the adapation of traffic envirment over the other routing algorithms priposed for ISPN until now.

  • PDF

Improvement of Handoff-state and QOS in Wireless Environment

  • Jeong, You-Sun;Choe, U-Gin
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.1
    • /
    • pp.1-5
    • /
    • 2010
  • In this paper, we propose for improving QoS in wireless micro cellular network using Cellular-IP/PRC(Paging Route Cache) with Paging Cache and Route Cache in Cellular-IP and propose for performance of realtime and non-real time handoff service using Handoff state machine Paging Route Cache. Although the Cellular-IP/PRC technology is devised for mobile internet communication, it bas its vulnerability in frequent handoff environment. On the other hand, Cellular IP combines the capability of cellular networks to provide high performance handoff and efficient location management of active and idle mobile users with the inherent flexibility, robustness and scalability found in IP networks. Also Cellular-IP/PRC use semi-soft handoff. During semi-soft hand off a mobile host may be in contact with either of the old and new base stations and receive packets from them. Packets intended to the mobile node are sent to both base stations and buffered, so when the mobile host eventually moves to the new location it can continue to receive packets without interruption. It should be suitable for realtime service such as multimedia traffic. But, much waste of resource will occur in this method, especially for non-real time services such as FTP and E-mail. Therefore, a new algorithm that performs different handoff according to characteristic of each traffic by use of reserved field in IP packet is proposed in this thesis. This hand off state machine using differentiated handoff improves quality of services in Cellular-IP/PRC. Suggested algorithm shows better performance than existing technology in wireless mobile internet communication environment. Matlab simulation results are improving QoS, show call drop and call blocking provided to Paging Router Cache during handoff state machine in Cellular-IP/PRC.

QoS aware Multi-class scheduler in WiMAX System (WiMAX 시스템에서 QoS에 기반한 Multi-Class 스케줄러)

  • Lee, Ju-Hyeon;Park, Hyung-Kun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.4
    • /
    • pp.820-822
    • /
    • 2010
  • Mobile WiMAX system provides various classes of traffic such as real-time and non-realtime services. These services have different QoS requirements and the QoS aware scheduling has been an important issue. Although many of scheduling algorithms for various services in OFDMA system have been proposed, it is needed to be modified to be applied to Mobile WiMAX system. Since Mobile WiMAX supports five kinds of service classes, it is important to take QoS characteristics of each class into consideration. In this paper, we propose an efficient packet scheduling algorithm to support QoS of each class. Proposed scheme selects a service class first considering QoS Characteristics of each class and choose an appropriate user in the selected class. Simulation results show that the proposed algorithm has better performance than the other algorithm.