• Journal of Korean Society of Transportation
• /
• v.15 no.4
• /
• pp.53-71
• /
• 1997

This paper presents a methodology for estimating average travel speed using volume and occupancy data from single magnetic loop detectors for signalized arterials. Three methods were developed and evaluated using field data: VPLUSKO method, fuzzy control method, and neural network method. While the VPLUSKO method is easy to apply, it results poor performances compared to other methods. The neural network method showed the best performances among the candidate methods. This method revealed the weakness in transferability, however. From limited cases of field test, it was concluded that the method of the fuzzy control application showed reasonable performance of estimation. It was also demonstrated that the fuzzy control method has the capability of transferability.

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

The standards which use shared medium like IEEE 802.11 wireless LAN have transmission opportunity by contention in contention period. If there are collisions in contention period, medium access control protocol may solve problem by using backoff algorithm. Backoff algorithm is important part in medium access control, but legacy backoff method which is used under IEEE 802.11 standards is not adjusted when load is heavy because of increasing collisions. In this paper, we propose a new load-based dynamic backoff algorithm in contention-based wireless shared medium to improve throughput of medium and to reduce the number of collisions. Proposed backoff algorithm can increase the network utilization about $20\%$ higher than that of binary exponential backoff algorithm.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.547-550
• /
• 2008

인터넷 서비스가 차별화 되어야 한다는 논의는 인터넷이 본격적으로 상용화된 1990넌대 중반부터 꾸준하게 제기되어 왔다. Tragedy of commons 라고 불리는 인터넷 혼잡현상은 지속적인 기술발전으로 인해서 상당부분 해결되었으나, 최근 들어서는, Web 2.0의 등장을 통해 동영상 파일이 차지하는 비중이 늘어나면서 P2P를 통한 파일교환이 전체 인터넷 트래픽의 상당 부분을 차지하면서, 또한 실시간 미디어, VoIP 등의 인터넷 응용 프로그램 등에서 전송상의 지연을 포함한 QoS 보장을 요구하게 되면서, 또한 통신사업자의 망중립성에 관한 논의가 진행되면서, 인터넷 서비스를 차별화하고, 통제하려는 연구의 중요성이 증대되고 있다. 본 연구는 인터넷 서비스를 차별화하기 위한 수단으로 기존에 제시되어온 자격과 우선순위라는 2개의 차원에서 그리고 가격제도로서 종가제와 종량제의 차원에서 배경을 검토해본 다음, 우선 대기열 이론과 혼잡성 제어 이론을 통해서 차별화된 서비스가 전체 시스템에어떤 구체적으로 효익을 가져오는 지를 검토하며, 우선순위와 사용시간에 따라 차별화되는 종량제가 현실에서 발견되지 않는 이유에 대한 이론적인 근거를 제시하고, 종량제를 채택했을 경우에 발생하는 문제점과 종량제 사용에서 발생하는 한계들을 논의하면서, 현실적으로 종량제와 차별가격을 도입할 때 발생할 수 있는 문제점들을 밝혀본다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.699-706
• /
• 2008

This paper compares throughput performance of TCP and SCTP in a variety of network environments. For experiments, we construct a Linux-based testbed and consider a set of performance metrics such as MSS(Maximum Segment Size), transmission delay, and packet loss rate. In addition, we analyze the effect of SCTP multi-streaming on throughput. From the experimental results, we can see that SCTP provides throughput gain of approximately $20%{\sim}50%$ over TCP. This performance gain comes from the distinctive features of SCTP such as chunk bundling, initial congestion window of 2 MTU and SACK(Selective ACK) based error control. In the lossy networks, we can see that SCTP multi-streaming transmissions can effectively overcome the so-called HoLB(Head-of-Line Blocking) phenomenon of TCP.

• Journal of Advanced Navigation Technology
• /
• v.12 no.2
• /
• pp.154-163
• /
• 2008

In a mobile broadband wireless access (MBWA) network, many users access a base station (BS), which relays data transferred from high-speed wired network to low-speed wireless network. For this difference of their data rate, a BS suffers from the lack of its buffer space when many users run multiple applications at the same time, and thus packet losses occur. TCP, which guarantees end-to-end reliability, is used as transport protocol also in wireless networks. But TCP lowers their transmission rate incorrectly and frequently whenever packet losses occur. And they increase their transmission rate differently with each other; finally TCP throughput of each TCP flow varies largely, and then TCP fairness goes worse. In this paper, a scheme that controls packet transmission rate adaptively according to TCP flows' transmission rate, that prevents buffer overflows at BS, and that guarantees TCP fairness at a certain degree is proposed. As it is analyzed by simulations, the proposed scheme enhances TCP fairness by maintaining TCP throughput of each TCP sender similarly with each other.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.919-926
• /
• 2016

In a wireless network, TCP causes the performance degradation because of mistaking packet loss, which is caused by characteristics of wireless link and throughput oscillation due to change of devices connected on a limited bandwidth. Delay based TCP is not affected by packet loss because it controls window size by using the RTT. Therefore, it can solve the problem of unnecessary degradation of the rate caused by misunderstanding reason of packet loss. In this paper, we propose an algorithm for improving the remaining problems by using delay based TCP. The proposed scheme can change throughput adaptively by adding the RTT, which rapidly reflects the network conditions to BaseRTT. It changes the weight of RTT and the increases and decreases window size based on the remaining amount of the buffer. The simulation indicated that proposed scheme can alleviate the throughput oscillation problem, as compared to the legacy TCP Vegas.

• Journal of IKEEE
• /
• v.10 no.1 s.18
• /
• pp.30-39
• /
• 2006

The TCP protocol can provide some reliability using sliding window mechanism for data transmission, flow control, and congestion control. However, TCP has some limitations in that it has basically been designed solely for wired communication environments. If traditional TCP protocol is used also in wireless networks, the end-to-end data transmission performance degrades dramatically due to frequent packet losses caused by transmission errors and hand-offs. While there have been some research efforts on TCP enhancements considering the mobility of wireless communication devices, in this paper we propose a new method to improve the TCP performance by combining the Snoop and the Freeze-TCP methods. In the proposed scheme, the TCP end-to-end semantics is maintained and no changes of existing protocols in sending systems or in routers are required. It has the advantage of simple implementation because TCP code changes are limited to mobile devices for applying the Freeze-TCP and it requires only to add Snoop modules in base stations. Accordingly, the proposed scheme can operate well in the existing networks. Finally, in this study, we compared the performance of the proposed scheme with traditional TCP, other approaches through simulations using ns-2.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.2
• /
• pp.59-68
• /
• 2002

In this paper, we compared and analyzed two new models of cyclic packet dropping algorithm, Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) with RIO. The ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. We modelled two cyclic packet drop algorithms and executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying the strict drop precedence policy, we get better performance on priority levels. The results show that two new algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than other algorithms.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.783-788
• /
• 2002

Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) are applying stricter drop precedence than that of RIO algorithm. Especially, the ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. And we executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying strict drop precedence policy, we get better performance on priority levels. The results show that the proposed algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than RIO and the NCPD algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.28-39
• /
• 2010

The study aims at offering a solution to the problems of transmission delay and data throughput decrease as the number of contending On-Board Units (OBU) increases by applying CSMA medium access control protocol based upon IEEE 802.11p. In a competition-based medium, contention probability becomes high as OBU increases. In order to improve the performance of this medium access layer, the author proposes EDCA which a adaptive adjustment of the Contention Windows (CW) considering traffic density and data type. EDCA applies fixed values of Minimum Contention Window (CWmin) and Maximum Contention Window (CWmax) for each of four kinds of Access Categories (AC) for channel-specific service differentiation. EDCA does not guarantee the channel-specific features and network state whereas it guarantees inter-AC differentiation by classifying into traffic features. Thus it is not possible to actively respond to a contention caused by network congestion occurring in a short moment in channel. As a solution, CWminAS(CWmin Adaptation Scheme) and ACATICT(Adaptive Contention window Adjustment Technique based on Individual Class Traffic) are proposed as active CW control techniques. In previous researches, the contention probabilities for each value of AC were not examined or a single channel based AC value was considered. And the channel-specific demands of IEEE 802.11p and the corresponding contention probabilities were not reflected in the studies. The study considers the collision number of a previous service section and the current network congestion proposes a dynamic control technique ACCW(Adaptive Control of Contention windows in considering the WAVE situation) for CW of the next channel.