Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Ian Michael Charles Shand
Ian Michael Charles Shand, Surry GB
| Patent application number | Description | Published |
|---|---|---|
| 20110019671 | Partitioned Forwarding of Packets Originated on a Broadcast Link Among Layer 2 Forwarding Devices of Different Adjacency Networks - The designated forwarding device functionality for forwarding of packets originated on a broadcast link among layer 2 is shared among multiple forwarding devices of different adjacency networks. As these networks do not form adjacencies, the forwarding devices do not natively participate in a same spanning tree for determining how to forward packets, and a designated forwarding device is used for forwarding packets originated on the common broadcast link. Distributing the role of a designated forwarding device among multiple of the forwarding devices provides a means for more efficiently forwarding packets to their destinations. | 01-27-2011 |
Ian Michael Charles Shand, Cobham GB
| Patent application number | Description | Published |
|---|---|---|
| 20080225697 | Computing repair path information - An apparatus and method is described for computing repair path information around a failure component in a data communications network having a components nodes and links therebetween. Where, according to a routing protocol, a node sends to a neighbor node a metric indicative of reachability of a destination node, the protocol requiring differentiated action by the node if the route to the destination node includes the neighbor node, the apparatus is arranged to compute a repair path to the destination node via candidate nodes comprising only neighbor nodes to the apparatus not requiring differentiated action relative to the apparatus. | 09-18-2008 |
| 20080225897 | Providing clock synchronization in a network - In one embodiment, an apparatus for providing clock synchronization in a packet-based network, the network having as components nodes and links therebetween and having a network topology, is arranged to compute a forward clock synchronization packet path to a synchronization destination from the network topology according to a computation rule such that the return path for a clock synchronization packet from the synchronization destination is the same as the forward path. | 09-18-2008 |
| 20080259923 | Forwarding data in a data communication network - An apparatus for forwarding data in a data communications network having as components nodes and links therebetween is described. The apparatus is arranged to forward data towards a destination on a label switched path and advertise in a label advertisement to nodes in the network in a label advertisement its label for the label switched path and its label for a repair label switched path for use in the event of non availability of a component in the network. The apparatus is further arranged to advertise to a remote node in the network in a label advertisement additional information for deriving repair label switched path information at the remote node. | 10-23-2008 |
| 20080310433 | Fast Re-routing in Distance Vector Routing Protocol Networks - In one embodiment, a method includes sending an adjacency discovery message | 12-18-2008 |
| 20100303091 | SYSTEM AND METHOD FOR DYNAMICALLY ASSIGNING VALUES IN A NETWORK - The embodiments described herein present methods and apparatus for dynamically assigning values in a network. A method includes receiving, at a designated value allocator from a network node, a first broadcast message using a link-state protocol. The method then identifies the first broadcast message as including a request to associate a parameter value to the network node and allocates an assigned parameter value to the network node based on the identification of the request included in the first broadcast message. A message that includes the assigned parameter value is then transmitted to the network node. Other embodiments are described. | 12-02-2010 |
Ian Michael Charles Shand, Surrey GB
| Patent application number | Description | Published |
|---|---|---|
| 20100238788 | Connection verification for MPLS label switched paths and pseudowires - In one embodiment, a connection verification (CV) message is initiated from an initiating maintenance end point (MEP) for an MPLS LSP, the CV message carried in a packet having a time-to-live (TTL) value of 1. Each maintenance intermediate point (MIP) along the MPLS LSP receives the packet and decrements the TTL, and in response to determining that the TTL equals 0, examines a payload of the packet to determine that the packet carries the CV message. The MIP may then append its MIP ID to a route record field of the payload having any previous MIP IDs of upstream MIPs, and forwards the CV message downstream along the MPLS LSP in a packet having a TTL value of 1. The end MEP receives the CV message, and sends a CV reply having the route record field with MIP IDs and an end MEP ID to the initiating MEP. | 09-23-2010 |
Ian Michael Charles Shand, Reading GB
| Patent application number | Description | Published |
|---|---|---|
| 20090067322 | FORWARDING DATA IN A DATA COMMUNICATIONS NETWORK - In an embodiment, an apparatus for forwarding data in a data communications network having as components nodes and links therebetween comprises a network interface configured to couple to a data communications network having as components nodes and links therebetween; first logic which when executed is operable to receive a repair address; second logic which when executed is operable to compute a repair path from a repairing node to the repair address around a failure component on a primary forwarding path between the apparatus and a repairing node; and third logic which when executed is operable to propagate the repair address along a label switched path (LSP), comprising the repair path, to the repairing node. The apparatus offers improved efficiency in computing a repair path in a network around a failed component because unnecessary computations are not performed with the disclosed apparatus and approach. | 03-12-2009 |
| 20090067330 | COMPUTING PATH INFORMATION TO A DESTINATION NODE IN A DATA COMMUNICATION NETWORK - Approaches for computing path information to a destination node in a data communications network are described. A data communications network comprises as components nodes and links therebetween and comprising a core subdomain of components and a plurality of non-core subdomains of components and having a common identifier for each non-core subdomain. An apparatus comprises first logic which when executed is operable to receive reachability information for a destination node and an associated identifier; and second logic which when executed is operable to perform a computation of path information for a path in the network to a destination node dependent on a particular identifier of a subdomain associated with the destination node, and to forward data for the destination over the path according to the path information. | 03-12-2009 |