Cisco Technology, Inc.

Tutogen Medical Gmbh

Steven Edward Moore

James L Ng

Alvaro E Retana

Jennifer Faleris

Jake Michaelson

Silke Schreiner

Arnd Wilhelmi

Yi Yang

Anne Reinlein

Russell Ivan White

Donnie Van Savage

Heidi H Ou

Steven Vincent Luong

Thuan Van Tran

Timothy M Gage

Donald Earl Slice, Jr

Gerald Redwine

Kevin M Eckhardt

Scott R Sturgess

The present application is directed to the field of implants comprising soft tissue for use in implantation in humans. The soft tissue implants of the present application are preferably obtained from xenograft sources. The present application provides a chemical process that sterilizes, removes antigens from and/or strengthens xenograft implants. The present techniques yield soft tissue implants having superior structural, mechanical, and/or biochemical integrity. The present application is also directed to processes for treating xenograft implants comprising soft tissues such as dermis, and to implants produced by such processes.

Xenograft soft tissue implants and methods of making

Present disclosure relates to methods for preparing BGP update messages for transmission and processing received update messages. The methods are based on grouping path attributes common to a plurality of IP address prefixes into respective sets identified with respective set identifiers and, instead of duplicating path attributes in each BGP update message, including a respective identifier referring to a certain set of path attributes provided in an earlier BGP update message when sending subsequent update messages. Grouping of path attributes into individual sets associated with respective identifiers provides significant advantages by enabling re-use of the results of previous processing on both the sending and receiving sides associated with transmission of BGP update messages. In addition, such an approach limits the amount of information transmitted in the control plane because duplicate sets of path attributes may only be transmitted once and merely be referred to in subsequent update messages.

Attribute SET_ID in border gateway protocol

[object Object]

In an example embodiment, a method and system is provided to determine and advertise a route advertisement in a reactive routing environment. In response to receiving a network address query with respect to a destination address at a routing device, an aggregate value, e.g. an address prefix, is determined and advertised in reply to the network address query. Determining of the aggregate value may comprise identifying within a range of network addresses represented by the aggregate value respective addresses for which the routing device does not have reachability information. The routing device may send address queries with respect to the identified addresses, to determine reachability via the routing device of those addresses. The aggregate value may be advertised conditional upon determining that a percentage of addresses within the corresponding range that can be reached via the routing device satisfies a predefined minimal coverage value.

Determining a route advertisement in a reactive routing environment

A system and method for facilitating connecting a switch to a network to improve network performance. In an illustrative embodiment, the system includes a first module for determining when the switch is initially connected to a network and providing a signal in response thereto. A second module selectively forms adjacencies with peers of the switch in response to the signal and based on one or more predetermined parameters. In a more specific embodiment, the switch is a router or Layer-3 (L3) switch. The one or more predetermined parameters include a load factor, values pertaining to capabilities of a processor included in the router, bandwidth capabilities of the interface and/or the router, internal router queue counts, and so on. The router employs a routing protocol such as Enhanced Interior Gateway Routing Protocol (EIGRP). The second module throttles and adjacency-formation rate based on the predetermined parameters.

System and method for enhancing network stability by selectively controlling adjacency formation

Methods and apparatus for allowing a traffic level switch associated with an automatic protection switching (APS) topology to occur transparently and without reconverging routing are described. According to one aspect of the present invention, a method for providing protection switching configuration information associated with a router arrangement to includes identifying a first interface and a second interface of the router arrangement as an APS group. The method also includes providing information regarding the APS group to a process that implements a routing protocol. Providing the information regarding the group includes identifying the first interface as a primary interface and identifying the second interface as a backup interface that is arranged to protect the primary interface.

Transparent automatic protection switching for a chassis deployment

In an example embodiment, a method is provided. In this method, a network address query is received. A first network address of a known apparatus is retrieved from a routing table, in response to the network address query. A second network address may be determined based upon the network address query, the second network address having a smaller bit length than the first network address. An aggregate value may be advertised that represents a range of reachable network addresses, the range of reachable network addresses including the second network address.

Determining an optimal route advertisement in a reactive routing environment

Disclosed are methods and apparatus for flooding link state packets or packet data units (LSP's) from a first node to one other LSP receiving node, where the LSP's are flooded in an order that is related to relative costs of various paths emanating from the first node. That is, the first node sends its own LSP first since the first node has no cost relative to itself. The first node then sends other LSP's that are associated with a plurality of other LSP sending nodes that have previously flooded their LSP's to the first node. These other LSP's are sent by the first node to the other LSP receiving node in an order related to the relative costs associated with the paths from the first node to each of the other LSP sending nodes which had previously sent the other LSP's to the first node.

Method and apparatus for flooding link state packets to achieve faster convergence

Disclosed are methods and apparatus for flooding link state packets or packet data units (LSP's) from a first node to one other LSP receiving node, where the LSP's are flooded in an order that is related to relative costs of various paths emanating from the first node. That is, the first node sends its own LSP first since the first node has no cost relative to itself. The first node then sends other LSP's that are associated with a plurality of other LSP sending nodes that have previously flooded their LSP's to the first node, and these other LSP's are sent by the first node to the other LSP receiving node in an order related to the relative costs associated with the paths from the first node to each of the other LSP sending nodes which had previously sent the other LSP's to the first node.

Growing community of inventors

Holly Springs, NC, United States of America

Steven Edward Moore