Load distribution using ARP-Path route discovery in real-time Ethernet networks

Today Ethernet networks need some requirements like low latency, scalability, load distribution, compatibility with existing protocol layering and topology independence. Link state routing protocols do not do not adapt well to real-time traffic variations and become complex when attempting to balance the traffic load. We propose ARP-Path bridges, which uses the standard Ethernet frame format, is fully transparent to hosts and does not need spanning tree or link state protocols. This proposed protocol is a new frame-routing paradigm based on the simultaneous exploration of all paths of the network in real-time by a broadcast frame, instead of computing routes on the network graph. These ARP-base Ethernet switches use the replicas of a standard ARP request packet flooded over all links, to discover the path with minimum latency to the destination host. Simulation results compare its performance in terms of response time and load distribution with link state shortest-path bridges, showing that ARP- path distributes the load more evenly. achieving much lower network latency.

کلیدواژه ها:

Quality of Service ، ARP-Path Bridging ، Real time Ethernet ، Path discovery ، Path calculation