• Title/Summary/Keyword: Load balancing management

Search Result 139, Processing Time 0.035 seconds

Cloud Radio Access Network: Virtualizing Wireless Access for Dense Heterogeneous Systems

  • Simeone, Osvaldo;Maeder, Andreas;Peng, Mugen;Sahin, Onur;Yu, Wei
    • Journal of Communications and Networks
    • /
    • v.18 no.2
    • /
    • pp.135-149
    • /
    • 2016
  • Cloud radio access network (C-RAN) refers to the virtualization of base station functionalities by means of cloud computing. This results in a novel cellular architecture in which low-cost wireless access points, known as radio units or remote radio heads, are centrally managed by a reconfigurable centralized "cloud", or central, unit. C-RAN allows operators to reduce the capital and operating expenses needed to deploy and maintain dense heterogeneous networks. This critical advantage, along with spectral efficiency, statistical multiplexing and load balancing gains, make C-RAN well positioned to be one of the key technologies in the development of 5G systems. In this paper, a succinct overview is presented regarding the state of the art on the research on C-RAN with emphasis on fronthaul compression, baseband processing, medium access control, resource allocation, system-level considerations and standardization efforts.

A Study on Energy Efficiency Network Communication System Development included Heterogeneous Distrubuted Power Management (분산전원 관리를 포함한 에너지 효율화 네트워크 통신시스템 개발에 관한 연구)

  • Han, Jeong-Hoon;Kim, Beom-Joo;Park, So-Yeong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.10a
    • /
    • pp.277-278
    • /
    • 2015
  • 해당 연구 시스템은 신재생에너지, 에너지저장장치를 연계하여 수용가의 전력소모기기를 효율적으로 제어할 수 있는 에너지 네트워크 고효율 시스템 기술로 수요반응 또는 사용자 설정에 따른 제어신호 생성 및 전달, 전력소모기기 사용량 분석을 통한 에너지 사용분석, ESS와 신재생에너지 투입에 대한 제어 및 분석, ESS, 신재생에너지, 에너지게이트웨이, 전력소모기기 간 분석을 통한 Load Balancing 기능을 제공하고자 한다. 현재는 연구단계로 설계 및 연계 통신은 완료상태이며, 주요 알고리즘 적용을 진행 중에 있다.

The Various Factors which Should Be Considered in Classifying Toxic Substances in Water and Deriving Their Effluent Limits: Focusing on the Reduction of Risk (수질유해물질의 지정 및 배출허용기준 설정 시 고려해야 하는 복합적 요인에 대한 고찰: 위해성 저감을 중심으로)

  • Bae, Hyokwan;Chung, Yun-Chul;Yang, Hyungjae;Kim, Jaehoon;Lee, Hyun Dong;Jung, Jin-Young
    • Journal of Korean Society on Water Environment
    • /
    • v.23 no.5
    • /
    • pp.766-775
    • /
    • 2007
  • The use of toxic chemicals was extended as the industry in Korea has grown dramatically during the last three decades. However, list of toxic substances and limit concentrations in the water environment are not consistent within management of ambient water, drinking water and industrial effluent. This article suggests the systematic framework to classify toxic substances in the water environment and deriving their effluent limits. The most important factor for decision-making to classify toxic substances is whether their concentrations in the water environment are higher than the reference concentrations, estimated by considering human health risk and ecological risk. Using a risk-based reference concentration, the ambient water quality criterion, it is possible to derive the regulatory limit concentrations of toxic substances in drinking water and in industrial effluent. The goal concentrations in the effluent, which guarantee the human and ecological safety, should be determined with scientific investigation, balancing environmental benefit and economical effect, considering availability of treatment technology and identifying characteristics of wastewater from different industries.

Management Techniques of Interest Area Utilizing Subregions in MMORPG based on Cloud and P2P Architecture (클라우드와 P2P 구조 기반의 MMORPG에서 소영역을 활용하는 관심 구역의 관리 기법)

  • Jin-Hwan Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.3
    • /
    • pp.99-106
    • /
    • 2023
  • In this paper, we propose subregion-based area of interest management techniques for MMORPG(massively multiplayer online role playing games) integrating P2P(peer-to-peer) networking and cloud computing. For the crowded region, the proposed techniques partition it into several subregions and assign a player to manage each subregion as a coordinator. These techniques include a load balancing mechanism which regulates communication and computation overhead of such player below the specified threshold. We also provide a mechanism for satisfying the criterion, where subregions overlapped with each player's view must be switched quickly and seamlessly as the view moves around in the game world. In the proposed techniques where an efficient provisioning of resources is realized, they relieve a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the players effectively. Simulation results show that the MMORPG based on cloud and P2P architecture can reduce the considerable bandwidth at the server compared to the client server architecture as the available resources grow with the number of players in crowding or hotspots.

An Efficient Management Scheme of Hierarchical P2P System based on Network Distance (계층적 P2P 시스템의 효율적 관리를 위한 네트워크 거리 기반 운영 기법)

  • Hong, Chung-Pyo;Kim, Cheong-Ghil;Kim, Shin-Dug
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.10 no.4
    • /
    • pp.121-127
    • /
    • 2011
  • Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

  • PDF

Dynamic File Migration And Mathematical model in Distributed Computer Systems (분산 시스템에서 동적 파일 이전과 수학적 모델)

  • Moon, Won Sik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.3
    • /
    • pp.35-40
    • /
    • 2014
  • Many researches have been conducted to achieve improvement in distributed system that connects multiple computer systems via communication lines. Among others, the load balancing and file migration are considered to have significant impact on the performance of distributed system. The dynamic file migration algorithm common in distributed processing system involved complex calculations of decision function necessary for file migration and required migration of control messages for the performance of decision function. However, the performance of this decision function puts significant computational strain on computer. As one single network is shared by all computers, more computers connected to network means migration of more control messages from file migration, causing the network to trigger bottleneck in distributed processing system. Therefore, it has become imperative to carry out the research that aims to reduce the number of control messages that will be migrated. In this study, the learning automata was used for file migration which would requires only the file reference-related information to determine whether file migration has been made or determine the time and site of file migration, depending on the file conditions, thus reflecting the status of current system well and eliminating the message transfer and additional calculation overhead for file migration. Moreover, mathematical model for file migration was described in order to verify the proposed model. The results from mathematical model and simulation model suggest that the proposed model is well-suited to the distributed system.

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 계층적 클러스터링 알고리즘)

  • Cha, Si-Ho;Lee, Jong-Eon;Choi, Seok-Man
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.4 no.2
    • /
    • pp.29-37
    • /
    • 2008
  • Clustering allows hierarchical structures to be built on the nodes and enables more efficient use of scarce resources, such as frequency spectrum, bandwidth, and energy in wireless sensor networks (WSNs). This paper proposes a hierarchical clustering algorithm called EEHC which is more energy efficient than existing algorithms for WSNs, It introduces region node selection as well as cluster head election based on the residual battery capacity of nodes to reduce the costs of managing sensor nodes and of the communication among them. The role of cluster heads or region nodes is rotated among nodes to achieve load balancing and extend the lifetime of every individual sensor node. To do this, EEHC clusters periodically to select cluster heads that are richer in residual energy level, compared to the other nodes, according to clustering policies from administrators. To prove the performance improvement of EEHC, the ns-2 simulator was used. The results show that it can reduce the energy and bandwidth consumption for organizing and managing WSNs comparing it with existing algorithms.

Improving the Simulation of a Mobile Patient Monitoring System for Node Diversification and Loss Minimization (노드 다변화 및 손실률 최소화를 위한 이동환자 상시 모니터링 시스템 시뮬레이션 개선 연구)

  • Choi, Eun Jung;Kim, Myuhng Joo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.7 no.4
    • /
    • pp.15-22
    • /
    • 2011
  • U-Healthcare service is a real-time service using the vital signs which are continuously transferred from monitoring sensors attached to mobile patients under the wireless network environments. It should monitor the health condition of mobile patients everywhere at any time. In this paper, we have improved two features of the three layered mobile patient monitoring system with load balancing ability. First, the simulation process has been improved by allowing the number of related nodes to be changed. Secondly, we have modified S node to which queue is added to reduce the loss rate of collecting data from patients during the delay of S node process. And the data from the patient with high priority can be transferred to the server immediately through the filtering function. Furthermore, we have solved the problem of redundancy in sharing information among S nodes by differentiating process time to each S node. By performing a DEVS Java-based system simulation, we have verified the efficiency of this improved system.

A Tree-Based Routing Algorithm Considering An Optimization for Efficient Link-Cost Estimation in Military WSN Environments (무선 센서 네트워크에서 링크 비용 최적화를 고려한 감시·정찰 환경의 트리 기반 라우팅 알고리즘에 대한 연구)

  • Kong, Joon-Ik;Lee, Jae-Ho;Kang, Ji-Heon;Eom, Doo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8B
    • /
    • pp.637-646
    • /
    • 2012
  • Recently, Wireless Sensor Networks (WSNs) are used in many applications. When sensor nodes are deployed on special areas, where humans have any difficulties to get in, the nodes form network topology themselves. By using the sensor nodes, users are able to obtain environmental information. Due to the lack of the battery capability, sensor nodes should be efficiently managed with energy consumption in WSNs. In specific applications (e.g. in intrusion detections), intruders tend to occur unexpectedly. For the energy efficiency in the applications, an appropriate algorithm is strongly required. In this paper, we propose tree-based routing algorithm for the specific applications, which based on the intrusion detection. In addition, In order to decrease traffic density, the proposed algorithm provides enhanced method considering link cost and load balance, and it establishes efficient links amongst the sensor nodes. Simultaneously, by using the proposed scheme, parent and child nodes are (re-)defined. Furthermore, efficient routing table management facilitates to improve energy efficiency especially in the limited power source. In order to apply a realistic military environment, in this paper, we design three scenarios according to an intruder's moving direction; (1) the intruder is passing along a path where sensor nodes have been already deployed. (2) the intruders are crossing the path. (3) the intruders, who are moving as (1)'s scenario, are certainly deviating from the middle of the path. In conclusion, through the simulation results, we obtain the performance results in terms of latency and energy consumption, and analyze them. Finally, we validate our algorithm is highly able to adapt on such the application environments.

Hybrid Centralized-Distributed Mobility Management Scheme in SDN-Based LTE/EPC Networks (SDN 기반 LTE/EPC 네트워크에서 하이브리드 중앙-분산 이동성 관리 기법)

  • Lim, Hyun-Kyo;Kim, Yong-hwan;Han, Youn-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.4
    • /
    • pp.768-779
    • /
    • 2017
  • Recently, the great number of mobile devices causes excessive data/control traffic problems in the centralized LTE/EPC network and such dramatically increased traffic is emerging as a critical issue. In the Centralized Mobility Management (CMM) based LTE/EPC network, the Packet Data Network Gateway (P-GW) plays the centralized mobility anchor role and it accommodates most of data traffic. To solve this problem, the IETF has proposed the Distributed Mobility Management (DMM) scheme, but it has only focused on the data traffic load balancing and could not solve the control traffic overload problem. In this paper, therefore, we propose a new SDN based hybrid CMM/DMM Mobility Management (C-DMM) architecture based on Packet Network Edge Gateway (P-EGW), and introduce a selection scheme between CMM and DMM according to a device's mobility and the number of PDN connections. In order to prove the efficiency of the proposed architecture and scheme, we compare the data traffic processing load and the control traffic processing load over each scheme by emulating them in the ONOS controller and the Mininet environment.