• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5B
• /
• pp.443-450
• /
• 2011

The Internet has become an essential part in our modern life by providing useful information. So, the volume of Internet traffic has been increasing rapidly, which emphasizes the importance of network traffic analysis for effective network operation and management. Signature based analysis have been commonly used, but it is shown that the increase of signatures due to the increase of applications causes the performance degradation of real-time traffic analysis on high-speed network links. In this paper, we propose OS fingerprinting method for real-time traffic analysis. The previous problems can be solved by utilizing the OS information. The OS fingerprinting method for real-time traffic analysis, proposed in this paper, conducts under passive mode, and improves the limitation of a previous method such as low completeness and accuracy. In this paper, we enlarged an input data to improve completeness, and used the User-Agent field in HTTP packet to extract various OS signatures. Also, we changed an input data from packet to flow to improve accuracy.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.90-93
• /
• 1998

컴퓨터 통신에서 실시간 멀티미디어 응용은 보장된 통신 서비스 성능을 요구하므로 이를 위해서는 트래픽이 버스트할 때 망 내에서 자원을 예약하여 접속시 피크율을 기반으로 망의 이용율을 높인다. 본 논문에서 결정론적 지연 범위을 이용하여 모든 접속에서 피크 율의 합이 링크 속도 보다 더 커질 때 버스트 상태의 트래픽에 대한 링크를 넘어 보장될 수 있음을 보인다. 또한 트래픽이 버스트할 때 새로운 결과는 연결수락된 접 속의 수를 증가시키므로 이러한 결과는 스위치에서 속도가 제어된 서비스 규율을 사용함으로써 단일 스위치로부터 망의 이용율을 개선할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.635-637
• /
• 1999

기존의 인터넷 기반 데이터 서비스는 'Best-effort' 정책으로 멀티미디어 서비스를 위한 트래픽 제어(traffic control) 기능을 제공하지 못한다. 그러므로 실시간 데이터 전송을 기반으로 제공되는 VOD(Video-on-Demand) 서비스는 사용자가 원하는 QoS(Quality of Service)를 제공할 수 없다. 따라서 인터넷 상에서 트래픽 제어 기능을 갖춘 중개자를 두어 VOD 서비스를 제공하는 방법에 대해 제안한다. 중개자의 주요 기능은 비디오 서버와 클라이언트 사이에 비디오 데이터의 버퍼링 기능을 이용하여 실시간 트래픽 제어를 수행한다. 이런 기능을 가진 중개자를 에이전트라 부르고, 에이전트에 대한 설계 및 구현에 대해 기술한다.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.134-146
• /
• 2005

Research about QoS in the ad-hoc networks for stable service of various applications has been needed as the expectation about the realization of the ad-hoc networks grows bigger. Existing researches about QoS in the ad-hoc network had the problems which can not guarantee the quantitative services or create the overhead. In this paper, we propose a novel algorithm of QFAN(QoS Framework for Ad-hoc Networks) the framework to resolve such problems and considered application of the proposed algorithm into the ad-hoc networks. Our model can guarantee the minimum bandwidth of the real-time traffic as minimized the overhead. And, disproportionate distribution of bandwidth problem can resolve by the proposed algorithm through the fair share between real-time traffic and best-effort traffic about available bandwidth. We design both the TiRe(Tiny Reservation) and the ADR(Adaptive Drop Rate) control algorithm to apply the proposed QFAN. Using simulation, we confirm fair share of available bandwidth between real-time traffic and best-effort traffic as guarantee minimum required bandwidth of real-time traffic.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.73-79
• /
• 2005

Recent advances on wireless technology are enabling the design and deployment of real-time traffic in wireless LAN. Point Coordination Function (PCF) mode of Wireless LAN is defined to provide QoS of real time traffic, such as voice, video in wireless LANs. The service polling scheduling plays an important role in real-time traffic services of wireless LAN. This paper proposes a multicast polling scheme to increase the maximum number of conversations by reducing the amount of empty polls in IEEE 802.11 PCF mode. Our simulation studies show that our scheme may improve performance of the PCF in terms of the average transfer delay and packet discard ratio.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.1-10
• /
• 2008

In this paper, a packet scheduling algorithm, called the modified PLFS, is proposed for real-time traffic in IEEE 802.22 WRAN systems. The modified PLFS(Packet Loss Fair Scheduling) algorithm utilizes not only the delay of the Head of Line(HOL) packets in buffer of each user but also the amount of expected loss packets in the next-next frame when a service will not be given in the next frame. The performances of the modified PLFS are compared with those of PLFS and M-LWDF in terms of the average packet loss rate and throughput. The simulation results show that the proposed scheduling algorithm performs much better than the PLFS and M-LWDF algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.98-106
• /
• 2006

In order to provide a realtime transmission over a wireless LAM, we here present a new jamming based retransmission mechanism. In a legacy wireless LAN system, all stations use the binary exponential backoff algorithm to avoid collisions among frames. It is well known that the backoff algorithm causes more collisions as the numbers of active stations increases. This makes transmission of real time traffic hard. In the proposed scheme, when each station senses collisions, it promptly allows to send a jamming signal during a unique jamming window period which is determined by its own channel access count database(CACDB). This jamming windows is chosen not to be overlapped each other by using of CACDB, and thus channel access of another station is prevented. Hereafter the station gets the ownership of the medium when the wireless medium becomes idle after sending the jamming signal and sensing carrier, and then sends frame in medium. In our proposal, repeating collisions is never happened. We here assume that real time traffic use a frame of fixed length in order to make the time for receiving its ACK frame same. Comparing the proposed jamming-based retransmission scheme with the the 802.11 and 802.11e MAC by simulation. one can find that the proposed scheme have advantages in terms of delay, average backoff time, and average number of collisions per frame. One can find that the proposed scheme might be practically applicable to several applications of realtime traffic transmission in wireless LAN systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.236-247
• /
• 2002

We propose a cell－multiplexing scheme for the real－time communication service in ATM network and a new service discipline guarantee end-to-end delay based on pseudo-isochronous cell switching. The proposed scheme consists of two level frame hierarchy, upper and lower frame, which is used to assign the bandwidth and to guarantee the requested delay bound, respectively. Since the Proposed algorithm employs two level frame hierarchy, it can overcome the coupling problem which is inherent to the framing strategy It can be comparatively reduce the complexity, and still guarantee the diverse delay bounds of end-to-end. Besides, it consists of two components, traffic controller and scheduller, as the imput traffic description model and regulates the input traffic specification. The function of the traffic controller is to shape real -time traffic to have the same input pattern at every switch along the path. The end-to-end delay is bounded by the scheduller which can limit the delay variation without using per-session jitter controllers, and therefore it can decrease the required buffer size. The proposed algorithm can support the QoS's of non-real time traffic as well as those of real time traffic.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.436-438
• /
• 2005

실시간 센서네트워크 응용은 사용자의 요구에 따른 실시간성을 보장하여야 한다. 센서네트워크에서 혼잡 문제를 다룬 기존의 연구들은 소스 노드 흑은 중간 노드에서의 전송률 제한 및 전송 지연을 통해 트래픽을 억제하는 방식을 사용하기 때문에 실시간성을 보장하지 않는다. 본 논문에서는 일정 시간 동안 전송되는 실제 데이터 수준을 유지하는 동시에 네트워크 트래픽을 억제하는 방식을 통해 실시간 센서네트워크 응용에 적절한 혼잡 회피 기법을 제안한다. 이는 네트워크에 존재하는 데이터를 실시간성을 기준으로 분류하여, 각각 병합 및 첨부 방식을 통해 하나의 패킷에 다수의 데이터를 포함시키는 기법이다. 시뮬레이션 결과에 의하면 본 기법의 적용에 의해 실시간 응용의 성능은 전송 성공률과 실시간성 측면에서 그렇지 않은 경우에 비해 높은 성능을 보여주고 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.879-888
• /
• 2004

In this paper, we propose a real time QoS(Quality of Service) guaranteed transmission mechanism for MPEG video traffic at the congested node in IP based networks. Recent spread of the Internet has increased the demands of a real time multimedia service of the quality, Because the type of Internet services can, however, offer the best effort delivery strategies, it is difficult to treat all the types of traffic with differential COS (Class of Service). Most of all, the hierarchical coding method of MPEG data utilizes the reference frame for the motion prediction. The loss of the reference frames makes QoS of the video traffic degraded because the reference frame bit error causes the consecutive packet loss. Therefore we have studied the real time QoS guaranteed mechanism for video traffic by analyzing the previous methods. Computer simulation results show that the proposed scheme has better performance than the previous one.