• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.239-246
• /
• 2009

In this study, we analyze the mean waiting time on the nested open queueing network, where the population within each subnetwork is controlled by a semaphore queue. The queueing network can be transformed into a simpler queueing network in terms of customers waiting time. A major characteristic of this model is that the lower layer flow is halted by the state of higher layer. Since this type of queueing network does not have exact solutions for performance measure, the lower bound and upper bound on the mean waiting time are checked by comparing them with the mean waiting time in the transformed nested queueing network. Simulation estimates are obtained assuming Poisson arrivals and other phase-type arrival process, i.e., Erlang and hyper-exponential distributions. The bounds obtained can be applied to get more close approximation using the suitable approach.

• Journal of Internet Computing and Services
• /
• v.17 no.2
• /
• pp.1-9
• /
• 2016

Users are provided infrastructure such as CPU, memory, network, and storage as IaaS (Infrastructure as a Service) service on cloud computing environments. However storage instances cannot support the maximum storage capacity that SQL servers can use, because the capacity of instances provided by service providers is usually limited. In this paper, we propose a method of securing mass storage capacity for SQL servers by sharing network disks with limited storage capacity. We confirmed through experiments that it is possible to secure mass storage capacity, which exceeds the maximum storage capacity provided by an instance with Amazon EBS on Amazon EC2 Windows environments, and it is possible to improve the overall performance of the SQL servers by increasing the disk capacity and performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.10
• /
• pp.654-663
• /
• 2014

Heterogeneous network (HetNet) with the various types of cells, e.g., with the different cell size and transmit power, has been introduced to improve the cell coverage and areal capacity in cellular mobile communication system. In this paper, we consider a practical situation in which all cells share the same wireless resource while some of them have a limited backhaul capacity. More specifically, we formularize a cell association problem that utilizes the minimum wireless resource while satisfying the quality of service (QoS) of all users in terms of their transmission time constraint, and propose a distributed algorithm to find the optimal solution. In the event of bottleneck at the backhaul link in some small cells, the proposed algorithm off-loads some users to the adjacent cell with the less congested backhaul capacity. Finally, we verify that the proposed algorithm supports the more numbers of users to satisfy the specified level of QoS than the conventional user association scheme under the limited access and backhaul capacities.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.183-189
• /
• 2018

This paper proposes distributed file placement and coverage expansion techniques for mitigating the traffic bottleneck in backhaul for small-cell networks. In order to minimize the backhaul load with limited memory space, the proposed scheme controls the coverage and file placement of base station according to file popularity distribution and memory space of base stations. In other words, since the cache hit ratio is low when there is small memory capacity or widespread file popularity distribution, the base stations expand its coverage and cache different set of files for the user located in overlapped area to exploit multiple cached file sets of base stations. Our simulation results show that the proposed scheme outperforms the conventional cache strategy in terms of network throughput when there is small memory capacity or widespread file popularity distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6B
• /
• pp.464-473
• /
• 2012

In this paper, we derive the gain of network coding when it is utilized for retransmission in wireless networks. To the end, we derive the outage probability of the network-coded transmission and express the diversity order as a function of the number of nodes and the node's listening probability. From the outage probability, we formulate the ${\epsilon}$-outage capacity. The network-coding gain is the ratio of the ${\epsilon}$-outage capacities between network-coded and non-coded transmissions. Under our system model, we find that the network-coding gain is a function of the diversity order. Moreover, when there are infinitely many nodes, we show that the network coding gain approaches $0.25{\epsilon}^{-1}$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2405-2410
• /
• 2012

The 4th generation mobile communication system, LTE, does not support an additional core network to provide voice service, and it is merged into a packet network based on all IP. Although Voice service over LTE can be supported by VoIP, it will be provided by the existing 3G networks because of the discontinuity of LTE coverage. However, it is inevitable to adopt VoIP over LTE to provide high quality voice service. In this paper, we investigate the capacity of VoIP over LTE. Our results indicate that spectral efficiency can be significantly improved as channel bandwidth increases in terms of VoLTE capacity. In addition, we can achieve higher VoLTE capacity without decreasing control channel capacity.

• Information and Communications Magazine
• /
• v.28 no.2
• /
• pp.17-24
• /
• 2011

휴대 가능한 이동 단말의 광범위한 보급과 무선 인터넷 기술을 근간으로 하는 모바일 컴퓨팅의 급속한 확대는 무선 네트워크 용량의 획기적인 증대를 요구하게 됐다. 본 논문에서는 공간 재사용(Spatial Reuse)을 통한 전송 용량 증대를 달성하기 위해 소형화된 셀 기반의 무선 네트워크 구조를 제안한다. 특히, 이 네트워크를 구성하기 위한 핵심기술을 분산화된 계층 교차 최적화, 초소형셀을 위한 이동성 지원, 무선 네트워크 가상화로 구분, 현재 진행중인 연구 내용을 자세하게 기술하고 이와 관련된 주요 이슈들을 함께 다루도록 한다.

• 한국IT서비스학회:학술대회논문집
• /
• 2010.05a
• /
• pp.202-206
• /
• 2010

무선 메쉬 네트워크(Wireless Mesh Network, WMN)는 유비쿼터스 환경 및 무선 브로드 밴드 액세스를 제공하기 위한 차세대 핵심기술로 떠오르고 있다. 다양한 멀티미디어 서비스가 존재하는 유비쿼터스 환경에서 실시간 서비스 제공을 위해서는 네트워크 용량 증대가 요구되며, 이를 위하여 WMN에서 네트워크 용량을 증대시키기 위한 다중 인터페이스 활용 기술이 중요한 이슈로 대두되고 있다. 하지만 WMN에서 주로 사용하는 인터페이스 기술인 IEEE 802.11 표준에서는 IEEE 802.11b/g 또는 IEEE 802.11a와 같은 스펙에 따라 간섭 없이 사용할 수 있는 채널은 3개 또는 12개로 한정되어 있기 때문에 다중 인터페이스 활용을 통해 증대된 가용 자원 효율성을 극대화하기 위해서 효율적인 채널 할당 기법의 연구가 요구되며, 이에 따라 본 논문에서는 채널 그룹 설정을 통하여 간섭 발생을 최소화하며 채널스캐닝 과정을 수행하지 않고 채널 변경을 진행함으로써 채널 스캐닝 과정으로 발생하는 전송 지연을 최소화하여 네트워크 성능을 향상시킬 수 있는 채널 할당 기법을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.433-436
• /
• 2015

스마트폰이 과거 수년 사이에 급격하게 확산됨에 따라 LTE망 운영자들은 많은 모바일 데이터 트래픽 용량에 대처하기 위해 노력하고 있다. 이러한 문제를 해결하기 위해, 본 논문에서는 LTE/EPC 네트워크에서 집중화된 제어 평면과 분산된 P-GW를 지원하는 새로운 SDN 기반 분산 이동성 관리기법을 제안한다. 네트워크 성능을 더욱 향상 시키기 위해, LTE 사용자들 사이에 교환되는 내부 트래픽을 위한 경로 최적화를 제안한다. 제안된 기법과 기존의 LTE/EPC 네트워크의 기법의 P-GW 데이터 처리 용량과 데이터 처리 수 측면에서 성능을 비교함으로써, 제안된 기법이 LTE/EPC 코어 네트워크의 확장성을 증가시키는 효율적인 방법임을 보여준다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.179-187
• /
• 2011

Recently, cognitive radio attracts lots of interest to effectively utilize the limited spectral resource. In the previous researches, we proposed a method to enhance the system capacity of the overall network by using Selfish Symbiotic architecture and Non-selfish Symbiotic architecture. In this research, we further enhance the previous works to OFDM-based CR networks by using efficient subchannel allocation. The system performance is evaluated through intensive simulations with multiple primary users as well as a single primary user with different numbers of CR users.