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

Hongnan Liu

dblp:126/0825 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-5710-8624ORCID · corroborated

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 · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › quality of service
bandwidth guarantee
0.112012
Towards bandwidth guarantee in multi-tenancy cloud computing networks · ICNP 2012
Cloud and datacenter computing › resource provisioning
virtual machine provisioning
0.012012
Towards bandwidth guarantee in multi-tenancy cloud computing networks · ICNP 2012

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

online allocation algorithm · 0.1
YearPublicationVenuePosition
2020 Managing Multicast Membership for Software Defined Data Center Network
abstract
In this paper we design DCMA, a novel multicast membership management scheme for data center networks. Unlike traditional protocols like IGMP/MLD, DCMA leverages the characteristics of data center multicast application and the emerging software defined networking (SDN) technique to manage multicast members in an easier and better way. Multicast application master delivers the membership to the SDN controller, and the SDN controller assigns the group addresses in a coordinated way to minimize the forwarding table size in switches. In particular, by formulating the multicast group address allocation problem and capturing the relationship among forwarding entries in different switches, we design both a batch algorithm and an incremental algorithm to allocate the multicast group addresses. Evaluations based on real-world traces show that, DCMA can save almost half multicast forwarding entries in switches compared with random multicast address allocation.
Dan Li 0001, Jing Zhu 0007, Hongnan Liu, Kai Chen 0005
VTC Fall4
2012 Towards bandwidth guarantee in multi-tenancy cloud computing networks
abstract
To efficiently utilize their infrastructure and thus increase their revenue, cloud providers need mechanisms to provide resource allocation and performance isolation for different tenants in the shared platform. In particular, network bandwidth sharing is a critical yet still an open problem to most cloud providers. In this paper, we study the problem of virtual machine (VM) allocation under the consideration of providing bandwidth guarantees. We first propose an online allocation algorithm for tenants with homogeneous bandwidth demand, which improves on the accuracy of existing algorithms. Subsequently, we extend it to handle heterogeneous bandwidth demand. Extensive simulations show that our algorithm makes much more efficient utilization of the network resource than existing algorithms, and performs close to the optimal offline allocation.
Jing Zhu 0007, Dan Li 0001, Hongnan Liu
ICNP4