发明名称 Packet relay apparatus and method of relaying packet
摘要 The packet relay apparatus is provided. The packet relay apparatus includes a receiver that receives a packet; and a determiner that determines to drop the received packet without storing the received packet into a queue among the multi-stage queue. The determiner determines to drop the received packet at a latter stage, based on former-stage queue information representing a state of a queue at any former stage which the received packet belongs to and latter-stage queue information representing a state of a queue at the latter stage which the received packet belongs to.
申请公布号 US8761012(B2) 申请公布日期 2014.06.24
申请号 US201113008611 申请日期 2011.01.18
申请人 Alaxala Networks Corporation 发明人 Yamada Takahiro;Hinosugi Hideki
分类号 G01R31/08;G06F11/00;G08C15/00;H04J1/16;H04J3/14;H04L1/00;H04L12/26;H04L12/50;H04Q11/00;H04L12/28;G06F15/16;G06F15/173;G06F3/00;G06F5/00 主分类号 G01R31/08
代理机构 Foley & Lardner LLP 代理人 Foley & Lardner LLP
主权项 1. A packet relay apparatus configured to relay a packet by utilizing a multi-stage queue structure, comprising: a receiver configured to receive a packet; a determiner configured to determine whether to drop the received packet at a latter stage, based on former-stage queue information representing a state of a former-stage queue at any former stage to which the received packet belongs, and latter-stage queue information including a drop probability and representing a state of a latter-stage queue at the latter stage to which the received packet belongs; a buffer memory configured to hold the received packet on the basis of the determination by the determiner; and a queuing controller configured to queue the received packet into the former-stage queue or the latter-stage queue in the buffer memory if the determiner determines not to drop the received packet, wherein when an average queue length is less than a maximum threshold value and greater than a minimum threshold value which is decreased by a drop threshold weight, the drop probability DP is defined as DP=(MAX_DP+β)(QAVE−MIN_TH(N+1)+β)/(MAX_TH(N+1)−MIN_TH(N+1)+β), wherein MAX_DP is a maximum drop probability, α is the drop probability weight, β is the drop threshold weight, QAVE is the average queue length, MAX_TH(N+1) is the maximum threshold value, and MIN_TH(N+1) is the minimum threshold value.
地址 Kawasaki JP
您可能感兴趣的专利