1Brown N,Mills C,Ruth G. Traffic flow measurement architecture[S].RFC 2722,1999.
2Kim I,Reddy A L N. Analyzing network traces to identify long term high-rate flows[R].TAMU,2001.
3Estan C,Varghese G. New directions in traffic measurement and accounting:focusmg on the elephants,ignoring the mice[J].ACM Transactions on Computer Systems,2003,(03):270-313.
4B Bloom. Space/time tradeoffs in hash coding with allowable errots[J].Communications of the ACM,1970,(07):422-426.
1Kim I,Reddy A L N.Analyzing network traces to identify long term high-rate flows[R].Technical report TAMU,2001.
2Estan Cristian,Varghese George.New directions in traffic measurement and accounting:focusing on the elephants,ignoring the mice[J].ACM Trans Comput Syst,2003,21(3):270-313.
3Kumar A,Xu J,Wang J,et al.Space-code bloom filter for efficient per-flow traffic measurement[C]//IEEE INFOCOM 2004,the Conference on Computer Communications.Hong Kong,2004:1763-1774.
4Bloom B.Space/time trade-offs in hash coding with allowable errors[J].Commun of ACM,1970,13(7):422-426.
5Fan L,Cao P,Almeida J,et al.Summary cache:a scalable wide-area web cache sharing protocol[J].IEEE/ACM Transactions on Networking,2000,8 (3):281-293.
6Cohen S,Matias Y.Spectral bloom filters[C]// Proc of the 2003 ACM SIGMOD Int'l Conf on Management of Data[C].San Diego:ACM Press,2003:241-252.
7Claffy K C,Braun H W,Polyzos G C.A parameterizable methodology for internet traffic flow profiling[J].IEEE Journal on Selected Areas in Communications,1995,13(8):1481-1494.
10Shaikh A,Rexford J,Shin K G.Load-sensitive routing of long-lived IP flows[C]//Proc of the Conference on Applications,Technologies,Architectures,and Protocols for Computer Communication.New York:ACM Press,1999:215-226.
