• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

DMCA

The Impact of False Sharing on Shared Congestion Management (2001)

Cached

  • Download as a PDF

Download Links

  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [pages.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [cs.wisc.edu]
  • [www.cs.cmu.edu]
  • [www.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [inat.lcs.mit.edu]
  • [nms.lcs.mit.edu]
  • [nms.csail.mit.edu]
  • [wind.lcs.mit.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.ieee-icnp.org]
  • [pages.cs.wisc.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Aditya Akella , Srinivasan Seshan , Hari Balakrishnan
Citations:21 - 3 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Akella01theimpact,
    author = {Aditya Akella and Srinivasan Seshan and Hari Balakrishnan},
    title = {The Impact of False Sharing on Shared Congestion Management},
    institution = {},
    year = {2001}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

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 in fact 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 markedly easier to detect and react to false sharing than it is to start by isolating flows and merge their congestion state afterward. 1.

Keyphrases

false sharing    shared congestion management    congestion state    destination address    end-systems overlook    flow classifier    congestion information    qos enhancement    differentiated service    concurrent flow    distinct case    different flow    extreme false sharing    important problem    different queue    robust detector    several recent proposal    loss pattern    path diversity    persistent overload    congestion state afterward    window-based congestion control    flow performance   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University