Reducing batch completion time in a computer network with max-min fairness

作者: Amin Vahdat , Abdul Kabbani

DOI:

关键词: Path (graph theory)Max-min fairnessComputer networkPercentileCompletion timeRouting (electronic design automation)Computer scienceThroughput (business)Process (computing)

摘要: The present disclosure describes a system and method for reducing total batch completion time using max-min fairness process. In some implementations, the process described herein reduces by collectively routing batches in way that targets providing same effective path capacity across all requests. More particularly, given network shared of flows, throughput is increased with (and therefore decreased) if n th percentile fastest flow cannot increase its without decreasing another whose not greater than first batch.

参考文章(9)
Praveen Yalagandula, Jeffrey C. Mogul, Yoshio Turner, Lucian Popa, Jose Renato G. Santos, Sujata Banerjee, Bandwidth Guarantee and Work Conservation ,(2012)
Marcos Novaes, James Robert Harold Challenger, Topology aware grid services scheduler architecture ,(2008)
Guido Desie, Luc Vanmaele, Geert Deroover, Method to improve the quality of dispersion formulations ,(2005)
Guohan Lv, Chuanxiong Guo, Jiahe Helen Wang, Shuang Yang, Virtual Data Center Allocation with Bandwidth Guarantees ,(2010)
Alan Shieh, Srikanth Kandula, Changhoon Kim, Albert Greenberg, Performance isolation for clouds ,(2011)