Netshare and stochastic netshare
Authors:
Open Access
- 26 June 2012
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 42 (3) , 5-11
Abstract
Application performance in cloud data centers often depends crucially on network bandwidth, not just the aggregate data transmitted as in typical SLAs. We describe a mechanism for data center networks called NetShare that requires no hardware changes to routers but allows bandwidth to be allocated predictably across services based on weights. The weights are either specified by a manager, or automatically assigned at each switch port based on a virtual machine heuristic for isolation. Bandwidth unused by a service is shared proportionately by other services, providing weighted hierarchical max-min fair sharing. On a testbed of Fulcrum switches, we demonstrate that NetShare provides bandwidth isolation in various settings, including multipath networks.Keywords
This publication has 8 references indexed in Scilit:
- Towards predictable datacenter networks2011
- SecondNet2010
- VL22009
- Approximate fair bandwidth allocation: A method for simple and flexible traffic management2008
- Stochastic fairness queueing2002
- Efficient fair queueing using deficit round robin1995
- Link-sharing and resource management models for packet networksIEEE/ACM Transactions on Networking, 1995
- Round-robin scheduling for max-min fairness in data networksIEEE Journal on Selected Areas in Communications, 1991