Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks

I Stoica, S Shenker, H Zhang - IEEE/ACM Transactions on …, 2003 - ieeexplore.ieee.org
Router mechanisms designed to achieve fair bandwidth allocations, such as fair queueing,
have many desirable properties for congestion control in the Internet. However, such …

Cloud computing system management under flat rate pricing

CF Li - Journal of network and systems management, 2011 - Springer
Success of cloud computing service depends on an acceptable pricing mechanism both by
users and the service provider. Piece rate pricing by counting work load should be favorable …

MediaPlayer™ versus RealPlayer™: a comparison of network turbulence

M Li, M Claypool, R Kinicki - Proceedings of the 2nd ACM SIGCOMM …, 2002 - dl.acm.org
The performance of currently available streaming media products will play an important role
in the network impact of streaming media. However, there are few empirical studies that …

User fair queuing: fair allocation of bandwidth for users

A Banchs - Proceedings. Twenty-First Annual Joint Conference …, 2002 - ieeexplore.ieee.org
User fairness aims at fairly distributing the network resources among users, where a user is
an entity that can possibly send different flows through different paths. In this paper we first …

Core-stateless guaranteed throughput networks

J Kaur, HM Vin - IEEE INFOCOM 2003. Twenty-second Annual …, 2003 - ieeexplore.ieee.org
End-to-end throughput guarantee is an important service semantics that network providers
would like to offer to their customers. A network provider can offer such service semantics by …

一种改进的核心无状态公平带宽分配机制

关冬亮, 余松煜 - 上海交通大学学报, 2004 - cqvip.com
CSFQ (Core Stateless Fair Queue) 算法在无状态网实现了如同有状态网那样好的公平带宽
分配, 但它的丢包算法是针对UDP 流等非响应流导出的, 不适用于TCP 流. 本文针对TCP …

对我国0~ 8 岁儿童发展与教育纵向研究的回顾与展望

贺琳霞, 朱文佳, 郭力平 - 教育探索, 2011 - cqvip.com
通过对中国0~ 8 岁儿童发展与教育纵向研究的分析发现, 已有研究在数量上有所增长,
在质量上有显著提高, 但仍存在研究主题缺乏全面性和系统性, 缺乏跨机构的合作研究 …

Using latency quantiles to engineer qos guarantees for web services

U Fiedler, B Plattner - Quality of Service—IWQoS 2003: 11th International …, 2003 - Springer
Simulations with web traffic usually generate input by sampling a heavy-tailed object size
distribution. As a consequence these simulations remain in transient state over all periods of …

A control-theoretical approach for achieving fair bandwidth allocations in core-stateless networks

HT Ngin, CK Tham - Computer Networks, 2002 - Elsevier
In this paper, we propose the use of a control theoretical approach in the design of fair
queueing algorithms based on the scalable core (SCORE)/dynamic packet state (DPS) …

Fair allocation using a fast smart market auction

CF Li, JS Li - European journal of operational research, 2006 - Elsevier
Allocation of network resources may be formulated as an optimization problem seeking to
maximize the sum of the utility function of each flow. Individual flows collectively achieve …