• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2764-2783
• /
• 2012

Network virtualization supports future Internet environments and cloud computing. Virtualization can mitigate many hardware restrictions and provide variable network topologies to support variable cloud services. Owing to several advantages such as low cost, high flexibility, and better manageability, virtualization has been widely adopted for use in network virtualization platforms. Among the many issues related to cloud computing, to achieve a suitable cloud service quality we specifically focus on network and performance isolation schemes, which ensure the integrity and QoS of each virtual cloud network. In this study, we suggest a virtual network platform that uses Xen-based virtualization, and implement multiple virtualized networks to provide variable cloud services on a physical network. In addition, we describe the isolation of virtual networks by assigning a different virtualized network ID (VLAN ID) to each network to ensure the integrity of the service contents. We also provide a method for efficiently isolating the performance of each virtual network in terms of network bandwidth. Our performance isolation method supports multiple virtual networks with different levels of service quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.620-629
• /
• 2012

This paper proposes packet aggregation scheme for considering energy consumption of mobile devices on guaranteeing quality of voice. To our purpose, we analyze VoIP service on wireless multi-hop channel in terms of delay, packet loss and energy consumption when packet aggregation scheme is applied to VoIP service. Moreover, we induce a cost function with considering of tradeoff relation between quality of voice and energy consumption.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.638-651
• /
• 2000

When the bandwidth resources in a packet-switched network are shared among sessions by MAX-MIN flow control each session is required to transmit its data into the network subject to the MAX-MIN fair rate which is solely determined by network loadings. This passive behavior of sessions if fact can cause seri-ous QoS(Quality of Service) degradation particularly for real-time multimedia sessions such as video since the rate allocated by the network can mismatch with what is demanded by each session for its QoS. In order to alleviate this problem we extend the concept of MAX-MIN fair bandwidth allocations as follows: Individual bandwidth demands are guaranteed if the network can accommodate them and only the residual network band-width is shared in the MAX-MIN fair sense. On the other hand if sum of the individual bandwidth demands exceeds the network capacity the shortage of the bandwidth is shared by all the sessions by reducing each bandwidth guarantee by the MAX-MIN fair division of the shortage. we present a novel flow control algorithm to achieve this extended MAX-MIN fairness and show that this algorithm can be implemented by the existing ATM ABR service protocol with minor changes. We not only analyze the steady state asymptotic stability and convergence rate of the algorithm by appealing to control theories but also verify its practical performance through simulations in a variety of network scenarios.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.2
• /
• pp.584-589
• /
• 2010

In this paper we suggest multimedia synchronization model that is based on the Petri-net and services desirable quality of service requirement. Proposed model applies variable buffer which can be allowed, and then it presents high quality of service and real time characteristics. In this paper we expend Petri-net and propose new multimedia synchronization specification model in PBMSM and apply two analysis method of Petri-net to prove our model suggested. We compared with other models and showed high QoS.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.611-616
• /
• 2003

Recently, the HFC-CATV network stand in a substructure of superhighway information network. Because of sharing up to 500 of subscribes, the Collision Resolution Algorithm needs in the upstream channel of HFC-CATV network. In order to provide Quality of Service (QoS) to users with real-time data such as voice, video and interactive service, the research of Collision Resolution Algorithm must include an effective priority scheme. In IEEE 802.14, the Collision Resolution Algorithm has high request delay because of static PNA(Priority New Access) slots structure and different priority traffics with the same probability. In order to resolve this problem, this paper proposed dynamic priority collision resolution algorithm with ternary tree algorithm. It has low request delay according to an increase of traffic load because high priority traffic first resolve and new traffic content with different probability. In the result of the simulation, it demonstrated that the proposed algorithm needs lower request delay than that of ternary tree algorithm with static PNA slots structure.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.37-43
• /
• 2009

Streaming video service over wireless and mobile communication networks has received significant interests from both academia and industry recently. Specifically, mobile WiMAX (IEEE 802.16e) is capable of providing high data rate and flexible Quality of Service (QoS) mechanisms, supporting mobile streaming very attractive. However, we need to note that streaming videos can be partially deteriorated in their macroblocks and/or slices owing to errors on OFDMA subcarriers, as we consider that compressed video sequence is generally sensitive to the error-prone channel status of the wireless and mobile network. In this paper, we introduce an OFDMA subcarrier-adaptive mobile streaming server based on cross-layer design. This streaming server system is substantially efficient to reduce the deterioration of streaming video transferred on the subcarriers of low power strength without any modifications of the existing schedulers, packet ordering/reassembly, and subcarrier allocation strategies in the base station.

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.201-208
• /
• 2005

To guarantee the quality of service for user request, we should consider various kinds of things. The important thing of QoS is that response time of service is transparently suggested 'to network users. We can know the response time of service using the information of network latency, system latency, and software component latency, In this paper, we carried out the modeling of network latency and analyzed the effects of packets loss to the network latency, Also, we showed the effectiveness of modeling using the NS-2. This research can help to provide the effective methods in case of SLA(Service Level Agreement) agreement between service provider and user.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2680-2696
• /
• 2018

The collaborative content caching system is an effective solution developed in recent years to reduce transmission delay and network traffic. In order to decrease the service end-to-end transmission delay for future 5G ultra-dense networks (UDN), this paper proposes a novel service migration method that can guarantee the continuity of service and simultaneously reduce the traffic flow in the network. In this paper, we propose a service migration optimization model that minimizes the cumulative transmission delay within the constraints of quality of service (QoS) guarantee and network condition. Subsequently, we propose an improved firefly algorithm to solve this optimization problem. Simulation results show that compared to traditional collaborative content caching schemes, the proposed algorithm can significantly decrease transmission delay and network traffic flow.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1623-1635
• /
• 2011

Fourth-generation (4G) cellular communication systems must provide different quality-of-service (QoS) to users according to the service type, membership class, and usage case of each user. For the purpose of user's QoS differentiation, we propose an enhanced uplink random access scheme for bandwidth request. More specifically, we divide a bandwidth request channel into two parts: One is a primary region and the other is a secondary region. Then, each region has a unique minimum access class that allows only specific users to perform random access through that region. By doing so, we can reduce collision probability and increase the success probability of bandwidth request. From the perspective of standardization, we presented this scheme in the IEEE 802.16m Session #66 held on March 2010. As a result, the concept of the proposed scheme and required messages were defined in the 802.16m standard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7A
• /
• pp.770-777
• /
• 2007

Smaller cell size in the micro-cell or pico-cell structure brings about more frequent hand-overs between cells, and higher speed movement of the mobile terminal makes short the permissible time interval for executing these hand-over procedures. In this situation the hand-over failure may occur or some packets may be lost during the hand-over. Moreover a rapid degradation of throughput is triggered by packet re-transmission for compensating such errors. The QoS (Quality of Services) of mobile multimedia applications with higher bits rate requirements and higher speed mobility are severely affected by even shot service interruption. This paper proposes a new hand-over scheme to provide seamless services in the next generation mobile communication systems. Simulation is done to evaluate the performance of the proposed scheme based on its hand-over failure rate and packet loss rate.