• Title/Summary/Keyword: 패킷 패기

Search Result 4, Processing Time 0.041 seconds

A Study on The UnSafe Packet Drop and Delay of Multimedia Traffics (멀티미디어 트래픽의 비보안 패킷 폐기와 지연에 관한 연구)

  • Lim Chung-Tyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.245-250
    • /
    • 2005
  • A network of Packet based switch Mode will be required to carry the traffics(CVR,VBR, UBR, ABR) generated by a wide range of services. Packet based Network services the Qualify-of-Service (QoS) management of traffic sources and bandwidth. Besides efficiency and throughput services are achieved in the multimedia traffic sent in the network. In this paper, the scheduler transmits the safe packet, drop the unsafe packet and evaluate unsafe Packet as the requirement of the delay avoiding the network congestion for improving the QoS of the multimedia network. In this paper, we Propose the scheduling algorithm which evaluates and drops the packet The suggested model Performance of the switch is estimated and simulated in terms of the delay by computer.

  • PDF

Policy of packet dropping for enhancing IDS performance (IDS의 성능 향상을 위한 패킷 폐기 방안)

  • Moon, Jong-Wook;Kim, Jong-Su;Jung, Gi-Hyun;Yim, Kang-Bin;Joo, Min-Kyu;ChoI, Kyung-Hee
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.473-480
    • /
    • 2002
  • Although many researches on IDS (Intrusion Detection System) have been performed, the most of them are limited to the algorithm of detection software. However, even an IDS with superior algorithm can not detect intrusion, if it loses packets which nay have a clue of intrusions. In this paper, we suggest an efficient wav to improve the performance of IDS by reducing packet losses occurred due to hardware limitation and abundant processing overhead introduced by massive detection software itself. The reduction in packet losses is achieved by dropping hacking-free packets. The result shows that this decrease of packet losses leads an IDS to improve the detection rate of real attack.

TCP Throughput Guarantee using Packet Buffering (패킷 버퍼링을 이용한 TCP 처리율 보장 방법)

  • Choi, Sun-Woong;Kim, Chung-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.2
    • /
    • pp.242-250
    • /
    • 2001
  • This paper deals with the TCP bandwidth guarantee problem in a differentiated serviccs(Diffserv) network. The Diffserv assured s<:rvice differentiates packet drop probabilities to guarantee the promised bandwidth even under network congestion. However a token buffer marker fails to show adequate performance because TCI' generates packets according to the unique Tel' congestion control mechanism. We propose a marker that uses a data buffer as well as a token buffer. The marker with a data buffer works well with the assured service mechanism because it smooths Tel' traffic. We showed that the marker with a data buffer achieves the target throughput better than a marker with a token buffer only. We also showed that the optimal buffer size is proportional to reserved throughput and HTT.

  • PDF

A Stabilized Queue Management Algorithm for Internet Congestion Control (인터넷 혼잡제어를 위한 안정적인 큐 관리 알고리즘)

  • 구자헌;정광수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.70-80
    • /
    • 2004
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). But, RED configuration has been a problem since its first proposal. This problem is that proposed configuration is only good for the particular traffic conditions studied, but may have detrimental effects if used in other conditions. While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are unstable for tile various traffic conditions. The inherent problem with these queue management algorithms is that they all use static parameter setting. In this paper, in order to solve this problem, a new active queue management algorithm called SQM(Stabilized Queue Management) is proposed. This paper shows that it is easy to parameterize SQM algorithm to perform well under different congestion scenarios. This algorithm can effectively reduce packet loss while maintaining high link utilizations and is good for the various traffic conditions.