• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.140-147
• /
• 1999

ABR uses the extra network resource more efficiently which uses not the guaranteed service in ATM and supports the best effort which the characteristics of application is bursty and maximum transfer rate is high. Switches for using ABR flow control differentiate EFCI switches (which supply only the congestion state information) from ER switches (which supply fair rate to source). This paper analyses the switches operation technique for efficiently managing ABR traffic in case which the network mixes EFCI switches and ER switches in ATM.

• Annual Conference of KIPS
• /
• 2000.10b
• /
• pp.1013-1016
• /
• 2000

기존의 end-to-end 방식에서는 네트워크 내부에서 혼잡(congestion)이 발생했을 경우 각 endpoint에서 즉시 알아 낼 수 없기 때문에 일정시간 동안 수신된 packet의 순서에 대한 정보로 혼잡이 발생했는지에 대해 추론하는 것이다. 따라서 네트워크 내부에서 직접적으로 정보를 얻거나 처리를 해 줄 수 있다면 기존 방식보다 처리율이 향상될 것이다. 본 논문에서는 Active Network 메커니즘을 이용하여 라우터를 구성하고 관련 모의실험결과를 보인다. 이를 통해서 기존의 방식보다 향상된 혼잡제어를 제시한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.313-322
• /
• 2000

The ATM Forum has been focusing on flow control mechanism for ABR traffic management. The goal of this activity is to efficiently manage the leftover network bandwidth and fairly distribute it among contending ABR VC so that communication links can be optimally utilized. ABR traffic is difficult to predict traffic shape because it has bursts and variable behavior. Also it's sensitive to lose but not to delay. This behavior makes difficult to UPC function in network and cause of congestion in switch, thus performance is degraded. To resolve this problem, various flow control mechanism has been worked in the ATM Forum. Especially, the rate-based flow control mechanism for ABR traffic has been standardized in the ATM Forum, Sept. 1994. Thus, various flow control mechanism has been working which likes EFCI, ER, VS/VD. VS/VD control is superior than existed ER control because it isolate different networks from each other. In this paper, we propose an expanded VS/VD flow control algorithm and compare with existed VS/VD flow control algorithm. Simulation result shows that this algorithm improve a problem in aspect of delay and fairness.

• Smart Media Journal
• /
• v.2 no.4
• /
• pp.51-59
• /
• 2013

With increasing transmission speed of backbone networks, it is getting to provide enough available bandwidth. However, the bandwidth is not effectively utilized in volumetric data transfer. This mainly comes from the transmission protocol, TCP, which is used for most applications. TCP is inherently difficult to adapt the available bandwidth because of it's own characteristic of transfer mechanism. UDT is a prominent application level data transfer protocol which is targeting high speed network. In this paper, we propose UDT parallel transfer technologies which is adaptive to network status and then evaluate their performance in two points of view. Firstly, we measure data transfer rate of UDT with rate congestion control methods, and compare them with basic UDT. Secondly, we apply parallel transfer technologies adapted to network status, and measure their performance. Experimental results showed that UDT rate congestion control method outperforms UDT with 106% improvement in RTT 100ms section set with jitter 30ms. In addition, performance of parallel transfer with rate congestion control method showed 107% improvement than that of parallel transfer in RTT 400ms section set with jitter 20ms.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.927-936
• /
• 1995

ATM Forum has defined a new service class for data applications called Available Bit Rate(ABR) Service, which has highly bursty traffic and unpredictable burst size. It is desirable that we reduce the probability of retrans mission of packets by minimizing the loss of cells because the traffic is much more sensitive to loss than delay. The Forum has also selected the Rate-Based Control for the ABR service and proposed EPRCA as the control mechanism for the service. This paper proposes the combination of EPRCA and the other feedb ack control mechanisms such as BECN and BP. The combined control mechanism control ABR traffic more efficiently and the simulation results show that the network performance can be improved by choosing the appropriate parameters.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.558-560
• /
• 2000

일 대 다수의 정보를 전송하는데 있어서 멀티캐스트는 네트웍의 자원을 절약할 수 있고 송신자의 부하를 감소시킬 수 있는 등 여러 가지 장점을 제공한다. 그러나, 그것을 효율적으로 실현시키기 위한 확장성 문제와 더불어 혼잡 제어를 통한 기존 인터넷 트래픽과의 공존성 문제를 주의 깊게 다루어야 한다. 본 논문에서는 지정된 서버(Designated Server)를 이용하여 혼잡 제어 방식에 있어서 기존 인터넷 트래픽과 자원을 공평하게 나누어 사용하며, 멀티캐스트 특성상 나타날 수 있는 수신자들의 불공정성 문제를 해결함으로써 보다 효율적인 정보전송이 이루어지도록 하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.89.6-89
• /
• 2001

In Vehicle Information and Communication System (VICS), which is an active field of Intelligent Transport System (ITS), information of traffic congestion is sent to each vehicle at real time. However, a centralized navigation system is not realistic to guide millions of vehicles in a megalopolis. Autonomous distributed systems should be more flexible and scalable, and also have a chance to focus on each vehicle´s demand. This paper proposes a sub-optimal route planning mechanism of vehicles in urban areas using the non-network type immune system. Simulation is carried out using a cellular automaton model. This system announces a sub-optimal route to drivers in real time using VICS.

• Journal of Advanced Navigation Technology
• /
• v.16 no.3
• /
• pp.463-470
• /
• 2012

This paper proposes a new profit popularity-based segment caching control mechanism for assuring a consecutive streaming QoS (Quality of Service) in the wireless channel. Then, the proposed mechanism operates SSCP (Single Segment Caching Profit) and MSCP (Multiple Segment Caching Profit) for assuring a QoS. SSCP and MSCP is to optimize the cache performance when is performed the streaming in the proxy. The proposed mechanism simulated to evaluate such mechanisms as fixed-partition mechanism, weight-based mechanism, SSCP, and MSCP. Simulation results show that the proposed mechanism has superior performance compared to other mechanisms.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1685-1688
• /
• 2002

Application Routing Load Balancing (ARLB) is a novel load balancing mode that combines QoS routing and load balancing in per application to support QoS far real-time application based on wired network. Zone Routing Protocol (ZRP) is a recent hybrid proactive/reactive routing approach in an attempt to achieve scalability of ad-hoc network. This routing approach has the potential to be efficient in the generation of control traffic than traditional routing schemes. Up to now, without proper load balancing tools, the ZRP can actually guarantee QoS for delay-sensitive applications when congestion occurred in ad-hoc network. In this paper, we propose the ARLB to improve QoS fur delay-sensitive applications based on ZRP in ad-hoc network when congestion occurred and to be forwarding mechanism fur route coupling to support QoS for real-time applications. The critical point is that the routing metric of ARLB is originally designed for wired network environment. Therefore, we study and present an appropriate metric or cost computation routing of ARLB for recently proposed ZRP over ad-hoc network environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1493-1499
• /
• 2007

Real-time applications in a wireless sensor network environment require real-time transmissions from sensing nodes to sink nodes. Existing congestion control mechanisms have treated congestion problems in sensor networks, but they only adjust the reporting frequency or the sending rate in intermediate nodes. They were not suitable for real-time applications from the transmission delays point of view. In this paper, we suggest a new mechanism that can reduce the transmission delay and can increase the throughput for real-time applications in sensor network. This mechanism classifies data on the real-time characteristics, processes the data maintaining the real-time characteristics prior to the other data such as the non real-time data or the data lost the real-time characteristics. A modified frame format is also proposed in order to apply the mechanism to IEEE 802.15.4 MAC layer. The simulation based on ns-2 is accomplished in order to verify the performance of the suggested scheme from transmission delay and throughput standpoints. The simulation results show that the proposed algorithm has a better performance specifically when It applies to the real-time applications in sensor networks.