• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.297-312
• /
• 2005

The multimedia traffic of continuous video and audio data via streaming service accounts for a significant and expanding portion of the Internet traffic. This streaming data delivery is mostly based on RTP with UDP. However, UDP does not support congestion control. For this reason, UDP causes the starvation of congestion controlled TCP traffic which reduces its bandwidth share during overload situation. In this paper, we propose a new TCP-friendly rate control scheme called 'TF-RTP(TCP-Friendly RTP)'. In the congested network state, the TF-RTP exactly estimates the competing TCP's throughput by using the modified parameters. Then, it controls the sending rate of the video streams. Therefore, the TF-RTP adjusts its sending rate to TCP-friendly and fair share with competing TCP traffics. Through the simulation, we prove that the TF-RTP correctly estimates the TCP's throughput and improves the TCP-friendliness and fairness.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.6
• /
• pp.1-10
• /
• 2021

The interest in underwater acoustic sensor networks (UWASNs), along with the rapid development of underwater industries, has increased. To operate UWASNs efficiently, it is important to adopt well-designed medium access control (MAC) protocols that prevent collisions and allow the sharing of resources between nodes efficiently. On the other hand, underwater channels suffer from a narrow bandwidth, long propagation delay, and low data rate, so existing terrestrial node pairing schemes for non orthogonal multiple access (NOMA) cannot be applied directly to underwater environments. Therefore, a multi-dimensional node pairing scheme is proposed to consider the unique underwater channel in UWASNs. Conventional NOMA schemes have considered the channel quality only in node pairing. Unlike previous schemes, the proposed scheme considers the channel gain and many other features, such as node fairness, traffic load, and the age of data packets to find the best node-pair. In addition, the sender employs a list of candidates for node-pairs rather than path loss to reduce the computational complexity. The simulation results showed that the proposed scheme outperforms the conventional scheme by considering the fairness factor with 23.8% increases in throughput, 28% decreases in latency, and 5.7% improvements in fairness at best.

• The Korean Journal of Franchise Management
• /
• v.9 no.3
• /
• pp.31-43
• /
• 2018

Purpose - This study examines the role of foodservice franchisee's perceived justice(distributive, procedural, and interactional) in developing long-term orientation to franchisor and investigate the mediating role of cohesiveness and relationship satisfaction in the relationship between franchisee's perceived justice and long-term orientation to franchisor. Research design, data, and methodology - We collected data from managers and owners in foodservice franchisees located in Seoul, Korea. Among a total of 500 questionnaires, 500 questionnaires were returned. After excluding 36 invalid respondent questionnaires, 496 valid questionnaires(response rate of 99.2%) were analyzed using frequency, confirmatory factor analysis, correlations analysis, and structural equation modeling with SPSS 21 and SmartPLS 3.0. Result - The findings of this study are as follows: First, distributive justice and interactional justice had positive effects on cohesiveness, but procedural justice did not. Second, distributive justice and interactional justice had positive effects on relationship satisfaction, but procedural justice did not. Third, cohesiveness and relationship satisfaction had positive effects on franchisee's long-term orientation to franchisor. Conclusions - The implications of this study are as follows. First, this study found that procedural justice can create a high cohesiveness and identification of franchisee and also maintain a cooperative relationship with the franchisor. Second, this findings suggest that the perceived distributional and interactional justice can improve the satisfaction with the franchisor and thus positively influence the intention to maintain the relationship and the intention to recontract. Third, the results of this study indicate that the cohesiveness of franchisees can play a pivotal role to improve their satisfaction with the franchisor and pursue mutual development by continuously maintaining stable business relationship with franchisor. The findings of this study are subject to at least three limitations. First, the research subject is limited to the food service franchise shops in Seoul area, so the sample was not nationally representative of the franchise stores. Second, the perceived fairness is measured only from the point of view of the franchisee, and this study has a limitation to examine the difference between the perceived franchisee's and franchisor's justice. Third, Future research needs to identify more closely the relationships between perceived fairness and long-term orientation by gathering specific quantitative data such as the renewal rate and the business performance.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.29-40
• /
• 2005

In this research, we propose packet scheduling algorithm considering different QoS characteristics of real-time traffic and non-real-time traffic in the next generation wireless communication system serving the multimedia traffic and a new efficient framing method cooperated with this packet scheduler. When the selected traffic classes of the selected users are transmitted, our proposed framing method can increase the number of serviced traffic classes by mixing the many different traffic classes within one frame considering data rate decided by the allocated AMC (Adaptive Modulation and Coding) option. Using this proposed method, the fairness among the traffic classes can be achieved and the system performance for total throughput and delay can be enhanced. Simulations are performed to analyze the performance of the proposed framing method. Our proposed packet scheduler and framing method will be applied to the next generation multimedia wireless communication system serving many traffic classes.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.401-409
• /
• 2006

Orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) technologies provide additional dimensions of freedom with spectral and spatial resources for radio resource management. Multi-dimensional radio resource management has recently been identified to exploit the full dimensions of freedom for more flexible and efficient utilization of scarce radio spectrum while provide diverse quality of service (QoS) guarantees. In this work, a multi-dimensional radio resource scheduling scheme is proposed to achieve above goals in hybrid orthogonal frequency division multiple access (OFDMA) and space division multiple access (SDMA) systems. Cochannel interference (CCI) introduced by frequency reuse under SDMA is eliminated by frequency division and time division between highly interfered users. This scheme maximizes system throughput subjected to the minimum data rate guarantee. for heterogeneous users and transmit power constraint. By numerical examples, system throughput and fairness superiority of the our scheduling scheme are verified.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.256-258
• /
• 2004

센서네트워크에서의 신뢰도를 다룬 기존 연구들은 필요 없는 오버헤드가 크거나, 네트워크 내의 모든 노드들에 일괄적인 정책을 수행하여 다수의 이벤트가 동시에 발생하였을 경우 각각에 대한 fairness를 보장하지 못하는 문제점을 갖는다. 따라서 data-centric의 관점에서 노드 각각이 아닌 이벤트들 간의 fairness를 보장하는 전송기법이 필요하다. 본 논문에서는 기존 연구에서 신뢰도 관리 기법을 이벤트 별로 분산시켜 독립적으로 수행함으로써 이벤트 간의 fairness를 함께 고려한 신뢰도 있는 전송 기법을 제안한다. 싱크는 사용자의 요구에 따라 현재 발생한 이벤트들에 대하여 독립적인 전송량을 결정하며, 이를 기준으로 각각의 이벤트의 대표 노드인 이벤트헤드는 자신과 같은 이벤트를 보고하는 다른 노드들의 reporting rate을 결정한다. 이와 같은 기법에 의한 이벤트 간 fairness의 향상을 실험을 통하여 검증한다.

• 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.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.1-7
• /
• 2002

Since multimedia data such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms could not be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm is a scheduling algorithm considered the time constraint of the multimedia data. This scheduling algorithm uses a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and the reduction in the number of context switching. Furthermore, a new evaluation method is proposed which can evaluate the flexibility of scheduling algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.151-161
• /
• 2014

3GPP LTE-Advanced (Release 10) system specifies carrier aggregation (CA) to enable high data rate on using multiple frequency bands, including the variout CA-specific deployment scenarios. Considering one of those scenarios in which the different directional sector antenna is employed by each frequency band, we propose a per-carrier cell selection scheme that can improve the average throughput of the cell-edge users by allowing each user equipment (UE) to select the frequency band of the adjacent cell. Furthermore, a distributed algorithm for inter-cell copperative scheduling in this scheme is proposed to support proportional fairness among the cells. It has been shown that the proposed scheduling algorithm for the per-carrier cell selection scheme improves the cell-edge user throughput roughly by 50% over that of the conventional scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.80-91
• /
• 2002

A general goal of the AT%(Asynchronous Transfer Mode) network is to support connect across various network. On ATM networks, ABR services are provided using the remained ban after allocation CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR ado VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. In this paper a simulation has been performed to compare and evaluate the performance between the ERICA(Explicit Rate Indicate Avoidance) and EPRCA(Enhanced Proportional Rate Control Algorithm) switches which use Explicit Rate switch algorithm for ABR switch. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. As a result of simulation, ERICA algorithm switch was ten times long compared to ERPCA switch to achieve assigned fair share. so EPRCA switch is superior to ERICA about load response. For Fair share and stability, ERICA switch is excellent to EPRCA switch.