Loading [MathJax]/jax/output/CommonHTML/jax.js
  • Title/Summary/Keyword: Traffic Adaptive

Search Result 504, Processing Time 0.091 seconds

Adaptive Packet Scheduling Scheme for Enhancing the PSM Performance of Mobile Devices (모바일 단말의 PSM 성능 향상을 위한 적응적 패킷 스케줄링 기법)

  • Park, Young Deok;Jung, Kyoung-Hak;Suh, Young-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.8
    • /
    • pp.623-631
    • /
    • 2013
  • Wireless LAN (WLAN) interface is one of the major sources drastically depleting the battery power of mobile devices such as smartphones and tablets. Most commercial mobile devices employ a power saving technique putting their WLAN interface into a sleep state when there is no network traffic, and thereby, save the battery power. However, since an access point (AP) just transmits the packet(s) received from a server to the corresponding mobile device immediately, it may cause a problem that the mobile device constantly remains in an awake state so that its battery power is rapidly drained. In this paper, we point out this problem and propose a new scheme that can save the mobile device's battery power with an adaptive packet scheduling at the AP side. From the experimental results based on a testbed, we found that the proposed scheme outperforms existing schemes over 50% in terms of power saving.

Performance Analysis of IPACT MAC Protocol for Gigabit Ethernet-PON (Gigabit Ethernet-PON을 위한 IPACT 매체접근제어 방식의 성능분석)

  • Shin Ji hye;Lee Jae yong;Kim Byung chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3B
    • /
    • pp.114-129
    • /
    • 2005
  • In this paper, we examine Interleaved Polling with Adaptive Cycle Time (IPACT) algorithm which was proposed to control upstream traffic for Gigabit Ethernet-PONs, and we analyze the performance of the gated service and the limited service of the IPACT mathematically. For the mathematical performance analysis, we model IPACT algorithm as a polling system and use mean-value analysis. We divide arrival rate λ value into three regions and analyze each region accordingly. We obtain average packet delay, average queue size and average cycle time of both the gated and the limited service. We compare analytical results with simulation to verify the accuracy of the mathematical analysis. Upon now, simulation analysis have been used to evaluate the performance of EPONs, which require much time sud effort. Mathematical analysis can be widely used in the design of EPON systems since system designers can obtain various performance results rapidly.

Performance Of Adaptive and Fixed Step Size Power Control Schemes Accommodating Integrated Voice/Video/Data in Wireless Cellular Systems (무선 셀룰라 시스템의 통합된 서비스를 수용하기 위한 적응 및 고정 스텝 크기 전력제어 방법의 성능분석)

  • Kim Jeong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1A
    • /
    • pp.9-17
    • /
    • 2004
  • Adapt ive and fixed step size PC (power control) schemes for accommodating voice, video, and data are evaluated according to the different PC command rates and their effects on integrated Voice/Video/Data are investigated. The required minimum power levels are derived as PC thresholds and the effects of PC errors on channel quality and radio 1 ink capacity are investigated. The services with high bit rates and low bit error rates can cause a significant effect on the radio link qualifies of the other types of traffic. The results show that the adapt ive step size PC scheme for voice/video/data services can achieve more capacity and cause less interference to the radio channels because less minimum PIL(Power Increment Level) is required for the specified radio link outage probability.

A Video Streaming Adaptive Packet Pre-marker in DiffServ Networks (DiffServ 네트워크에서 비디오 스트리밍을 위한 적응적 트래픽 마커 알고리듬 연구)

  • Jung, Young-H.;Kang, Young-Wook;Choe, Yoon-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12B
    • /
    • pp.735-742
    • /
    • 2007
  • We propose an effective packet marking algorithm for video streaming in DiffServ network. Because legacy packet markers such as srTCM(single rate three color marker) cannot distinguish the importance of packet, these markers can cause quality degradation of streaming during the network congestion period. Recently proposed TMS (Two Marker System) [4] shows effectiveness in such scenario that video streaming service is struggling with other types of service traffic. However, if many video streaming services co-exist in DiffServ network and result in competition among themselves, then both legacy packet markers and even TMS cannot prevent drastic streaming quality degradation. To cope with this, we suggest A-TCPM (Adaptive time sliding window Three Color Marker) algorithm. In this algorithm, an A-TCPM module decides the color of a racket based upon the probability which is lead by current channel status and frame importance ratio. Simulation results show that proposed A-TCPM algorithm can enhance streaming service quality especially when overbooked video streaming sessions struggle with themselves.

An Effective Location-based Packet Scheduling Scheme for Adaptive Tactical Wireless Mesh Network (무선 메쉬 네트워크의 군 환경 적용을 위한 효율적인 위치기반 패킷 스케줄링 방식)

  • Kim, Young-An;Hong, Choong-Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12B
    • /
    • pp.719-727
    • /
    • 2007
  • The Wireless Mesh Network technology is able to provide an infrastructure for isolated islands, in which it is difficult to install cables or wide area such as battlefield of armed forces. Therefore, Wireless Mesh Network is frequently used to satisfy needs for internet connection and active studies and research on them are in progress However, as a result of increase in number of hops under hop-by-hop communication environment has caused a significant decrease in throughput and an increase in delay. Considering the heavy traffic of real-time data, such as voice or moving pictures to adaptive WMN, in a military environment, it is restricted for remote units to have their Mesh Node to get real-time services. Such phenomenon might cause an issue in fairness. In order to resolve this issue, the Location-based Packet Scheduling Scheme, which can provide an fair QoS to each mesh node that is connected to each echelon's AP and operates based on WRR method that gives a priority to emergency message and control packet. The performance of this scheme is validated.

A Study on Adaptive Queue Management Algorithm Considering Characteristics of Multimedia Data (멀티미디어 데이터 특성을 고려한 동적 큐 관리 알고리즘 연구)

  • Kim, Ji-Won;Yun, Jeong-Hee;Jang, Eun-Mee;Choi, Sang-Bang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.6
    • /
    • pp.140-148
    • /
    • 2011
  • Multimedia streaming service is susceptible to loss and delay of data as it requires high bandwidth and real time processing. Therefore QoS cannot be guaranteed due to data loss caused by heavy network traffic. To deal with these problems, a study on algorithm that can provide high quality multimedia service by considering both network congestion and characteristics of multimedia data is required. In this paper, we propose APQM algorithm which probabilistically removes packet by the congestion level of the queue in wireless station. The comparison with other existing scheduling algorithms shows tht congestion in the network is reduced and multimedia service quality of the proposed algorithm is improved.

Adaptive Dynamic Slot Assignment of VBR Traffics Using In-band Parameters in Wireless ATM (무선 ATM에서 In-Band 파라미터를 이용한 VBR 트래픽의 적응적 슬롯 할당)

  • Paek, Jong-Il;Jun, Chan-Yong;Kim, Young-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.7
    • /
    • pp.30-37
    • /
    • 2002
  • In this paper, we propose a new adaptive slot assignment algorithm called In-VDSA in order to guarantee the QoS(Quality of Service) of VBR(Variable Bit Rate) traffics in wireless ATM and maximize efficiency in use of wireless channels. In the proposed algorithm, the status of terminal buffers is encoded in signed number on the GFC(Generic Flow Control) field of an ATM cell header and piggybacked. And also, the number of slots to be assigned to the next frame is adjusted effectively, which is different to methods in the conventional slot assignment algorithms. As a result, we can guarantee QoS such as CLR(Cell Loss Rate) and cell delay and achieve the higher utilization of channels. The validity of the proposed algorithm has been justified in performance by analysis through simulation results using the BONeS tool and comparison with conventional methods.

Adaptive User Selection in Downlink Multi-User MIMO Networks (다중 사용자 및 다중 안테나 하향링크 네트워크에서 적응적 사용자 선택 기법)

  • Ban, Tae-Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.7
    • /
    • pp.1597-1601
    • /
    • 2013
  • Multiple antenna technique is attracting attention as a core technology for next-generation mobile communication systems to accommodate explosively increasing mobile data traffic. Especially, recent researches focus on multi-user multiple input multiple output (MU-MIMO) system where base stations are equipped with several tens of transmit antennas and transmit data to multiple terminals (users) simultaneously. To enhance the performance of MU-MIMO systems, we, in this paper, propose an adaptive user selection algorithm which adaptively selects a user set according to varying channel states. According to Monte-Carlo based computer simulations, the performance of proposed scheme is significantly improved compared to the conventional scheme without user selection and approaches that of exhaustive search-based optimal scheme. On the other hand, the proposed scheme can reduce the computational complexity to K/(2K1) compared to the optimal scheme where K denotes the number of total users.

Performance Analysis of Adaptive RS Coverage Extension Scheme for the MMR systems (MMR 시스템을 위한 적응적인 RS 커버리지 확장 기법의 성능 분석)

  • Kim, Seung-Yeon;Kim, Se-Jin;Lee, Hyong-Woo;Ryu, Seung-Wan;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4B
    • /
    • pp.584-591
    • /
    • 2010
  • In this paper, we propose an adaptive Relay Station (RS) coverage extension scheme for the Mobile Multi-hop Relay (MMR) systems. The MMR system with a non-transparent mode RS can be used to extend BS coverage using the remaining capacity of the Base Station(BS). Thus, the call blocking may occur in RSs when calls arrive very often in Multi-hop Relay Base Station (MR-BS). In the proposed scheme, RSs can be connected to the neighbor MMR system as the 2ndtier RSs if the neighbor MMR system services low traffic load when calls are frequently arrived in MR-BS or RSs. By doing so, the MMR system can accept a new call without call blocking. Through numerical results, we demonstrate that the proposed scheme outperforms the conventional MMR system in terms of the throughput and call blocking probability of MMR systems.

An Adaptive Cache Replacement Policy for Web Proxy Servers (웹 프락시 서버를 위한 적응형 캐시 교체 정책)

  • Choi, Seung-Lak;Kim, Mi-Young;Park, Chang-Sup;Cho, Dae-Hyun;Lee, Yoon-Joon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.6
    • /
    • pp.346-353
    • /
    • 2002
  • The explosive increase of World Wide Web usage has incurred significant amount of network traffic and server load. To overcome these problems, web proxy caching replicates frequently requested documents in the web proxy closer to the users. Cache utilization depends on the replacement policy which tries to store frequently requested documents in near future. Temporal locality and Zipf frequency distribution, which are commonly observed in web proxy workloads, are considered as the important properties to predict the popularity of documents. In this paper, we propose a novel cache replacement policy, called Adaptive LFU (ALFU), which incorporates 1) Zipf frequency distribution by utilizing LFU and 2) temporal locality adaptively by measuring the amount of the popularity reduction of documents as time passed efficiently. We evaluate the performance of ALFU by comparing it to other policies via trace-driven simulation. Experimental results show that ALFU outperforms other policies.