Verification mechanism for network service chain paths
US10637772B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 28, 2016 |
| Grant date | Apr 28, 2020 |
| Priority date | — |
| Expiry date | Feb 25, 2037 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/306
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Data packets passing from a source to a destination in a network according to a Service Function Chain (SFC) are processed by an ordered sequence of at least one service function (SF). For each SF in the SFC in order, a current value of a function, such as a hash function, is recursively computed including, as input values, at least current identifying data that identifies a corresponding current one of the SFs, and a value of the function output from an immediately preceding SF. After computing the current value of the function for a selected SF in the SFC, the current value of the function is compared with an expected value. If the value of the function for the selected SF is the same as the expected value, the data packet is allowed to be transmitted to a subsequent processing stage; if not, then an error response action is taken.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.