• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.294-301
• /
• 2004

This paper presents a combination of optimization concept and congestion control for multicast communications to bring best benefit for the network. For different types of Internet services, there will be different utility functions and so there will be different ways to choose on how to control the congestion, especially for real time multicast traffic. Our proposed algorithm OMCC brings the first implementation experiment of utility-based Multicast Congestion Control. Simulation results show that OMCC brings better network performances in multicast session throughput while it still keeps a certain fairness of unicast and multicast sessions, and thus, provides better benefit for all network participants.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.205-208
• /
• 2007

The IEEE 802.11 is a MAC protocol which has been standardized by IEEE for Wireless Local Area Networks (WLANs). In the IEEE 802.11 WLANs, network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. However, the BEB scheme suffers from a fairness problem; some nodes can achieve significantly larger throughput than others. This paper proposes a new backoff algorithm for the IEEE 802.11 DCF scheme. This algorithm uses the hop count for considering fairness. It causes flows with high hop count to generate short backoff interval than those with low hop count, thus getting high priority. Therefore, when a collision occurs, the modified IEEE 802.11 DCF assigns higher priority to flow to be close to a destination.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9A
• /
• pp.1535-1541
• /
• 2001

TCP is the most widely-used transport layer protocol in current Internet, while ATM technology is used to increase the data communication speed at data link layer and network layer. In the TCP-over-ATM architecture, the most significant problems are (i) the partial packet discarding problem, and (ii) the TCP window timeout problem. Several approaches have been proposed to solve the partial packet discard problem and the timeout problem individually, but none of them considered the two problems together. In this paper, we propose an enhanced UBR+ scheme which supports fairness among the TCP connections using UBR+ scheme, and provides protection of damaged VC from the multiple packet losses in the same TCP sliding window. To analyze its performance, we simulate the proposed scheme using OPNET. The simulation results show that the proposed scheme supports fairness, and also increases the throughput by reducing the probability of multiple cell losses in the same TCP window.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2675-2690
• /
• 2014

We study the problem of optimal opportunistic spectrum access with unknown and heterogeneous channel dynamics in cognitive radio networks. There is neither statistic information about the licensed channels nor information exchange among secondary users in the respective systems. We formulate the problem of maximizing network throughput. To achieve the desired optimization, we propose a win-shift lose-stay algorithm based only on rewards. The key point of the algorithm is to make secondary users tend to shift to another channel after receiving rewards from the current channel. The optimality and the convergence of the proposed algorithm are proved. The simulation results show that for both heterogeneous and homogenous systems the proposed win-shift lose-stay algorithm has better performance in terms of throughput and fairness than an existing algorithm.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.275-278
• /
• 2000

Recently ATM(Asynchronous Transfer Mode) technology is facing challenges from Integrated Service IP(Internet Protocol), IP router, Gigabit Ethernet. Although ATM is approved by ITU-T as the standard technology in B-ISDN, its survival is still in question. In the ATM networks, the Guaranteed Frame Rate(GFR) service has been designed to accommodate non-real-time applications, such as TCP(Transmission Control Protocol)/IP based traffic. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fairshare of available resources. We have studied different discarding and scheduling schemes, and compared their throughput and fairness when TCP/IP Traffic is carried. Through simulations, we know that only per-VC queueing with weighted Round Robin(WRR) can guarantee Minimum Cell Rate Among all the Schemes that have been experimented, we recommend DT-EPD(Dynamic Threshold-Early Packet Discard) integrated with MCRplus(Minimum Cell Rate) to support the GFR service.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.221-224
• /
• 2000

The issue of supporting TCP traffic over ATM networks is currently one of the most important issues in the field of data networks. One important part of this issue is congestion control. In general, congestion control uses method such as packet drop to relieve network resource when the network is congested so as to maintain high throughput and low delay. In addition, congestion control is required to ensure fair sharing of resources among all users during congestion. In this paper we propose a new congestion control method using WRED & per-VC accounting mechanism. This packet discard scheme is proposed with the goal to provide both good performance in terms of throughput and fairness in terms of bandwidth exploitation of the output link among all virtual circuits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.263-271
• /
• 2004

In this paper, we proposed a new buffer management algorithm using perVC-Queuing discipline. Proposed algorithm uses service rate estimation and assigns dynamic perVC threshold to each VCs. Service rate estimation and dynamic perVC threshold combined with global threshold provide nearly optimal throughput and improve fairness performance of network resource among GFR VCs as well as guarantee MCR of all VCs. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.401-409
• /
• 2006

Orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) technologies provide additional dimensions of freedom with spectral and spatial resources for radio resource management. Multi-dimensional radio resource management has recently been identified to exploit the full dimensions of freedom for more flexible and efficient utilization of scarce radio spectrum while provide diverse quality of service (QoS) guarantees. In this work, a multi-dimensional radio resource scheduling scheme is proposed to achieve above goals in hybrid orthogonal frequency division multiple access (OFDMA) and space division multiple access (SDMA) systems. Cochannel interference (CCI) introduced by frequency reuse under SDMA is eliminated by frequency division and time division between highly interfered users. This scheme maximizes system throughput subjected to the minimum data rate guarantee. for heterogeneous users and transmit power constraint. By numerical examples, system throughput and fairness superiority of the our scheduling scheme are verified.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.204-206
• /
• 2009

Opportunistic scheduling is one of the important techniques to maximize multiuser diversity gain. In this paper, we propose a distributed opportunistic scheduling scheme for ad-hoc network. In the proposed distributed scheduling scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed scheduling using extensive simulation and simulation results show that proposed scheduling obtains higher network throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.59-68
• /
• 1996

In this paper, we propose two types of WDMA protocol for multi-wavelength optical networks that have a dedicated control channel. Protocol type I is designed for the case that the number of nimislots is less than the number of nodes (La${\ge}$M). Proposed protocols employ the aging scheme to guarantee a fairness in the process of channel allocation. The perfomrance of proposed protocols are evaluated in terms of throughput and delay with variations in offered load. Simulation results show that the proposed protocols have superior performance to conventional protocols.