• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.867-875
• /
• 2003

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization in which TCP congestion window size is fluctuated during congestion period. Furthermore, if RTT(Round Trip Time) is increased, three duplicate ACK packets are not correct congestion signals because congestion might already disappear and the host may send more packets until it receives three duplicate ACK packets. Recently there are increasing interests in solving end-to-end congestion control using AQM(Active Queue Management) to improve the performance of TCP protocols. AQM is a variation of RED-based congestion control. In this paper, we first evaluate the effectiveness of the current AQM schemes such as RED, CHOKe, ARED, FRED and SRED, over traffic with different rates and over traffic with mixed responsive and non-responsive flows, respectively. In particular, CHOKe mechanism shows greater unfairness, especially when more unresponsive flows exist in a shared link. We then propose a new AQM scheme using CHOKe mechanism, called DQC(Double Queue CHOKe), which uses two FIFO queues before applying CHOKe mechanism to adaptive congestion control. Simulation shows that it works well in protecting congestion-sensitive flows from congestion-causing flows and exhibits better performances than other AQM schemes. Also we use partial state information, proposed in LRURED, to improve our mechanism.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.291-299
• /
• 2016

To enhance network efficiency, named-data networking (NDN) implements data caching functionality on intermediate network nodes, and then the nodes directly respond to request messages for cached data. Through the processing of request messages in intermediate node, NDN can efficiently reduce the amount of network traffic, also solve network congestion problems near data sources. Also, NDN provides a data authenticate mechanism so as to prevent various Internet accidents caused from the absence of an authentication mechanism. Hence, through applying NDN to various smart IT convergence services, it is expected to efficiently control the explosive growth of network traffic as well as to provide more secure services. Basically, it is important factors of NDN which data is cached and where nodes caching data is located in a network topology. This paper first analyzes previous works caching content based on the popularity of the content. Then ii investigates the hitting rate of caches in each node of a network topology, and then propose an improved caching scheme based on the result of the analyzation. Finally, it evaluates the performance of the proposal.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.55-60
• /
• 1992

The IEEE 802.4 priority mechanism can be used to handle multiple data access classes of traffic. Several timers are used to realize the priority mechanism. The performance and stability of a token bus network depend on the assignment of such timers. In this peper, we present a dynamic timer assignment algorithm for the token passing bus network. The presented algorithm has simple structure for real-time applications and adaptively controls the set of initial timer values according to the offered traffic load. The assignment of the set of timers becomes easy due to the presented algorithm. Based on the iterative algorithm, some solutions such as mean waiting time are derived.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.230-239
• /
• 2003

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.176-180
• /
• 2004

In this paper we introduce a bandwidth allocation algorithm and admission control policy for IEEE 802.16 broadband wireless access standard. The proposed mechanism is practical and compatible to the IEEE 802.16. Our scheme provides QoS support to high priority traffic and high throughput in low priority traffic. The simulation show that the proposed scheme includes QoS support for real-time traffic and we presented that BS determine a efficient contention mini-slot size. We have shown the relationship between traffic size and its QoS requirements and the network performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.241-249
• /
• 2005

ATM based MPLS(Multiprotocol Label Switching) is discussed for its provisioning QOS commitment capabilities, Traffic engineering and smooth migration for BcN in Korea. At this time, due to the comprehensive nature of ATM protocol, ATM has been adapted as the backbone system for carrying Internet traffic[1,2,3,4]. This paper presents preventive congestion control mechanisms for detecting HTR(Hard-To-Reach) LSP(Label Switched Path) in ATM based MPLS systems. In particular, we have introduced a HTR LSP detection method using network signaling information in an ATM layer. MPLS related studies can cover LSP failures in a physical layer fault, it can not impact network congestion status. Here we will present the research results for introducing HTR LSP detection methods and control mechanisms and this mechanism can be implementing as SOC for high speed processing a packet header. We concluded that it showed faster congestion avoidance abilities with a more reduced system load and maximized the efficiency of network resources by restricting ineffective machine attempts.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.103-115
• /
• 2007

The vulnerability issue on IEEE 802.1x wireless LAN has been permits the malicious attack such as Auth/Deauth flooding more serious rather than we expected. Attacker can generate huge volume of malicious traffic as the same methods on existing wired network. The objective of wireless IP Traceback is to determine the real attack sources, as well as the full path taken by the wireless attack packets. Existing IP Traceback methods can be categorized as proactive or reactive tracing. But, these existing schemes did not provide enhanced performance against DoS attack on wireless traffic. In this paper, we propose a 'TTL based advanced Packet Marking' mechanism for wireless IP Packet Traceback with wireless Classification function. Proposed mechanism can detect and control DoS traffic on AP and can generate marked packet for reconstructing on the real path from the non-spoofed wireless attack source, by which we can construct secure wireless network based on AP with enhance traceback performance.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.227-237
• /
• 2008

In this paper, an algorithm that provides absolute and proportional differentiation of packet delays is proposed with the objective of enhancing quality of service in future packet networks. It features an adaptive scheme that adjusts the target delay for every time slot to compensate the deviation from the target delay, which is caused by prediction error on the traffic to arrive at the next time slot. It predicts the traffic to arrive at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized by the delay control operation for the next time slot to offset it. Because the proposed algorithm compensates the prediction error continuously, it shows superior adaptability to bursty traffic and exponential traffic. Through simulations we demonstrate that the algorithm meets the quantitative delay bounds and is robust to traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA, and the performance is verified under the test board based on the XPC860P CPU.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.3
• /
• pp.389-399
• /
• 1998

The DMR-II shared-medium access control protocol was developed for the ATM access network users to supper the isochronous traffic and the non-isochronous traffic simultaneously under the bandwidth-skating environment. In this paper we analyze the performance of the DMR-II protocol by using both the analytical analysis and the simulation method. Under the ATM access network environment, the performance analysis result shows that the DMR-II protocol maintains the delay variation of the isochronous traffic beyond the threshold value, and satisfies the delay time criteria of the non-isochronous traffic by supporting the priority service. Moreover the result shows high network utilization over 130% due to the destination release mechanism of the DMR-II protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.39-46
• /
• 2005

As the multimedia application traffic takes more portion in the internet traffic, it is necessary to control the network congestion through the congestion control protocol. In addition, the QoS-enabled networks such as DiffServ become an indispensable technology when running the multimedia applications. However, the previously proposed end-to-end congestion control algorithms take the round trip time to react the network congestion. Thus, as the RTT becomes larger, the reaction against the congestion gets delayed further, while the network congestion gets worse. In addition the performance of end-to-end congestion control algorithm is degraded if the QoS-enabled network runs the congestion control mechanism in the network level without any coordination between them. In this paper, we propose the early rate adaptation protocol for the DiffServ network which effectively linke the congestion control algorithm at the host and the congestion mechanism in the network together. By taking advantage of early congestion notification from the network it is possible to react the network congestion more quickly and effectively.