• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.759-761
• /
• 2016

ICMP(Internet Control Message Protocol) supports the processing of error in the communication network based TCP/IP. If a problem is occurred in a data transmission process, router or receiving host sends ICMP message containing the error cause to sending host. However, in this process an attacker sends a fake ICMP message to the host so that the communication between the hosts can be abnormally terminated. In this paper, we performed a study to prevent several attacks related to ICMP. To this, we have designed outbound traffic controller so that attack packet is not transmitted to network in operating system of host.

• International Journal of Computer Science & Network Security
• /
• v.22 no.2
• /
• pp.327-333
• /
• 2022

Internet Protocol Television (IPTV) has emerged as a personal entertainment source for home users. Streaming IPTV content over a wireless medium with good Quality of Service (QoS) can be a challenging task as IPTV content requires more bandwidth and Wireless Local Area Networks (WLANs) are susceptible to packet loss, delay and jitter. This research presents the capacity of IPTV using User Datagram Protocol (UDP) and TCP Friendly Rate Control (TFRC) over IEEE 802.11ac WLANs in good and bad network conditions. Experimental results show that in good network conditions, UDP and TFRC could accommodate a maximum of 78 and 75 Standard Definition Television (SDTV) users, respectively. In contrast, 15 and 11 High-Definition Television (HDTV) users were supported by UDP and TFRC, respectively. Performance of UDP and TFRC was identical in bad network conditions and same number of SDTV and HDTV users were supported by TFRC and UDP. With background Transmission Control Protocol (TCP) traffic, both UDP and TFRC can support nearly the same number of SDTV users. It was found that TFRC can co-exist fairly with TCP by giving more throughput to TCP unlike UDP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2796-2813
• /
• 2014

This paper presents a new algorithm called the adaptive logarithmic increase and adaptive decrease algorithm (A-LIAD), which mainly addresses the Round-Trip Time (RTT) fairness problem in satellite networks with a very high propagation delay as an alternative to the current TCP congestion control algorithm. We defined a new increasing function in the fashion of a logarithm depending on the increasing factor ${\alpha}$, which is different from the other logarithmic increase algorithm adopting a fixed value of ${\alpha}$ = 2 leading to a binary increase. In A-LIAD, the ${\alpha}$ value is derived in the RTT function through the analysis. With the modification of the increasing function applied for the congestion avoidance phase, a hybrid scheme is also presented for the slow start phase. From this hybrid scheme, we can avoid an overshooting problem during a slow start phase even without a SACK option. To verify the feasibility of the algorithm for deployment in a high-speed and long-distance network, several aspects are evaluated through an NS-2 simulation. We performed simulations for intra- and interfairness as well as utilization in different conditions of varying RTT, bandwidth, and PER. From these simulations, we showed that although A-LIAD is not the best in all aspects, it provides a competitive performance in almost all aspects, especially in the start-up and packet loss impact, and thus can be an alternative TCP congestion control algorithm for high BDP networks including a satellite network.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.339-346
• /
• 1999

When a multicast video conference system utilizes RTP (Real Time Protocol) and RTCP (Real Time Control Protocol), the loss rate and the synchronization of transfer in RTCP affect the scalability of the system. The random delay technique introduced to resolve the problems is so simple that leads the network to meet some congestion in synchronizing feedback information when lots of people transfer the feedback information simultaneously, which reduces the scalability of system. In this paper, we propose a new feedback control algorithm that provides priority levels with the RTCP packet, which cuts down the feedback delay and increases the scalability. The criteria of providing priority Based on the decided priority level, Agent forced the session participants to provide much more RTCP packets, positively controlled, and the possible bandwidth can be measured. The simulation on this technique decreases the delay, and the feedback messages are equally distributed on a given time period.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2259-2266
• /
• 2016

Recently dense wireless local area networks (WLANs) emerge as the number of WLAN cells and stations increases. In such dense WLAN environment, this paper proposes a new distributed medium access control (MAC) protocol. The proposed MAC protocol extends the previous CSMA with collision resolution (CSMA/CR) that uses a single collision detection (CD) phase and employs multiple CD phases to resolve more collisions. It checks the collision detection in each CD phase and stops the CD phase if consecutive non-detected CD phases occur more than the threshold. Therefore, the proposed protocol can control the number of CD phases adaptively according to the number of accessing stations and increase the probability of collision resolution while decreasing the packet overhead. The simulation results show that the proposed adaptive CSMA/CR protocol employs a variable number of CD phases according to the number of stations and achieves a greater throughput than the previous CSMA/CR protocol using the fixed number of CD phases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.900-910
• /
• 2004

Route failure is mainly caused by mobility of mobile host in ad hoc networks. Route failure, which may lead to sudden packet losses and delays, is losing the route from source to destination. In this situation, TCP assumes that congestion has occurred within the network and also initiates the congestion control procedures. Congestion control algorithm provides the means for the source to deal with lost packets. TCP performance in ad hoc environments will be degraded as TCP source cannot distinguish congestion from route failure. In this paper, we propose TCP-P as pre-detection approach to deal with route failure. TCP-P freezes TCP through pre-detection of route failure. Route failure information of the proposed mechanism is obtained not by routing protocol but by MAC protocol. The intermediated node, obtaining route failure information by its MAC layer, relays the information to TCP source and lets TCP source stop the congestion control algorithm. Results reveal that TCP-P responding with proactive manner outperforms other approaches in terms of communication throughput under the presence of node mobility.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.3-11
• /
• 2000

This paper considers the performance of a dynamic priority control function (DPCF) of a threshold-based Bernoulli priority jump (TBPJ) scheme. Loss-sensitive and delay-sensitive traffics are applied to a system with a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Loss-sensitive and delay-sensitive traffics represent sound and data, respectively. Under the TBPJ scheme, the first packet of the loss-sensitive traffic buffer goes into the delay-sensitive traffic buffer with Bernoulli probability p according to system states which represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. TBPJ scheme shows also better performance than that of HOL scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.941-950
• /
• 2001

In this paper, we present the integrated network architecture for supporting mobile IP in third generation mobile communication networks, and propose the end-to-end QoS control mechanisms of DiffServ and QoS control functions of each network element in the proposed network. First, the QoS supporting schemes of IMT-2000 are described. Second, the necessities of integrating the networks are discussed and the integrated architecture are proposed. Third, the mapping between wireless channels and DiffServ classes are presented. Finally, the end-to-end QoS control mechanisms are proposed. We also analyze the link level protocols with QoS provisioning for mobile multimedia assuming that the system support voice and data traffic simultaneously. In case of data traffic, the delay and throughput of SREJ ARQ and Type-1 Hybrid ARQ scheme are compared, and In case of voice traffic, the packet loss rate of BCH coding is analyzed according to the varying data traffic loads. The results indicate that the adaptive link level protocols are efficient to meet the QoS requirements while the complexities are increased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1037-1053
• /
• 1991

Flooding is known to be an effective routing mechanism not only in circuit switched networks but also packet switched networks since it minimizes the time required for up calls and does not have to maintain routing tables or distance tables by periodically intercommunicating among all the network nodes. However, one main drawback of it is the overhead on the control message signaling channels, In the paper, we propose an overlaying scheme on the existing mechanism that retains the desired properties of flooding, yet provides congestion control to the network. This is done by utilizing the wasted search messages to inform the network of the conditions of each path from one node to another. The overhead is to maintain a path table in each node. However, this overhead is not so critical. Also, this scheme can take advantages further by limiting the extent of message propagation through the network and by incorporating trunk reservation schemes additionally.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.692-697
• /
• 2003

The researches on the Internet based tole-operation have received increased attention for the past few years. In this paper, we implement the Internet based tele-operating system. In order to transmit robustly the surroundings and control information of the robot, we make a data as a packet type. Also in order to transmit a very large image data, we use PEG compressive algorithm. The central problem in the Internet based tele-operation is the data transmission latency or data-loss. For this specific problem, we introduce an autonomous mobile robot with a 2-layer fuzzy controller. Also, we implement the color detection system and the robot can perceive the object. We verify the efficacy of the 2-layer fuzzy controller by applying it to a robot that is equipped with various input sensors. Because the 2-layer fuzzy controller can control robustly the robot with various inputs and outputs and the cost of control is low, we hope it will be applied to various sectors.