• International Journal of Computer Science & Network Security
• /
• 제21권2호
• /
• pp.158-170
• /
• 2021

Virtualization technologies are being adopted and broadly utilized in many fields and at different levels. In cloud computing, achieving load balancing across large distributed virtual machines is considered a complex optimization problem with an essential importance in cloud computing systems and data centers as the overloading or underloading of tasks on VMs may cause multiple issues in the cloud system like longer execution time, machine failure, high power consumption, etc. Therefore, load balancing mechanism is an important aspect in cloud computing that assist in overcoming different performance issues. In this research, we propose a new approach that combines the advantages of different task allocation algorithms like Round robin algorithm, and Random allocation with different threshold techniques like the VM utilization and the number of allocation counts using least connection mechanism. We performed extensive simulations and experiments that augment different scheduling policies to overcome the resource utilization problem without compromising other performance measures like makespan and execution time of the tasks. The proposed system provided better results compared to the original round robin as it takes into consideration the dynamic state of the system.

• ETRI Journal
• /
• 제24권4호
• /
• pp.311-322
• /
• 2002

Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

• 한국정보처리학회논문지
• /
• 제4권3호
• /
• pp.639-648
• /
• 1997

컴퓨터의 응용 영역이 확대됨에 따라 일정 이내에 자료를 신속히 처리해야 하는 실시간 응용들이 대두되기 시작했다 기존의 디스크 기반 데이타베이스 시스템윤 디스크 입출력으로 인한 성능 저하로 마감시간을 지닌 실시간 트랜잭션 처리에는 부적당 하다. 또한, 최근 마감시간 우선 기법을 사용하는 실시간 트랜잭션 스케줄링 기법은 트랜잭션이 과다하게 적제되는 경우 연쇄적인 마감시간 초과로 인하여 성능이 저하 된다. 이러한 문제점을 해결하기 위해 이 논문에서는 첫째, 주기억 데이터베이스 환경하 에서 우선순위를 기반으로한 이중 록킹 기법을 제안하여 실시간 트랜잭션 스케쥴링 기법 의 성능을 향상시켰다. 그리고, 본 연구에서는 제안한 우선순위를 기반으로한 이중 록킹, 기법의 성능을 평가하기 위해 모델링하고, 주기억 데이터베이스 환경하에서 이산적 사건 모델을 지원하는 SLAM II로 시뮬레이션하여 타 연구와의 성능을 비교 분석하였다.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2007년도 학술대회
• /
• pp.371-375
• /
• 2007

In this paper, we have implemented the device management system to upgrade T-PAK software in mobile phone. The hybrid scheduling method and selective upgrade method are proposed. Hybrid scheduling method is based on distribution of delivery data in accordance with network traffic load and service priority from device management server to mobile phone. Selective upgrade method manages DSL classified by T-PAK software version to be upgrade using version management established in OMA DM SCOMO. Key mechanism of selective upgrade method is to only deliver DSL to be replaced to the mobile phone. We made an experiment on two methods using MS-700T terminals. The experimental result shows that the proposed method is faster than normal from delivery time standpoint.

• 한국콘텐츠학회논문지
• /
• 제10권9호
• /
• pp.45-56
• /
• 2010

본 연구에서는 불필요한 에너지 소모와 지연을 야기하는 혼잡을 탐지할 수 있는 알고리즘을 제시하고 이에 따라 혼잡 제어를 수행할 수 있는 기법을 제시한다. 기존의 혼잡 탐지는 큐 점유율만을 사용하거나 MAC 계층에서 패킷 도착율만을 가지고 혼잡을 결정하였으나 본 연구에서는 이들 두 가지를 모두 고려하여 더 정밀한 혼잡 탐지를 가능하게 하였다. 또한 혼잡도에 따라 미리 혼잡 회피를 수행하고 혼잡이 발생한 경우 패킷의 우선순위에 따라 지연에 민감한 패킷들을 먼저 스케줄링할 수 있는 방법을 제시하였다. 시뮬레이션 결과 본 논문에서 제안한 혼잡 탐지와 제어 기법은 기존의 혼잡 제어 방법들에 비해 우수한 성능을 보임을 알 수 있었다.

• Journal of Electrical Engineering and Technology
• /
• 제11권4호
• /
• pp.810-819
• /
• 2016

Uncoordinated charging of large-scale electric vehicles (EVs) will have a negative impact on the secure and economic operation of the power system, especially at the distribution level. Given that the charging load of EVs can be controlled to some extent, research on the optimal charging control of EVs has been extensively carried out. In this paper, two possible smart charging scenarios in China are studied: centralized optimal charging operated by an aggregator and decentralized optimal charging managed by individual users. Under the assumption that the aggregators and individual users only concern the economic benefits, new load peaks will arise under time of use (TOU) pricing which is extensively employed in China. To solve this problem, a simple incentive mechanism is proposed for centralized optimal charging while a rolling-update pricing scheme is devised for decentralized optimal charging. The original optimal charging models are modified to account for the developed schemes. Simulated tests corroborate the efficacy of optimal scheduling for charging EVs in various scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5917-5935
• /
• 2018

Adaptive Multi-Rate Codec is one of the codecs which is used for making voice calls. It helps to connect people who are scattered in various geographical areas. It adjusts its bit-rate according to the user's channel conditions. It plays a vital role in providing an improved speech quality of voice connection in Long Term Evolution (LTE). There are some constraints which need to be addressed in providing this service profitably. Quality of Service (QoS) is the dominant mechanism which determines the quality of the speech in communication. On several occasions, number of users are trying to access the same channel simultaneously by standing in a particular region for a longer period of time. It refers to Multi-user channel sharing problem which leads to resource loss very often. The main aim of this paper is to develop a novel RSA - QoS scheduling algorithm for reducing the Resource Loss Ratio. Eventually, it increases the throughput.The simulation result shows that the RSA - QoS increases the number of users for accessing the resources better than the existing algorithms in terms of resource loss and throughput. Ultimately, it enhances the QoS in Mobile Networks.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.536-539
• /
• 2004

IEEE 802.11 Point Coordination Function (PCF) mode is defined to support time bounded traffic, such as voice in wireless LANs. The poll scheduling plays an important role in IEEE 802.11 PCF mode operation. This paper proposed a Multicast Polling Scheme (MPC) to increase the performance of wireless LANs. Moreover, we proposed a polling schedule scheme for our proposed multi-poll to serve real-time traffic. The results show that the proposed mechanism is more efficient than the original IEEE 802.11 PCF.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (3)
• /
• pp.322-324
• /
• 2004

IEEf 802.11 Point Coordination Function (PCF) mode is defined to support time bounded traffic, such as VoIP in wireless LANs. The poll scheduling plays an important role in IEEE 802.11 PCF mode operation. This paper proposed a Multicast Polling Scheme to increase the performance of wireless LANs. Moreover, we proposed a polling schedule scheme for our proposed multipoll to serve real-time traffic. The results show that the proposed mechanism is more efficient than the original IEEE 802.11 PCF.

• 한국통신학회논문지
• /
• 제22권11호
• /
• pp.2521-2530
• /
• 1997

In this paepr, we present a video-on-demand (VOD) system design model that address and integrates a number of inter-related issues. Then with analysis and performance evaluation, we investigate various aspects of disk and buffer managements in the given model. Based on the analysis results, we suggest that a distributed buffering scheme with intermediate buffers may te useful to transform bursty disk accesses into a continuous stream for for glitch-free performance of VOD systems. Also, through simulation, we illustrate that massive multimedia information storage design techniques such as prefetching, clustered striping, and real-time disk scheduling integrated with the distributed buffering mechanism may enhance end-to-end real-time performance of VOD systems under wide-area networks.