• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.638-651
• /
• 2000

When the bandwidth resources in a packet-switched network are shared among sessions by MAX-MIN flow control each session is required to transmit its data into the network subject to the MAX-MIN fair rate which is solely determined by network loadings. This passive behavior of sessions if fact can cause seri-ous QoS(Quality of Service) degradation particularly for real-time multimedia sessions such as video since the rate allocated by the network can mismatch with what is demanded by each session for its QoS. In order to alleviate this problem we extend the concept of MAX-MIN fair bandwidth allocations as follows: Individual bandwidth demands are guaranteed if the network can accommodate them and only the residual network band-width is shared in the MAX-MIN fair sense. On the other hand if sum of the individual bandwidth demands exceeds the network capacity the shortage of the bandwidth is shared by all the sessions by reducing each bandwidth guarantee by the MAX-MIN fair division of the shortage. we present a novel flow control algorithm to achieve this extended MAX-MIN fairness and show that this algorithm can be implemented by the existing ATM ABR service protocol with minor changes. We not only analyze the steady state asymptotic stability and convergence rate of the algorithm by appealing to control theories but also verify its practical performance through simulations in a variety of network scenarios.

• 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.40 no.5
• /
• pp.624-633
• /
• 2018

Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.332-340
• /
• 2010

In this paper, we deal with multi-user diversity scheduling methods that transmit simultaneously signals from multiple users using superposition coding multiplexing. These methods can make various scheduling methods be obtained, according to strategies for user selection priority from the first user to the first-following users, strategies for per-user power allocation, and resulting combining strategies. For the first user selection, we consider three strategies such as 1) higher priority for a user with a better channel state, 2) following the proportional fair scheduling (PFS) priority, 3) higher priority for a user with a lower average serving rate. For selection of the first-following users, we consider the identical strategies for the first user selection. However, in the second strategy, we can decide user priorities according to the original PFS ordering, or only once an additional user for power allocation according to the PFS criterion by considering a residual power and inter-user interference. In the strategies for power allocation, we consider two strategies as follows. In the first strategy, it allocates a power to provide a permissible per-user maximum rate. In the second strategy, it allocates a power to provide a required per-user minimum rate, and then it reallocates the residual power to respective users with a rate greater than the required minimum and less than the permissible maximum. We consider three directions for scheduling such as maximizing the sum rate, maximizing the fairness, and maximizing the sum rate while maintaining the PFS fairness. We select the max CIR, max-min fair, and PF scheduling methods as their corresponding reference methods [1 and references therein], and then we choose candidate scheduling methods which performances are similar to or better than those of the corresponding reference methods in terms of the sum rate or the fairness while being better than their corresponding performances in terms of the alternative metric (fairness or sum rate). Through computer simulations, we evaluate the sum rate and Jain’s fairness index (JFI) performances of various scheduling methods according to the number of users.

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

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

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.474-479
• /
• 2004

This paper describes a feedback-based congestion control algorithm to improve TCP performance over wireless network. In this paper, we adjust the packet marking probability at the router for Max-Min fair sharing of the bandwidth and full utilization of the link. Using the successive ECN (Explicit Congestion Notification), the proposed algorithm regulates the window size to avoid the congestion and sees the packet loss only due to the wireless link error. Based on the asymptotic analysis, it is shown that the proposed algorithm guarantees the QoS of the wireless TCP. The effectiveness of the proposed algorithm is demonstrated by simulations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.6
• /
• pp.549-553
• /
• 2002

This paper develops knowledge-based multiple fuzzy rules for researcher-selection by automatic ranking process. Inference rules for researcher-selection are created, then the multiple fuzzy rule system with max-min inference is applied. The way to handle for selection standards according to a certain criteria in dynamic manner, is also suggested in a simulation model. The model offers automatic, fair, and trust decision for researcher-selection processing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.33-42
• /
• 2001

We consider a model describing large scale performance of multiservice networks supporting both constant- and adaptive-rate services. As the number of constant-rate connection changes over time in multiservice networks, the available bandwidth for adaptive-rate connections changes as well. We estimate the available bandwidth for adaptive-rate service in a dynamically changing traffic environment based on Erlang fixed point equation and Little\`s law. The bandwidth allocation for adaptive-rate service is determined by the max-min fairness criterion. We find an upper bound on the average minimum throughput for adaptive-rate service, and 7how that the bound is achieved in large-capacity networks. This is verified using network examples. Since max-min fair allocation may not maximize the total throughput or revenue in a network, we consider adjustments via network level priority schemes to increase efficiency.