Patents by Inventor Ladan PICKERING

Ladan PICKERING 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).

  • Routing around intra-network element disconnectivity
    Patent number: 8982900
    Abstract: Routing around intra-network element (intra-NE) disconnectivity is described. The routing is performed on one or more network element (NEs) of a channelized network. The routing involves performing a shortest-path-search (SPS) to determine a shortest non-disconnected path from a single path-ingress edge to a single path-egress edge. The SPS includes classifying a set of endpoints of each NE in the channelized network as an equivalence class of endpoints, classifying a set of paths-so-far between each NE in the channelized network as an equivalence class of paths-so-far, grouping each equivalence class of paths-so-far by the equivalence class of endpoints that includes a terminal endpoint of the path-so-far that is furthest from the single path-ingress edge, and exploring separately each equivalence class of edges that are incident to each NE when determining the shortest non-disconnected path from the single path-ingress edge to the single path-egress edge.
    Type: Grant
    Filed: April 25, 2012
    Date of Patent: March 17, 2015
    Assignee: Fujitsu Limited
    Inventors: Daniel Louis Miller, Ladan Pickering, Sanjay Gera, Edward A. Harbin, Albert V. Smith, Jr.
  • ROUTING AROUND INTRA-NETWORK ELEMENT DISCONNECTIVITY
    Publication number: 20130287018
    Abstract: Routing around intra-network element (intra-NE) disconnectivity is described. The routing is performed on one or more network element (NEs) of a channelized network. The routing involves performing a shortest-path-search (SPS) to determine a shortest non-disconnected path from a single path-ingress edge to a single path-egress edge. The SPS includes classifying a set of endpoints of each NE in the channelized network as an equivalence class of endpoints, classifying a set of paths-so-far between each NE in the channelized network as an equivalence class of paths-so-far, grouping each equivalence class of paths-so-far by the equivalence class of endpoints that includes a terminal endpoint of the path-so-far that is furthest from the single path-ingress edge, and exploring separately each equivalence class of edges that are incident to each NE when determining the shortest non-disconnected path from the single path-ingress edge to the single path-egress edge.
    Type: Application
    Filed: April 25, 2012
    Publication date: October 31, 2013
    Applicant: FUJITSU LIMITED
    Inventors: Daniel Louis MILLER, Ladan PICKERING, Sanjay GERA, Edward A. HARBIN, Albert V. SMITH, JR.