Invention Grant
US09369293B2 Compressing singly linked lists sharing common nodes for multi-destination group expansion
有权
压缩单个链接列表,共享多目标组扩展的公共节点
- Patent Title: Compressing singly linked lists sharing common nodes for multi-destination group expansion
- Patent Title (中): 压缩单个链接列表,共享多目标组扩展的公共节点
-
Application No.: US13894484Application Date: 2013-05-15
-
Publication No.: US09369293B2Publication Date: 2016-06-14
- Inventor: Mingzhe Li
- Applicant: Cisco Technology, Inc.
- Applicant Address: US CA San Jose
- Assignee: Cisco Technology, Inc.
- Current Assignee: Cisco Technology, Inc.
- Current Assignee Address: US CA San Jose
- Agency: Edell, Shapiro & Finnan, LLC
- Main IPC: H04L12/18
- IPC: H04L12/18 ; G06F3/0484 ; G06T11/60 ; H04L12/931 ; H04L12/761

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.
Public/Granted literature
- US20140071988A1 Compressing Singly Linked Lists Sharing Common Nodes for Multi-Destination Group Expansion Public/Granted day:2014-03-13
Information query