To reduce the TCP flow processing cost, some bit patterns selected from the TCP/IP packet can be used as TCP flow identification. Based on the entropy and randomness analysis of the distribution of sequence number （S...To reduce the TCP flow processing cost, some bit patterns selected from the TCP/IP packet can be used as TCP flow identification. Based on the entropy and randomness analysis of the distribution of sequence number （SN） and acknowledgement number （AN） in the first packet of a TCP flow, this paper proposes a new uniform TCP flow identification by sequence and acknowledgement number （FIDSAN） to the heavy-tailed IP or TCP traffic. The experimental results suggest that some bits in the TCP sequence number and acknowledgment number can be selected out as flow ID with acceptable confliction probability. The bit length of flow ID selected under given confliction probability can be conducted from an equation deduced from the observing window and flow ID range. FIDSAN has low computation cost in the comparison with the traditional methods, such as 5-tuple, CRC, and Checksum etc.展开更多
1.引言随着Internet网络的飞速发展,传统的"尽力"型业务越来越不能满足新的用户和应用的质量要求,网络需要提供更高级的质量保障.同时,对于不同的用户对业务质量(QoS)具有不同的要求,网络也需要区别QoS等级,并采用相应的传输...1.引言随着Internet网络的飞速发展,传统的"尽力"型业务越来越不能满足新的用户和应用的质量要求,网络需要提供更高级的质量保障.同时,对于不同的用户对业务质量(QoS)具有不同的要求,网络也需要区别QoS等级,并采用相应的传输控制机制来保障这些QoS等级.在传统Internet网络中,分别用两种传输协议来传送不同质量要求的业务:TCP(Transmission Control Protrol)和UDP(User Data Protocol)协议.展开更多
文摘To reduce the TCP flow processing cost, some bit patterns selected from the TCP/IP packet can be used as TCP flow identification. Based on the entropy and randomness analysis of the distribution of sequence number （SN） and acknowledgement number （AN） in the first packet of a TCP flow, this paper proposes a new uniform TCP flow identification by sequence and acknowledgement number （FIDSAN） to the heavy-tailed IP or TCP traffic. The experimental results suggest that some bits in the TCP sequence number and acknowledgment number can be selected out as flow ID with acceptable confliction probability. The bit length of flow ID selected under given confliction probability can be conducted from an equation deduced from the observing window and flow ID range. FIDSAN has low computation cost in the comparison with the traditional methods, such as 5-tuple, CRC, and Checksum etc.
基金Supported by the National High-Tech Research and Development Plan of China under Grant No.2005AA121210(国家高技术研究发展计划(863))the National Basic Research Program of China under Grant No.2007CB307102(国家重点基础研究发展计划(973))
文摘针对流竞争拥塞,提出了一种拥塞分析模型FCCM(flow-competing congestion model),给出了TCP竞争流在拥塞链路上的分布特性,推导了流竞争拥塞发生的条件,进而分析了在流竞争拥塞发生时,路由器为维持拥塞链路100%利用率所需的最小缓存.分析结果表明,当流数目不确定时,应对流竞争拥塞所需的缓存将不大于流数目确定时经典BSCL(buffer sizing for congested interact links)方案中的最小缓存需求.
文摘1.引言随着Internet网络的飞速发展,传统的"尽力"型业务越来越不能满足新的用户和应用的质量要求,网络需要提供更高级的质量保障.同时,对于不同的用户对业务质量(QoS)具有不同的要求,网络也需要区别QoS等级,并采用相应的传输控制机制来保障这些QoS等级.在传统Internet网络中,分别用两种传输协议来传送不同质量要求的业务:TCP(Transmission Control Protrol)和UDP(User Data Protocol)协议.
