Patents by Inventor Jerome Chiabaut
Jerome Chiabaut 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).
-
Publication number: 20120307832Abstract: Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths.Type: ApplicationFiled: August 20, 2012Publication date: December 6, 2012Applicant: ROCKSTAR BIDCO, LPInventors: David Allan, Nigel Bragg, Jerome Chiabaut
-
Publication number: 20120300774Abstract: A method ensures that multicast packets follow the same loop-free path followed by unicast packets in a packet communication network. The communication network includes at least one first area interconnected through at least one area border node (“ABN”) to a second area. Each ABN has a first level port connected to each first area and a second level port connected to the second area. Each multicast packet forwarded includes a header having a root-id identifying a root of a multicast tree. A data packet is received at an ABN. Responsive to receiving a multicast packet at a second level port of an area border node, the root-id of the multicast packet is examined and if the multicast packet is to be forwarded over at least one of the first level ports, a different root-id is substituted into the packet before the packet is forwarded over the first level port.Type: ApplicationFiled: August 6, 2012Publication date: November 29, 2012Applicant: Rockstar Bidco, LPInventors: Liam M. CASEY, David Ian ALLAN, Nigel Lawrence BRAGG, Jerome CHIABAUT
-
Patent number: 8270319Abstract: A method ensures that multicast packets follow the same loop-free path followed by unicast packets in a packet communication network. The communication network includes at least one first area interconnected through at least one area border node (“ABN”) to a second area. Each ABN has a first level port connected to each first area and a second level port connected to the second area. Each multicast packet forwarded includes a header having a root-id identifying a root of a multicast tree. A data packet is received at an ABN. Responsive to receiving a multicast packet at a second level port of an area border node, the root-id of the multicast packet is examined and if the multicast packet is to be forwarded over at least one of the first level ports, a different root-id is substituted into the packet before the packet is forwarded over the first level port.Type: GrantFiled: October 7, 2009Date of Patent: September 18, 2012Assignee: Rockstart Bidco, LPInventors: Liam M. Casey, David Ian Allan, Nigel Lawrence Bragg, Jerome Chiabaut
-
Patent number: 8270290Abstract: A method system for interfacing a client system in a first network domain with a Provider Link State Bridging (PLSB) network domain. At least two Backbone Edge Bridges (BEBs) of the PLSB domain 20 are provided. Each BEB is an end-point of a connection in the first network domain to the client system and an end-point of at least a unicast path defined within the PLSB domain 20. An inter-node trunk is provided in the PLSB domain 20 for interconnecting the at least two BEBs. A phantom node is defined in the PLSB domain 20. The phantom node has a unique address in the PLSB domain 20 and is notionally located on the inter-node trunk one hop from each of the BEBs. Each of the BEBs is configured such that: an ingress packet received from the client system via the connection in the first network domain is forwarded through a path notionally rooted at the phantom node; and an egress subscriber packet destined for the client system is forwarded to the client system through the connection in the first network domain.Type: GrantFiled: December 19, 2008Date of Patent: September 18, 2012Assignee: Rockstar Bidco, LPInventors: Liam Casey, David Allan, Nigel L. Bragg, Jerome Chiabaut, Peter Ashwood Smith
-
Publication number: 20120230199Abstract: A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.Type: ApplicationFiled: May 22, 2012Publication date: September 13, 2012Applicant: ROCKSTAR BIDCO LPInventor: Jerome CHIABAUT
-
Publication number: 20120219288Abstract: Link bandwidth is varied based on the subscriber traffic load. Varying the link bandwidth has the effect of varying the actual noise margin of the link (in an inverse elation), so that the noise margin will vary inversely with the traffic load. A beneficial result is that, because the noise margin is increased during “off-peak” traffic periods, rapidly varying and burst impairments can be absorbed without causing data loss. In effect, the respective probability distributions of error bursts and traffic load are separated. Data loss only becomes a significant risk when peaks in both distributions coincide. However, the probability of that event occurring is comparatively low. This enables a lower noise margin allocation during design of the link, which dramatically reduces the link cost.Type: ApplicationFiled: August 29, 2011Publication date: August 30, 2012Inventors: Kim B. Roberts, Jerome Chiabaut
-
Patent number: 8248925Abstract: Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest when creating the path ID to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths through the network. Selective naming of node IDs and use of different inversion functions can be exploited to further optimize distribution of traffic on the network.Type: GrantFiled: October 7, 2009Date of Patent: August 21, 2012Assignee: Rockstar Bidco, LPInventors: David Allan, Nigel Bragg, Jerome Chiabaut
-
Publication number: 20110292838Abstract: A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and any nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.Type: ApplicationFiled: August 5, 2011Publication date: December 1, 2011Applicant: NORTEL NETWORKS LIMITEDInventors: Jerome CHIABAUT, David ALLAN, Nigel BRAGG
-
Patent number: 8009985Abstract: Link bandwidth is varied based on the subscriber traffic load. Varying the link bandwidth has the effect of varying the actual noise margin of the link (in an inverse relation), so that the noise margin will vary inversely with the traffic load. A beneficial result is that, because the noise margin is increased during “off-peak” traffic periods, rapidly varying and burst impairments can be absorbed without causing data loss. In effect, the respective probability distributions of error bursts and traffic load are separated. Data loss only becomes a significant risk when peaks in both distributions coincide. However, the probability of that event occurring is comparatively low. This enables a lower noise margin allocation during design of the link, which dramatically reduces the link cost.Type: GrantFiled: May 13, 2003Date of Patent: August 30, 2011Assignee: Ciena CorporationInventors: Kim B. Roberts, Jerome Chiabaut
-
Patent number: 8005016Abstract: A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbor node of the first node and any nodes of the network subtending the neighbor node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.Type: GrantFiled: October 28, 2008Date of Patent: August 23, 2011Assignee: Nortel Networks LimitedInventors: Jerome Chiabaut, David Allan, Nigel Bragg
-
Patent number: 7983243Abstract: A system for increasing the call capacity of an access point in a WLAN that determines whether a maximum total voice path delay would be exceeded if the packetization delay is increased for packets in a call. In the event that the packetization delay can be increased without the total delay exceeding the maximum delay, the disclosed system increases the size of packets used in the call, if all participating devices can process the increased packet size. The maximum delay may be predetermined, and reflect a maximum delay that cannot be exceeded without adversely impacting the voice quality of a call. If the two end points for a call are determined to be physically “local” to each other, packetization delay for the call may be increased based on the assumption that the increased packetization delay will not decrease the voice quality of the call.Type: GrantFiled: April 12, 2004Date of Patent: July 19, 2011Assignee: Avaya, Inc.Inventors: Liam Casey, David Allan, Jerome Chiabaut
-
Publication number: 20110167155Abstract: A method of installing forwarding state in a link state protocol controlled network node having a topology database representing a known topology of the network, and at least two ports for communication with corresponding peers of the network node. A unicast path is computed from the node to a second node in the network, using the topology database, and unicast forwarding state associated with the computed unicast path installed in a filtering database (FDB) of the node. Multicast forwarding state is removed for multicast trees originating at the second node if an unsafe condition is detected. Subsequently, a “safe” indication signal is advertised to each of the peers of the network node. The “safe” indication signal comprises a digest of the topology database. A multicast path is then computed from the network node to at least one destination node of a multicast tree originating at the second node.Type: ApplicationFiled: March 15, 2011Publication date: July 7, 2011Applicant: NORTEL NETWORKS LIMITEDInventors: Jerome Chiabaut, David Allan, Nigel Bragg
-
Publication number: 20110128857Abstract: A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.Type: ApplicationFiled: February 9, 2011Publication date: June 2, 2011Inventors: Jerome Chiabaut, David Allan, Nigel Bragg, Peter Ashwood Smith
-
Patent number: 7924836Abstract: A method of installing forwarding state in a link state protocol controlled network node having a topology database representing a known topology of the network, and at least two ports for communication with corresponding peers of the network node. A unicast path is computed from the node to a second node in the network, using the topology database, and unicast forwarding state associated with the computed unicast path installed in a filtering database (FDB) of the node. Multicast forwarding state is removed for multicast trees originating at the second node if an unsafe condition is detected. Subsequently, a “safe” indication signal is advertised to each of the peers of the network node. The “safe” indication signal comprises a digest of the topology database. A multicast path is then computed from the network node to at least one destination node of a multicast tree originating at the second node.Type: GrantFiled: October 29, 2008Date of Patent: April 12, 2011Assignee: Nortel Networks LimitedInventors: Jerome Chiabaut, David Allan, Nigel Bragg
-
Patent number: 7911944Abstract: A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.Type: GrantFiled: December 26, 2007Date of Patent: March 22, 2011Assignee: Nortel Networks LimitedInventors: Jerome Chiabaut, David Allan, Nigel Bragg, Peter Ashwood Smith
-
Publication number: 20110060844Abstract: Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest when creating the path ID to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths through the network. Selective naming of node IDs and use of different inversion functions can be exploited to further optimize distribution of traffic on the network.Type: ApplicationFiled: October 7, 2009Publication date: March 10, 2011Applicant: Nortal Networks LimitedInventors: David Allan, Nigel Bragg, Jerome Chiabaut
-
Publication number: 20100284309Abstract: Interest in multicast group membership may be advertised via a routing system on an Ethernet network along with an indication of an algorithm to be used by the nodes on the network to calculate the distribution tree or trees for the multicast. Each node, upon receipt of the advertisement, will determine the algorithm that is to be used to produce the multicast tree and will use the algorithm to calculate whether it is on a path between nodes advertising common interest in the multicast. Example algorithms may include shortest path algorithms and spanning tree algorithms. This allows multicast membership to be managed via the routing control plane, while enabling spanning tree processes to be used to forward multicast traffic. Since spanning tree is able to install multicast state per service rather than per source per service, this reduces the amount of forwarding state required to implement multicasts on the routed Ethernet mesh network.Type: ApplicationFiled: May 5, 2009Publication date: November 11, 2010Applicant: Nortel Newtworks LimitedInventors: David Allan, Nigel Bragg, Jerome Chiabaut
-
Publication number: 20100157844Abstract: A method system for interfacing a client system in a first network domain with a Provider Link State Bridging (PLSB) network domain. At least two Backbone Edge Bridges (BEBs) of the PLSB domain 20 are provided. Each BEB is an end-point of a connection in the first network domain to the client system and an end-point of at least a unicast path defined within the PLSB domain 20. An inter-node trunk is provided in the PLSB domain 20 for interconnecting the at least two BEBs. A phantom node is defined in the PLSB domain 20. The phantom node has a unique address in the PLSB domain 20 and is notionally located on the inter-node trunk one hop from each of the BEBs. Each of the BEBs is configured such that: an ingress packet received from the client system via the connection in the first network domain is forwarded through a path notionally rooted at the phantom node; and an egress subscriber packet destined for the client system is forwarded to the client system through the connection in the first network domain.Type: ApplicationFiled: December 19, 2008Publication date: June 24, 2010Applicant: NORTEL NETWORKS LIMITEDInventors: Liam CASEY, David ALLAN, Nigel L. BRAGG, Jerome CHIABAUT, Peter ASHWOOD SMITH
-
Publication number: 20100103846Abstract: A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and any nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.Type: ApplicationFiled: October 28, 2008Publication date: April 29, 2010Applicant: NORTEL NETWORKS LIMITEDInventors: Jerome Chiabaut, David Allan, Nigel Bragg
-
Publication number: 20100020797Abstract: A method ensures that multicast packets follow the same loop-free path followed by unicast packets in a packet communication network. The communication network includes at least one first area interconnected through at least one area border node (“ABN”) to a second area. Each ABN has a first level port connected to each first area and a second level port connected to the second area. Each multicast packet forwarded includes a header having a root-id identifying a root of a multicast tree. A data packet is received at an ABN. Responsive to receiving a multicast packet at a second level port of an area border node, the root-id of the multicast packet is examined and if the multicast packet is to be forwarded over at least one of the first level ports, a different root-id is substituted into the packet before the packet is forwarded over the first level port.Type: ApplicationFiled: October 7, 2009Publication date: January 28, 2010Applicant: NORTEL NETWORKS LIMITEDInventors: Liam M. CASEY, David Ian ALLAN, Nigel Lawrence BRAGG, Jerome CHIABAUT