• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.399-406
• /
• 2002

We consider design of multiservice network link, in which connections of constant- and adaptive-rate services arrive and leave dynamically. We propose performance analysis and design methods of these dynamic multiservice networks. A multiservice network link is modeled by a Markov chain, and data rates for adaptive-rate connections are derived using QBD (Quasi-Birth-Death) processes and matrix-geometric equations. We estimate average number of adaptive-rate connections, average data rate and average connection delay. The performance of constant-rate connections is determined from the blocking probability of the connections. Based on the performance of constant-and adaptive- rate connections, we propose a design methods of a network link to satisfy performance requirements of constant- and adaptive-rate connections (data rates, delay, blocking probability). Our methods can be used for the analysis and design of network switch supporting dynamic data and voice (video) traffic simultaneously.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.33-42
• /
• 2001

We consider a model describing large scale performance of multiservice networks supporting both constant- and adaptive-rate services. As the number of constant-rate connection changes over time in multiservice networks, the available bandwidth for adaptive-rate connections changes as well. We estimate the available bandwidth for adaptive-rate service in a dynamically changing traffic environment based on Erlang fixed point equation and Little\`s law. The bandwidth allocation for adaptive-rate service is determined by the max-min fairness criterion. We find an upper bound on the average minimum throughput for adaptive-rate service, and 7how that the bound is achieved in large-capacity networks. This is verified using network examples. Since max-min fair allocation may not maximize the total throughput or revenue in a network, we consider adjustments via network level priority schemes to increase efficiency.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.216-219
• /
• 2010

최근 기존의 지상파 DMB와 역호환성을 유지하면서 전송속도를 증대시켜, 비디오 서비스의 품질을 증대시키거나, 다른 서비스들을 추가로 제공할 수 있는 새로운 이동멀티미디어 방송을 위한 전송기술이 개발되었으며, '고전송율 지상파 디지털멀티미디어방송(AT-DMB)' 이라 명명되었다. 현재 고전송율 지상파 디지털멀티미디어방송의 상용화 서비스를 위한 필트 테스트가 진행 중이며, 이를 이용한 신규서비스 개발이 추진되고 있다. 본 논문은 고전송율 지상파 디지털멀티미디어방송 시스템을 이용하여 제공할 수 있는 모바일 멀티미디어 서비스들을 제안한다. 이를 위해 고전송율 지상파 디지털멀티미디어방송의 전송 특성을 분석하였으며, 이를 이용해 제공될 수 있는 모바일 멀티미디어 서비스 모델들을 포함한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2010.05a
• /
• pp.417-419
• /
• 2010

웹서비스의 성능행상을 위해서는 서비스에 대한 추상적인 모델에 대한 설계 및 서비스 비용, 성능, 신뢰성 및 확장성 등의 서비스 품질 속성에 대한 정의 및 확장이 요구된다. 성능 측면에서 품질은 서비스 당 평균 응답 시간, 단위 시간 동안의 처리율이 포함된다. 본 연구에서는 웹 서비스 지원을 위해 단위 시간당 처리율을 개선하여 성능을 개선코자 하였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.3
• /
• pp.149-159
• /
• 2006

To provide on-demand video streaming services through the network, video objects with both high and low client request rates should be served efficiently. In this paper, we propose a dynamic on-demand streaming approach for providing services efficiently regardless of the client request rate. This approach can maintain QoS by transitioning the service scheme according to the request rate. The server provides services by the Heuristic broadcasting approach when the client request rate is low and by Striping broadcast, one of many Periodic broadcast approaches, when the client request rate is high. The server knows the variations of client request rates by the number of service channels and decides the transition to more efficient service schemes on its own. We simulated this scheme transition with various client request intervals and traces from a company providing streaming services. The results show that the performance of our approach is reasonable.

• The Journal of the Korea Contents Association
• /
• v.19 no.1
• /
• pp.648-659
• /
• 2019

The social network services have spread rapidly with new issues in terms of the security. The purpose of this study is to longitudinally verify the influence of relationships among online security, social network service, and smartphone expense. The analyses were conducted on panel data of SNS users from 2015 to 2017 based on the SEM methodologies. The results indicated that anxiety of online security had an effect on the SNS usage. In addition, The results showed that anxiety of online security and SNS usage had a significant influence on the smartphone expenses. This study could provide useful guidelines for researchers and company managers, and an opportunity to develop an understanding of social network trends.

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.27-35
• /
• 2015

We analyze an M/G/1/K queueing system with queue-length dependent service and arrival rates. There are a single server and a buffer with finite capacity K including a customer in service. The customers are served by a first-come-first-service basis. We put two thresholds $L_1$ and $L_2$($${\geq_-}L_1$$ ) on the buffer. If the queue length at the service initiation epoch is less than the threshold $L_1$, the service time of customers follows $S_1$ with a mean of ${\mu}_1$ and the arrival of customers follows a Poisson process with a rate of ${\lambda}_1$. When the queue length at the service initiation epoch is equal to or greater than $L_1$ and less than $L_2$, the service time is changed to $S_2$ with a mean of $${\mu}_2{\geq_-}{\mu}_1$$. The arrival rate is still ${\lambda}_1$. Finally, if the queue length at the service initiation epoch is greater than $L_2$, the arrival rate of customers are also changed to a value of $${\lambda}_2({\leq_-}{\lambda}_1)$$ and the mean of the service times is ${\mu}_2$. By using the embedded Markov chain method, we derive queue length distribution at departure epochs. We also obtain the queue length distribution at an arbitrary time by the supplementary variable method. Finally, performance measures such as loss probability and mean waiting time are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.854-861
• /
• 2003

In this paper, we proposed the fuzzy control algorithm for efficient buffer control about traffic that is connected in ATM networks. The proposed Fuzzy control algorithm has total traffic arrival ratio, buffer occupancy ratio and Fuzzy set to search for dynamic service rates in server. That is, is based on Fuzzy logic according to the arrival ratio of total traffic and buffer occupancy ratio that is happened and reasoning. Then, made reasoning result control service rates in server about traffic that is connected with defuzzification value. Performance analysis result: it was confirmed that with the proposed scheme, performance improves at cell loss rate, when compared with the existing PBS scheme.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.90-93
• /
• 1998

컴퓨터 통신에서 실시간 멀티미디어 응용은 보장된 통신 서비스 성능을 요구하므로 이를 위해서는 트래픽이 버스트할 때 망 내에서 자원을 예약하여 접속시 피크율을 기반으로 망의 이용율을 높인다. 본 논문에서 결정론적 지연 범위을 이용하여 모든 접속에서 피크 율의 합이 링크 속도 보다 더 커질 때 버스트 상태의 트래픽에 대한 링크를 넘어 보장될 수 있음을 보인다. 또한 트래픽이 버스트할 때 새로운 결과는 연결수락된 접 속의 수를 증가시키므로 이러한 결과는 스위치에서 속도가 제어된 서비스 규율을 사용함으로써 단일 스위치로부터 망의 이용율을 개선할 수 있다.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.477-488
• /
• 2001

In wireless networking environments, supporting guaranteed quality of service to mobile hosts is difficult due to the facts that wireless networks have limited bandwidth and mobile hosts frequently move in and out of cells. In spite of the characteristics of wireless communications, the quality of some types of services, i.e., real-time services, must be guaranteed at a certain level. When a mobile host moves into another cell, service rates for mobile hosts in wireless networks may be adjusted since wireless networks have limited bandwidths. In this paper, we propose two resource allocation algorithms in wireless mobile networks, using quality of service (QoS) specifications. For efficient use of resources of wireless networks, the proposed algorithms dynamically allocate rates of flows in proportion to QoS with limited resources.