• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.661-668
• /
• 2009

The Extended real-time Polling Service (ErtPS) is proposed tosupport QoS of VoIP service with silence suppression which generates variable size data packets in IEEE 802.16e systems. If the silence is suppressed, VoIP should support Comfort Noise Generation (CNG) which generates comfort noise for receiver's auditory sense to notify the status of connection to the user. CNG mode in silent-period generates a data with lower bit rate at long packet transmission intervals in comparison with talk-spurt. Therefore, if the ErtPS, which is designed to support service flows that generate data packets on a periodic basis, is applied to silent-period, resources of the uplink are used inefficiently. In this paper, we proposed the Improved ErtPS algorithm for efficient resource utilization of the silent-period in VoIP traffic supporting CNG. In the proposed algorithm, the base station allocates bandwidth depending on the status of voice at the appropriate interval by havingthe user inform the changes of voice status. The Improved ErtPS utilizes the Cannel Quality Information Channel (CQICH) which is an uplink subchannel for delivering quality information of channel to the base station on a periodic basis in 802.16e systems. We evaluated the performance of proposed algorithm using OPNET simulator. We validated that proposed algorithm improves the bandwidth utilization of the uplink and packet transmission latency

• Journal of Korea Multimedia Society
• /
• v.21 no.10
• /
• pp.1182-1194
• /
• 2018

The Dynamic Adaptive Streaming over HTTP(DASH) is envisioned to evolve to meet an increasing demand on providing seamless video streaming services in the near future. The DASH performance heavily depends on the client's adaptive quality selection algorithm that is not included in the standard. The existing conventional algorithms are basically based on a procedural algorithm that is not easy to capture and reflect all variations of dynamic network and traffic conditions in a variety of network environments. To solve this problem, this paper proposes a novel quality selection mechanism based on the Deep Q-Network(DQN) model, the DQN-based DASH Adaptive Bitrate(ABR) mechanism. The proposed mechanism adopts a new reward calculation method based on five major performance metrics to reflect the current conditions of networks and devices in real time. In addition, the size of the consecutive video segment to be downloaded is also considered as a major learning metric to reflect a variety of video encodings. Experimental results show that the proposed mechanism quickly selects a suitable video quality even in high error rate environments, significantly reducing frequency of quality changes compared to the existing algorithm and simultaneously improving average video quality during video playback.

• The Journal of the Korea Contents Association
• /
• v.2 no.3
• /
• pp.119-126
• /
• 2002

The QoS(Quality of Service) guarantee mechanism is one of critical issues in the wireless network. Real-time applications like VoIP(Voice over IP) in All-IP networks need smooth handoffs in order to minimize or eliminate packet loss as a Mobile Host(MH) transitions between network links. In this paper, we design a new multicasting algorithm using DB(Dynamic Buffering) mechanism for Mobile-IPv6. A key feature of the new protocol is the concepts of the DB and MRA(Multicast Routing Agent) to reduce delivery path length of the multicast datagram. Particularly, the number of tunneling and average routing length of datagram are reduced relatively, the multicast traffic load is also decreased.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1415-1418
• /
• 2002

최근 정보 통신 기술의 발달에 따라 음성 서비스 등과 같은 단일 서비스를 제공하던 무선 통신망이 음성, 데이터, 고화질 정지화면, 동영상 및 다양한 정보형태의 멀티미디어 서비스를 추구하고 있다. 이처럼 다양한 종류의 멀티미디어 트래픽을 지원하기 위해서는 매체 접근 제어(MAC) 프로토콜이 필요하다. 본 논문에서는 서로 다른 종류의 트래픽이 혼재된 무선 ATM 환경에서 폭주제어 정보를 가지고 각 트래픽 클래스의 QoS를 만족할 수 있는 동적 자원 할당 방식 기반의 MAC 프로토콜을 제안한다. 각 트래픽 클래스의 데이터 전송 스케줄링을 제안함으로서 CBR이나 VBR의 실시간 데이터의 손실을 최소화하고 네트워크 상태에 따른 ABR 트래픽 클래스에 최소의 고정적인 대역폭을 할당함으로서 실시간 비실시간 데이터의 비효율성 문제 해결 방안을 제시한다. 그리고 각각의 트래픽 모델에 대한 허용 테스트 식을 제공함으로서 다른 실시간 또는 비실시간 채널에 영향을 수지 않고 새로운 채널을 설정한 수 있는 방안을 제시한다.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.567-579
• /
• 2016

Several energy saving techniques in cellular wireless networks such as active base station (BS) selection, transmit power budget adaptation and user association have been studied independently or only part of these aspects have been considered together in literature. In this paper, we jointly tackle these three problems and propose an integrated framework, called dynamic cell reconfiguration (DCR). It manages three techniques operating on different time scales for ultimate energy conservation while guaranteeing the quality of service (QoS) level of users. Extensive simulations under various configurations, including the real dataset of BS topology and utilization, demonstrate that the proposed DCR can achieve the performance close to an optimal exhaustive search. Compared to the conventional static scheme where all BSs are always turned on with their maximum transmit powers, DCR can significantly reduce energy consumption, e.g., more than 30% and 50% savings in uniform and non-uniform traffic distribution, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.53-60
• /
• 2007

We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.1-9
• /
• 2010

In this paper we propose a scheduling algorithm for supporting Quality of Service(QoS) in IEEE 802.11e HCCA referred to as ASR-DRR and ASD-DRR, which aims at providing improved performance for the support of multimedia traffic. Although We identify the problem of the current IEEE 802.11e HCCA (Hybrid Coordination Function Controlled Channel Access) scheduler and its numerous variations, that the queue information cannot be notified to the Hybrid Coordinator (HC) timely, therefore the uplink delay lengthens unnecessarily. We suggests a simple solution and a couple of implementation practices, namely the Adaptive Scheduler with RTS/CTS (ASR) and Adaptive Scheduler with Data/Ack (ASD). They are both further elaborated to emulate the Deficit Round Robin (DRR) scheduler. They are also compared with existing exemplary schedulers through simulation, and shown to perform well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.192-198
• /
• 2008

In this paper, we propose a scheme that improves the transmission performance of realtime multimedia data in wireless Local Area Network (LAN) environment, through the dynamical control of Transmission Opportunity (TXOP) period of the IEEE 802.11e HCCA Medium Access Control (MAC). The existing schedulers which determine the frame transmission time and its duration could not appropriately cope with the change of physical transmission rate, since the TXOP period has remained unchanged with the change of transmission rate of the wireless station. Our scheme is devised to keep the transmission performance of real-time multimedia data effectively unchanged by making TXOP period be extended when the transmission rate gets reduced. The proposed scheme is experimented along with IEEE 802.11e reference model using NCTUns simulator, which shows that the multimedia data is effectively delivered with the change of transmission rate as the distance between the wireless station and its access point increases.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.997-1005
• /
• 2010

Recently, there has been a growing interest in the use of WLAN technology due to its easy deployment, flexibility and so on. Examples of WLAN applications range from standard internet services such as Web access to real-time services with strict latency/throughput requirements such as multimedia video and voice over IP on wireless network environments. Fair and efficient distribution of the traffic loads among APs(Access Points) has become an important issue for improved utilization of WLAN. This paper focuses on an AP selection scheme for achieving better load balance, and hence increasing network resource utilization for each user on wireless network environments. This scheme makes use of active scan patterns and the network delay as main parameters of load measurement and AP selection. This scheme attempts to estimate the AP traffic loads by observing the up/down delay and utilize the results to maximize the link resource efficiency through load balancing. We compared the proposed scheme with the original SNR(Signal to Noise Ratio)-based scheme using the NS-2(Network Simulation.2). We found that the proposed scheme improves the throughput by 12.5% and lower the network up/down link delay by 36.84% and 60.42%, respectively. All in all, the new scheme can significantly increase overall network throughput and reduce up/down delay while providing excellent quality for voice and video services.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.6
• /
• pp.185-196
• /
• 2015

Energy aware server clusters aim to reduce power consumption at maximum while keeping QoS(Quality of Service) compared to energy non-aware server clusters. They adjust the power mode of each server in a fixed or variable time interval to let only the minimum number of servers needed to handle current user requests ON. Previous studies on energy aware server cluster put efforts to reduce power consumption further or to keep QoS, but they do not consider energy efficiency well. In this paper, we propose an energy efficient cluster management based on autonomous learning for energy aware server clusters. Using parameters optimized through autonomous learning, our method adjusts server power mode to achieve maximum performance with respect to power consumption. Our method repeats the following procedure for adjusting the power modes of servers. Firstly, according to the current load and traffic pattern, it classifies current workload pattern type in a predetermined way. Secondly, it searches learning table to check whether learning has been performed for the classified workload pattern type in the past. If yes, it uses the already-stored parameters. Otherwise, it performs learning for the classified workload pattern type to find the best parameters in terms of energy efficiency and stores the optimized parameters. Thirdly, it adjusts server power mode with the parameters. We implemented the proposed method and performed experiments with a cluster of 16 servers using three different kinds of load patterns. Experimental results show that the proposed method is better than the existing methods in terms of energy efficiency: the numbers of good response per unit power consumed in the proposed method are 99.8%, 107.5% and 141.8% of those in the existing static method, 102.0%, 107.0% and 106.8% of those in the existing prediction method for banking load pattern, real load pattern, and virtual load pattern, respectively.