• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.9
• /
• pp.12-19
• /
• 2002

Guaranteed Frame Rate(GFR) service is intended to efficiently support TCP/IP traffic in ATM networks. The GFR service not only guarantees a minimum service rate at the frame level, but also supports a fair share of available bandwidth. The original GFR proposal outlined two switch implementation scheme : FIFO Queuing and perVC-Queuing. In general, it has been shown that FIFO Queuing is not sufficient to provide rate guarantees and perVC-Queuing with scheduling is needed. In perVC-Queuing implementation, scheduling algorithm plays key rule to provide rate guarantees and to improve fairness. We proposed a new scheduling algorithm for the GFR service. Proposed algorithm can provide minimum service rate guarantee and fair sharing to GFR VCs. Computer simulation results show that proposed scheduling scheme provide a much better performance in TCP Goodput and fairness than previous scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7A
• /
• pp.611-619
• /
• 2005

The present paper proposes two different packet scheduling algorithms in the IEEE 802.16e type TDD-OFDMA downlink, which are the weighted fair scheduling(WFS) and the throughput guarantee scheduling(TGS). The performance of proposed scheduling algorithms are compared to some of conventional schedulers such as round robin(RR), proportional fair(PF), fast fair throughput(FFTH), and fair throughput(FH) in terms of service coverage, effective throughput and fairness at 64 kbps and 128 kbps minimum user throughput requirements. For a relatively smaller throughput(64 kbps) requirement, the proposed algorithms provide higher improvement in the number of users per sector within 95$\%$ service coverage while satisfying the lxEV-DV fairness criterion. For a relatively larger throughput(128 kbps) requirement, the proposed algorithms provide higher coverage enhancement while maintaining the same effective aggregate throughput over PF scheduler.

• Journal of Korea Port Economic Association
• /
• v.29 no.2
• /
• pp.1-17
• /
• 2013

This paper aims to review the fairness of carriers' incentive schemes at Gwangyang port in 2010 and to show the desirable incentive allocation rules using the proportional and egalitarian rules under cooperative game theory. The carriers' incentive schemes at Gwangyang port in 2010 did not meet the no-envy and the efficiency, and satisfy the symmetry axiom. According to the research findings, the equal surplus method satisfies the axioms of equity, efficiency, symmetry, and progressivity. However, the uniform losses method meets the axioms of equity, efficiency, symmetry, and regressivity. We use a single allocation criterion of the total throughput to show the regressivity and the symmetry principles into the incentive scheme instead of using multiple criteria such as total throughput, increased volume, and coastal volume. The uniform losses method based on the total throughput can distribute the incentive amount according to the intent of the incentive schemes. Hence, we need to establish a rationing system to allocate reasonably the total amount of different types of incentives, avoiding the temptation to adjust the volume shipped between the ports of carriers considering the efficiency of allocation.

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

A fair exchange protocol enable two parties to exchange secrets with fairness, so that neither can gain any information advantage by quitting prematurely or otherwise misbehaving. Therefore a fair exchange is the most important for electronic transactions between untrusted parties. To design new fair exchange, after describing basic concepts, definitions and existing protocols and designing a non-interactive OT protocol using ELGamal's public key system, I will design new protocol to support fair exchange. In my designed new protocol, untrusted parties exchange secrets obliviously and verify that their received secrets are true by using transformed Zero Knowledge Interactive Proof extended to duplex. At this time, concerned two parties can't decrypt the other's ciphertext. .After all of the steps, two parties can do it. It is the most important to provide perfect fairness and anonymity to untrusted parties in this protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.613-627
• /
• 2004

In this paper, we propose an Aggregate Fairness Maker (ARM) required for an Edge router to improve fairness of throughput among the flows of Assured Service in DiffServ with different round trip time (RTT) and we propose a user flow Three Color Marker (uf-TCM) as a flow marker that marks packets from the flow as green, yellow, or red. A yellow packet is the packet that consumes loss token in uf-TCM as well as that is demoted green packet in AM due to disobey the aggregate traffic profile. The proposed AFH promotes yellow packet to green packet or demotes green packet to yellow packet through the fair method without per-flow management, and it improves the feirness of throughput among the flows as well as link utilization. A yellow packet and a red packet have the same drop precedence at Core Router in our scheme. So we can use the RIO buffer management scheme. We evaluated the performance of our proposed AFM and the REDP Marker that was proposed to improve fairness without per-flow management. Simulation results show that, compared with the REDP marker, proposed AFM can improve performance of throughput fairness among the flows with different RTT and link utilization under the over-provisioning, exact-provisioning, and under-provisioning network environments at Multiple DiffServ domains as well as at Single DiffServ domain.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2382-2388
• /
• 2014

To provide network reliability in indoor wireless communication systems, we should resolve the problem of unexpected network failure rapidly. In this paper, we propose an adaptive resource management (ARM) scheme to support seamless connectivity to users. In consideration of system throughput and user fairness simultaneously, the ARM scheme adaptively determines the set of healing channels, and performs scheduling and power allocation iteratively based on a constrained non-convex optimization technique. Through intensive simulations, we demonstrate the superior performance results of the proposed ARM scheme in terms of the average cell capacity and user fairness.

• Journal of the Korean Home Economics Association
• /
• v.39 no.9
• /
• pp.137-152
• /
• 2001

On the basis of the equity theory, as the couple perceives their relationship is equitable, they tend to make decisions jointly and are satisfied with their family lives. Therefore this study is aimed to identify the relationship among perception of equity, decision-making styles and family life satisfaction in dual-career couples. As a result of analyzing the cause-effect relationship, it shows that many socioeconomic$.$psychological variables have direct indirect impact on family life satisfaction through medium factor, so this study proves the application of the cause-effect modes. However the influence of the perception of equity of wives were higher than husbands.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.101-103
• /
• 2010

본 논문에서는 다중 셀 환경의 OFDMA 기반 복호 후 재전송 중계 네트워크를 위한 새로운 부반송파 할당 기법에 대해서 제안한다. 제안된 기법에서는 기지국 간의 채널 정보 공유를 통해 공평성 제한을 가지면서 전체 통신 용량이 최대가 되도록 중계단말기와 수신단말기에 부반송파를 할당한다. 공평성 제한은 각 중계단말기의 최대 전송 전력과 각 수신단말기의 최소 통신 용량에 부과되어 중계단말기가 전력을 과도하게 사용하는 것을 막고 수신단말기가 채널 상태가 좋지 않더라도 최소한의 통신 용량을 확보할 수 있도록 한다. 모의실험 결과 제안된 기법이 대조군인 static기법에 비하여 부반송파 당 더 높은 주파수 효율을 얻는 다는 것을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.503-507
• /
• 2007

라우터는 여러 곳에서 들어오는 패킷들을 빠르게 전달하는 기능을 담당하는 네트워크 장비로서, 들어오는 패킷들이 공평하게 서비스 받을 수 있도록 큐 관리 알고리즘을 사용한다. 그런데 대부분의 라우터들은 HOL 블록킹 문제 때문에 버퍼를 입력 포트 쪽이 아닌 가상적으로 출력 포트 쪽에 정의하는 VOQ로 구현을 하였고, 패킷들이 공평하게 서비스 받기 위해 DRR 알고리즘으로 구현하는 경향이 있다. 이 논문에서는 기존의 DRR 알고리즘에서 패킷 서비스를 위한 경직된 조건에 유연성을 주어 기존의 DRR 알고리즘의 복잡도와 공평성을 유지하는 한편 패킷 서비스 성능을 높여주는 NDRR 알고리즘을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.261-266
• /
• 2007

UMTS release 5 에서 소개된 HSDPA 를 위해 도입된 새로운 기술 Adaptive Modulation and Coding, Hybrid Automatic Repeal reQuest, Fast Packet Scheduling 에 대해 알아보고 여기서 key role 이 되는 Fast Packet Scheduling 알고리즘 가운데 대표적인 세 가지 Round Robin(RR), Promotional Fairness(PF), Maximum Channel Quality Index(Max CQI) 알고리즘의 성능을 시스템 수율과 공평성의 관점에서 분석해보았다. 시스템 수율에서는 Max CQI, PF. RR 알고리즘 순이었으며 공평성 측면에서는 RR, PF Max CQI 알고리즘 순으로 나타났다. 같은 시스템, 같은 망 구조 내에서라면 알고리즘을 최적화하여 QoS와 성능을 극대화할 수 있도록 지속적인 연구가 필요하다.