Enterprise Europe Network

Establishment, repair and deleting procedure of disjoint multiple paths, redirection of frames and network bridge. Multiple disjoint Paths (MDP)

Country of origin:
Country: 
SPAIN
Opportunity:
External Id: 
TOES20191028002
Published
14/11/2019
Last update
20/11/2019
Expiration date
20/11/2020

Keywords

Partner keyword: 
Data Processing / Data Interchange, Middleware
Data I/O devices
Databases and on-line information services
Database and file management
EXPRESS YOUR INTEREST

Summary

Summary: 
An engineering research group from a Spanish university has developed a procedure that solves in a simple and distributed way, without route calculations, the problem of establishing fast multiple paths between pairs of bridges bordering a network of bridges that route terminals’ traffic connected to them. The cooperation types are license agreements, commercial agreements with technical assistance or collaboration agreements.

Description

Description: 

The invention from the Spanish university engineering group describes mechanisms that sequentially and completely explore a network of transparent bridges to discover and establish multiple bidirectional paths, disjointed in links only or disjointed in nodes and links, between pairs of bridges bordering the network, as well as a network bridge that implements these mechanisms.
The origin frontier bridge sends multicast road establishment packages to the destination bridge, that propagate until reaching the destination bridge, which confirms to the frontier bridge each disjunct road establishment by means of a message from destination to the origin, that leaves identified and established the bidirectional path in each bridge.
The roads are automatically deleted when a certain time passes without confirmation, without being used or when sending the border bridge an explicit delete packet of a road or all roads. The number of created paths is parameterizable and both ends communicate with each other the number of output links available, in order to know the maximum number of disjoint paths feasible.
These multiple disjoint paths created by border bridges can be used by an entity or protocol for load sharing, reliability enhancement or other purposes.
The present technology has a special application for ethernet switches for enterprise networks and data centers.
The group seeks to reach license agreements, commercial agreements with technical assistance or collaboration agreements with companies in the telecommunication sector, for the application of its technology in Ethernet switches for business networks and data centers.

Advantages & innovations

Cooperation plus value: 
- Unlike shortest path bridging, multiple disjoint paths do not require knowledge of the topology or any calculation against the extremely complex SPB (multiple symmetric minimum paths between nodes, to calculate disjoint routes in the network graph). - In MDP (maximum disjoint paths), the selected paths are the fastest of the disjoint ones, so they are chosen according to the load, contrary to Shortest Path Bridging, which calculates them without having the real load in mind. - Unlike the protocols derived from AODV (Ad hoc On-Demand Distance Vector ) and DSR (Dynamic Source Routing), MDP performs the automatic discarding, without an inspection, of the many packages with redundant routes that arrive at the bridges.

Stage of development

Cooperation stage dev stage: 
Under development/lab tested

Partner sought

Cooperation area: 
The group seeks to reach license agreements, commercial agreements with technical assistance or collaboration agreements with companies in the telecommunication sector, for the application of its technology in Ethernet switches for business networks and data centers.

Type and size

Cooperation task: 
SME 11-50,R&D Institution,SME <10,>500 MNE,251-500,SME 51-250,>500