Downloads: 120 | Views: 193
Survey Paper | Computer Science & Engineering | India | Volume 5 Issue 11, November 2016
A Cumulative Study for Path Isoloation of Network Data
Ankita Shirbhate | Sarita Patil [2]
Abstract: As the resource competition and conflicts in datacenter networks (DCNs) are frequent and in large extent now a days, this becomes the reason behind the evolution of our concept. On the shared transmission paths, when mixing elephant and mice flows, the different factors taken into consideration are as the latency, throughput and performance degradation. A new flow scheduling scheme is proposed here, Freeway, this advances similar to the path diversity in the DCN topology is carried out simultaneously, like the mice flow completion before the due time and high network utilization of it. Thus this will adjust these two types of paths according to the real-time traffic. The partitioning is done efficiently by Freeway, into low latency and high throughput paths and the different transmission services for each category are provided accordingly. Also thus various flow type-specific scheduling and forwarding methods are used to make full utilization of the corresponding bandwidth.
Keywords: Data center network, path partitioning, ow scheduling
Edition: Volume 5 Issue 11, November 2016,
Pages: 592 - 595