Publication:
All-path bridging: Path exploration as an efficient alternative to path computation in bridging standards

Simple item page
dc.affiliation.dptoUC3M. Departamento de Ingeniería Telemáticaes
dc.affiliation.grupoinvUC3M. Grupo de Investigación: Network Technologieses
dc.contributor.authorIbáñez Fernández, Guillermo Agustín
dc.contributor.authorRojas, Elisa
dc.date.accessioned2015-02-12T12:59:40Z
dc.date.available2015-02-12T12:59:40Z
dc.date.issued2013-06
dc.descriptionThis work is at: IEEE International Conference on Communications: Second Workshop on Telecommunication Standards: From Research to Standards. In Communications Workshops (ICC). Date 9-13 June 2013, Budapest, Hungary.en
dc.description.abstractLink-state based routing protocols are dominant in Shortest Path Bridges (IEEE 802.1aq) and also at TRILL (IETF) Rbridges. Both standards propose a hybrid of switch and router adding a link state routing protocol in layer two that computes shortest paths between bridges. Surprisingly, path exploration mechanisms have not yet been considered at standardization bodies, in spite of some outstanding advantages: simplicity,instantaneous path adaptation to traffic load with load adaptive routing and low latency. We have developed All-path, a family of protocols based on simple path exploration mechanisms based on full flooding of a single frame, as an alternative to the "beatentrail" of path computation. Path exploration (either instantaneous or periodical, proactive or reactive) is an efficient alternative to path computation for bridged networks because the processing cost of address learning at bridges from broad cast frames is very low and Ethernet links provide very high link capacity so that the extra packet broad casts do not impact load significantly. Standardization groups should consider the application of path exploration (instantaneous or periodical, proactive or reactive) mechanisms in Audio Video Bridges and ingeneric bridging networks like campus and data centers to find redundant paths, low latency and load distributionen
dc.description.sponsorshipThis work was supported in part by grants from Comunidad de Madrid through Project MEDIANET-CM (S-2009/TIC-1468) .en
dc.description.statusPublicado
dc.format.extent6
dc.format.mimetypeapplication/pdf
dc.identifier.bibliographicCitationIIEEE International Conference on Comunications (2013) pp. 1280-1285en
dc.identifier.doi10.1109/ICCW.2013.6649434
dc.identifier.publicationfirstpage1280
dc.identifier.publicationlastpage1285
dc.identifier.publicationtitleIEEE International Conference onen
dc.identifier.urihttps://hdl.handle.net/10016/20041
dc.identifier.uxxiCC/0000022350
dc.language.isoeng
dc.publisherIEEEen
dc.relation.eventdate2013-Jun -09-13es
dc.relation.eventplaceBudapest (Hungría)es
dc.relation.eventtitleEEE International Conference on Communications: Second Workshop on Telecommunication Standards: From Research to Standards.es
dc.relation.projectIDComunidad de Madrid. S2009/TIC-1468/MEDIANETes
dc.relation.publisherversionhttp://dx.doi.org/10.1109/ICCW.2013.6649434
dc.rights© 2013. IEEEen
dc.rights.accessRightsopen access
dc.subject.ecienciaTelecomunicacioneses
dc.subject.otherRoutingen
dc.subject.otherBridgesen
dc.subject.otherProtocolsen
dc.subject.otherEtherneten
dc.titleAll-path bridging: Path exploration as an efficient alternative to path computation in bridging standardsen
dc.typeconference proceedings*
dc.type.hasVersionAM*
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
allpath_ICCC_2013_ps.pdf
Size:
1.26 MB
Format:
Adobe Portable Document Format
Download
Collections
DIT - RYSC - Comunicaciones en Conferencias Internacionales / International Conferences