• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.451-453
• /
• 2019

Recently, as the use of wireless communication devices has increased, the wireless network usage has increased, and a wired network and a wireless network have been mixed to form a network. Existing TCP algorithms are designed for wired networks. Therefore, in the modern network environment, packet loss can not be accurately distinguished and improper congestion control is performed, resulting in degradation of TCP performance. In this paper, we propose SLDA (Support Vector Machine based Loss Discrimination Algorithm) which can accurately classify the packet loss environment to improve TCP performance and evaluate its performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.325-338
• /
• 2004

As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.

• Journal of Satellite, Information and Communications
• /
• v.8 no.1
• /
• pp.1-7
• /
• 2013

Currently satellite communication systems usually use the ACM(Adaptive Coding and Modulation) to extend the link availability and to increase the bandwidth efficiency. However, when ACM system is used for satellite communications, we should carefully consider TCP congestion control to avoid network congestions. Because MODCODs in ACM are changed to make a packet more robust according to satellite wireless link conditions, bandwidth of satellite forward link is also changed. Whereas TCP has a severe problem to control the congestion window for the changed bandwidth, then packet overflow can be experienced at MAC or PHY interface buffers. This is a reason that TCP in transport layer does not recognize a change of bandwidth capability form MAC or PHY layer. To overcome this problem, we propose the adaptive congestion control scheme of TCP for supporting ACM in Satellite PEP (Performance Enhancing Proxy) systems. Simulation results by using ns-2 show that our proposed scheme can be efficiently adapted to the changed bandwidth and TCP congestion window size, and can be useful to improve TCP performance.

• Journal of KIISE:Information Networking
• /
• v.33 no.5
• /
• pp.369-379
• /
• 2006

In recent years, there have been many researches about Ad-hoc Networks which is available to communicate freely between mobile devices by using multi-hop without any support of relay base or access point. TCP that used the most widely transport protocol in the Internet repeats packet loss and retransmission because it increases congestion window size by using reactive congestion control until packet loss occurs. As a result of this, energy of mobile device is wasted unnecessarily. In this paper, we propose TCP-New Veno in order to improve the energy efficiency of mobile device. According to the state of network, the scheme adjusts appropriate size of congestion window. Therefore, the energy efficiency of mobile device and utilization of bandwidth are improved by the scheme. From the simulation by using ns-2, we could see more improved energy efficiency with TCP-New Veno than those with TCP in Ad-hoc Networks.

• Journal of KIISE:Information Networking
• /
• v.35 no.3
• /
• pp.192-206
• /
• 2008

Multihop is the main communication style for wireless sensor networks composed of tiny sensor nodes. Until now, most applications have treated the periodic small sized sensing data. Recently, the burst traffic with the transient and continuous nature is increasingly introduced due to the advent of wireless multimedia sensor networks. Therefore, the efficient communication protocol to support this trend is required. In this paper, we propose a novel PIGAB(Packet Interval Gap based on Adaptive Backoff) protocol to efficiently transmit the burst data in multihop wireless sensor networks. The contention-based PIGAB protocol consists of the PIG(Packet Interval Gap) control algorithm in the source node and the MF(MAC-level Forwarding) algorithm in the relay node. The PIGAB is on basis of the newly proposed AB(Adaptive Backoff), CAB(Collision Avoidance Backoff), and UB(Uniform Backoff). These innovative algorithms and schemes can achieve the performance of network by adjusting the gap of every packet interval, recognizing the packet transmission of the hidden node. Through the simulations and experiments, we identify that the proposed PIGAB protocol considerably has the stable throughput and low latency in transmitting the burst data in multihop wireless sensor networks.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.189-196
• /
• 2004

Most of the recent researches for ATM switches have been based on multistage interconnection network known as regularity and self-routing property. These networks can switch packets simultaneously and in parallel. However, they are blocking networks in the sense that packet is capable of collision with each other Mainly Banyan network have been used for structure. There are several ways to reduce the blocking or to increase the throughput of banyan-type switches: increasing the internal link speeds, placing buffers in each switching node, using multiple path, distributing the load evenly in front of the banyan network and so on. Therefore, this paper proposes the use of recirculating shuffle-exchange network to reduce the blocking and to improve hardware complexity. This structures are recirculating shuffle-exchange network as simplified in hardware complexity and Rank network with tree structure which send only a packet with highest priority to the next network, and recirculate the others to the previous network. after it decides priority number on the Packets transferred to the same destination, The transferred Packets into banyan network use the function of self routing through decomposition and composition algorithm and all they arrive at final destinations. To analyze throughput, waiting time and packet loss ratio according to the size of buffer, the probabilities are modeled by a binomial distribution of packet arrival. If it is 50 percentage of load, the size of buffer is more than 15. It means the acceptable packet loss ratio. Therefore, this paper simplify the hardware complexity as use of recirculating shuffle-exchange network instead of bitonic sorter.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.612-622
• /
• 2013

In this paper, we propose a coding packet group-based ARQ scheme (rNC) for file delivery in wireless networks. rNC assumes multiple network coding points between the source and the destination. Each network coding point gathers and codes a group of packets according to the queue polling system. A queue polling system makes a few or several packets available for coding in a queue while polling the other queues in the system. Thus, we assuem a queue polling system at each network coding point. We call this group of packets as coded packet group. Each coding point acknowledges the reception of every code packet group to its previous coding point for reliable delivery. Thus, the intermediate coding points including the source can release its buffer before the packet is delivered to the destination. To guarantee the ultimate file delivery to the destination, the destination sends acknowledgement to the sender. We evaluate our proposed scheme using ns-2 and compare the performance with CodeCast. The results show that rNC works better than CodeCast in terms of packet delivery ratio and control overhead in unreliable wireless networks.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.793-805
• /
• 2001

In the recent priority system, high-priority packet will be served first and low-priority packet will be served when there isn\`t any high-priority packet in the system. By the way, even high-priority packet can be blocked by HOL (Head of Line) contention in the input queueing System. Therefore, the whole switching performance can be improved by serving low-priority packet even though high-priority packet is blocked. In this paper, we study the performance of preemptive priority in an input queueing switch for high speed switch system. The analysis of this switching system is taken into account of the influence of priority scheduling and the window scheme for head-of-line contention. We derive queue length distribution, delay and maximum throughput for the switching system based on these control schemes. Because of the service dependencies between inputs, an exact analysis of this switching system is intractable. Consequently, we provide an approximate analysis based on some independence assumption and the flow conservation rule. We use an equivalent queueing system to estimate the service capability seen by each input. In case of the preemptive priority policy without considering a window scheme, we extend the approximation technique used by Chen and Guerin [1] to obtain more accurate results. Moreover, we also propose newly a window scheme that is appropriate for the preemptive priority switching system in view of implementation and operation. It can improve the total system throughput and delay performance of low priority packets. We also analyze this window scheme using an equivalent queueing system and compare the performance results with that without the window scheme. Numerical results are compared with simulations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.8
• /
• pp.731-737
• /
• 2012

In this paper the usage of Bluetooth in networked control systems is described. ACL links and commonly used serial port profile built on top of ACL links are analyzed and their problems such as unpredictable latency are discovered. SCO link packet scheduling, latency estimation and setup procedure are examined. SCO link is suggested as proper link for NCS, due to its low latency and low variance. Smith predictor use for latency compensation is described and its impact on control performance is estimated. A number of experiments on DC motor position control are performed and control performance of system utilizing SCO link with and without Smith predictor is proved to be higher than control performance of system utilizing ACL link.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.168-172
• /
• 2010

The Network-based handover still has problems such as the transmission delays and the packet losses in the case of macro mobility, though technological advances have been made in the wireless and mobile communication. For end-to-end handover, the link bandwidth has been reduced in the wireless network due to its burst errors and congestion control. To overcome such problems, we propose a new scheme of the macro handover according to the protocol layer. The proposed macro handover is implemented on the network layer to partially substitute wired signaling for wireless signaling, to flexibly employ buffers, and on the transport layer to postpone its retransmission time. We have performed extensive simulation using ns-2 and the result shows that our proposed scheme outperforms the other existing schemes in terms of transmission delay, packet loss, and data transfer rate during the handovers.