Abstract
Based on the transformation of the fat-tree structure, the problem of allocating servers in hierarchical data center networks can be formulated as an integer programming problem. The objective is to maximize resource efficiency and to minimize reallocation cost while satisfying the topology constraints even when some n-star allocations are reallocated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
G.L. Nemhauser, L.A. Wolsey, Integer and combinatorial optimization, John Wiley & Sons, New York, (1988)
J.E. Hopcroft, R.M. Karp, An n5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comp. 2(4), 225–231, (1973)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 The Author(s)
About this chapter
Cite this chapter
Tsai, L., Liao, W. (2016). Allocation of Servers. In: Virtualized Cloud Data Center Networks: Issues in Resource Management.. SpringerBriefs in Electrical and Computer Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-32632-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-32632-0_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-32630-6
Online ISBN: 978-3-319-32632-0
eBook Packages: EngineeringEngineering (R0)