• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.7
• /
• pp.22-29
• /
• 2002

The Gauranteed Frame Rate service category was proposed by the ATM Forum as an enhancement to the UBR service. This service aims to support minimum cell rate gaurantee for each virtual connection and allow any excess bandwidth in the network to be shared among the contending VCs in a fair manner. We propose a new buffer management algorithm for GFR service through FIFO queuing discipline. Proposed scheme can provide minimum bandwidth guarantee for GFR VCs as well as improve the fairness among the competing GFR VCs on a single FIFO queue. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• Journal of the Korea Society for Simulation
• /
• v.11 no.1
• /
• pp.71-82
• /
• 2002

One of the most important things in the research for MIN-based switch operation the management scheme of network cycle. In the traditional MIN, when the receving buffer module is empty, the sell has to move forward the front-most buffer position by the characteristic of the conventional FIFO queue. However, most of buffer modules are almost always full for practical amount of input loads. The long network cycle of the traditional scheme is thus a substantial waste of bandwidth. In this paper, we propose the modeling method for the input and multi-buffered MIN with unit step buffering scheme, In spite of simplicity, simulation results show that the proposed model is very accurate comparing to previous modeling approaches in terms of throughput and the trend of delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2257-2264
• /
• 2011

Sensor nodes in Wireless sensor network have limited resources and consume almost all energy to the communication. For its traffic feature as a burst traffic type toward a sink node, it has high probability to network congestion. Network congestion causes packet drops and retransmission of dropped packets draws energy consumption. In particular, the loss of packet that is from the sensor node far away from a sink node requires additional energy consumption by frequent retransmission. This paper presents a traffic control mechanism that determines packet transfer by considering priority of packet and congestion level as well as hop count. Analysis of proposed mechanism by simulation demonstrated that it improved energy efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1384-1396
• /
• 1998

This paper ivestigates the performance of a relative rate (RR) switch algorithm for the rate-based available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. A RR switch may notify the network congestion status to the source by suing the congestion indication (CI) bit or no increase (NI)bit in the backward RM (BRM) cells. A RR switch can be differently implemented according to the congestion detectio and notification methods. In this paper, we propose three implementation schemes for the RR switch with different congestion detection and notification methods, and analyze the allowed cell rate (ACR) of a source and the queue length of a switch in steady state. In addition, we derive the upper and lower bounds for the maximum and minimum queue lengths for each scheme respectively, and evaluate the effects of the ABR parameter values on the queue length. Furthermore, we suggest the range of the rage increase factor (RIF) and rate decrease factor (RDF) parameter values which can prevent buffer overflow and underflow at a switch.

• International Journal of Contents
• /
• v.13 no.2
• /
• pp.29-34
• /
• 2017

Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.867-875
• /
• 2003

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization in which TCP congestion window size is fluctuated during congestion period. Furthermore, if RTT(Round Trip Time) is increased, three duplicate ACK packets are not correct congestion signals because congestion might already disappear and the host may send more packets until it receives three duplicate ACK packets. Recently there are increasing interests in solving end-to-end congestion control using AQM(Active Queue Management) to improve the performance of TCP protocols. AQM is a variation of RED-based congestion control. In this paper, we first evaluate the effectiveness of the current AQM schemes such as RED, CHOKe, ARED, FRED and SRED, over traffic with different rates and over traffic with mixed responsive and non-responsive flows, respectively. In particular, CHOKe mechanism shows greater unfairness, especially when more unresponsive flows exist in a shared link. We then propose a new AQM scheme using CHOKe mechanism, called DQC(Double Queue CHOKe), which uses two FIFO queues before applying CHOKe mechanism to adaptive congestion control. Simulation shows that it works well in protecting congestion-sensitive flows from congestion-causing flows and exhibits better performances than other AQM schemes. Also we use partial state information, proposed in LRURED, to improve our mechanism.

• 한국경영정보학회:학술대회논문집
• /
• 2008.06a
• /
• pp.1084-1087
• /
• 2008

새로운 인터넷 응용 프로그램들이 등장하면서 망 중립성에 대한 논의는 계속되고 있다. 백본망 제공자의 입장에서 자신의 망에 부과를 주는 응용프로그램들 때문에 비용을 추가로 지불해야 한다는 사실은 오래된 문제이긴 하지만 새롭게 주목을 받고 있다. 많은 연구가 인터넷혼잡에 대한 문제 해결을 위해 가격체계를 도입해야 한다는 사실을 밝혔지만, 종량제 도입시도는 사회적 저항을 불러일으켰다. 하지만 IPTV나 VoIP와 같은 응용프로그램들이 요구하는 품질을 맞추기 위해서 망 투자는 계속되어야 하지만, 정치적 사회적 반대로 인해 사업자의 선택은 제한되어 있다. 한편 인터넷 버전 6를 위한 구축비용이 엄청나며, 새로운 표준 도입의 기술적 문제 때문에 많은 사업자들이 주저하고 있다. 이 논문은 우선대기열을 사용해서, 망 사업자가 무차별, 무계급(non-priority)에 기반한 인터넷에서 차별화된(prioritized) 인터넷 망 서비스를 제공할 때 일어날 수 있는 문제를 살펴본다. 현재의 서비스 수준보다 더 좋거나 같은 수준의 (즉 Pareto-improving) 서비스를 차별화된 가격체계에서 제공할 수 있을지에 대한 가능성과 문제점들을 살펴보면서, 망 사업자와 사용자 모두에게 유익할 수 있는 방안을 검토해 본다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.325-329
• /
• 2007

The mobile and multimedia service on wireless network have been leaded from the improvement of telecommunication techniques. A typical multimedia service, a video transmission usually requires larger bandwidth than voice transmission. Many channel allocation algorithms for Orthogonal Frequency Division Multiple Access (OFBMA) to use resources more efficiently, Previous channel allocation algorithms have developed with an assumption that the data traffic is constant bit rate (CBR). However, existing algorithms are not suitable to video traffic because it usually generates a variable bit rate (VBR) traffic. In this paper, we proposed a new channel allocation algorithm called a queue-based channel allocation. it is more suitable to transmit the video traffics. Also, a problem are notified in case of realtime generated video traffic and a corresponding heuristic solution was proposed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.113-118
• /
• 1995

본 연구는 폐쇄형 대기행렬망(CQN:Closed Network of Queue)으로 표시되는 FMS 시스템의 최적 성능을 산정하는 방법과 각 작업장의 작업 부하 (Workload)를 최적화하기 위한 방법에 관한 연구이다. FMS 생산 시스템의 성능 (Performance)을 기존의 생산률(Production Rate)외에 기대생산률 (Expected Production Rate), 평균 대기작업량(Mean Queueue Length), 및 기대 투자이용률(Expected Investment Utilization Rate)과 이들 각각의 분산 (Variance)들을 고려하였다. 이러한 성과측정 문제를 수리 모델링하고 이를 이용하여 각 작업장에서의 가공 장비의 그룹(Machine Group)별 최적 작업배 분(Workload) 조건을 보였다. 또한 위의 과정을 최근의 FMS 전용 Simulator인 FACTOR/AIM을 이용한 분석 결과와 비교하여 보였다.

• Journal of the Korea Safety Management & Science
• /
• v.9 no.5
• /
• pp.57-66
• /
• 2007

본 논문에서는 통신망의 트래픽 제어를 위한 무한버퍼, 단일 서버와 배치도착과정을 갖는 대기행렬 모형을 고려하였다. 또한 고객 도착 형태와 서비스의 분포는 지수분포를 배치 흐름은 포아송 정상과정 및 배치크기는 기하분포를 따른다고 가정하였다. 서비스를 받기 위해 시스템으로 들어오는 배치의 크기는 시스템의 상태에 따라서 트래픽 제어가 가능하다. 이와 같은 조건에서 시스템에 있는 고객의 수와 배치크기에 대한 결합 확률분포를 분석하였고, 행렬기법을 적용하여 시스템 체재시간에 대한 분석이 수행되었다. 마지막으로 시스템의 주요 성능평가 척도에 대한 효율적인 제어기법에 대한 언급과 수치예제를 통해서 증명하였다.