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

e-Archivo Repository

Show simple item record

dc.contributor.author Ibáñez, Guillermo
dc.contributor.author Rojas, Elisa
dc.date.accessioned 2015-02-12T12:59:40Z
dc.date.available 2015-02-12T12:59:40Z
dc.date.issued 2013-06
dc.identifier.bibliographicCitation IIEEE International Conference on Comunications (2013) pp. 1280-1285
dc.identifier.uri http://hdl.handle.net/10016/20041
dc.description This 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.
dc.description.abstract Link-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 distribution
dc.description.sponsorship This work was supported in part by grants from Comunidad de Madrid through Project MEDIANET-CM (S-2009/TIC-1468) .
dc.format.extent 6
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher IEEE
dc.rights © 2013. IEEE
dc.subject.other Routing
dc.subject.other Bridges
dc.subject.other Protocols
dc.subject.other Ethernet
dc.title All-path bridging: Path exploration as an efficient alternative to path computation in bridging standards
dc.type conferenceObject
dc.description.status Publicado
dc.relation.publisherversion http://dx.doi.org/10.1109/ICCW.2013.6649434
dc.subject.eciencia Telecomunicaciones
dc.identifier.doi 10.1109/ICCW.2013.6649434
dc.rights.accessRights openAccess
dc.relation.projectID Comunidad de Madrid. S2009/TIC-1468/MEDIANET
dc.type.version acceptedVersion
dc.relation.eventdate 2013-Jun -09-13
dc.relation.eventplace Budapest (Hungría)
dc.relation.eventtitle EEE International Conference on Communications: Second Workshop on Telecommunication Standards: From Research to Standards.
dc.relation.eventtype proceeding
dc.identifier.publicationfirstpage 1280
dc.identifier.publicationlastpage 1285
dc.identifier.publicationtitle IEEE International Conference on
dc.identifier.uxxi CC/0000022350
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)


This item appears in the following Collection(s)

Show simple item record