• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.363-373
• /
• 2010

The existing QoS mechanisms for video streaming are short of the consideration for various user environments and the characteristic of streaming applying programs. In order to overwhelm this problem, studies on the video streaming protocols exploiting scalable video coding (SVC), which provide spatial, temporal, and qualitative scalability in video coding, are progressing actively. However, these protocols also have the problem to deepen network congestion situation, and to lower fairness between other traffics, as they are not equipped with congestion control mechanisms. SVC based streaming protocols also have the problem to overlook the property of videos encoded in SVC, as the protocols transmit the streaming simply by extracting the bitstream which has the maximum bit rate within available bandwidth of a network. To solve these problems, this study suggests TCP-friendly network adaptive SVC streaming(T-NASS) protocol which considers both network status and SVC bitstream property. T-NASS protocol extracts the optimal SVC bitstream by calculating TCP-friendly transmission rate, and by perceiving the network status on the basis of packet loss rate and explicit congestion notification(ECN). Through the performance estimation using an ns-2 network simulator, this study identified T-NASS protocol extracts the optimal bitstream as it uses TCP-friendly transmission property and perceives the network status, and also identified the video image quality transmitted through T-NASS protocol is improved.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.38 no.4
• /
• pp.25-34
• /
• 2010

This study was conducted to develop evaluation indicators to improve athletic performance and operational management of golf courses and the results of the research are as follows. Through theoretical research and a preliminary professional survey, 15 on-going evaluations of golf course composition and operational management and 55 sub-evaluation indices were rejected while 10 on-going evaluations and 52 sub-evaluation indicators were reconfigured as final for environmental-friendliness, level of member services, level of human service of game personnel, difficulties of course, management level of the course, fairness of operational management, accessibility and location characteristic, traditions and ambiance of the golf club, quality of course, and course layout. When analyzing the important decision factors in golf course user preference evaluation indicators, the following contributed in the order of higher to lower contributions: the management level of the course, excellence of the course, level of human services for personnel, course layout and environmental-friendliness. When identifying the path coefficient of golf course evaluation indicators, the curvature of a hole and the length of the course had a causal effect on the 'course layout' section. Tournament facilities and various shot values had a causal relationship with 'excellence of the course', in the order of higher to lower, and convenience of waiting and fair allocation of reservations for 'fairness of operational management'. The history of the golf course and its environmental characteristics, history and culture of the region have relatively higher causal effects on 'traditions of the golf club' and geographical conditions on 'accessibility and location characteristics', pesticide and fertilizer usage and water pollution on 'environmental-friendliness', and member benefit and kindness of employees on 'level of member services'. The kindness and expertise of the game personnel had a relatively higher causal effect on the 'level of human services of game personnel', the location of tenning area, and location of OB and hazards on 'difficulties of course', and rough conditions and obstacles management on 'management level of the course'. There is a need to complete a systematic evaluation index system for golf course user preferences through future studies for a more detailed assessment, as well as a process to verify these evaluation indicators by application to domestic and international golf courses.

• Information Systems Review
• /
• v.14 no.1
• /
• pp.85-103
• /
• 2012

ISMP is a method of writing clearly the user requirements in the RFP(Request for Proposal) of the IS development projects. Unlike the conventional methods of RFP preparation that describe the user requirements of target systems in a rather superficial manner, ISMP systematically identifies the businesses needs and the status of information technology, analyzes in detail the user requirements, and defines in detail the specific functions of the target systems. By increasing the clarity of RFP, the scale and complexity of related businesses can be calculated accurately, many responding companies can prepare proposals clearly, and the level of fairness during the evaluation of many proposals can be improved, as well. Above all though, the problems that are posed as chronic challenges in this field, i.e., the misunderstanding and conflicts between the users and developers, excessive burden on developers, etc. can be resolved. This study is a case study that analyzes the execution process, execution accomplishment, problems, and the success factors of two pilot projects that introduced ISMP for the first time. ISMP performance procedures of actual site were verified, and how the user needs in the request for quote are described was examined. The satisfaction levels of ISMP RFP for quote were found to be high as compared to the conventional RFP. Although occurred were some problems such as RFP preparation difficulties, increased workload, etc. due to the lack of understanding and execution experience of ISMP, in overall, also occurred were some positive effects such as the establishment of the scope of target systems, improved information sharing and cooperation between the users and the developers, seamless communication between issuing customer corporations and IT service companies, reduction of changes in user requirements, etc. As a result of conducting action research type in-depth interviews on the persons in charge of actual work, factors were derived as ISMP success factors: prior consensus on the need for ISMP, the acquisition of execution resources resulting from the support of CEO and CIO, and the selection of specification level of the user requirements. The results of this study will provide useful site information to the corporations that are considering adopting ISMP and IT service firms, and present meaningful suggestions on the future study directions to researchers in the field of IT service competitive advantages.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.7
• /
• pp.538-545
• /
• 2014

This paper proposes a coordinated multi-point (CoMP) based dynamic transmission scheme in a downlink multi-ship network, where a central ship selects a ship in order to maximize the utility function. The proposed scheduling scheme dynamically decides to the usage of the coordinated multi transmissions and selects a user to be served for every frame, in order to the utility function on the basis of the throughput and fairness. In particular, the proposed utilify function based scheduling scheme aims to increase the quality of service of ships at the edge of cells. Under the proportional fair scheduling, the simulation results show that the proposed utility function-based scheduling improves the throughput of the ships at the cell edge with the little sacrifice of the system capacity.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.26-35
• /
• 2009

In this paper, we investigate how to do resource allocation to guarantee a minimum user data rate at low signaling overhead in multi-cell orthogonal frequency division multiple access (OFDMA) wireless systems. We devise dynamic resource allocation (DRA) algorithms that can minimize the QoS violation ratio (i.e., the ratio of the number of users who fail to get the requested data rate to the total number of users in the overall network). We assume an OFDMA system that allows dynamic control of frequency reuse factor (FRF) of each sub-carrier. The proposed DRA algorithms determine the FRFs of the sub-carriers and allocate them to the users adaptively based on inter-cell interference and load distribution. In order to reduce the signaling overhead, we adopt a hierarchical resource allocation architecture which divides the resource allocation decision into the inter-cell coordinator (ICC) and the base station (BS) levels. We limit the information available at the ICC only to the load of each cell, that is, the total number of sub-carriers required for supporting the data rate requirement of all the users. We then present the DRA with limited coordination (DRA-LC) algorithm where the ICC performs load-adaptive inter-cell resource allocation with the limited information while the BS performs intra-cell resource allocation with full information about its own cell. For performance comparison, we design a centralized algorithm called DRA with full coordination (DRA-FC). Simulation results reveal that the DRA-LC algorithm can perform close to the DRA-FC algorithm at very low signaling overhead. In addition, it turns out to improve the QoS performance of the cell-boundary users, and achieve a better fairness among neighboring cells under non-uniform load distribution.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.6
• /
• pp.9-17
• /
• 2014

Heterogeneous network (HetNet) is a network consisting of macrocells overlaid with small cells. In HetNet, the interference from macrocell to small cell users is a major cause of performance degradation of small cell users and enhanced inter-cell interference coordination (eICIC) is needed to mitigate the interference. Previous works on eICIC gives limited performance gain because these works focus on maximizing long-term throughput and rarely consider varying channel conditions over frames. This paper proposes a new algorithm which dynamically coordinates interference and schedules users on each frame to maximize the total utility of the network with lower computational complexity than exhaustive search. Simulation results show that the proposed algorithm achieves higher total throughput than the throughput with the conventional algorithm, and has higher fairness index than the conventional algorithm when there large number of users.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.189-196
• /
• 2006

This paper proposes a priority based AOI management model as a method to effectively process message traffic for collaboration in virtual environments. Where message traffic reaches the maximum capacity of the message replay server in DVE, some of the events might be delayed to be updated at the remote clients. Because existing AOI models depend only on the occurrence time of events, they have a problem that more important events in the context might be processed later than less serious ones. Close Interactions with other participants are relatively more important than simple events which happen at a distance from the participant. This study classifies the priorities of events according to the degree of interest, and proposes a method to reduce processing delay time of events highly interested by a user. The proposed model offers a way to effectively utilize limited capacity of a server using a priority queue mechanism, which is able to handle different kinds of events. To prevent from starvation of simple events and to give fairness to the proposed algorithm, event occurrence time is also considered as well as degree of interest when processing events.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.246-255
• /
• 2016

The orthogonal frequency-division multiple access (OFDMA) systems are well suited to multi-rate multicast transmission, as they allow flexible resource allocation across both frequency and time, and provide adaptive modulation and coding schemes. Unlike layered video coding, the multiple description coding (MDC) enables flexible decomposition of the raw video stream into two or more substreams. The quality of the video stream is expected to be roughly proportional to data rate sustained by the receiver. This paper describes a mathematical model of resource allocation and throughput in the multi-rate video multicast for the OFDMA wireless and mobile networks. The impact on mean opinion score (MOS), as a measurement of user-perceived quality (by employing a variety of scheduling disciplines) is discussed in terms of utility maximization and proportional fairness. We propose a pruning algorithm to ensure a minimum video quality even for a subset of users at the resource limitation, and show the optimal number of substreams and their rates can sustain.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3876-3895
• /
• 2014

Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.5
• /
• pp.280-292
• /
• 2014

Recently, heterogeneous networks consisting of small-cells on top of traditional macro-cellular network has attracted much attention, because traditional macro-cellular network is not suitable to support more demanding mobile data traffic due to its limitation of spatial reuse. However, due to the transmit power difference between macro- and small-cells, most users are associated with macro-cells rather than small-cells. To solve this problem, enhanced inter-cell interference coordination (eICIC) has been introduced. Particularly, in eICIC, the small-cell coverage is forcibly expanded to associate more users with small-cells. Then, to avoid cross-tier interference from macro-cells, these users are allowed to receive the data during almost blank subframe (ABS) in which macro-cells almost remain silent. However, this approach is not sufficient to balance the load between macro- and small-cells because it only expands the small-cell coverage. In this paper, we propose a load balance scheme improving proportional fairness for heterogeneous networks employing eICIC. In particular, the proposed scheme combines the greedy-based user association and the ABS rate determination in a recursive manner to perform the load balance.