On efficient on-line grouping of flows with shared bottlenecks at loaded servers

Get BibTex-formatted data

Author

O Younis, S Fahmy

Entry type

proceedings

Abstract

We design an efficient on-line approach, FlowMate, for partitioning flows at a busy server into flow groups that share bottlenecks. These groups are periodically input to congestion coordination, aggregation, load balancing, admission control, or pricing modules. FlowMate uses in-band packet delay measurements to the receivers to determine shared bottlenecks among flows. Packet delay information is piggybacked on returning feedback, or, if impossible, flow (e.g., TCP) round trip time estimates are used. We simulate FlowMate to examine the effect of network load, traffic burstiness, network buffer sizes, and packet drop policies on partitioning correctness. Our results demonstrate accurate partitioning of medium to long-lived flows even under heavy load and self-similar background traffic. Experiments with HTTP/1.1 flows demonstrate difficulties in partitioning bursty foreground traffic. We also study fairness of coordinated congestion management when integrated with FlowMate.

Date

2002 – 11

URL

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1181398

Booktitle

Network Protocols, 2002. Proceedings. 10th IEEE International Conference on

Key alpha

Fahmy

Pages

175-184

Publication Date

2002-11-00

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Proceedings{ Fahmy,
	title = " On efficient on-line grouping of flows with shared bottlenecks at loaded servers",
	author = "O Younis, S Fahmy",
	year = "2002",
	month = "11",
	booktitle = "Network Protocols, 2002. Proceedings. 10th IEEE International Conference on",
	pages = "175-184",
	abstract = "We design an efficient on-line approach, FlowMate, for partitioning flows at a busy server into flow groups that share bottlenecks. These groups are periodically input to congestion coordination, aggregation, load balancing, admission control, or pricing modules. FlowMate uses in-band packet delay measurements to the receivers to determine shared bottlenecks among flows. Packet delay information is piggybacked on returning feedback, or, if impossible, flow (e.g., TCP) round trip time estimates are used. We simulate FlowMate to examine the effect of network load, traffic burstiness, network buffer sizes, and packet drop policies on partitioning correctness. Our results demonstrate accurate partitioning of medium to long-lived flows even under heavy load and self-similar background traffic. Experiments with HTTP/1.1 flows demonstrate difficulties in partitioning bursty foreground traffic. We also study fairness of coordinated congestion management when integrated with FlowMate.",
	url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1181398",
}