Flow Identification for Supporting Resource Reservation
Author(s)
Cao, Zhiruo
Wang, Zheng
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
Abstract
This paper considers the problem of flow identification for supporting
resource reservation. We propose several hashing-based schemes for flow
identification and present a quantitative analysis of their performance and
scalability limits. Of the hash functions we studied using simulation with
real traffic traces, 32-bit CRC and XOR-folding of the five-tuple
demonstrate excellent performance, both on the memory requirement for a
collision rate target, and on the number of collided flows on average and in
the worst-case. Our findings show that, with hashing-based schemes, it is
feasible to implement flow identification at high speeds to support hundreds
of thousands of reserved flows.
Sponsor
Date
1999
Extent
200652 bytes
Resource Type
Text
Resource Subtype
Technical Report