Bicasting using non-congruent paths in a loop-free routing topology having routing arcs
US9794167B2 · kind B2 · utility
Inventors
Key dates
| Filing date | Jun 30, 2015 |
| Grant date | Oct 17, 2017 |
| Priority date | — |
| Expiry date | Jun 30, 2035 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/24
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.