• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1554-1566
• /
• 2014

Cloud Computing allows application providers seamlessly scaling their services and enables users scaling their usage according to their needs. In this paper, using queuing game model, we present service scheduling schemes which are used in software as a service (SaaS). The object is maximizing the Cloud Computing platform's (CCP's) payoff via controlling the service requests whether to join or balk, and controlling the value of CCP's admission fee. Firstly, we treat the CCP as one virtual machine (VM) and analyze the optimal queue length with a fixed admission fee distribution. If the position number of a new service request is bigger than the optimal queue length, it balks. Otherwise, it joins in. Under this scheme, the CCP's payoff can be maximized. Secondly, we extend this achievement to the multiple VMs situation. A big difference between single VM and multiple VMs is that the latter one needs to decide which VM the service requests turn to for service. We use a corresponding algorithm solve it. Simulation results demonstrate the good performance of our schemes.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.428-437
• /
• 2007

Along with the development of network, more and more functions and services are required by users, while traditional network fails to support all of them. Although overlay is a good solution to some demands, using them in an efficient, scalable way is still a problem. This paper puts forward a framework on how to construct an efficient, scalable overlay mesh in real network. Main differences between other overlays and ours are that our overlay mesh processes some nice features including class-of-service(CoS) and traffic engineering(TE). It embeds the end-to-end optimal traffic control law which can distribute traffic in an optimal way. Then, an example is given for better understanding the framework. Particularly, besides good scalability, and failure recovery, it possesses other characteristics such as routing simplicity, self-organization, etc. In such an overlay mesh, an applicable source routing scheme called hierarchical source routing is used to transmit data packet based on UDP protocol. Finally, a guideline derived from a number of simulations is proposed on how to set various parameters in this overlay mesh, which makes the overlay more efficient.

• 산업경영시스템학회지
• /
• 제43권1호
• /
• pp.61-69
• /
• 2020

Systems such as database and socal network systems have been broadly used, and their unexpected failure, with great losses and sometimes a social confusion, has received attention in recent years. Therefore, it is an important issue to find optimal maintenance plans for such kind of systems from the points of system reliability and maintaining cost. However, it is difficult to maintain a system during its working cycle, since stopping works might incur users some troubles. From the above viewpoint, this paper discusses minimal repair maintenance policy with periodic replacement, while considering the random working cycles. The random working cycle and periodic replacement policies with minimal repair has been discussed in traditional literatures by usually analyzing cases for the nonstopping works. However, maintenance can be more conveniently done at discrete time and even during the working cycle in real applications. So, we propose that periodic replacement is planned at discrete times while considering the random working cycle, and moreover provide a model in which system, with a minimal repair at failures between replacements, is replaced at the minimum of discrete times KT and random cycles Y. The average cost rate model is used to determine the optimal number of periodic replacement.

• 한국컴퓨터정보학회논문지
• /
• 제12권5호
• /
• pp.19-27
• /
• 2007

본 논문은 일반인들이 여행 시 필요한 최적의 경로를 찾아 주는 웹 사이트를 구현하는 방법을 제안한다. 출발지와 목적지만 주어질 때 최적 경로를 찾아 주는 웹 사이트는 이미 많이 존재한다. 그러나 방문할 도시가 여럿일 때 최적 경로를 찾아주는 사이트는 아직까지 존재하지 않는다. 출발 도시에서 출발하여 경유지를 모두 한번씩 방문하고 출발도시로 되돌아오는 최적 경로를 찾는 문제를 외판원 문제라고 하며, 이 문제는 지수 시간복잡도 문제로 널리 알려져 있다. 본 논문에서는 인공지능 탐색 알고리즘을 적용하여 외판원 문제를 푸는 방법을 웹 시스템으로 구현하였다. 지금까지 소개된 외판원 문제를 푸는 알고리즘은 출발지와 도착지가 동일한데 반하여 최적 경로 문제에서는 출발지와 도착지가 서로 다를 수도 있다. 본 논문이 제안하는 방법은 출발지와 도착지가 동일하거나 아니면 다르더라도 최적의 경로를 찾는다는 점이 기존의 연구와는 다르다. 본 논문에서 구현한 웹 사이트는 사용자에게 출발지, 목적지, 그리고 여러 경유지들을 선택하게 한 다음, 출발지를 출발하여 모든 경유지들을 경유하고 도착지로 도착하는데 비용이 가장 적게 드는 방문 순서를 효율적으로 찾아준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1368-1389
• /
• 2014

Three-dimensional multiple-input multiple-output (3D MIMO) and large-scale MIMO are two promising technologies for upcoming high data rate wireless communications, since the inter-user interference can be reduced by exploiting antenna vertical gain and degree of freedom, respectively. In this paper, we derive the achievable sum rate of 3D MIMO systems employing zero-forcing (ZF) receivers, accounting for log-normal shadowing fading, path-loss and antenna gain. In particular, we consider the prevalent log-normal model and propose a novel closed-form lower bound on the achievable sum rate exploiting elevation features. Using the lower bound as a starting point, we pursue the "large-system" analysis and derive a closed-form expression when the number of antennas grows large for fixed average transmit power and fixed total transmit power schemes. We further model a high-building with several floors. Due to the floor height, different floors correspond to different elevation angles. Therefore, the asymptotic achievable sum rate performances for each floor and the whole building considering the elevation features are analyzed and the effects of tilt angle and user distribution for both horizontal and vertical dimensions are discussed. Finally, the relationship between the achievable sum rate and the number of users is investigated and the optimal number of users to maximize the sum rate performance is determined.

• 한국컴퓨터정보학회논문지
• /
• 제26권5호
• /
• pp.47-53
• /
• 2021

희소한 평가 데이터는 사용자들 간의 신뢰할만한 유사도 산출을 저해하기 때문에 추천 시스템을 위한 메모리 기반의 협력 필터링 기법의 성능을 저하시킨다. 기존 연구의 많은 결과물은 이 데이터 희소성 문제를 해결하기 위해 개발되었으며, 가장 단순하고 대표적인 업적은 자카드 계수를 활용하는 방법들이다. 이 계수는 두 사용자의 공통 평가 항목수를 반영하며, 그들 간의 유사도를 보다 정확하게 계산하기 위해 전통적인 유사도 척도와 통합된다. 그러나, 그러한 통합은 데이터 희소성의 정도를 고려하지 않은 매우 단순한 방법이다. 본 연구는 두 사용자의 자카드 계수값에 의거하여 다른 유사도 척도를 적용하는 새로운 아이디어를 제시한다. 제안 방법에서 사용하는 파라미터의 최적값을 구하기 위하여 성능 실험을 진행하였고, 다른 관련된 방법들과 비교 평가하였다. 결과로서, 제안 방법은 예측 정확도와 추천 정확도에 있어서 가장 우수하거나 대등한 성능을 보였다.

• 산업경영시스템학회지
• /
• 제39권2호
• /
• pp.46-53
• /
• 2016

In mobile communication systems, location management deals with the location determination of users in a network. One of the strategies used in location management is to partition the network into location areas. Each location area consists of a group of cells. The goal of location management is to partition the network into a number of location areas such that the total paging cost and handoff (or update) cost is a minimum. Finding the optimal number of location areas and the corresponding configuration of the partitioned network is a difficult combinatorial optimization problem. This cell grouping problem is to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking is a minimum in location area wireless network. In fact, this is shown to be an NP-complete problem in an earlier study. In this paper, artificial bee colony (ABC) is developed and proposed to obtain the best/optimal group of cells for location area planning for location management system. The performance of the artificial bee colony (ABC) is better than or similar to those of other population-based algorithms with the advantage of employing fewer control parameters. The important control parameter of ABC is only 'Limit' which is the number of trials after which a food source is assumed to be abandoned. Simulation results for 16, 36, and 64 cell grouping problems in wireless network show that the performance of our ABC is better than those alternatives such as ant colony optimization (ACO) and particle swarm optimization (PSO).

• 인터넷정보학회논문지
• /
• 제10권2호
• /
• pp.85-98
• /
• 2009

최근 들어 SaaS기반 이동형 개인 맞춤 소프트웨어 플랫폼에 관한 연구 및 개발이 활발해지고 있다. 이러한 플랫폼들은 다양한 사용자의 OS를 만족시키기 위해 최적화된 가상머신이 필수적으로 요구된다. 또한 다양한 Host OS에서 내부, 외부 네트워크 간에 빠르고 안정적인 서비스를 지원 함으로서 사용자의 작업환경 이동성을 보장해야 한다. 이를 위해 가상머신은 다양한 관점에서의 성능 측정이 필요하다. 하지만 기존 연구에서 가상머신의 성능 측정은 Host 컴퓨터에 설치된 VM에 Guest OS를 설치하여 이를 하나의 컴퓨터로 간주하고, 외부의 클라이언트에서 네트워크 성능을 측정한다. 이는 이동형 개인 맞춤 소프트웨어 플랫폼을 위한 가상머신 성능 측정에 적합하지 않다. 본 논문은 SaaS기반 이동형 개인 맞춤 소프트웨어 플랫폼을 위한 최적화된 가상머신을 선정하기 위해서 네트워크 성능 측정 방법과 측정된 결과 분석을 통한 최적화된 가상머신을 제안한다.

• 한국전자파학회논문지
• /
• 제16권7호
• /
• pp.697-708
• /
• 2005

3G CDMA 시스템의 순방향 링크는 사용자 수의 증가에 따른 제한을 받게 된다. 기존의 채널 구분을 위한 부호인 Walsh 부호는 많은 사용자에 대 한 충분한 크기를 갖지 못하므로, Walsh 부호와 최적의 상관 특성을 갖는 준직교 부호(QOF: Quasi Orthogonal Function)가 고려되고 있다. 본 논문에서는 3G CDMA 시스템에서 더 낮은 상관 값과 우수한 성능을 갖는 재킷 행렬 상에서의 준직교 수열 생성에 관해 고찰하였다. 또한 QOF CDMA 시스템의 검파기의 단순화 및 BER 성능 개선을 위한 새로운 검파 구조를 제시하였다. 마지막으로, QOF 마스크 함수를 위한 bent 수열의 간단한 반복 생성에 대해 고찰하였다.

• 한국시스템다이내믹스연구
• /
• 제3권2호
• /
• pp.49-68
• /
• 2002

The intent of this study is to develop system dynamics model for assessment of organizational and human factors in nuclear power plant which can contribute to secure the nuclear safety. Previous studies are classified into two major approaches. One is engineering approach such as ergonomics and probability safety assessment(PSA). The other is social science approach such like sociology, organization theory and psychology. Both have contributed to find organization and human factors and to present guideline to lessen human error in NPP. But, since these methodologies assume that relationship among factors is independent they don't explain the interactions among factors or variables in NPP. To overcome these limits, we have developed system dynamics model which can show cause and effect among factors and quantify organizational and human factors. The model we developed is composed of 16 functions of job process in nuclear power, and shows interactions among various factors which affects employees' productivity and job quality. Handling variables such like degree of leadership, adjustment of number of employee, and workload in each department, users can simulate various situations in nuclear power plant in the organization side. Through simulation, user can get insight to improve safety in plants and to find managerial tools in the organization and human side. Analyzing pattern of variables, users can get knowledge of their organization structure, and understand stands of other departments or employees. Ultimately they can build learning organization to secure optimal safety in nuclear power plant.