A Caltech Library Service

Adaptive Deterministic Packet Marking

Andrew, Lachlan L. H. and Hanly, Stephen V. and Chan, Sammy and Cui, Tony (2006) Adaptive Deterministic Packet Marking. IEEE Communications Letters, 10 (11). pp. 790-792. ISSN 1089-7798. doi:10.1109/LCOMM.2006.060898.

See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Article
Related URLs:
URLURL TypeDescription
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).
Subject Keywords:Congestion control, ECN, packet marking
Issue or Number:11
Record Number:CaltechAUTHORS:ANDieeecl06
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:7161
Deposited By: Archive Administrator
Deposited On:11 Jan 2007
Last Modified:08 Nov 2021 20:40

Repository Staff Only: item control page