Compressing singly linked lists sharing common nodes for multi-destination group expansion
US9369293B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | May 15, 2013 |
| Grant date | Jun 14, 2016 |
| Priority date | — |
| Expiry date | Sep 15, 2033 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/16
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A multi-destination expansion table is stored that comprises a first database containing data representing all nodes in a singly linked list that is a superset of nodes for a plurality of multi-destination groups and a second database storing data representing multi-destination group specific arcs across one or more nodes. The singly linked list is traversed to determine how to replicate a packet for a particular multi-destination group. The packet is replicated based on interface data stored in the first database associated with the current node address. When a match is found in the second database, a next node address is determined from the second database. When a match is not found in the second database, a next node address determined from accessing the first database. Traversing of the singly linked list is terminated when the next node address is determined to be invalid or null.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.