• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1831-1853
• /
• 2012

By sending periodically short bursts of traffic to reduce legit transmission control protocol (TCP) traffic, the low-rate denial of service (LDoS) attacks are hard to be detected and may endanger covertly a network for a long period. Traditionally, LDoS detecting methods mainly concentrate on the attack stream with feature matching, and only a limited number of attack patterns can be detected off-line with high cost. Recent researches divert focus from the attack stream to the traffic anomalies induced by LDoS attacks, which can detect more kinds of attacks with higher efficiency. However, the limited number of abnormal characteristics and the inadequacy of judgment rules may cause wrong decision in some particular situations. In this paper, we address the problem of detecting LDoS attacks and present a scheme based on the fluctuant features of legit TCP and acknowledgment (ACK) traffic. In the scheme, we define judgment criteria which used to identify LDoS attacks in real time at an optimal detection cost. We evaluate the performance of our strategy in real-world network topologies. Simulations results clearly demonstrate the superiority of the method proposed in detecting LDoS attacks.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.1
• /
• pp.1-15
• /
• 1988

DS1 transmission systems use framing bit errors, bipolar violations and code-detected errors to estimate the bit error rate when determining errored and severely errored seconds. Using the coefficient of variation under the memoryless binary symmetric channel assumption, a basic framework to evaluate these estimation schemes is proposed to provide a practical guideline in determining errored and severely errored seconds which are fundamental in monitoring the real-ime error performance of DS1 transmission systems carrying live traffic. To evaluate the performance of the cyclic redundancy check code (CRC), a computer simulation model is used. Several drawbacks of the superframe format in association with real time error performance monitoring are discussed. A few recommendations are suggested in measuring errored and severely errored seconds, and determining service limit alarms through the use of the superframe format. Furthermore, we propose a new robust scheme for determining service limit alarms which take into consideration the limitations of some estimation schemes for the time interval of one second.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.84-92
• /
• 2015

Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.385-395
• /
• 2014

In this paper, we consider a resource allocation scheme for millimeter wave-based wireless personal area networks using directional antennas. This scheme involves scheduling the reservation period of medium access control for IEEE 802.15.3c. Objective functions are considered to minimize the average delay and maximize throughput; and two scheduling algorithms-namely, MInMax concurrent transmission and MAxMin concurrent transmission-are proposed to provide a suboptimal solution to each objective function. These are based on an exclusive region and two decision rules that determine the length of reservation times and the transmission order of groups. Each group consists of flows that are concurrently transmittable via spatial reuse. The algorithms appropriately apply two decision rules according to their objectives. A real video trace is used for the numerical results, which show that the proposed algorithms satisfy their objectives. They outperform other schemes on a range of measures, showing the effect of using a directional antenna. The proposed scheme efficiently supports variable bit rate traffic during the reservation period, reducing resource waste.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.329-331
• /
• 2014

JavaScript is widely used to offer interactive web service and dynamic content. However, the number and size of JavaScript constituting the web page has been increasing steadily, and this circumstance leads to falling web performance. In this paper, we suggest a scheme for acceleration of JavaScript transmission considering software module reusability. We perform network simulation for the performance evaluation and analysis about the suggested scheme, and then confirm that the suggested scheme offers better performance in term of page loading time and the amount of traffic generated in the network than the transmission method using Gzip.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.258-265
• /
• 2003

Transmission of continuous media streams has been a challenging problem of multimedia service. Lots of works have been done trying to figure out the best solution for this problem, and some works presented the optimal solution for transmitting the stored video using smoothing schemes applied to each individual stream. But those smoothing schemes considered only one stream, not the whole streams being serviced, to apply themselves, which could only achieve local optimum not the global optimum. Most of all, they did not exploit statistical multiplexing gain that can be obtained before smoothing. In this paper, we propose a new smoothing scheme that deals with not an individual stream but the whole streams being serviced simultaneously to achieve the optimal network bandwidth utilization and maximize the number of streams that can be serviced simultaneously. We formally proved that the proposed scheme not only provides deterministic QoS for each client but also maximizes number of clients that can be serviced simultaneously and hence achieves maximum utilization of transmission bandwidth.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.187-198
• /
• 2005

In this paper, we propose the enhanced header compression scheme for the efficient data traffic transmission in Ipv6 networks. The bandwidth of wireless links and IP networks will probably be limited due to properties of the physical medium and regulatory limits on the use of frequencies for radio communications. That is major cause of user throughput reduction. Therefore, We discuss the IPHC(RFC2507) and ROHC(RFC3095) scheme. IPHC is simple header compression scheme and ROHC is enhanced header compression that have fast optimal recovery scheme. We have studied the enhanced header compression scheme in ROHC. We will show that indication of compression context values preventing from packet losses can provide the fast recovery of compression state. Computer simulations show that the proposed scheme has better performance than the previous one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1031-1037
• /
• 2003

A new scheduling scheme, which uses channel quality information of each flow in Bluetooth system of ad-hoc network for effective bandwidth assignment, has been proposed in this paper. By an effective bandwidth assignment, QoS (Quality of Service) could have been ensured in case of asymmetric data traffic, mixed data transmission, and congested data transmission in a specific channel. The scheduling algorithm determines channel weights using partial channel information of flows. Case studies conducted by NS-2 (Network Simulator 2) and Bluehoc simulator has been presented to show the effectiveness of the proposed scheduling scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.192-198
• /
• 2008

In this paper, we propose a scheme that improves the transmission performance of realtime multimedia data in wireless Local Area Network (LAN) environment, through the dynamical control of Transmission Opportunity (TXOP) period of the IEEE 802.11e HCCA Medium Access Control (MAC). The existing schedulers which determine the frame transmission time and its duration could not appropriately cope with the change of physical transmission rate, since the TXOP period has remained unchanged with the change of transmission rate of the wireless station. Our scheme is devised to keep the transmission performance of real-time multimedia data effectively unchanged by making TXOP period be extended when the transmission rate gets reduced. The proposed scheme is experimented along with IEEE 802.11e reference model using NCTUns simulator, which shows that the multimedia data is effectively delivered with the change of transmission rate as the distance between the wireless station and its access point increases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12A
• /
• pp.1246-1252
• /
• 2006

In this paper, a collision probability, processing time and traffic capacity analysis algorithm for RFID system using random FHSS and synchronous FHSS is proposed. Service time, duty cycle, traffic intensity and additional delay time required for re-transmission due to collision are considered and the processing delay and frequency channel capacity are analyzed for the steady state operation of the system. The simulation results which show maximum capacity of the system and explain the accuracy of the algorithm are provided.