Published November 1, 2006
| Version public
Journal Article
Open
Adaptive Deterministic Packet Marking
Abstract
An efficient method is presented for signaling link price information using single-bit marks. It exploits side information in the IPid field of the IP header to allow the maximum price on a flow's path to be estimated. It automatically adapts the resolution with which the price is quantized, depending on how quickly the price changes. The algorithm does not depend on the number of hops in a link. A marking scheme with improved compatibility with current ECN (RFC 3168) is also proposed.
Additional Information
© Copyright 2006 IEEE. Reprinted with permission. Manuscript received June 9, 2006. [Posted online: 2006-12-04] The associate editor coordinating the review of this letter and approving it for publication was Costas Georghiades. This work was supported by the Australian Research Council (DP0557611), the NSF under the FAST project, and the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 110705).Files
ANDieeecl06.pdf
Files
(180.0 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:2a7842024944b7c5e238826fef0c3540
|
180.0 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 7161
- Resolver ID
- CaltechAUTHORS:ANDieeecl06
Dates
- Created
-
2007-01-11Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field