Flow Identification for Supporting Resource Reservation

dc.contributor.author Cao, Zhiruo en_US
dc.contributor.author Wang, Zheng
dc.date.accessioned 2005-06-17T17:48:04Z
dc.date.available 2005-06-17T17:48:04Z
dc.date.issued 1999 en_US
dc.description.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. en_US
dc.format.extent 200652 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/6615
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.relation.ispartofseries CC Technical Report; GIT-CC-99-15 en_US
dc.subject Resource reservation
dc.subject Real-time systems
dc.subject Flow analysis
dc.subject Hashing-based schemes
dc.title Flow Identification for Supporting Resource Reservation en_US
dc.type Text
dc.type.genre Technical Report
dspace.entity.type Publication
local.contributor.corporatename College of Computing
local.relation.ispartofseries College of Computing Technical Report Series
relation.isOrgUnitOfPublication c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication 35c9e8fc-dd67-4201-b1d5-016381ef65b8
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
195.95 KB
Adobe Portable Document Format