• Title/Summary/Keyword: Traffic Offloading

Search Result 26, Processing Time 0.03 seconds

Traffic Offloading Algorithm Using Social Context in MEC Environment (MEC 환경에서의 Social Context를 이용한 트래픽 오프로딩 알고리즘)

  • Cheon, Hye-Rim;Lee, Seung-Que;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.514-522
    • /
    • 2017
  • Traffic offloading is a promising solution to solve the explosive growth of mobile traffic. One of offloading schemes, in LIPA/SIPTO(Local IP Access and Selected IP Traffic Offload) offloading, we can offload mobile traffic that can satisfy QoS requirement for application. In addition, it is necessary for traffic offloading using social context due to large traffic from SNS. Thus, we propose the LIPA/SIPTO offloading algorithm using social context. We define the application selection probability using social context, the application popularity. Then, we find the optimal offloading weighting factor to maximize the QoS(Quality of Service) of small cell users in term of effective data rate. Finally, we determine the offloading ratio by this application selection probability and optimal offloading weighting factor. By performance analysis, the effective data rate achievement ratio of the proposed algorithm is similar with the conventional one although the total offloading ratio of the proposed algorithm is about 46 percent of the conventional one.

Flow Prediction-Based Dynamic Clustering Method for Traffic Distribution in Edge Computing (엣지 컴퓨팅에서 트래픽 분산을 위한 흐름 예측 기반 동적 클러스터링 기법)

  • Lee, Chang Woo
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.8
    • /
    • pp.1136-1140
    • /
    • 2022
  • This paper is a method for efficient traffic prediction in mobile edge computing, where many studies have recently been conducted. For distributed processing in mobile edge computing, tasks offloading from each mobile edge must be processed within the limited computing power of the edge. As a result, in the mobile nodes, it is necessary to efficiently select the surrounding edge server in consideration of performance dynamically. This paper aims to suggest the efficient clustering method by selecting edges in a cloud environment and predicting mobile traffic. Then, our dynamic clustering method is to reduce offloading overload to the edge server when offloading required by mobile terminals affects the performance of the edge server compared with the existing offloading schemes.

Socially Aware Device-to-multi-device User Grouping for Popular Content Distribution

  • Liu, Jianlong;Zhou, Wen'an;Lin, Lixia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.11
    • /
    • pp.4372-4394
    • /
    • 2020
  • The distribution of popular videos incurs a large amount of traffic at the base stations (BS) of networks. Device-to-multi-device (D2MD) communication has emerged an efficient radio access technology for offloading BS traffic in recent years. However, traditional studies have focused on synchronous user requests whereas asynchronous user requests are more common. Hence, offloading BS traffic in case of asynchronous user requests while considering their time-varying characteristics and the quality of experience (QoE) of video request users (VRUs) is a pressing problem. This paper uses social stability (SS) and video loading duration (VLD)-tolerant property to group VRUs and seed users (SUs) to offload BS traffic. We define the average amount of data transmission (AADT) to measure the network's capacity for offloading BS traffic. Based on this, we formulate a time-varying bipartite graph matching optimization problem. We decouple the problem into two subproblems which can be solved separately in terms of time and space. Then, we propose the socially aware D2MD user selection (SA-D2MD-S) algorithm based on finite horizon optimal stopping theory, and propose the SA-D2MD user matching (SA-D2MD-M) algorithm to solve the two subproblems. The results of simulations show that our algorithms outperform prevalent algorithms.

Cellular Traffic Offloading through Opportunistic Communications Based on Human Mobility

  • Li, Zhigang;Shi, Yan;Chen, Shanzhi;Zhao, Jingwen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.872-885
    • /
    • 2015
  • The rapid increase of smart mobile devices and mobile applications has led to explosive growth of data traffic in cellular network. Offloading data traffic becomes one of the most urgent technical problems. Recent work has proposed to exploit opportunistic communications to offload cellular traffic for mobile data dissemination services, especially for accepting large delayed data. The basic idea is to deliver the data to only part of subscribers (called target-nodes) via the cellular network, and allow target-nodes to disseminate the data through opportunistic communications. Human mobility shows temporal and spatial characteristics and predictability, which can be used as effective guidance efficient opportunistic communication. Therefore, based on the regularity of human mobility we propose NodeRank algorithm which uses the encounter characteristics between nodes to choose target nodes. Different from the existing work which only using encounter frequency, NodeRank algorithm combined the contact time and inter-contact time meanwhile to ensure integrity and availability of message delivery. The simulation results based on real-world mobility traces show the performance advantages of NodeRank in offloading efficiency and network redundant copies.

Combinatorial Auction-Based Two-Stage Matching Mechanism for Mobile Data Offloading

  • Wang, Gang;Yang, Zhao;Yuan, Cangzhou;Liu, Peizhen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2811-2830
    • /
    • 2017
  • In this paper, we study the problem of mobile data offloading for a network that contains multiple mobile network operators (MNOs), multiple WiFi or femtocell access points (APs) and multiple mobile users (MUs). MNOs offload their subscribed MUs' data traffic by leasing the unused Internet connection bandwidth of third party APs. We propose a combinatorial auction-based two-stage matching mechanism comprised of MU-AP matching and AP-MNO matching. The MU-AP matching is designed to match the MUs to APs in order to maximize the total offloading data traffic and achieve better MU satisfaction. Conversely, for AP-MNO matching, MNOs compete for APs' service using the Nash bargaining solution (NBS) and the Vickrey auction theories and, in turn, APs will receive monetary compensation. We demonstrated that the proposed mechanism converges to a distributed stable matching result. Numerical results demonstrate that the proposed algorithm well capture the tradeoff among the total data traffic, social welfare and the QoS of MUs compared to other schemes. Moreover, the proposed mechanism can considerably offload the total data traffic and improve the network social welfare with less computation complexity and communication overhead.

Traffic Offloading in Two-Tier Multi-Mode Small Cell Networks over Unlicensed Bands: A Hierarchical Learning Framework

  • Sun, Youming;Shao, Hongxiang;Liu, Xin;Zhang, Jian;Qiu, Junfei;Xu, Yuhua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4291-4310
    • /
    • 2015
  • This paper investigates the traffic offloading over unlicensed bands for two-tier multi-mode small cell networks. We formulate this problem as a Stackelberg game and apply a hierarchical learning framework to jointly maximize the utilities of both macro base station (MBS) and small base stations (SBSs). During the learning process, the MBS behaves as a leader and the SBSs are followers. A pricing mechanism is adopt by MBS and the price information is broadcasted to all SBSs by MBS firstly, then each SBS competes with other SBSs and takes its best response strategies to appropriately allocate the traffic load in licensed and unlicensed band in the sequel, taking the traffic flow payment charged by MBS into consideration. Then, we present a hierarchical Q-learning algorithm (HQL) to discover the Stackelberg equilibrium. Additionally, if some extra information can be obtained via feedback, we propose an improved hierarchical Q-learning algorithm (IHQL) to speed up the SBSs' learning process. Last but not the least, the convergence performance of the proposed two algorithms is analyzed. Numerical experiments are presented to validate the proposed schemes and show the effectiveness.

A Context-aware Task Offloading Scheme in Collaborative Vehicular Edge Computing Systems

  • Jin, Zilong;Zhang, Chengbo;Zhao, Guanzhe;Jin, Yuanfeng;Zhang, Lejun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.2
    • /
    • pp.383-403
    • /
    • 2021
  • With the development of mobile edge computing (MEC), some late-model application technologies, such as self-driving, augmented reality (AR) and traffic perception, emerge as the times require. Nevertheless, the high-latency and low-reliability of the traditional cloud computing solutions are difficult to meet the requirement of growing smart cars (SCs) with computing-intensive applications. Hence, this paper studies an efficient offloading decision and resource allocation scheme in collaborative vehicular edge computing networks with multiple SCs and multiple MEC servers to reduce latency. To solve this problem with effect, we propose a context-aware offloading strategy based on differential evolution algorithm (DE) by considering vehicle mobility, roadside units (RSUs) coverage, vehicle priority. On this basis, an autoregressive integrated moving average (ARIMA) model is employed to predict idle computing resources according to the base station traffic in different periods. Simulation results demonstrate that the practical performance of the context-aware vehicular task offloading (CAVTO) optimization scheme could reduce the system delay significantly.

A Study on MEC Network Application Functions for Autonomous Driving (자율주행을 위한 MEC 적용 기능의 연구)

  • Kang-Hyun Nam
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.3
    • /
    • pp.427-432
    • /
    • 2023
  • In this study, MEC (: Multi-access Edge Computing) proposes a cloud service network configuration for various tests of autonomous vehicles to which V2X (: Vehicle to Everything) is applied in Wave, LTE, and 5G networks and MEC App (: Application) applied V2X service function test verification of two domains (operator (KT, SKT, LG U+), network type (Wave, LTE (including 3G), 5G)) in a specific region. In 4G networks of domestic operators (SKT, KT, LG U+ and Wave), MEC summarized the improvement effects through V2X function blocks and traffic offloading for the purpose of bringing independent network functions. And with a high level of QoS value in the V2X VNF of the 5G network, the traffic steering function scenario was demonstrated on the destination-specific traffic path.

Hybrid Offloading Technique Based on Auction Theory and Reinforcement Learning in MEC Industrial IoT Environment (MEC 산업용 IoT 환경에서 경매 이론과 강화 학습 기반의 하이브리드 오프로딩 기법)

  • Bae Hyeon Ji;Kim Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.12 no.9
    • /
    • pp.263-272
    • /
    • 2023
  • Industrial Internet of Things (IIoT) is an important factor in increasing production efficiency in industrial sectors, along with data collection, exchange and analysis through large-scale connectivity. However, as traffic increases explosively due to the recent spread of IIoT, an allocation method that can efficiently process traffic is required. In this thesis, I propose a two-stage task offloading decision method to increase successful task throughput in an IIoT environment. In addition, I consider a hybrid offloading system that can offload compute-intensive tasks to a mobile edge computing server via a cellular link or to a nearby IIoT device via a Device to Device (D2D) link. The first stage is to design an incentive mechanism to prevent devices participating in task offloading from acting selfishly and giving difficulties in improving task throughput. Among the mechanism design, McAfee's mechanism is used to control the selfish behavior of the devices that process the task and to increase the overall system throughput. After that, in stage 2, I propose a multi-armed bandit (MAB)-based task offloading decision method in a non-stationary environment by considering the irregular movement of the IIoT device. Experimental results show that the proposed method can obtain better performance in terms of overall system throughput, communication failure rate and regret compared to other existing methods.

Effective Mobile Data Offloading using DBSCAN (DBSCAN을 사용한 효과적인 모바일 데이터 오프로딩)

  • Kim, SeungKeun;Yang, Sung-Bong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.05a
    • /
    • pp.81-84
    • /
    • 2018
  • Recently, many researchers claim that mobile data offloading is a key solution to alleviating overloaded cellular traffic by dividing the overloaded traffic with femtocells, WiFi networks or users. In this paper, we propose an idea to select a group of users, known as VIPs, that is able to effectively transfer the data to others using Density-Based Spatial Clustering of Application with Noise, also known as DBSCAN algorithm. We conducted our experiments using NCCU real trace dataset. The results show that our proposed idea offload about 70~77% of the network with VIP set size of four, which is better than the compared methods.