• Title/Summary/Keyword: requirements to QoS

Search Result 391, Processing Time 0.029 seconds

Backoff Algorithm to improve DCF functionality in IEEE 802.11 (IEEE 802.11에서 DCF 성능 향상을 위한 백오프 알고리즘)

  • Nam, Jae-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.796-798
    • /
    • 2011
  • The IEEE 802.11 MAC uses DCF for media access among the participating network nodes. But DCF alone is neither capable nor suitable for fulfilling the QoS requirements of realtime applications. There are many ways in which QoS is provided by modifying DCF based MAC. This paper proposes (m,k)-collision scheme which is based on IEEE 802.11 and (m,k)-firm scheme tries to improve DCF functionality. The proposed scheme uses different Contention Window according to the number of collision in the node. The simulation result shows that the proposed scheme helps improve the throughput of the DCF.

  • PDF

An Adaptive Hot-spot Operating Scheme in Vertically Overlaid OFDMA Wireless Systems (수직적으로 겹쳐진 OFDMA 무선 시스템에서의 적응적 Hot-spot 운용 기법)

  • Choi Hye-Sun;Chung Hee-Jeong;Kim Nak-Myeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7A
    • /
    • pp.620-627
    • /
    • 2005
  • We develop an adaptive hot-spot operating scheme(AHOS) to mitigate the negative effects from the nonuniform distribution of user location and the variation in the mixture of QoS requirements in OFDMA downlink systems. The base station in a macrocell can control the operation of picocells within the cell, and turns on or off according to the changes in the estimated user outage probability and the AHOS gain parameter. With the computer simulation, the AHOS has been proved to maximize the system throughput while maintaining the QoS outage probability very low under various system scenarios.

IMT-2000 Packet Data Processing Method utilizing MPLS (MPLS망을 적용한 IMT2000 시스템에서의 패킷 데이터 처리 절차)

  • Yu, Jae-Pil;Kim, Gi-Cheon;Lee, Yun-Ju
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11S
    • /
    • pp.3190-3198
    • /
    • 1999
  • Because of the rapid growth of the mobile communication, the need for the mobile internet access has grown up as well. since the current mobile communication network, however, is optimized for a voice communication system, which exclusively occupies a channel for a given time, it is not suitable for variable rate packet data. In order to support the mobile internet access, it is essential do design a reasonable packet switching network which supports the mobility. Since mobile packet network has longer latency, high speed switching and QoS are required to meet the user's requirements. In this paper, we suggest an resonable way to construct a network and its operation procedures utilizing GPRS(General Packet Radio Service) network and MPLS(Multi Protocol Label Switching) to provide a high speed switching and QoS mobile internet access. GPRS is used as a network which supports the mobility and MPLS guarantees the QoS and high speed IP protocol transmission based on the ATM switching technology.

  • PDF

A Graph-based Model for RSUs Deployment in Vehicular Networks by Considering Urban and Network Limitations and QoS Requirements of Service Advertisement and Discovery

  • Balouchzahi, Nik Mohammad;Fathy, Mahmood;Akbari, Ahmad
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1662-1681
    • /
    • 2015
  • The efficient send and receive of information in VANET improves the efficiency of the safety and traffic services advertisment and discovery. However, if the V2V is the only communication system used, the restrictions of the urban environment and network drop the performance of VANET. In order to improve the performance of the network, it is necessary to use V2I communication as well as V2V communication. Therefore, RSUs must be placed in the environment. However due to the high costs of placement, the full coverage of the environment would not be possible. Therefore, it is necessary to optimally install a limited number of RSUs in the environment.

A Study on The Performance Evaluation of Differentiated Service Using Time Sliding Window with 3 Color Marking (3 색 표식을 갖는 타임 슬라이딩 윈도우를 사용하는 차등화 서비스의 성능평가 연구)

  • Chun, Sang-Hun
    • 전자공학회논문지 IE
    • /
    • v.48 no.3
    • /
    • pp.16-19
    • /
    • 2011
  • Differentiated Service is an IP QoS ensuring method based on packet marking that allows packets to be prioritized according to user requirements. During the time of congestion, more low priority packets are dropped than high priority packets. Different policy models are used to determine how to mark the packet. This paper investigated the performance of Differentiated Service using time sliding window with 3 color marking (TSW3CM). Simulation results using NS-2 showed that Differentiated Service can provide the quality of service requirements.

A Packet Scheduling Algorithm for High-speed Portable Internet System (휴대 인터넷 시스템에서의 패킷 스케줄링 알고리즘 연구)

  • Choi, Seong-Hoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.1
    • /
    • pp.59-65
    • /
    • 2007
  • HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

Fast Selection of Composite Web Services Based on Workflow Partition (워크플로우 분할에 기반한 복합 웹 서비스의 빠른 선택)

  • Jang, Jae-Ho;Shin, Dong-Hoon;Lee, Kyong-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.5
    • /
    • pp.431-446
    • /
    • 2007
  • Executable composite Web services are selected by binding a given abstract workflow with the specific Web services that satisfy given QoS requirements. Considering the rapidly increasing number of Web services and their highly dynamic QoS environment, the fast selection of composite services is important. This paper presents a method for quality driven comosite Web services selection based on a workflow partition strategy. The proposed method partitions an abstract workflow into two sub-workflows to decrease the number of candidate services that should be considered. The QoS requirement is also decomposed for each partitioned workflow. Since the decomposition of a QoS requirement is based on heuristics, the selection might fail to find composite Web services. To avoid such a failure, the tightness of a QoS requirement is defined and a workflow is determined to be partitioned according to the tightness. A mixed integer linear programming is utilized for the efficient service selection. Experimental results show that the success rate of partitioning is above 99%. Particularly, the proposed method performs faster and selects composite services whose qualities are not significantly different (less than 5%) from the optimal one.

QoS Constrained Optimization of Cell Association and Resource Allocation for Load Balancing in Downlink Heterogeneous Cellular Networks

  • Su, Gongchao;Chen, Bin;Lin, Xiaohui;Wang, Hui;Li, Lemin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1569-1586
    • /
    • 2015
  • This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem with cardinality constraints. A reweighted heuristic l1-norm regularization method is used to obtain a sparse solution to the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for users.

Kernel Level Power Management Solution for Multi-Core (멀티코어 환경에서 커널 수준의 전력 관리 솔루션)

  • Ahn, Youngho;Hwang, Young-Si;Chung, Ki-Seok
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.4 no.2
    • /
    • pp.50-54
    • /
    • 2009
  • In this paper, we address a novel system-level power management technique which is specifically targeted for an ARM 11 MPCore system. Our proposed solution is a DPM technique which includes process monitoring, real time power analysis, and policy application to reduce the power consumption while meeting the performance requirement. One of the main contributions of this paper is that we systematically infer QoS requirements of processes without getting any additional information from the application. When multiple processes are running under various user level policies, priorities of the policy application are determined in such a way that the overall system performance is maintained while power consumption is effectively managed. Experimental results show that our DPM technique is very effective in reducing power consumption without violating system's QoS requirements.

  • PDF

Uplink Resource Management Scheme for Multiple QoS Traffics in cdma2000 type Networks: Modified Weighted G-Fair Scheduler with RoT Filling (cdma2000-type 네트워크의 역방향 링크에서의 다중 QoS 서비스 보장을 위한 자원 관리 기술: Modified Weighted G-Fair 스케줄러)

  • 기영민;김은선;김동구
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.786-793
    • /
    • 2004
  • Autonomous data rate control scheme of current IxEV-DO uplink networks can not supper the various QoS requirements of heterogeneous traffics nor hold rise-over-thermal OtoT) constraints. In this paper, an uplink resource management scheme called the modified weighted g-fair (MWGF) scheduler with RoT filling is proposed and evaluated for heterogeneous traffics in cdma2000 type uplink networks. The proposed scheme belongs to a family of centralized resource management schemes and offers QoS guarantee by using priority metrics as well as lower system loading by holding RoT constraints using RoT filling method. With some case-study simulations, the proposed algorithms shows lower average delays of real time users compared to that of autonomous rate control by 29 - 40 %. It also shows the 1.0 - 1.3 dB lower received RoT level than autonomous rate control schemes, leading to lower network loading.