• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.463-468
• /
• 2016

The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.743-748
• /
• 2002

In recent research for the Internet, many studies have investigated the Diffserv AS architecture that can provide Quality of Service. However, this architecture still lacks the qualification to provide full use of the bandwidth to the customer In this paper, we propose the TS2W3C (Time Sliding Two Window Three Color) marking algorithm to improve the fair share of bandwidth by enhancing the TSW (Time Sliding Window) marking algorithm. Our proposed mechanism provides the bandwidth relatively more fairly than the TSW mechanism.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.5
• /
• pp.906-914
• /
• 2007

In the upstream link of EPON, numerous ONUs In the reverse link of the EPON network, numerous ONUs receive the privileges to use the optical medium from the scheduler of the LOT, but not through the competition with others. Therefore, it is very important to select a proper DBA algorithm to allocatethe frequency band to each ONU in an effectively and fair manner. In our preceding study, we proposed the RC-DBA algorithm that complements many problems in existing DBA algorithms. In this paper, we designed the MAC scheduler for the OLT, which the proposed algorithmwas applied to and implement it in the FPGA. In addition, in order to verify the operation of the scheduler, we developed the embedded Linux based testbed.

• Journal of Digital Convergence
• /
• v.12 no.10
• /
• pp.317-327
• /
• 2014

To improve the efficiency of wireless channel, IEEE 802.11ac uses the DL MU-MIMO MAC scheme through which an AP transmits multiple frames to different mobile nodes simultaneously. IEEE 802.11ac DL MU-MIMO MAC needs a new step, called as TXOP sharing, between legacy IEEE 802.11n DL SU-MIMO's two operations, the obtaining an EDCA TXOP and the transmitting multiple frames for EDCA TXOP. In the TXOP sharing operation, both wireless channel destinations and frames transmitted for its TXOP period should are determined. So this paper deals with the TXOP sharing for improving IEEE 802.11ac MAC performance. However, the EDCA priority based method mentioned by IEEE 802.11ac standard document not fair among the buffers and the frames of buffers, and occurs in high_loss rate and high_delay about specific buffers. In this paper, we propose a new scheme of the TXOP sharing with sequencing p-AC, s-AC in similar properties, and all S-AC. This method provides a differentiated service without damage of EDCA characteristics.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.85-94
• /
• 2006

Simple-relay aided resource allocation (SRARA) schemes are incorporated with throughput guarantee scheduling (TGS) in IEEE 802.16 type TDD-OFDMA downlink to enhance service coverage, where the amount of resources at each relay is limited due to either its available power which is much smaller than base station (BS) power or the required overhead The performance of SRARA schemes is evaluated with both proportional fair (PF) and TGS schedulers at 64 kbps and 128 kbps user throughput requirements. For SRARA with RSs of relatively lower power, a scheme putting total power into only one subchannel shows larger coverage than when both subchnnels are used in a manner of equal power allocation, while the RS with evenly power-allocated two subchannels could provide larger coverage gain for a relatively higher power. In a lower target (64kbps), more improvement comes from relay scheme rather than scheduler design. For a relatively higher level (128 kbps), it comes from scheduler design rather than relay.

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

The Long Term Evolution (LTE) system is already able to provide a background of variety services for mobile users with multimedia services such as audio, video, and data. In fact, the High Speed Packet Access plus (HSPA+) solution can greatly enhance bit rates on down-link. However, the supporting for multimedia applications with different QoS (Quality of Service) requirements is not devised yet. Hence, in this paper we propose an effective packet scheduling algorithm based on Proportional Fairness (PF) scheduling algorithms for the LTE. In this proposed packet scheduling scheme, we optimized instantaneous user data rates and the traffic class weight which prioritize user's packets. Finally, we evaluated and showed the performance of the proposed scheduling algorithm through simulations of multimedia traffics being transmitted to users over LTE links in a multi-cell environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.86-100
• /
• 2004

To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as for UDP sources. In this paper, to improve TCP fairness of the REDP marker, we propose a modified REDP marker where we combine a dropper, meters and a token filling rate configuration component with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays in demotion region without incoming demoted in-profile packets. Considering the case where the token level cannot stay in demotion region without the prior demotion, we propose a token filling rate configuration method using traffic meters. By using the token filling rate configuration method, the modified REDP marker newly configures a token filling rate which is less than the negotiated rate determined by interdomain SLA and larger than the current input aggregate in-profile traffic rate. Then, with the newly configured token filling rate, the token level in the modified REDP marker can stay in demotion region pertinently fir the operation of the dropper to improve TCP fairness. We experiment with the modified REDP marker using ns2 simulator fur TCP sources at the general case where the token level cannot stay in demotion region without the prior demotion at the negotiated rate set as the bottleneck link bandwidth. The simulation results demonstrate that through the combined dropper with the newly configured token filling rate, the modified REDP marker also increases both aggregate in-profile throughput and link utilization in addition to TCP fairness improvement compared to the REDP marker.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1479-1495
• /
• 2012

Spectrum scarcity seems to be the most challenging issue to be solved in new wireless telecommunication services. It is shown that spectrum unavailability is mainly due to spectrum inefficient utilization and inappropriate physical layer execution rather than spectrum shortage. Daily increasing demand for new wireless services with higher data rate and QoS level makes the upgrade of the physical layer modulation techniques inevitable. Orthogonal Frequency Division Multiple Access (OFDMA) which utilizes multicarrier modulation to provide higher data rates with the capability of flexible resource allocation, although has widely been used in current wireless systems and standards, seems not to be the best candidate for cognitive radio systems. Filter Bank based Multi-Carrier (FBMC) is an evolutionary scheme with some advantages over the widely-used OFDM multicarrier technique. In this paper, we focus on the total throughput improvement of a cognitive radio network using FBMC modulation. Along with this modulation scheme, we propose a novel uplink radio resource allocation algorithm in which fairness issue is also considered. Moreover, the average throughput of the proposed FBMC based cognitive radio is compared to a conventional OFDM system in order to illustrate the efficiency of using FBMC in future cognitive radio systems. Simulation results show that in comparison with the state of the art two algorithms (namely, Shaat and Wang) our proposed algorithm achieves higher throughputs and a better fairness for cognitive radio applications.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.257-267
• /
• 2007

Bandwidth Trading(BT) represents a potential market with over 1 trillion USD across the world and high growth potential. BT is also likely to accelerate globalization of the telecommunications industry and massive restructuring driven by unbundling rush. However, systematic researches on BT remain at an infant stage. This study starts with structure analysis of the Internet industry, and discusses significance of Internet interconnection with respect to BT issues. We also describe the bandwidth commoditization trends and review technical requirements for effective Internet interconnection with BT capability. Taking a step further, this study explores the possibility of improving efficiency of network providers and increasing user convenience by developing an architectural prototype of Hub-&-Spoke interconnection model required to facilitate BT. The BT market provides an innovative base to ease rigidity of two-party contract and increase service efficiency. However, as fair, efficient operation by third party is required, this research finally proposes an exchanging hub named NIBX(New Internet Business eXchange).

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.253-262
• /
• 2008

Providing Quality-of-Service (QoS) guarantee requires the reservation of resource needed to accommodate the traffic flow of service for which resource reservation protocol (RSVP) was introduced. However, if any RSVP-capable router on the path fails to accommodate the traffic flow due to lack of resource, the flow is not allowed no matter how much surplus resources other routers on the path have. In order to solve this problem, this paper proposes a resource reservation method with available resource migration between RSVP-capable routers in which the routers use the recently developed latency optimized fair queuing scheduler. The results of the simulation applying the proposed method to an evaluation network show that it may yield the gain of up to 165% compared to that in the original one in terms of the number of admitted flows.