Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yingnan Lian

dblp:141/1952 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 67% Storage systems · 33%
Computer networks
1 paper
Network optimization and economics · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › resource allocation
bandwidth allocation
0.212013
Falloc: Fair network bandwidth allocation in IaaS datacenters via a bargaining game approach · ICNP 2013
Cloud and datacenter computing
datacenter network
0.212013
Falloc: Fair network bandwidth allocation in IaaS datacenters via a bargaining game approach · ICNP 2013
Storage systems
fair bandwidth allocation
0.212013
Falloc: Fair network bandwidth allocation in IaaS datacenters via a bargaining game approach · ICNP 2013
Network optimization and economics › game theory › cooperative game theory
bargaining game
0.012013
Falloc: Fair network bandwidth allocation in IaaS datacenters via a bargaining game approach · ICNP 2013

Methods — techniques the papers use, named apart from their topics

openflow · 0.3nash bargaining solution · 0.3
YearPublicationVenuePosition
2013 Falloc: Fair network bandwidth allocation in IaaS datacenters via a bargaining game approach
abstract
With wide application of virtualization technology, tenants are able to access isolated cloud services by renting the shared resources in datacenters. Unlike resources such as CPU and memory, datacenter network, which relies on traditional transport-layer protocols, suffers unfairness due to a lack of VM-level network isolation. In this paper, we propose Falloc, a new bandwidth allocation protocol, towards VM-based fairness across the datacenter with two main objectives: (i) guarantee bandwidth for VMs based on their base bandwidth requirements, and (ii) share residual bandwidth in proportion to weights of VMs. To design Falloc, we model the datacenter bandwidth allocation as a bargaining game and propose a distributed algorithm to achieve the asymmetric Nash bargaining solution (NBS). We apply the theory to practice by implementing Falloc with OpenFlow in experiments under diversed scenarios, which shows that Falloc can achieve fairness by adapting to different network requirements of VMs, and balance the tradeoff between bandwidth guarantee and proportional bandwidth share. By carrying out large scale trace-driven simulations using real-world Mapreduce workload, we show that Falloc achieves high utilization and maintains fairness among VMs in datacenters.
Fangming Liu, Haowen Tang, Yingnan Lian, Hai Jin 0001, John C. S. Lui
ICNP4