The estimation error of adaptive deterministic packet marking

Lachlan Andrew; Stephen Hanly

The estimation error of adaptive deterministic packet marking

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

Abstract

This paper is concerned with problem of signalling congestion link price information to a receiver using single bit marks. An efficient method was presented in [1] which exploits side information in the IPid field of the IP header to allow the maximum price on a flow's path to be estimated. In this paper we provide analysis to support the claim that the scheme can track a changing price. We consider a random walk model for the price, and provide a weak convergence result showing that the squared error (normalized by the drift) is asymptotically exponentially distributed, as the drift tends to zero.

Original language	English
Title of host publication	44th Annual Allerton Conference on Communication, Control, and Computing 2006
Place of Publication	Urbana-Champaign
Publisher	University of Illinois at Urbana-Champaign
Pages	1211-1219
Number of pages	9
Volume	3
ISBN (Electronic)	9781604237924
Publication status	Published - 2006
Externally published	Yes
Event	44th Annual Allerton Conference on Communication, Control, and Computing - 2006 - Monticello, United States Duration: 27 Sept 2006 → 29 Sept 2006

Other

Other	44th Annual Allerton Conference on Communication, Control, and Computing - 2006
Country/Territory	United States
City	Monticello
Period	27/09/06 → 29/09/06

Keywords

Congestion price
ECN
Explicit Congestion Notification
Flow control.
TCP
Transmission Control Protocol

Cite this

@inproceedings{862280200bc34dd5adfadbfa48f855fd,

title = "The estimation error of adaptive deterministic packet marking",

abstract = "This paper is concerned with problem of signalling congestion link price information to a receiver using single bit marks. An efficient method was presented in [1] which exploits side information in the IPid field of the IP header to allow the maximum price on a flow's path to be estimated. In this paper we provide analysis to support the claim that the scheme can track a changing price. We consider a random walk model for the price, and provide a weak convergence result showing that the squared error (normalized by the drift) is asymptotically exponentially distributed, as the drift tends to zero.",

keywords = "Congestion price, ECN, Explicit Congestion Notification, Flow control., TCP, Transmission Control Protocol",

author = "Lachlan Andrew and Stephen Hanly",

year = "2006",

language = "English",

volume = "3",

pages = "1211--1219",

booktitle = "44th Annual Allerton Conference on Communication, Control, and Computing 2006",

publisher = "University of Illinois at Urbana-Champaign",

address = "United States",

note = "44th Annual Allerton Conference on Communication, Control, and Computing - 2006 ; Conference date: 27-09-2006 Through 29-09-2006",

}

Andrew, L & Hanly, S 2006, The estimation error of adaptive deterministic packet marking. in 44th Annual Allerton Conference on Communication, Control, and Computing 2006. vol. 3, University of Illinois at Urbana-Champaign, Urbana-Champaign, pp. 1211-1219, 44th Annual Allerton Conference on Communication, Control, and Computing - 2006, Monticello, Illinois, United States, 27/09/06.

The estimation error of adaptive deterministic packet marking. / Andrew, Lachlan; Hanly, Stephen.
44th Annual Allerton Conference on Communication, Control, and Computing 2006. Vol. 3 Urbana-Champaign: University of Illinois at Urbana-Champaign, 2006. p. 1211-1219.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - The estimation error of adaptive deterministic packet marking

AU - Andrew, Lachlan

AU - Hanly, Stephen

PY - 2006

Y1 - 2006

N2 - This paper is concerned with problem of signalling congestion link price information to a receiver using single bit marks. An efficient method was presented in [1] which exploits side information in the IPid field of the IP header to allow the maximum price on a flow's path to be estimated. In this paper we provide analysis to support the claim that the scheme can track a changing price. We consider a random walk model for the price, and provide a weak convergence result showing that the squared error (normalized by the drift) is asymptotically exponentially distributed, as the drift tends to zero.

AB - This paper is concerned with problem of signalling congestion link price information to a receiver using single bit marks. An efficient method was presented in [1] which exploits side information in the IPid field of the IP header to allow the maximum price on a flow's path to be estimated. In this paper we provide analysis to support the claim that the scheme can track a changing price. We consider a random walk model for the price, and provide a weak convergence result showing that the squared error (normalized by the drift) is asymptotically exponentially distributed, as the drift tends to zero.

KW - Congestion price

KW - ECN

KW - Explicit Congestion Notification

KW - Flow control.

KW - TCP

KW - Transmission Control Protocol

UR - https://www.scopus.com/pages/publications/84940661466

M3 - Conference proceeding contribution

AN - SCOPUS:84940661466

VL - 3

SP - 1211

EP - 1219

BT - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

PB - University of Illinois at Urbana-Champaign

CY - Urbana-Champaign

T2 - 44th Annual Allerton Conference on Communication, Control, and Computing - 2006

Y2 - 27 September 2006 through 29 September 2006

ER -

The estimation error of adaptive deterministic packet marking

Abstract

Other

Keywords

Other files and links

Fingerprint

Cite this