Analysis, modeling and generation of self-similar VBR video traffic
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
An integrated congestion management architecture for Internet hosts
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Detecting shared congestion of flows via end-to-end measurement
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
A web server's view of the transport layer
ACM SIGCOMM Computer Communication Review
ACM SIGCOMM Computer Communication Review
Traffic model and performance evaluation of Web servers
Performance Evaluation
Passive network tomography using Bayesian inference
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Robust identification of shared losses using end-to-end unicast probes
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
The War between Mice and Elephants
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
The Impact of False Sharing on Shared Congestion Management
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
An integrated experimental environment for distributed systems and networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
A wavelet-based approach to detect shared congestion
IEEE/ACM Transactions on Networking (TON)
Estimating topological distances based on end-to-end path sharing
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
TCP slow start with fair share of bandwidth
Computer Networks: The International Journal of Computer and Telecommunications Networking
CCIPCA-OPCSC: An online method for detecting shared congestion paths
Computer Networks: The International Journal of Computer and Telecommunications Networking
An architecture for component-based design of representative-based clustering algorithms
Data & Knowledge Engineering
| Hi-index | 0.00 |
We design and implement an efficient on-line approach, FlowMate, for clustering flows (connections) emanating from a busy server, according to shared bottlenecks. Clusters can be periodically input to load balancing, congestion coordination, aggregation, admission control, or pricing modules. FlowMate uses in-band (passive) end-to-end delay measurements to infer shared bottlenecks. Delay information is piggybacked on feedback from the receivers, or, if impossible, TCP or application round-trip time estimates are used. We simulate FlowMate and examine the effects of network load, traffic burstiness, network buffer sizes, and packet drop policies on clustering correctness, evaluated via a novel accuracy metric. We find that coordinated congestion management techniques are more fair when integrated with Flow-Mate. We also implement FlowMate in the Linux kernel v2.4.17 and evaluate its performance on the Emulab testbed, using both synthetic and tcplib-generated traffic. Our results demonstrate that clustering of medium to long-lived flows is accurate, even with bursty background traffic. Finally, we validate our results on the Internet Planetlab testbed.