作者: Amin Vahdat , Abdul Kabbani
DOI:
关键词: Path (graph theory) 、 Max-min fairness 、 Computer network 、 Percentile 、 Completion time 、 Routing (electronic design automation) 、 Computer science 、 Throughput (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.