• Journal of Korea Multimedia Society
• /
• v.10 no.7
• /
• pp.893-901
• /
• 2007

Since real-time multimedia applications requiring duality-of-service guarantees are spreading over mobile and wireless networks, energy efficiency in wireless channels is becoming more important. Energy consumption in the channels can be reduced with decreasing the rate of scheduler's outgoing link by means of Dynamic Modulation Scaling (DMS). This paper proposes a fair queuing algorithm, termed Rate Efficient Fair Queuing (REFQ), in order to reduce the outgoing link's rate, which is based on the Latency-Optimized Fair Queuing algorithm developed to enhance Weighted Fair Queuing (WFQ). The performance evaluation result shows that REFQ does decrease the link rate by up to 35% in comparison with that in WFQ, which results in reducing the energy consumption by up to 90% when applied to the DMS based radio modem.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.306-317
• /
• 2021

The unbalance between system ergodic sum rate and high fairness is one of the key issues affecting the performance of non-orthogonal multiple access (NOMA) system. To solve the problem, this paper proposes a power allocation algorithm to realize the ergodic sum rate maximization of NOMA system. The scheme is mainly achieved by the construction algorithm of fair model based on α fair utility function and the optimal solution algorithm based on the interior point method of penalty function. Aiming at the construction of fair model, the fair target is added to the traditional power allocation model to set the reasonable target function. Simultaneously, the problem of ergodic sum rate and fairness in power allocation is weighed by adjusting the value of α. Aiming at the optimal solution algorithm, the interior point method of penalty function is used to transform the fair objective function with unequal constraints into the unconstrained problem in the feasible domain. Then the optimal solution of the original constrained optimization problem is gradually approximated within the feasible domain. The simulation results show that, compared with NOMA and time division multiple address (TDMA) schemes, the proposed method has larger ergodic sum rate and lower Fairness Index (FI) values.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.379-382
• /
• 2001

In this paper, a new enhanced early fair rate allocation(EFRA＋) algorithm is proposed for ATM switches supporting ABR service. The central issue of explicit rate control algorithms for ABR service is the computation of max-min fair rates for every connection. The EFRA＋ inherits the main feature of the EFRA, uses the connection control information during the connection setup to prevent potential congestion in switches, and enhances the computation method of the max-min fair rate.

• ETRI Journal
• /
• v.22 no.3
• /
• pp.1-9
• /
• 2000

Self-Clocked Fair Queueing (SCFQ) algorithm has been considered as an attractive packet scheduling algorithm because of its implementation simplicity, but it has unbounded delay property in some input traffic conditions. In this paper, we propose a Rate Proportional SCFQ (RP-SCFQ) algorithm which is a rate proportional version of SCFQ. If any fair queueing algorithm can be categorized into the rate proportional class and input is constrained by a leaky bucket, its delay is bounded and the same as that of Weighted Fair Queueing (WFQ) which is known as an optimal fair queueing algorithm. RP-SCFQ calculates the timestamps of packets arriving during the transmission of a packet using the current value of system potential updated at every packet departing instant and uses a starting potential when it updates the system potential. By doing so, RP-SCFQ can have the rate proportional property. RP-SCFQ is appropriate for high-speed packet-switched networks since its implementation complexity is low while it guarantees the bounded delay even in the worst-case input traffic conditions.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.375-383
• /
• 2009

The WiMedia alliance has specified a distributed medium access control (WiMedia MAC) protocol based on ultra wideband (UWB) for high data rate WPANs (HR-WPANs). The merits of WiMedia MAC such as distributed nature and high data rate make it a favorite candidate in HR-WPAN. Although QoS parameters such as the range of service rates are provided to a traffic stream, the WiMedia MAC is not able to use the QoS parameters and to determine or adjust a service rate using the QoS parameters for the traffic stream. In this paper, we propose a fair and adaptive resource allocation method that allocates time slots to isochronous streams according to QoS parameters and the current traffic load condition in a fully distributed manner. Although the traffic load condition changes, each device independently recognizes the changes and calculates fair and maximum allowable service rates for traffic streams. From the numerical and simulation results, it is proved that the proposed method achieves high capacity of traffic streams and fair QoS provisioning under various traffic load condition.

• Journal of Navigation and Port Research
• /
• v.28 no.4
• /
• pp.299-303
• /
• 2004

In the Internet, to guarantee transmission rate and delay and to achieve fair bandwidth allocation, many per-flow scheduling algorithms, such as fair queueing, which have many desirable properties for congestion control, have been proposed and designed. However, algorithms based on per-flow need maintain rate state, buffer management and packet scheduling, so that it cost great deal ： implement. Therefore, in this paper, to implement routers cost-effectively, we propose CS-FNE algorithm based on FNE in Core-Stateless network We evaluate CS-FNE comparing with four additional algorithms i.e., CSFQ, FRED, RED and DRR, in several different, configurations and traffic sources. Through simulation results, we show that CS-FNE algorithm can allocate fair bandwidth approximately and is simpler and easier to implement than other per-flow basis queueing mechanisms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.973-980
• /
• 2005

In this paper, we analyze previous flow control algorithm for serving ABR traffic, and then propose the algorithm which calculate fair transmission rate and control efficiently ABR traffic using VS/VD switch which has an effect on PNNI environment with long delay. For getting the transmission rate, the proposed algorithm use FMMRA as ER scheme which calculate exactly the fair share. And, in large delay state, we can obtain fair cell sharing by calculating transmission rates which obtained by transmitted queue length information of VD to VS for serve and drain cell in queue Through the computer simulation, we evaluate the performance of proposed algorithm. According to the results, the proposed algorithm shows good performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1413-1421
• /
• 2000

In this paper, we analyze previous flow control algorithm for serving ABR traffic, and then propose the algorithm which calculate fair transmission rate and control efficiently ABR traffic using VS/VD switch which has an effect on WAN environment with long delay. For getting the transmission rate, the proposed algorithm use FMMAR as ER scheme which calculate exactly the fair share. And, in large delay state. we can obtain fair cell sharing by calculating transmission rates which obtained by transmitted queue length information of VD to VS for serve and drain cell in queue Through the computer simulation, we evaluate the performance of proposed algorithm. According to the results, the proposed algorithm shows good performance.

• Science of Emotion and Sensibility
• /
• v.7 no.4
• /
• pp.67-75
• /
• 2004

In this paper, we analyze previous flow control algorithm for serving ABR traffic, and then propose the algorithm which calculate fair transmission rate and control efficiently ABR traffic using VS/VD switch which has an effect on PNNI environment with long delay. For getting the transmission rate, the proposed algorithm use FMMRA as ER scheme which calculate exactly the fair share. And, in large delay state, we can obtain fair cell sharing by calculating transmission rates which obtained by transmitted queue length information of VD to VS for serve and drain cell in queue Through the computer simulation, we evaluate the performance of proposed algorithm, According to the results, the proposed algorithm shows good performance.

• The Journal of the Korea Contents Association
• /
• v.7 no.12
• /
• pp.238-244
• /
• 2007

Guaranteed Frame Rate(GFR), recently approved by the ATM Forum, expects to become an important service category 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. We proposed new scheduling scheme for the GFR service. Proposed scheme provides priority to VCs and high priority to a VC which have more untagged cells in buffer. High priority VCs have much more serviced than low priority. Proposed scheme can provide MCR(minimum cell 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.