• ETRI Journal
• /
• 제38권6호
• /
• pp.1153-1162
• /
• 2016

This paper addresses the resource allocation (RA) problem in multi-cell cognitive radio networks. Besides the interference power threshold to limit the interference on primary users PUs caused by cognitive users CUs, a proportional fairness constraint is used to guarantee fairness among multiple cognitive cells and the impact of imperfect spectrum sensing is taken into account. Additional constraints in typical real communication scenarios are also considered-such as a transmission power constraint of the cognitive base stations, unique subcarrier allocation to at most one CU, and others. The resulting RA problem belongs to the class of NP-hard problems. A computationally efficient optimal algorithm cannot therefore be found. Consequently, we propose a suboptimal RA algorithm composed of two modules: a subcarrier allocation module implemented by the immune algorithm, and a power control module using an improved sub-gradient method. To further enhance algorithm performance, these two modules are executed successively, and the sequence is repeated twice. We conduct extensive simulation experiments, which demonstrate that our proposed algorithm outperforms existing algorithms.

• 한국정보과학회논문지:정보통신
• /
• 제29권5호
• /
• pp.495-500
• /
• 2002

We propose a new estimation method for rate adjustment in the face of a packet loss in the TFRC protocol, a TCP-Friendly congestion control protocol for UDP flows. Previous methods respond in a sensitive way to a single packet loss, resulting in oscillatory transmission behavior. This is an undesirable for multimedia services demanding constant bandwidth. The proposed TFRC provides more smooth and fair (against TCP flows) transmission through collective response based on multiple packets loss events. We show our "Exponential smoothing method" performs better than known "Weight smoothing method" in terms of smoothness and fairness.

• 한국통신학회논문지
• /
• 제21권12호
• /
• pp.3098-3108
• /
• 1996

This paper proposed two mechanisms of fixed method and new arrival method. They are all interactive meachanisms in that a SCP and the SSPs exchange load information for overload control. These mechanisms using simple algorithm based on the standard ACG, apply differenct call gapping time on each SSP under the fairness scheme when they allocates SCP capacity to competing demends. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. Fairness about the probability of rejection is maintained same value on all SSPs. On Priority scheme, new arrival method has better achievement than fixed method.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.135-138
• /
• 2004

This paper considers a ring loading problem on RPR(Resilient Packet Ring), where RPR is recommended by IEEE802.17 Resilient Packet Ring working group for data optimized networks without the requirements of provisioning circuits. RPR is well suitable for metropolitan area network with two counter-rotating rings that multiple stations share the bandwidth, where the data and its corresponding control traffic is transmitted to the two opposite directional ring, respectively. One of the major concerns on RPR is to provide fairness among traffic requirements. The paper discusses several fairness measures and analysis ring loading problems for the fairness.

• Asia pacific journal of information systems
• /
• 제1권1호
• /
• pp.117-145
• /
• 1991

IS changeback is regarded as an offective way to control the usage of computers and communication systems which are very much limited resources and whose costs are very high, In this paper, the problem of combining the optimal chargeback system which guarantees the efficiency with the Rawls'(1971) concept of fairness. Primary conclusion of this paper is that if the value function which represents the contributions of IS user to the firm's profit is evidit and there is no uncertainty about this contribution information, optimality can be achived without any loss of fairness using full cost allocation pricing. But if there is no significant differences among contribution of each user and there is no significant differences among users because of the managerial arbitrariness, From this point of view contingent chargeback system with which manager can find the golden middle between optimality and fairness by adjusting the 'efficiency coefficient' according to his/her organizational characterisics and environments is proposed. A heuristic of finding the appropriate efficiency coefficient is also suggested.

• 인터넷정보학회논문지
• /
• 제6권3호
• /
• pp.121-128
• /
• 2005

최근, 차별 서비스 망에서는 다양한 차세대 인터넷 서비스들을 지원하기 위해 효율적인 자원 관리를 위한 연구로서 동적 프로비저닝 (Dynamic Provisioning) 기법들을 이용한 수락 제어 메커니즘 연구가 활발히 진행되고 있다. 하지만, 수락 제어 메커니즘이 망에 적용되더라도 서로 다른 대역폭을 요구하는 서비스들에 대한 호 설정 요구가 들어오며 불공평한 호 블로킹 확률이 존재한다. 본 논문에서는 큰 대역폭을 요구하는 서비스와 작은 대역폭을 요구하는 서비스들 사이에 공평한 호 블로킹 확률을 제공하는 새로운 수락 제어 정책 Heuristic 알고리즘을 제안한다. 특히 제안된 알고리즘은 모의 실험 결과를 통하여 호 블로킹 확률의 공평성 및 높은 대역폭의 사용율을 제공할 수 있음을 보여 주었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.215-217
• /
• 2004

In wireless sensor networks, fair allocation of bandwidth among different nodes is one of the critical problems that effects the serviceability of the entire system. Fair bandwidth allocation mechanisms, like fair queuing, usually need to maintain state, manage buffers, and perform packet scheduling on a per flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. It is a very important and difficult technical issue to provide packet scheduling architecture for fairness in wireless sensor networks. In this paper, we propose an packet scheduling architecture for sensor node, called FISN (Fairness Improvement Sensor Network), that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. Sensor node for sensing estimate the incoming rate of each sensor device and insert a label into each transmission packet header based on this estimate. Sensor node for forwarding maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels and an estimate of the aggregate traffic at the gathering node. We present the detailed design, implementation, and evaluation of FISN using simulation. We discuss the fairness improvement and practical engineering challenges of implementing FISN in an experimental sensor network test bed based on ns-2.

• 한국통신학회논문지
• /
• 제31권4B호
• /
• pp.255-269
• /
• 2006

The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

• 한국정보과학회논문지:정보통신
• /
• 제30권1호
• /
• pp.65-74
• /
• 2003

본 논문에서는 멀티 서비스 WCDMA 이동 시스템을 위한 새로운 서비스 품질 예측 지표를 사용함으로써 사용자들의 QoS 요구치를 고려한 순방향 서비스 수락 기준을 제안한다. 제안된 순방향 서비스 수락 기준은 상대적인 외부 셀의 간섭을 가정하고 각 서비스의 평균 수신 전력을 계산함으로써 얻어진다. 제안한 방법을 이용하여 우리는 서로 다른 서비스의 사용자들이 허용될 수 있는 순방향 서비스 수락 영역을 얻는다. 그리고 제안한 순방향 서비스 수락 기준에 형평성을 고려하여 각각의 서비스를 사용하는 사용자들을 위한 또 다른 순방향 서비스 수락 기준을 제시한다. 수치적 예에서 음성 서비스와 데이타 서비스들의 형평성을 고려한 순방향 서비스 수락 영역과 형평성을 고려하지 않은 순방향 서비스 수락 영역은 제안된 파카의 순방향 서비스 수락 기준들을 이용하여 얻을 수 있다.

• 한국정보통신학회논문지
• /
• 제23권9호
• /
• pp.1117-1122
• /
• 2019

본 논문에서는 하나의 기지국과 두 사용자를 갖는 하향링크 비직교 다중접속 시스템에서 사용자 데이터 전송률의 공정성을 개선하기 위한 전력 할당 기법을 제안한다. 특히, 독립적인 레일레이 채널을 가정하여 평균 사용자 데이터 전송률의 공정성을 극대화하는 전력 할당 기법을 제안한다. 여기서, 공정성의 극대화는 사용자의 평균 데이터 전송률이 동일할 때 얻어진다. 따라서 공정성 평가를 위하여 평균 사용자 데이터 전송률과 총 평균 데이터 전송률의 근사식을 제시한다. 시뮬레이션 결과 분석을 통하여 유도한 평균 데이터 전송률의 근사식을 검증하고, 기존의 전력 할당기법들과 평균 사용자 데이터 전송률 결과를 비교하여 제안하는 기법이 공정성 측면에서 우수함을 보인다.