Patents by Inventor Donald Slice

Donald Slice has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7583672
    Abstract: A static neighbor configured network device is configured with a static neighbor feature including a static neighbor list of network devices. The static neighbor configured network device is in a network segment that includes a dynamically configured network device. The static neighbor configured network device receives a multicast packet from the dynamically configured network device. It is determined if the dynamically configured network device is included in the static neighbor list of the static neighbor configured network device. The multicast packet is accepted if the dynamically configured network device is found in the neighbor list for the static neighbor configured network device. Also, adjacency for the static neighbor configured network device is not lost with any other currently adjacent network devices when the multicast packet is received.
    Type: Grant
    Filed: April 5, 2006
    Date of Patent: September 1, 2009
    Assignee: Cisco Technology, Inc.
    Inventors: Yi Yang, Thuan Van Tran, Donnie Van Savage, Donald Slice, James Ng, Alvaro Retana
  • Patent number: 7512106
    Abstract: Techniques for sending routing data include sending first routing data in a first multicast packet to a number N of adjacent nodes. It is determined whether different routing data is ready to be sent in a different multicast packet. If so, then a number M of adjacent nodes from which acknowledgment messages have been received, and whether M exceeds a threshold, is determined. If so, then a Conditional-Receive (CR) method is invoked in which a multicast message is sent which identifies each of a number L=N?M of laggard adjacent nodes. The laggard adjacent nodes are thus notified to ignore the different multicast packet. If it is determined that M does not exceed the threshold, then additional acknowledgement messages are received while waiting until M does exceed the threshold before the CR method is invoked. The threshold is greater than or equal to 1.
    Type: Grant
    Filed: August 1, 2006
    Date of Patent: March 31, 2009
    Assignee: Cisco Technology, Inc.
    Inventors: Thuan Van Tran, Donnie Van Savage, Donald Slice
  • Patent number: 7388862
    Abstract: A technique efficiently notifies EIGRP neighbors when destroying adjacencies in a computer network. A goodbye notification packet is provided that enables an EIGRP router to inform one or more of its neighbors of its intention to destroy their existing adjacencies. The goodbye notification packet comprises an EIGRP packet header with variable-length fields embodied as an appended goodbye attribute. The appended goodbye attribute is illustratively tagged according to a TLV encoding format that defines a new type (T) field called “a goodbye” having a predetermined type that distinguishes it from a conventional EIGRP Hello packet. A value (V) field of information conveyed within the goodbye attribute contains a list of neighbor (peer) identifiers (IDs). The peer IDs on this list instruct those neighbor routers to “go away” so that their adjacencies can be destroyed.
    Type: Grant
    Filed: June 19, 2003
    Date of Patent: June 17, 2008
    Assignee: Cisco Technology, Inc.
    Inventors: Thuan Van Tran, Donnie V. Savage, Donald Slice
  • Publication number: 20080031244
    Abstract: Techniques for sending routing data include sending first routing data in a first multicast packet to a number N of adjacent nodes. It is determined whether different routing data is ready to be sent in a different multicast packet. If so, then a number M of adjacent nodes from which acknowledgment messages have been received, and whether M exceeds a threshold, is determined. If so, then a Conditional-Receive (CR) method is invoked in which a multicast message is sent which identifies each of a number L=N?M of laggard adjacent nodes. The laggard adjacent nodes are thus notified to ignore the different multicast packet. If it is determined that M does not exceed the threshold, then additional acknowledgement messages are received while waiting until M does exceed the threshold before the CR method is invoked. The threshold is greater than or equal to 1.
    Type: Application
    Filed: August 1, 2006
    Publication date: February 7, 2008
    Inventors: Thuan Van Tran, Donnie Van Savage, Donald Slice
  • Publication number: 20070237142
    Abstract: A static neighbor configured network device is configured with a static neighbor feature including a static neighbor list of network devices. The static neighbor configured network device is in a network segment that includes a dynamically configured network device. The static neighbor configured network device receives a multicast packet from the dynamically configured network device. It is determined if the dynamically configured network device is included in the static neighbor list of the static neighbor configured network device. The multicast packet is accepted if the dynamically configured network device is found in the neighbor list for the static neighbor configured network device. Also, adjacency for the static neighbor configured network device is not lost with any other currently adjacent network devices when the multicast packet is received.
    Type: Application
    Filed: April 5, 2006
    Publication date: October 11, 2007
    Applicant: Cisco Technology, Inc.
    Inventors: Yi Yang, Thuan Tran, Donnie Savage, Donald Slice, James Ng, Alvaro Retana
  • Publication number: 20050195835
    Abstract: A first router is configured for monitoring prescribed attributes of an active path connected to the first router, and supplying an update message to a second router, according to a prescribed routing protocol such as Enhanced Interior Gateway Routing Protocol (EIGRP), that specifies a detected change by the first router in at least one of the prescribed attributes of the connected active path. Hence, the second router, in response to receiving the update message, can update an internal topology table based on the detected change in the active path connected to the first router, and selectively adjust an internal routing table based on the detected change relative to queuing policies for prescribed data flows.
    Type: Application
    Filed: March 2, 2004
    Publication date: September 8, 2005
    Inventors: Donnie Savage, Donald Slice, Roy Brooks, Matthew Birkner
  • Publication number: 20040258002
    Abstract: A technique efficiently notifies EIGRP neighbors when destroying adjacencies in a computer network. A goodbye notification packet is provided that enables an EIGRP router to inform one or more of its neighbors of its intention to destroy their existing adjacencies. The goodbye notification packet comprises an EIGRP packet header with variable-length fields embodied as an appended goodbye attribute. The appended goodbye attribute is illustratively tagged according to a TLV encoding format that defines a new type (T) field called “a goodbye” having a predetermined type that distinguishes it from a conventional EIGRP Hello packet. A value (V) field of information conveyed within the goodbye attribute contains a list of neighbor (peer) identifiers (IDs). The peer IDs on this list instruct those neighbor routers to “go away” so that their adjacencies can be destroyed.
    Type: Application
    Filed: June 19, 2003
    Publication date: December 23, 2004
    Inventors: Thuan Van Tran, Donnie V. Savage, Donald Slice