View Item 
  •   e_Buah Home
  • INVESTIGACIÓN
  • Grupos de Investigación
  • Telematics Services Engineering (TSE)
  • AUTOMTSE - Artículos
  • View Item
  • INVESTIGACIÓN
  • Grupos de Investigación
  • Telematics Services Engineering (TSE)
  • AUTOMTSE - Artículos
  • View Item
  • Biblioteca
    • English
    • español
JavaScript is disabled for your browser. Some features of this site may not work without it.

All-Path Bridging: Path Exploration Protocols for Data Center and Campus Networks

Show full item record
RefworksUtilizar EndNote Import
Author
Rojas Sánchez, ElisaUniversity of Alcalá Author; Ibáñez Fernández, Guillermo AgustínUniversity of Alcalá Author; Giménez Guzmán, José ManuelUniversity of Alcalá Author; Carral Pelayo, Juan AntonioUniversity of Alcalá Author; García-Martínez, Alberto; [et al.]
Identifiers
Enlace permanente (URI): http://hdl.handle.net/10017/21144
DOI: doi:10.1016/j.comnet.2015.01.002
Date
2014
Filiación
Universidad de Alcalá. Departamento de Automática
Cita bibliográfica
Elisa Rojas, Guillermo Ibañez, Jose Manuel Gimenez-Guzman, Juan A. Carral, Alberto Garcia-Martinez, Isaias Martinez-Yelmo, Jose Manuel Arco, All-Path bridging: Path exploration protocols for data center and campus networks, Computer Networks, Volume 79, 14 March 2015, Pages 120-132, ISSN 1389-1286.
Palabras clave
Path exploration
Path computation
Routing switches
Shortest path bridges
All-Path
Tipo de documento
info:eu-repo/semantics/article
Versión
info:eu-repo/semantics/acceptedVersion
Derechos de acceso
info:eu-repo/semantics/openAccess
Share
 
Abstract
Today, link-state routing protocols that compute multiple shortest paths predominate in data center and campus networks, where routing is performed either in layer three or in layer two using link-state routing protocols. But current proposals based on link-state routing do not adapt well to real time traffic variations and become very complex when attempting to balance the traffic load. We propose All-Path bridging, an evolution of the classical transparent bridging that forwards frames over shortest paths using the complete network topology, which overcomes the limitations of the spanning tree protocol. All-Path is a new frame routing paradigm based on the simultaneous exploration of all paths of the real network by a broadcast probe frame, instead of computing routes on the network graph. This paper presents All- Path switches and their differences with standard switches and describes ARP-Path protocol in detail, its path recovery mechanisms and compatibility with IEEE 802.1 standard bridges. ARP-Path is the first protocol variant of the All-Path protocol family. ARP-Path reuses the standard ARP Request and Reply packets to explore reactively the network and find the fastest path between two hosts. We compare its performance in terms of latency and load distribution with link-state shortest-path routing bridges, showing that ARP-Path distributes the load more evenly and provides lower latencies. Implementations on different platforms prove the robustness of the protocol. The conclusion is that All-Path bridging offer a simple, resilient and scalable alternative to path computation protocols.
Files in this item
FilesSizeFormat
View
14 Comnet Rojas14_Revised2.pdf1.804MbPDF
FilesSizeFormat
View
14 Comnet Rojas14_Revised2.pdf1.804MbPDF
Collections
  • AUTOMTSE - Artículos [38]

Contact Us | Send Feedback | About DSpace
¡CSS Válido!@mire NV
¡CSS Válido!@mire NV
 

 

Browse

All of e_BuahCommunities y CollectionsIssue DateAuthorsTitlesSubjectsIn this CollectionIssue DateAuthorsTitlesSubjects

My Account

My e_BuahCreate account

Help

What is e-Buah?Guide e_BuahGuide autoarchiveFAQContact us

Statistics

View Usage Statistics

Information

Open access. Open ScienceOpen access PolicyPublishing permissionsCopyrightResearch datae-cienciaDatos RepositoryPlan de Gestión de Datos

Los contenidos se difunden en


Contact Us | Send Feedback | About DSpace
¡CSS Válido!@mire NV
¡CSS Válido!@mire NV