• 제목/요약/키워드: Load-aware

검색결과 91건 처리시간 0.024초

QuLa: Queue and Latency-Aware Service Selection and Routing in Service-Centric Networking

  • Smet, Piet;Simoens, Pieter;Dhoedt, Bart
    • Journal of Communications and Networks
    • /
    • 제17권3호
    • /
    • pp.306-320
    • /
    • 2015
  • Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

Traffic-Aware Relay Sleep Control for Joint Macro-Relay Network Energy Efficiency

  • Deng, Na;Zhao, Ming;Zhu, Jinkang;Zhou, Wuyang
    • Journal of Communications and Networks
    • /
    • 제17권1호
    • /
    • pp.47-57
    • /
    • 2015
  • With the ever growing demand of data applications, the joint macro-relay networks are emerging as a promising heterogeneous deployment to provide coverage extension and throughput enhancement. However, the current cellular networks are usually designed to be performance-oriented without enough considerations on the traffic variation, causing substantial energy waste. In this paper, we consider a joint macro-relay network with densely deployed relay stations (RSs), where the traffic load varies in both time and spatial domains. An energy-efficient scheme is proposed to dynamically adjust the RS working modes (active or sleeping) according to the traffic variations, which is called traffic-aware relay sleep control (TRSC). To evaluate the performance of TRSC,we establish an analytical model using stochastic geometry theory and derive explicit expressions of coverage probability, mean achievable rate and network energy efficiency (NEE). Simulation results demonstrate that the derived analytic results are reasonable and the proposed TRSC can significantly improve the NEE when the network traffic varies dynamically.

Scate: A Scalable Time and Energy Aware Actor Task Allocation Algorithm in Wireless Sensor and Actor Networks

  • Sharifi, Mohsen;Okhovvat, Morteza
    • ETRI Journal
    • /
    • 제34권3호
    • /
    • pp.330-340
    • /
    • 2012
  • In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

Congestion-Aware Handover in LTE Systems for Load Balancing in Transport Network

  • Marwat, Safdar Nawaz Khan;Meyer, Sven;Weerawardane, Thushara;Goerg, Carmelita
    • ETRI Journal
    • /
    • 제36권5호
    • /
    • pp.761-771
    • /
    • 2014
  • Long-Term Evolution employs a hard handover procedure. To reduce the interruption of data flow, downlink data is forwarded from the serving eNodeB (eNB) to the target eNB during handover. In cellular networks, unbalanced loads may lead to congestion in both the radio network and the backhaul network, resulting in bad end-to-end performance as well as causing unfairness among the users sharing the bottleneck link. This work focuses on congestion in the transport network. Handovers toward less loaded cells can help redistribute the load of the bottleneck link; such a mechanism is known as load balancing. The results show that the introduction of such a handover mechanism into the simulation environment positively influences the system performance. This is because terminals spend more time in the cell; hence, a better reception is offered. The utilization of load balancing can be used to further improve the performance of cellular systems that are experiencing congestion on a bottleneck link due to an uneven load.

A Study on Intelligent Edge Computing Network Technology for Road Danger Context Aware and Notification

  • Oh, Am-Suk
    • Journal of information and communication convergence engineering
    • /
    • 제18권3호
    • /
    • pp.183-187
    • /
    • 2020
  • The general Wi-Fi network connection structure is that a number of IoT (Internet of Things) sensor nodes are directly connected to one AP (Access Point) node. In this structure, the range of the network that can be established within the specified specifications such as the range of signal strength (RSSI) to which the AP node can connect and the maximum connection capacity is limited. To overcome these limitations, multiple middleware bridge technologies for dynamic scalability and load balancing were studied. However, these network expansion technologies have difficulties in terms of the rules and conditions of AP nodes installed during the initial network deployment phase In this paper, an intelligent edge computing IoT device is developed for constructing an intelligent autonomous cluster edge computing network and applying it to real-time road danger context aware and notification system through an intelligent risk situation recognition algorithm.

Distributing Network Loads in Tree-based Content Distribution System

  • Han, Seung Chul;Chung, Sungwook;Lee, Kwang-Sik;Park, Hyunmin;Shin, Minho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권1호
    • /
    • pp.22-37
    • /
    • 2013
  • Content distribution to a large number of concurrent clients stresses both server and network. While the server limitation can be circumvented by deploying server clusters, the network limitation is far less easy to cope with, due to the difficulty in measuring and balancing network load. In this paper, we use two useful network load metrics, the worst link stress (WLS) and the degree of interference (DOI), and formulate the problem as partitioning the clients into disjoint subsets subject to the server capacity constraint so that the WLS and the DOI are reduced for each session and also well balanced across the sessions. We present a network load-aware partition algorithm, which is practicable and effective in achieving the design goals. Through experiments on PlanetLab, we show that the proposed scheme has the remarkable advantages over existing schemes in reducing and balancing the network load. We expect the algorithm and performance metrics can be easily applied to various Internet applications, such as media streaming, multicast group member selection.

교정용 BRACKET과 ARCHWIRE 사이의 마찰저항에 대한 비교연구 (COMPARISON OF THE FRICTIONAL RESISTANCE BETWEEN ORTHODONTIC BRACKET & ARCHWIRE)

  • 성현미;박영철
    • 대한치과교정학회지
    • /
    • 제21권3호
    • /
    • pp.543-560
    • /
    • 1991
  • Practitioners are aware of the presence of friction between bracket system and archwire during sliding movement of teeth. Clinically a mesiodistally applied force must exceed the frictional force to produce a tooth movement. The objective of this study were to determine, on a dry condition, changes in magnitude of friction with respect to load, 3rd order inclination (Torque), archwire materials and ligature type. Three wire alloys (Stainless Steel, TMA, NiTi) in two wire sizes (.016, .016x, .022 inch) were examined respect to two bracket system (Straight, Standard), and two ligature type (Metal, Plastic ligature) at three levels of load (100g, 150g, 200g). The results were as follows; 1. Frictional resistance was found to increase with increasing load for S.S., TMA, NiTi. 2. The straight bracket system was exhibited more frictional force than standard bracket system for .016x, .022 S.S. tightly ligated metal ligature. But, torque difference did not increase friction for loose metal ligature & plastic ligature. 3. Regardless of the ligature type, torque and load, stainless steel wire sliding against stainless steel exhibited the lowest friction, and TMA sliding against stainless steel exhibited the highest friction. 4. The loose stainless steel ligature generated lower frictional resistance than plastic ligature in all experimental groups. 5. The following factors affected friction in decreasing order; wire material ligature type, and load.

  • PDF

군집선박을 위한 선박 USN을 이용한 상황인식 모니터링 시스템 (USN based Context-Aware Vessel Monitoring System for A Group of Ships)

  • 신도성;김기영;이성로;이연우;정민아
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2010년도 추계학술대회
    • /
    • pp.481-484
    • /
    • 2010
  • 이 논문에서는 군집선박 사이에서 얻어낸 센서 정보를 통합 관리하고 모니터링을 하는 군집선박을 위한 선박 USN(Ubiquitous Sensor Network)이용한 상황인식 모니터링시스템을 구현하였다. 이 시스템은 임의의 선박에서 센서의 오동작 발생할 경우 중앙 관리 선박에서 타 선박으로 센서의 동작 제어권을 넘겨 지속적으로 데이터를 수집하여 적절한 상황인식을 유도할 수 있다. 또한 각 선박에 따라 특정한 데이터만 수집해서 상황인식을 한 정보를 서버로 보냄으로서 센서 노드의 통신으로 인한 부하를 줄일 수 있는 장점이 있다.

  • PDF

서버 클러스터 환경에서 자율학습기반의 에너지 효율적인 클러스터 관리 기법 (An Energy Efficient Cluster Management Method based on Autonomous Learning in a Server Cluster Environment)

  • 조성철;곽후근;정규식
    • 정보처리학회논문지:컴퓨터 및 통신 시스템
    • /
    • 제4권6호
    • /
    • pp.185-196
    • /
    • 2015
  • 에너지 절감형 서버 클러스터는 에너지 절감을 고려하지 않는 기존 서버 클러스터에 비해 서비스 품질을 보장하면서 전력소비를 절감하는 것을 목표로 한다. 에너지 절감형 서버 클러스터에서는 현재의 부하를 처리하는 데 필요한 최소수의 서버들만 ON 하도록 고정 또는 가변 주기로 서버들의 전원모드를 조정한다. 이에 대한 기존 연구들은 전력 절감 또는 서비스 품질을 보장하려고 노력해왔지만 에너지 효율성을 잘 고려하지는 못했다. 본 논문에서는 에너지 절감형 클러스터에서 자율학습기반의 에너지 효율적인 클러스터 관리 기법을 제안한다. 자율학습을 통해 최적화된 파라미터들을 이용하여 전력 소모 대비 최고의 성능을 얻을 수 있도록 서버 전원모드를 조정한다. 제안방법은 서버 전원모드 조정을 위해 아래의 과정을 반복 수행한다. 첫째, 현재 부하 및 트래픽 패턴을 보고 현재 워크로드 패턴 유형을 사전에 정의한 대로 분류한다. 둘째, 학습 테이블을 탐색하여 해당 워크로드 패턴 유형에 대해 예전에 학습이 수행되었는지 확인한다. 만일 수행되었다면 이미 저장된 파라미터를 이용한다. 그렇지 않으면, 학습을 수행하여 에너지 효율성 관점에서 최고의 파라미터를 얻어 저장한다. 셋째, 얻어진 파라미터를 이용하여 서버 전원모드를 조정한다. 제안방법을 구현하여 16개의 서버 클러스터 환경에서 3가지 다른 부하 패턴들을 이용하여 실험을 수행하였다. 실험 결과는 제안방법의 에너지 효율성이 뛰어남을 보여주고 있다. 뱅킹 부하패턴, 실제 부하패턴, 가상 부하패턴 각각에 대하여, 제안방법의 단위전력당 good 응답 수가 기존의 정적 서버 전원모드 제어방법의 99.9%, 107.5%, 141.8%이고, 기존의 예측방법의 102.0%, 107.0%, 106.8%이다.

에너지 및 성능 효율적인 이종 모바일 저장 장치용 동적 부하 분산 (Energy and Performance-Efficient Dynamic Load Distribution for Mobile Heterogeneous Storage Devices)

  • 김영진;김지홍
    • 한국컴퓨터정보학회논문지
    • /
    • 제14권4호
    • /
    • pp.9-17
    • /
    • 2009
  • 본 논문에서는 운영체제 수준에서 에너지 절감과 함께 I/O 성능 개선을 목적으로 하여 소형 하드 디스크와 플래시 메모리를 이종의 저장 장치로 가지는 모바일 시스템에 대해 동적 부하 분산 기법을 제안한다. 제안 기법은 부하가 에너지 및 성능 효율적인 방법으로 하드디스크와 플래시 메모리의 이종성의 저장 장치 구성에 대해서 어떻게 효율적으로 분산될 수 있을 것인지를 발견하기 위하여 파일 배치 기법과 버퍼 캐시 관리 기법을 결합하는 접근법을 취한다. 제안한 기법은 폭넓은 시뮬레이션을 통해서 기존의 기법들과 비교하여 이종의 모바일 저장장치들에 대해서 더 개선된 실험 결과를 보이는 것으로 나타났다.