• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.189-192
• /
• 2004

This paper focuses on a TCP window-based flow control mechanism with Explicit Congestion Notification (ECN). We investigate the fundamental problem of achieving a fair window control for TCP, which cooperates with ECN. This is done by using feedback congestion pricing as a means of estimating the state of bottleneck router. The problem is solved by achieving network optimal performance, which maximize the total user utilities. We then look at the simulation of such scheme.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.1-6
• /
• 1999

본 논문에서는 TCP를 사용한 위성망에서의 문제점을 도출하고 그에 대한 성능향상 알고리즘을 제안하였다. 긴 전파 지연과 높은 에러율을 지닌 위성링크는 TCP의 성능을 현저히 떨어뜨린다. 특히 TCP에서는 에러에 의한 세그먼트 손실도 Congestion에 의한 손실로 판단하여 Slow Start나 Congestion Avoidance 알고리즘을 적용시킨다. 따라서 본 논문에서는 에러에 의한 손실과 Congestion의한 손실을 구분해 주는 ENA(Error Notification Ack) 알고리즘을 제안했다. 그리고 위성에서 좋은 성능을 나타내는 SACK TCP에 이 알고리즘을 적용시켜 성능을 평가했다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.415-417
• /
• 2001

RED 알고리즘은 큐 avg가 threshold를 넘으면 일정한 확률로 패킷을 drop하여 congestion을 제어하는 알고리즘이다. RED 알고리즘은 큐 자신의 avg만을 고려하여 drop 확률을 결정한다. 하지만, VOQ를 사용하는 input queueing에서 같은 출력 단을 목적지로 하는 다른 큐들의 사이즈가 큐 내부에서의 delay에 영향을 미치기 때문에 그 큐들의 avg를 고려하는 것이 필요하다. 본 논문에서는 기존의 RED 방법의 drop 확률 결정에서 같은 출력 단을 목적지로 하는 큐들의 avg 값을 고려하는 알고리즘을 제안한다. 시뮬레이션을 통하여 제안한 알고리즘을 구현하고, 성능을 기존의 RED 알고리즘과 비교한다.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.494-496
• /
• 2003

Transmission congestion is one of the key factors to local market power in competitive electricity markets. This paper presents an alternative methodology in estimating market power under transmission congestion. The proposed methodology was demonstrated with the Optimal Power Flow(OPF).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1355-1358
• /
• 2004

This paper describes a modification to the SACK (Selective Acknowledgement) Transmission Control Protocol's (TCP), called SACK TCP with Probing Device, SACK works in conjunction with Probing Device, for improving SACK TCP performance when more than half a window of data lost that is typical in handoff as well as unreliable media. It shows that by slightly modifying the congestion control mechanism of the SACK TCP, it can be made to better performance to multiple packets lost from one window of data.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.465-466
• /
• 2009

This paper investigates congestion detection and control strategies for multi-path traffic (CDCM) diss emination in lifetime-constrained wireless sensor networks. CDCM jointly exploits packet arrival rate, succ essful packet delivery rate and current buffer status of a node to measure the congestion level. Our objec tive is to develop adaptive traffic rate update policies that can increase the reliability and the network lif etime. Our simulation results show that the proposed CDCM scheme provides with good performance.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.550-553
• /
• 2013

Due to limited spectrum resources and differences in link loads, network congestion is one of the key issues in cognitive radio wireless mesh networks. In this letter, a congestion avoidance model with power control, channel allocation, and routing under the signal-to-interference-and-noise ratio is presented. As a contribution, a nested optimization scheme combined with a genetic algorithm and linear programming solver is proposed. Extensive simulation results are presented to demonstrate the effectiveness of our algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.411-419
• /
• 2017

The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.396-406
• /
• 2014

We have designed and investigated a new congestion control scheme, called optimal and fully explicit (OFEX) controller. Different from existing relatively explicit controllers, this new scheme can provide not only optimal bandwidth allocation but also a fully explicit congestion signal to sources. It uses the congestion signal from the most congested link instead of the cumulative signal from the flow path. In this way, it overcomes the drawback of relatively explicit controllers exhibiting bias toward multi-bottlenecked users and significantly improves their convergence speed and source throughput performance. Furthermore, our OFEX-controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention-based multi-access networks. Compared with former works/controllers, this remedy also effectively reduces the instantaneous queue size in a router and thus significantly improves queuing delay and packet loss performance. We have evaluated the effectiveness of the OFEX controller in OPNET. The experimental comparison with the existing relatively explicit controllers verifies the superiority of our new scheme.

• Management Science and Financial Engineering
• /
• v.1 no.1
• /
• pp.1-19
• /
• 1995

In this paper, we analyze an M / M / 1 queueing system where there are incentive conflicts among customers. Self-interested customers' decisions whether to join the system or not may not necessarily induce a socially optimal congestion level. As a way to alleviate the over-congestion, toll imposition was used in Naor's paper [3]. Instead of using a toll mechanism, we study the usefulness of imperfect information on system state (queue size, for example) as a way to reduce the over-congestion by self-interested customers. The main conclusion of this paper is that by purposefully giving fuzzy or imperfect information on the current queue size we can improve the congestion in the system. This result might look contradictory to rough intuition since perfect information should give better performance than imperfect information. We show how this idea is verified. In deriving this result, we use the concept of Nash equilibrium (pure and mixed strategy) as introduced in game theory. In some real situations, using imperfect information is easier to apply than imposing a toll, and thus the result of this paper has practical implications.