• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.58-67
• /
• 2000

The paper presents a representative-based feedback mechanism and rate adaptation policy for congestion control in multicast traffic for multimedia applications. In multicast congestion control, feedback implosion occurs as many receivers send feedback to a sender. We propose to use representatives to avoid the feedback implosion. In our scheme, receivers feedback packet loss information periodically and a sender adapts the sending rate based on the information collected through a hierarchy of representatives. A representative is selected in each region and roles as a filter to decrease the number of feedbacks. The simulation results show that the proposed scheme solves the feedback implosion problem and well adapts in a congested situation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1377-1384
• /
• 2015

In this paper, a resource management scheme for preventing the video frame loss in the presence of network congestion is proposed. WiMedia protocol is suitable for the application that supports the real-time multimedia service in the ship area network since it supports high speed data transfer. However, network congestion causes the degradation of video quality, since WiMedia standard discards video frames regardless of importance of video frame. Therefore, a resource management scheme for WiMedia network is proposed in this paper. The proposed technique can intelligently treat the network congestion, and solve the degradation of video quality.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2779-2789
• /
• 1999

In this paper, we propose a new neural Buffered Leaky Bucket algorithm for preventing the degradation of network performance caused by congestion and dealing with the traffic congestion in ATM networks. We networks. We justify the validity of the suggested method through performance comparison in aspects of cell loss rate and mean transfer delay under a variety of traffic conditions requiring the different QoS(Quality of Service). also, the cell scheduling algorithms such as DWRR and DWEDF used for multiplexing the incoming traffics are induced to get the delay time of the traffics fairly. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate is changed by the predicted values. The prediction of traffic loss rate by neural networks can effectively reduce the cell loss rate and the cell transfer delay of next incoming cells and be applied to other traffic control systems. Computer simulation results performed for traffic prediction show that QoSs of the various kinds of traffics are increased.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.624-627
• /
• 2014

In vehicular network, the basic goal is to provide vehicle safety service and commercial service such as ITS(Intelligent Transportation System) or video, etc on the road. And most research concentrated on transportation of safety message in congestion situation. It is important to allocate channel for safety message in congestion situation, but providing suitable service is also important problem in vehicular network. For this reason, IEEE 1609.4 allocate 4 multiple service channels (SCHs) for non-safety data transfer. But, in congestion situation with many vehicles, the contention for channel acquisition between services becomes more severe. So services are provided improperly because of lack of service channel. This paper suggests dynamic channel allocation algorithm. The proposed algorithm is that RSU(RaodSide Unit) maintain and manage the information about service and status of channels. On based of the SJF(Shortest Job First) scheduling using those information, RSU selects the most appropriate channel among the 4 SCHs allocated by IEEE 1609.4 in network congestion situation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.29-40
• /
• 2004

In this paper, we propose a new early congestion detection and notification technique called QR-AQM. Unlike RED and it's variation, QR-AQM measures the total traffic rate from TCP sessions, predicts future network congestion, and determine the packet marking probability based on the measured traffic rate. By incorporating the traffic rate in the decision process of the packet marking probability, QR-AQM is capable of foreseeing future network congestion as well as terminating congestion resolution procedure in much more timely fashion than RED. As a result, simulation results show that QR-AQM maintains the buffer level within a fairly narrow range around a target buffer level that may be selected arbitrarily as a control parameter. Consequently, compared to RED and its variations, QR-AQM is expected to significantly reduce the jitter and delay variance of packets traveling through the buffer while achieving nearly identical link utilization.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.12-19
• /
• 2005

Reliable transport protocols such as TCP are tuned to Perform well in traditional networks where packet losses occur mainly because of congestion. In a wireless network, however, packet losses will occur more often due to reasons such as the high bit error rate and the handoff rather than due to congestion. When using TCP over wireless network, TCP responds to losses due to the high bit error rate and the handoff by invoking congestion control and avoidance algorithms, resulting in the degraded end-to-end performance in the wireless network. There have been several schemes for improving TCP performance over wireless links. Among them, SNOOP Is a very promising scheme because of the localized retransmission. In this thesis, an efficient scheme is proposed by modifying SNOOP scheme. The invocation of congestion control mechanism is now minimized by knowing the cause of packet loss.

• KIISE Transactions on Computing Practices
• /
• v.22 no.9
• /
• pp.405-418
• /
• 2016

Recently, many researchers have studied the VSL decision method using traffic information in multiple detector zones. However, this method selects incorrect VSL starting points, leading to the selection of the wrong speed control zone and calculation of the wrong VSL, causing traffic congestion. Eventually, the Unstable VSL system causes more congestion on the freeway. This paper proposes an improved VSL algorithm stably operated in multiple detector zones on the Korea highway. The proposed algorithm selects a preliminary VSL start station (VSS) expected to end the congestion using the acceleration of stations. It also determines the VSS at each congestion area. Finally, it calculates the VSL relative to the determined VSS and controls the vehicles that enters the traffic congestion zone. The developed strategy is compared with Real-time Variable Speed Limits for Urban Freeway (RVSL) to test the stability and efficiency of the proposed algorithm. The results show that the proposed algorithm resolves the problems of the existing algorithm, demonstrated by the correct VSS decision and the reduction of total travel time by 1-2 minutes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.6
• /
• pp.1881-1900
• /
• 2014

Since 802.11 wireless LANs are so widely used, it has become common for numerous access points (APs) to overlap in a region, where most of those APs are managed individually without any coordinated control. This pattern of wireless LAN usage is called the private OBSS (Overlapping Basic Service Set) environment in this paper. Due to frame collisions across BSSs, each BSS in the private OBSS environment suffers severe performance degradation. This study approaches the problem from the perspective of congestion control rather than noise or collision resolution. The retry limit, one of the 802.11 attributes, could be used for traffic control in conjunction with TCP. Reducing the retry limit causes early discard of a frame, and it has a similar effect of random early drops at a router, well known in the research area of congestion control. It makes the shared link less crowded with frames, and then the benefit of fewer collisions surpasses the penalty of less strict error recovery. As a result, the network-wide performance improves and so does the performance of each BSS eventually. Reducing the retry limit also has positive effects of merging TCP ACKs and reducing HOL-like blocking time at the AP. Extensive experiments have validated the idea that in the OBSS environment, reducing the retry limit provides better performance, which is contrary to the common wisdom. Since our strategy is basically to sacrifice error recovery for congestion control, it could yield side-effects in an environment where the cost of error recovery is high. Therefore, to be useful in general network and traffic environments, adaptability is required. To prove the feasibility of the adaptive scheme, a simple method to dynamically adjust the value of the retry limit has been proposed. Experiments have shown that this approach could provide comparable performance in unfriendly environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.331-337
• /
• 2005

The optical Internet is considered as a feasible solution for transporting huge amount of traffic volume in the future Internet. Among optical switching technology for the optical Internet, OBS becomes one of the most promoting solution. Recently, a lebeled OBS(LOBS) architecture is considered for an efficient control on OBS network. Given that a data burst may contain few thousands of IP packets, a single loss of data burst results in a serious throughput degradation in LOBS network. In this paper, we improve the performance of LOBS network by introducing the burst congestion control mechanism. More specifically, the OBS router at the network core detects the network congestion by measuring the loss probability of burst control packet. The OBS router at the network edge reduces the burst generation according to the network condition repored by the OBS router at the network core. Through the simulations, it is shown that the proposed congestion control mechanism can reduce the burst loss probability and improve the LOBS network throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.553-562
• /
• 2003

Supporting QoS (Quality of Service) for the multimedia applications becomes an important issue as the demand of multimedia applications increases. Thus, it is necessary for the application layer to have an efficient congestion control algorithm, which can support the multimedia applications' QoS requirements. In this paper, we propose a new application layer congestion control algorithm, called RRC-OTT (Receiver-based Rate Control with One-way Trip Time). RRC-OTT algorithm differs from the previously proposed algorithms in that the receiver takes the responsibility of the network congestion control. Thus, RRC-OTT algorithm can not only precisely estimate the network congestion using OTT (one-way Trip Time), but reduce the work load from the sender (e.g., the web server). Our simulation study shows that RRC-OTT algorithm can maintain the comparable link utilization to the previously proposed algorithms and keep the packet jitter low, which thus can help enhance the quality of multimedia applications.