标题: | 差异性服务网路中封包分类与讯务标示方法之讨论 Packet Classification and Traffic Marking Algorithms for DiffServ Networks |
作者: | 颜宁佑 Ning-You Yan 张仲儒 郑瑞光 Chung-Ju Chang Ray-Guang Cheng 电信工程研究所 |
关键字: | 封包分类;三元可位址化记忆体;过滤器冲突;讯务标示器;差异性服务网路;Packet classifiaction;TCAM;filter conflict;traffic marker;DiffServ |
公开日期: | 2002 |
摘要: | 差异性服务 (Diffserv) 网路架构提供网际网路服务品质保证(QoS guarantee)的能力。它将网路上的讯务依订定的契约内容分为数个群组 (classes),并对每一群组提供不同等级的服务品质保证。封包分类器(packet classifier)是位于边缘路由器(edge router),依据封包标头内容来分配至不同的微讯务流(micro-flows)。然而当两个或多个过滤器(filter)有相交集的时候,会有一个隐密不显的过滤器冲突问题发生,这会使得封包分类器无法正确的处理封包,更进一步会招致安全性的问题。所以,需要一些过滤器冲突侦测的机制来解决这问题。 在另一方面,讯务调节器 (traffic conditioner) 是位于边缘路由器 (edge router) 上,里面包含着测量(metering)、标示(marking)、塑型(shaping)和规范(policing)等功能。其中,当封包要离开时,里面的讯务标示器会依据测量得到的结果,给予封包标示符合规约(in- of-profile)或是不符合规约(out-of-profile) 。而在差异性服务网路的后续端点,将会这些标示内容和网路负载的状况,来决定做出哪些相对应的动作来处理封包。然而传统的讯务标示器有些缺点。第一、对微讯务流之间的不公平标示造成某些微讯务得不到应得的服务品质保证。第二、符合规约的封包数量会随着经过的差异性服务领域 (DS domain)个数变多而减少。更有甚者,在新的一些拥有升级功能的标示机制当中,会出现一个不公平升等的问题,而这会使得原先高服务等级的讯务无法永远比其他低服务等级的讯务接受到较高的服务等级。而这可能使得高服务等级的讯务有比较高的机率被丢弃的可能。因此在这篇论文中,我们先提出了一个增进式三元可位址化为基础的封包分类器来侦测过滤器冲突及处理封包分类的问题。经由我们的方法,可以使得有发生冲突的过滤器和最佳符合的过滤器,都可以在一次记忆体存取时间得到。另外,一个新的讯务标示器-具有积极性的公平讯务标示器(FTM_AP)-在这里被提了出来。这标示器可以修正传统标示器中不恰当标示的问题。新的机制是以双速率三色标示器 (TRTCM) 为基本架构来发展,具有对微讯务公平分配频宽的特性并可以透过封包升级充分利用现有频宽。当升级机制被启动时,新的机制会考量封包在传送端最原始被标示的颜色。而这样子的设计会减低不公平升等的效应。藉由模拟结果我们可以观察出FTM_AP的效能比TC_PFG与TRTCM优异。 The Differentiated Services (DiffServ; DS) architecture is proposed for providing current Internet with QoS guarantee. In DiffServ, the traffic is separated to several classes according to the service contracts, and each class is offered with different QoS guarantee. The packet classifier is an element located in the edge router to examine the packet header and dispatch it to the different micro-flows. However, an implicit problem, called filter conflict, would occur when two or more filters overlap. This problem would cause the classifier unable to handle the packet correctly; furthermore, it could incur the security problem. Thus, some filter conflict detection schemes are needed to resolve the problem. On the other hands, the traffic conditioner is an element located in the edge router, which includes the functions of metering, marking, shaping and policing. The traffic maker takes the responsibility to mark the packet as either in- or out-of-profile according the measuring result when it exits the traffic marker. The corresponding actions will be taken in the later DS nodes according to the condition of network and the marking result of packet. However, there are several drawbacks in traditional traffic marker. First, the unfair marking appears and certain micro-flows would not achieve the deserved QoS requirement. Second, if a connection passes through more than one DS domains, it would be more probable to be demoted and dropped. In advance, the current some marking algorithm with a promotion function would incur an unjust promotion of the traffic. This problem could make the higher-level traffic not be always served more likely than the other lower-level traffic; moreover, the high-level traffic would be more probable to be dropped in this mechanism. In this thesis, we propose the e_TCAM (enhanced TCAM)-based classifier to detect the filter conflict and classify the incoming packets. Through applying our scheme, no matter the conflicted filter and the best-matching filter can be found in one memory access time. Also, a new traffic marker called, FTM_AP (Fair Traffic Marker with Aggressive Promotion), is proposed to amend the inappropriate markings in traditional marking algorithms. The new scheme is based on TRTCM (Two Rate Three Color Marker) scheme and allocates appropriate bandwidth to micro-flows to reduce the unfair distribution among micro-flows and improve the utilization by allowing promotion of packets when there is bandwidth available. When the promotion mechanism is enabled, the packets its original color at the source would be considered, and it could reduce the effect of the unjust promotion. Simulation results show that FTM_AP outperforms the TRTCM and TC_PFG. |
URI: | http://140.113.39.130/cdrfb3/record/nctu/#NT910435019 http://hdl.handle.net/11536/70549 |
显示于类别: | Thesis |