Show simple item record

dc.contributor.authorIbáñez Fernández, Guillermo Agustín 
dc.contributor.authorCarral Pelayo, Juan Antonio 
dc.contributor.authorRojas Sánchez, Elisa 
dc.contributor.authorGiménez Guzmán, José Manuel
dc.description.abstractRP-Path is a simple, low latency, shortest path bridging protocol for campus, enterprise and data center networks. We recently found that this protocol natively distributes the traffic load in networks having redundant paths of similar characteristics. The reason is that every new path between hosts is selected on-demand in a race among ARP Request packet replicas over all available paths: the first arriving replica gets its path selected on the fly. This means a continuous adaptation of new paths to variations on the load at links and bridges. To show this unique load distribution capability and path diversity property we use a number of simulations for complex scenarios, including two different simulators: one flow- based and one packet-based, and two basic topologies: data center and a regular mesh. We also verify this behavior on real hardware on a network of nine ARP-Path NetFPGA switches. The conclusion is that the ARP-Path protocol efficiently distributes traffic via alternative paths at all load levels, provided that multiple paths of similar propagation delays are availableen
dc.publisherCommunications (ICC), 2013 IEEE International Conference on , vol., no., pp.3769,3774, 9-13 June 2013 doi: 10.1109/ICC.2013.6655142en
dc.subjectEthernet, Routing bridges, Spanning Tree, Load Distributionen
dc.titleEvaluating Native Load Distribution of ARP- Path Bridging Protocol in Mesh and Data Centeren
dc.subject.ecienciaCIENCIAS TECNOLÓGICASes_ES
dc.contributor.affiliationUniversidad de Alcalá. Departamento de Automáticaes_ES
dc.relation.projectIDS-2009/TIC-1468/MEDIANET (Comunidad de Madrid)es_ES

Files in this item


This item appears in the following Collection(s)