A wavelet-based approach to detect shared congestion
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
FlowMate: scalable on-line flow clustering
IEEE/ACM Transactions on Networking (TON)
Throughput models for SCTP with parallel subflows
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of first ACM/IEEE international workshop on Mobility in the evolving internet architecture
Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths
IEEE/ACM Transactions on Networking (TON)
A wavelet-based approach to detect shared congestion
IEEE/ACM Transactions on Networking (TON)
Performance evaluation of subflow capable SCTP
Computer Communications
CCIPCA-OPCSC: An online method for detecting shared congestion paths
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Several recent proposals for sharing congestion information across concurrent flows between end-systems overlook an important problem: two or more flows sharing congestion state may infact not share the same bottleneck. In this paper, we categorize the origins of this false sharing into two distinct cases: (i) networks with QoS enhancements such as differentiated services, where a flow classifier segregates flows into different queues, and (ii) networks with path diversity where different flows to the same destination address are routed differently. We evaluate the impact of false sharing on flow performance and investigate how false sharing can be detected by a sender. We discuss how a sender must respond upon detecting false sharing. Our results show that persistent overload can be avoided with window-based congestion control even for extreme false sharing, but higher bandwidth flows run at a slower rate. We find that delay and reordering statistics can be used to develop robust detectors of false sharing and are superior to those based on loss patterns. We also find that it is markedlyeasier to detect and react to false sharing than it is to start by isolating flows and merge their congestion state afterward.