Network planning for disaster recovery
暂无分享,去创建一个
Andrea Bianco | Fabio Neri | Luca Giraudo | Jorge M. Finochietto | Marco Modesti | A. Bianco | F. Neri | J. Finochietto | Luca Giraudo | Marco Modesti
[1] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[2] Christoph M. Gauger,et al. Modeling and performance evaluation of ISCSI storage area networks. , 2005 .
[3] H. W. Kuhn B R Y N Mawr College. Variants of the Hungarian Method for Assignment Problems' , 1955 .
[4] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[5] Randy H. Katz,et al. A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.
[6] H. W. Kuhn,et al. Variants of the hungarian method for assignment problems , 1956 .
[7] H KatzRandy,et al. A case for redundant arrays of inexpensive disks (RAID) , 1988 .
[8] D. R. Fulkerson,et al. A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.
[9] A. Bianco,et al. Distributed storage on networks of Linux PCs using the iSCSI protocol , 2008, 2008 International Conference on High Performance Switching and Routing.
[10] Bo Chen,et al. Scheduling on identical machines: How good is LPT in an on-line setting? , 1997, Oper. Res. Lett..
[11] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .