• Title/Summary/Keyword: Optimal Allocation

Search Result 842, Processing Time 0.033 seconds

Performance Evaluation of Device-to-Device Communications Based on System-Level Simulation in Cellular Networks (셀룰라 네트워크 환경에서 시스템 레벨 시뮬레이션 기반 단말간 직접통신 성능 분석)

  • Lee, Howon;Choi, Hyun-Ho;Jung, Soojung;Chang, Sung-Cheol;Kwon, Dong-Seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.4
    • /
    • pp.229-239
    • /
    • 2013
  • Recently, device-to-device (D2D) communications have been highlighted to improve the spectral efficiency and offer various user experiences in cellular networks. In this paper, we survey standards and literatures related to the D2D technology and address various advantages of D2D technology, and the problems to be resolved before practically implemented. Especially, by considering an important interference issue between cellular and D2D links, five resource allocation and interference management scenarios are provided and their performances are evaluated through the system level simulations. The simulation results show that the use of D2D significantly improve the cell capacity and the D2D user rate due to the effects of frequency reuse and data off-loading. Notably, it is also shown that an optimal D2D communication range exists to maximize the system performance.

A Markov Approximation-Based Approach for Network Service Chain Embedding (Markov Approximation 프레임워크 기반 네트워크 서비스 체인 임베딩 기법 연구)

  • Chuan, Pham;Nguyen, Minh N.H.;Hong, Choong Seon
    • Journal of KIISE
    • /
    • v.44 no.7
    • /
    • pp.719-725
    • /
    • 2017
  • To reduce management costs and improve performance, the European Telecommunication Standards Institute (ETSI) introduced the concept of network function virtualization (NFV), which can implement network functions (NFs) on cloud/datacenters. Within the NFV architecture, NFs can share physical resources by hosting NFs on physical nodes (commodity servers). For network service providers who support NFV architectures, an efficient resource allocation method finds utility in being able to reduce operating expenses (OPEX) and capital expenses (CAPEX). Thus, in this paper, we analyzed the network service chain embedding problem via an optimization formulation and found a close-optimal solution based on the Markov approximation framework. Our simulation results show that our approach could increases on average CPU utilization by up to 73% and link utilization up to 53%.

Server Replication Degree Reducing Location Management Cost in Cellular Networks (셀룰라 네트워크에서 위치 정보 관리 비용을 최소화하는 서버의 중복도)

  • Kim, Jai-Hoon;Lim, Sung-Hwa
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.265-275
    • /
    • 2002
  • A default server strategy is a very popular scheme for managing location and state information of mobile hosts in cellular networks. But the communication cost increases if the call requests are frequent and the distant between the default server and the client is long. Still more any connection to a mobile host cannot be established when the default server of the destination mobile host fails. These problems can be solved by replicating default server and by letting nearest replicated default server process the query request which is sent from a client. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. Furthermore we propose and evaluate an optimized allocation algorithm and an optimal replication degree for replicating: dofault servers in nn grid networks and binary tree networks.

An Improved Genetic Algorithm for Integrated Planning and Scheduling Algorithm Considering Tool Flexibility and Tool Constraints (공구유연성과 공구관련제약을 고려한 통합공정일정계획을 위한 유전알고리즘)

  • Kim, Young-Nam;Ha, Chunghun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.2
    • /
    • pp.111-120
    • /
    • 2017
  • This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems.

Hydraulic Analysis of Urban Water-Supply Networks in Marivan

  • Tavosi, Mohammad Ghareb;Siosemarde, Maaroof
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.4
    • /
    • pp.396-402
    • /
    • 2016
  • In this study, hydraulic analysis of water-supply networks in Marivan was performed by modeling. WATERGEMS was used for modeling and it was calibrated using existing rules and regulations. The purpose of this research is modeling urban water network and its analysis based on hydraulic criteria and meeting pressure conditions at the nodes and complying the economic speed. To achieve this goal, first the pipelines of city streets was designed in AutoCAD on a map of the city. It should be mentioned that it was tried to prevent from creating additional loops in the network and the optimal network was designed by a combination of annular and branch loops. In the next step, the pipes were called in WATERGEMS and then we continue the operation by the allocation of elevation digits to the pipes. Since the topography of this city is very specific and unique, the number of pressure zones was increased. Three zones created only covers about 20% of the population in the city. In this dissertation, the design was performed on the city's main zone with the largest density in the Figures 1,320-1,340. In the next step, the network triangulation was conducted. Finally, the Debiw as allocated based on the triangulation conducted and considering the density of the city for year of horizon. Ultimately, the network of Marivan was designed and calibrated according to hydraulic criteria and pressure zoning. The output of this model can be used in water-supply projects, improvement and reform of the existing net-work in the city, and various other studies. Numerous and various graphs obtained in different parts of a network modelled can be used in the analysis of critical situation, leakage.

A Web-based and QoS-guaranteed Traffic Control System using Integrated Service Model (Integrated Service 모델을 응용한 웹 기반 QoS 보장형 트래픽 제어시스템)

  • Lee, Myung-Sub;Park, Chang-Hyeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1B
    • /
    • pp.34-44
    • /
    • 2003
  • As the recent rapid development of internet technology and the wide spread of multimedia communications, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service To resolve these problems, this paper presents a web-based traffic control system which supports QoS of realtime packet transmission for the multimedia communication The traffic control system presented in this paper applies the integrated service model and provides QoS of packet transmission by means of determining the packet transmission rate according to the policies of network manager and the optimal resource allocation considering the end-to-end traffic load It also provides QoS for the realtime packet transmission through the admission controller and the packet scheduler by the modified $WF^2Q^+$ algorithm support asynchronous and class-based queuing.

A Case Study on Application of Dispatching Rule-Based Advanced Planning and Scheduling (APS) System (디스패칭 룰 기반의 Advanced Planning and Scheduling (APS) 시스템 활용 사례연구)

  • Lee, Jae-yong;Shin, Moonsoo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.3
    • /
    • pp.78-86
    • /
    • 2015
  • Up-to-date business environment for manufacturers is very complex and rapidly changing. In other words, companies are facing a variety of changes, such as diversifying customer requirements, shortening product life cycles, and switching to small quantity batch production. In this situation, the companies are introducing the concept of JIT (just-in-time) to solve the problem of on-time production and on-time delivery for survival. Though many companies have introduced ERP (enterprise resource planning) systems and MRP (material requirement planning) systems, the performance of these systems seems to fall short of expectations. In this paper, the case study on introducing an APS (advanced planning and scheduling) system based on dispatching rules to a machining company and on finding a method to establish an efficient production schedule is presented. The case company has trouble creating an effective production plan and schedule, even though it is equipped with an MRP-based ERP system. The APS system is applied to CNC (computer numerical control) machines, which are key machines of the case company. The overall progress of this research is as follows. First, we collect and analyze the master data on individual products and processes of the case company in order to build a production scheduling model. Second, we perform a pre-allocation simulation based on dispatching rules in order to calculate the priority of each order. Third, we perform a set of production simulations applying the priority value in order to evaluate production lead time and tardiness of pre-defined dispatching rules. Finally, we select the optimal dispatching rule suitable for work situation of the case company. As a result, an improved production schedule leads to an increase in production and reduced production lead time.

An Optimal Allocation Mechanism of Location Servers in A Linear Arrangement of Base Stations (선형배열 기지국을 위한 위치정보 서버의 최적할당 방식)

  • Lim, Kyung-Shik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.426-436
    • /
    • 2000
  • Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

  • PDF

Active Distribution System Planning for Low-carbon Objective using Cuckoo Search Algorithm

  • Zeng, Bo;Zhang, Jianhua;Zhang, Yuying;Yang, Xu;Dong, Jun;Liu, Wenxia
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.2
    • /
    • pp.433-440
    • /
    • 2014
  • In this study, a method for the low-carbon active distribution system (ADS) planning is proposed. It takes into account the impacts of both network capacity and demand correlation to the renewable energy accommodation, and incorporates demand response (DR) as an available resource in the ADS planning. The problem is formulated as a mixed integer nonlinear programming model, whereby the optimal allocation of renewable energy sources and the design of DR contract (i.e. payment incentives and default penalties) are determined simultaneously, in order to achieve the minimization of total cost and $CO_2$ emissions subjected to the system constraints. The uncertainties that involved are also considered by using the scenario synthesis method with the improved Taguchi's orthogonal array testing for reducing information redundancy. A novel cuckoo search (CS) is applied for the planning optimization. The case study results confirm the effectiveness and superiority of the proposed method.

A Optimal Method of Sensor Node Deployment for the Urban Ground Facilities Management (도시지상시설물 관리를 위한 최적 센서노드 배치 방법)

  • Kang, Jin-A;Nam, Sang-Kwan;Kwon, Hyuk-Jong;OH, Yoon-Seuk
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.12 no.4
    • /
    • pp.158-168
    • /
    • 2009
  • As nation and society progresses, urban ground facilities and their management system get more complicated and the cost and effort to control the system efficiently grows exponentially. This study suggests to the deployment method of a sensor node by Wireless Sensor Network for controling the Urban Ground Facilities of National Facilities. First, we achieve the management facilities and method using the first analysis and then make the coverage of sensing and then set up the Sensor Node in Urban Ground Facilities. Second, we propose the solution way of repetition by the second analysis. And, we embody the GIS program by Digital Map and this method, we improve the reality by overlapping an aerial photo. Also we make an experience on the sensor node allocation using making program. we can remove the repetition sensor node about 50%, and we can confirm that the sensor nodes are evenly distributed on the road.

  • PDF