• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.9
• /
• pp.358-365
• /
• 2003

To support Internet traffic efficiently over ATM networks, Guaranteed Frame Rate(GFR) has been proposed in the ATM Forum. GFR provides minimum rate guarantees to VCs and allows any excess bandwidth in the network to be shared among the contending VCs in a fair manner. In this paper, we proposed a new fuzzy logic based buffer management algorithm that provides MCR guarantee and fair sharing to GFR VCs. A key feature of proposed algorithm is its ability to accept or drop a new incoming packet dynamically based on buffer condition and load ratio of VCs. This is achieved by using fuzzy logic controller for the production of a drop factor. Simulation results show that proposed scheme significantly improves fairness and TCP throughput compared with previous schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.304-306
• /
• 2002

본 논문은 멀티캐스트 혼잡제어방식 제안 중의 하나인 PGMCC의 공정성 향상 방법에 관한 것이다. 안정적인 멀티캐스트 전송과 혼잡제어를 위한 여러가지 방법중에서 PGMCC는 유력한 방식으로 제안되었다. 하지만 PGMCC에도 고정된 timeout 값의 사용과 불확실한 acker 선출로 인하여 공정성을 낮추는 요인들이 몇가지 지적되고 있다. 본 논문에서는 TCP와 같은 적응적인 timeout값의 적용과 acker 선출에서 추가적인 방법의 적용으로 이와 같은 문제를 해결하여 공정성이 향상되는 것을 확인 할 수 있었다.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.732-744
• /
• 2005

Previous works for the AE(Assured Forwarding) service in the Diffserv network have no sufficient consideration on the fairness of bandwidth share based on the target rate and the effect or RTT and UDP. Also Previous works act like Best-effort service in the UPN(under-Provisioned Network) condition. In this paper, in order to solve these problems, we propose the PFDSA(Proportionally Fair Differentiated Service Architecture) composed of tmTRA3CM(tcp-microflow based Target rate and an Aware Three color Marking), um3CM(udp-microflow based Three color Marker), TRBD(Target Rate Based Dropper), and target rate adjusting function. In the results of comparing the performance among existing mechanisms and the PFDSA, the PFDSA was able to mitigate the RTT and UDP effect better than the former. The PFDSA was shown to provide good performance for transmission rates proportional to various target rates in the UPN condition.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.149-158
• /
• 2005

This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.15-21
• /
• 2018

Per-packet scheduling is more suitable than per-flow scheduling to reduce the flow completion time by efficiently utilizing resources in data center networks. Recently, many per-packet scheduling schemes utilizing multiple paths have been proposed. However, to mitigate the negative effect of packet reordering on TCP performance, most of the schemes require supplemental measures such as putting packets in order at the lower layer. In this study, we investigate how well DCTCP, which is a representative TCP for data center networks, performs with per-packet scheduling through simulation. Simulation results show that DCTCP keeps the queue length short but that DCTCP shows low fairness due to the way of reducing the congestion window by ECN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4B
• /
• pp.227-233
• /
• 2007

According to the recent development of network technology, the demands of users are diversified and the needs of multimedia traffic are increasing. In general, UDP(User Datagram Protocol) traffic is used to transport multimedia data, which satisfied the real-time and isochronous characteristics. UDP traffic competes with TCP traffic and incur the network congestion. However, TCP traffic performs network congestion control but does not consider the receiver's status. Thus, it is not appropriate in case of streaming services. In this paper, we solve a fairness problems and proposed a network algorithm based on RTP/RTCP(Real-time Transport Protocol/Realtime Transport Control Protocol) in view of receiver status. The POBA(Priority Ordered Buffer Algorithm), which applies priorities in the receiver's buffer and networks, shows that it provides the appropriate environment for streaming services in view of packet loss ratio and buffer utilization of receiver's buffer compared with the previous method.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.143-155
• /
• 2007

In video streaming applications over the Internet, TCP-friendly rate control schemes are useful for improving network stability and inter-protocol fairness. However it does not always guarantee a smooth quality for video streaming. To simultaneously satisfy both the network and application requirements, video streaming applications should be quality-adaptive. In this paper, we propose a new quality adaptation mechanism to adjust the quality of congestion controlled video stream by controlling the frame rate. Based on the current network condition, it controls the frame rate and sending rate of video stream. Through the simulation, we prove that our adaptation mechanism appropriately adjusts the quality of video stream while improving network stability.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.19-23
• /
• 2008

The AQM (Active Queue Management) starts dropping packets earlier to notify traffic sources about the incipient stage of congestion. The AQM improves fairness between response flow (like TCP) and non-response flow (like UDP), and it can provide high throughput and link efficiency. In this paper, we suggest the QVARED (Queue Variation Adaptive RED) algorithm to respond to bursty traffic more actively. It is possible to provide more smoothness of average queue length and the maximum packet drop probability compared to RED and ARED (Adaptive RED). Therefore, it is highly adaptable to new congestion condition. Our simulation results show that the drop rate of QVARED is decreased by 80% and 40% compare to those of RED and ARED, respectively. This results in shorter end-to-end delay by decreasing the number of retransmitted packets. Also, the QVARED reduces a bias effect over 18% than that of drop-tail method; therefore packets are transmitted stably in the bursty traffic condition.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1371-1374
• /
• 2005

지금까지 IEEE 802.11 WLAN 에서 많이 연구되어진 주제는 노드들 간의 공평성(fairness)과 처리량(throughput)을 높이는데 중점이 맞추어진 것들이 대부분이었다. 성능을 높이기 위한 AP의 CW값에 관한 연구는 노드들 간에 관한 연구에 비하여 비교적 적은 편이다. 지금은 노드들과 AP가 충돌하게 되면 BEB(Binary Exponential backoff)방식으로 셋팅되어 사용하게 있기 때문에 1:N의 불공평한(unfairness) 상황이 발생한다. AP에서 노드들로 가는 하향링크(downlink) 전송이 많은 상황에서 AP가 다른 노드들과 똑같은 채널 접근확률을 가지는 것은 바람직하지 않기 때문에 AP에게 우선권(priority)을 주어 전체 성능을 높이는 것이 필요하다. 따라서 본 논문에서는 AP의 CW(Contention Window)값이 변화함에 따라 전체 성능에 끼치는 영향과 노드 수의 변화에 따른 AP의 적절한 백오프 CW값을 분석해 보고자 한다.

• Proceedings of the KAIS Fall Conference
• /
• 2006.05a
• /
• pp.294-297
• /
• 2006

Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.