首页> 外文OA文献 >Design and Implementation of Stateful Packet Filtering Firewall and optimization using Binary Decision Diagram
【2h】

Design and Implementation of Stateful Packet Filtering Firewall and optimization using Binary Decision Diagram

机译:有状态包过滤防火墙的设计与实现以及二进制决策图的优化

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Today internet is the most useful and big source of knowledge. We can find any information on the internet. But at the same time we are exposed to different types of attacks such as spoof Packet filtering, Denial of Service Attack and so on. So we have to secure the network from this type of attack so that we can easily find information without any hiccups. Through Firewall we can secure our network form this type of attack. There are so many types of Firewall currently exist. But we focus specially on Stateful Packet Firewall. Stateful Packet Filtering in improved version of packet filter firewall in which it validates the first packet of the new connection according to the firewall rule. If that packet is satisfied by the firewall rule policy than corresponding entry is created in state table so that for consecutive packet of the same connection will not be validated by firewall rule. It checks only that packet is corresponding to the existing connection or not. If packet is of existing connection then it will immediately passed through firewall, no need to check according to firewall rule and if packet is of the new connection then it is passed through firewall if and only if it validates the rule and accordingly it will create entry in state table. But there exist problem when the rule list is large in number. Today firewall rules contains thousands or lacks of rule. So it will take long time to decide for a packet to be allowed or not. So we can improve this look up time by using Binary Decision Diagram (BDD). BDD is compressed data structure that will decide immediately that if packet should be passed or not. Operation are performed directly on compressed data structure. On testing on millions of packets the look up time is decreases up to 74%.
机译:如今,互联网已成为最有用和最重要的知识来源。我们可以在互联网上找到任何信息。但是与此同时,我们面临着各种类型的攻击,例如欺骗性数据包筛选,拒绝服务攻击等。因此,我们必须保护网络免受此类攻击,以便我们能够轻松找到信息而不会造成任何麻烦。通过防火墙,我们可以保护网络免受此类攻击。当前存在多种类型的防火墙。但是我们特别关注状态数据包防火墙。改进版本的数据包筛选器防火墙中的状态数据包筛选,其中它根据防火墙规则验证新连接的第一个数据包。如果防火墙规则策略满足了该数据包,则将在状态表中创建相应的条目,这样对于同一连接的连续数据包,防火墙规则将不会对其进行验证。它仅检查数据包是否与现有连接相对应。如果数据包具有现有连接,则它将立即通过防火墙,无需根据防火墙规则进行检查;如果数据包具有新连接,则当且仅当它验证规则并因此将创建条目时,才通过防火墙。在状态表中。但是,当规则列表数量众多时,存在问题。如今,防火墙规则包含数千条规则或缺乏规则。因此,决定是否允许数据包将花费很长时间。因此,我们可以使用二进制决策图(BDD)来缩短查找时间。 BDD是压缩的数据结构,它将立即决定是否应传递数据包。操作直接在压缩数据结构上执行。在对数百万个数据包进行测试时,查找时间最多可减少74%。

著录项

  • 作者

    Kumar Anil;

  • 作者单位
  • 年度 2014
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号