• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.230-245
• /
• 2002

Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.583-592
• /
• 2005

An important factor influencing the robustness of the Internet is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes the network congestion worse. Brakmo and Peterson proposed a congestion control algorithm, TCP Vegas, by modifying the congestion avoidance scheme of TCP Reno. Many studies indicate that Vegas is able to achieve better throughput and higher stability than Reno. But there are three unfairness problems in Vegas. These problems hinder the spread of Vegas in the current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP NewVegas. The proposed NewVegas is able to solve these unfairness problems effectively by using the variation of the number of queued packets in a bottleneck router. To evaluate the proposed approach, we compare the performance among NewVegas, Reno and Vegas. Through the simulation, NewVegas is shown to be able to achieve throughput and better fairness than Vegas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.581-590
• /
• 2005

The IEEE 802.17 Resilient Packet Ring Working Group develops standards to support the development and deployment of Resilient Packet Ring networks in Local, Metropolitan, and Wide Area Networks for resilient and efficient transfer of data Packets at rates scalable to many gigabits Per second. It was known that the fairness algorithm of the IEEE 802.17 Resilient Packet Ring suffers from throughput degradation under an unbalanced overload. This Paper proposes a congestion release advertisement method to improve this throughput degradation and discusses its performance. Under the proposed method, a congested node decides whether its congestion is released or not. If released, it advertises the congestion release to upstream nodes, and then upstream nodes transmit their traffic without uy regulation. The proposed method is compatible with the legacy fairness algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.20-26
• /
• 2010

The downlink scheduling algorithm has a great impact on the performance of mobile telecommunication system. In proportional fairness (PF) scheduling algorithm, the resource is allocated proportionally to the quality of wireless channel. Thus, PF has difficulty in servicing the users having more downlink traffic. One can allocate the resource proportionally to the accumulated queue length. However, this leads to system throughput degradation since the users having low channel quality get more and more resource allocated due to accumulation property of queue. In this paper, we propose a new downlink scheduling algorithm, which extends PF algorithm by incorporating downlink traffic arrival rate. The proposed algorithm can effectively cope with users having more downlink traffic, and maintain high system throughput by eliminating accumulation effect in the algorithm. With computer simulations, it is verified that the proposed algorithm performs better than existing algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.549-552
• /
• 2005

Multiple wireless devices in wired and wireless heterogeneous networks communicate with counterparts via a single access point (AP). In this case, the AP becomes a bottleneck of the network, therefore buffer overflows occur frequently and result in TCP performance degradation. In this paper, a new algorithm that prevents buffer overflows at AP and enhances TCP fairness is proposed. Depending on the buffer usage of AP, the new algorithm adaptively controls each TCP senders' transmission rate, prevents buffer overflows and thus guarantees improved TCP fairness. It is proved that the algorithm makes better of TCP throughput and fairness by preventing buffer overflows.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1551-1557
• /
• 2006

Since subscribers, who pay the same communication fees, have a strong desire to take similar services with the other users, it is an important issue to provide fairness among those subscribers wherever they are located. Therefore, in this paper we propose a QoS packet scheduler that can provide fairness among wireless LAN terminals and evaluate its performance using computer simulation. The key idea of this scheduler is to reduce the CW value of the wireless LAN terminal that has failed in sending its packets due to channel transmission error in order to offer the wireless MM terminal a higher transmission priority which is the idea of service compensation. We evaluate its performance using NS-2 network simulator, compare its numerical results to those of IEEE 802.11e without this scheme, and conclude that this scheme can reduce throughput difference between similar wireless LAN terminals.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.5
• /
• pp.581-588
• /
• 2019

In this paper, I propose an modified back-off algorithm to improve the fairness for slotted ALOHA sensor networks. In hierarchical networks, the performance degradation of a specific node can cause degradation of the overall network performance in case the data transmitted by lower nodes is needed to be synthesized and processed by an upper node. Therefore it is important to ensure the fairness of transmission performance to all nodes. The proposed scheme choose a back-off time of a node considering the previous transmission results as well as the current transmission result. Moreover a node that failed to transmit consecutively is given gradually shorter back-off time but a node that is success to transmit consecutively is given gradually longer back-off time. Through simulations, I compare and analyze the performance of the proposed scheme with the binary exponential back-off algorithm(BEB). The results show that the proposed scheme reduces the throughput slightly compared to BEB but improves the fairness significantly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1647-1653
• /
• 2004

In a contention-based wireless LAN protocol, maximization of channel utilization and fair bandwidth allocations are main topics to deal with. But it is very difficult to achieve these two goals simultaneously. Many studies have been done to achieve these goals. In this paper we propose a control mechanism to support fair transmissions among traffic classes in IEEE 802.11e Wireless LAN. The proposed algorithm uses short-term and long-term transmission times of each traffic classes to control their $CW_{min}$ for fairness. The proposed algorithm don't need to know the exact number of nodes in the networks to support fairness as other studies do. Furthermore any modifications in AP and mobile hosts are not required.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1099-1107
• /
• 2005

The Guaranteed Frame Rate(GFR) service has been designed to accomodate non-real-time applications, such as TCP/IP based traffic in ATM networks. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fair share of available resources. In this paper, we propose a cell scheduling scheme which can improve the fairness and the goodput through the traffic control in GFR service. For the evaluation of the proposed scheme, we compare the proposed scheme with the existing scheme in the fairness and the goodput. Simulation results show that proposed scheme can improve the fairness and goodput comparing with the existing buffer management scheme.