194 results about "Link-state advertisement" patented technology

A communication network comprises a plurality of nodes interconnected by communication links. A node maintains a database of topology information relating to the network. A node receives a topology advertisement from another node of the network which provides information about a part of the network. The topology advertisement includes a metric which is related to aggregate distance or cost of the path travelled by the topology advertisement. The node compares the metric in the newly received topology advertisement with one previously received for the same part of the network. The database is updated with the newly received topology advertisement if the value of the metric in the newly received topology advertisement is lower than the metric in the topology advertisement previously received for the same part of the network. The method can be used during flooding or database synchronisation. The metric can be carried within a header or body of a topology advertisement, such as a Link State Advertisement (LSA).

A method and system enables policy-based traffic forwarding in a data network by implementing policy-based control over propagation of LSA messages through the data network. A route tag is asserted in respect of a link state advertisement (LSA) message advertising a network address. Propagation of the LSA through the data network is controlled using the asserted internal route tag. At each hop, a policy decision affecting the forwarding of the LSA is made. Exemplary policy decisions include, Pass and Discard. In addition, the forwarding table may be updated using the route and address information contained in the LSA. In this case, routes entered in the forwarding table may be tagged as an inclusion route or an exclusion route. This may be based on the value of an exclusion route flag, which can, for example, be provided as a binary “0” or “1” inserted into an unused portion of the options field of the LSA.

A system for providing content location information is provided, and the system includes at least one router-storage apparatus configured to be connected to a storage, generate Opaque Link State Advertisement (LSA) including content location information of content items stored in the storage and flood the generated Opaque LSA to at least one adjacent router and at least one content location finding apparatus configured to be connected to the at least one router-storage apparatus, acquire the content location information, store content location information in a content location information database (DB), search for location information of a content item requested from a user terminal in the content location information DB and provide the found content location information.

Distributed traffic engineering route exchanger routers (TE-Xs) are used in an open shortest path first (OSPF) routing area to collect Traffic Engineering Link State Advertisements (TE-LSAs) and exchange the TE-LSAs with other TE-Xs. TE-Xs store TE-LSAs and compute explicit routes required by edge routers. A single point of failure that exists when a single centralized TE database is used is thereby eliminated. The TE-Xs peer with other TE-Xs in a routing area and exchange TE-LSAs to keep traffic engineering link state databases (TE-LSDBs) synchronized. Network resources are preserved for payload traffic and resource reservation collisions are reduced.

Paths may be advertised on a network implementing a link state routing protocol by using path state advertisement that are distributed in the same manner as link state advertisements. The path state advertisements contain path entries, each of which includes a globally unique path ID and path information such as a series of nodes or links that defines the path through the network. When a path state advertisement is received by a network element, the network element will evaluate the path entries in the path state advertisement to determine if the path state advertisement is relevant and, if necessary, install forwarding state for the relevant path entries. Path state advertisements not relevant to a network element are not used to affect forwarding state on the network element. Label based forwarding may then be used by the network elements to forward data along the path, in which the globally unique path ID is used as the label for the data.

A novel technique is provided for preventing routing loops by disseminating Border Gateway Protocol (BGP) attribute information in an Open Shortest Path First (OSPF) configured network. Specifically, a new OSPF sub-type-length-value (TLV) is introduced for transporting a conventional BGP autonomous system (AS) path attribute through the OSPF-configured network. Like the BGP AS-path attribute, the new OSPF AS-path sub-TLV is configured to store a set of AS numbers corresponding to the AS path of one or more advertised routes. Thus, when a network device receives an OSPF link-state advertisement (LSA) containing the novel AS-path sub-TLV, the network device determines whether it resides in an autonomous system whose AS number is stored in the sub-TLV. If so, the network device does not install the LSA's advertised routes in its link-state database since the routes, if installed, could result in routing loops.

In a link state protocol such as an interior gateway protocol (IGP), link state advertisements or link state packets (LSA / LSPs) are sent only to network nodes that have expressed interest in them, rather than always flooding them.

A method, and a system, called link state advertisement (“LSA”) correlation, for scheduling routing table updates following a topology change. LSA correlation correlates information in the LSAs to identify the topology change that led to their generation. A routing table update is performed when a topology change has been identified.

Method and system for efficiently handling hub and spoke area topologies in a data network under Open Shortest Path First (OSPF) routing protocol which provides selective blocking of Link State Advertisements (LSAs) includes selectively blocking the broadcast or flooding of LSAs from spoke routers to other respective spoke routers in the hub and spoke area unless route leaking is permitted for a particular spoke router, or the particular spoke router has a backdoor connection, in which case, a full shortest path first (SPF) run may be scheduled for the particular spoke router such that the amount of protocol traffic may be minimized and the SPF runs in the hub and spoke area may be reduced.

The invention includes methods for controlling transmission of a plurality of packets from a sending device to a receiving device. A first method includes determining an expected path for a packet having associated with it a packet size, determining a Media Transmission Unit (MTU) size for the expected path, and, in response to a determination that the packet size is greater than the MTU size, propagating to the sending device a message adapted to reduce packet sizes of subsequent packets to be less than or equal to the MTU size. Other methods include generating a link state advertisement (LSA) for a link including a link TLV having a sub-TVL conveying MTU information associated with the link, transmitting the LSA toward a router, receiving the LSA at the router, and updating a table entry associated with the link using the MTU information conveyed by the sub-TLV.

Routing information is distributed interdomain using a policy-based protocol and intradomain by flooding. A network device receives a message with routing information from outside its domain and applies policy. Policy filtered routing information is flooded throughout the domain of the network device. A link state advertisement header is added to the routing information to perform flooding. Policy is also applied to flooded routing information before sending such message to another domain.

A link state advertisement protocol message received from an originating device over an inbound interface is forwarded over the fast path according to a reverse path forwarding determination. Specifically, a reverse path forwarding check is performed in order to determine the reverse path forwarding interface for the originating device. A forwarding state that indicates the reverse path forwarding interface may be installed, in which case the forwarding state may be used to determine the reverse path forwarding interface. If the inbound interface is determined to be the reverse path forwarding interface for the originating device, then the link state advertisement protocol message is forwarded over the fast path. Otherwise, the link state advertisement protocol message is not forwarded over the fast path. The link state advertisement protocol message continues to be processed and forwarded by the control plane as usual for robustness.

One embodiment of the present invention provides a system for updating link-status information associated with a prefix in an information-centric network (ICN). During operation, a first node in the ICN receives a link-state advertisement (LSA) message from a neighbor node with the LSA message specifying a prefix and an anchor node advertising the specified prefix. The system determines, based on topology information stored on the first node, whether a shortest-path condition is met, and forwards the received LSA message to other neighbors of the first node in response to the shortest-path condition being met.

A protected communication network utilizes a link-based recovery strategy that includes methods for calculating and distributing link-protection parameters and calculating primary and link-detour paths based on these parameters. These link-protection parameters support the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. A joint-optimization mechanism can be employed that considers both the cost of link-detour paths as well as the cost of links in candidate primary paths in the selection of a primary path for a demand. Information for the joint optimization is preferably distributed using link-state advertisements.

A network topology map and a system and method of annotating a network topology map of a packet network is described which monitors traffic engineering extensions in link state advertisement packets. Traffic engineering information contained in traffic engineering extensions is extracted and the traffic engineering information is used to annotate the network topology map with network attributes, such as bandwidth information and traffic engineering metrics.

Each node of a telecommunications network determines interface point connection type attributes available for each signal type supported by the node. Each signal type represents a different connection routing layer within the telecommunications network. Adaptation costs involved in traversing from one connection routing layer to another connection routing layer in the node are calculated. The connection type attributes and adaptation costs are included in a link state advertisement broadcasted by each node in the telecommunications network. A route calculation is performed for a desired signal to determine a route through the telecommunications network for the signal. The route calculation takes into account the various connection type attributes, availability, and adaptation costs in determining the shortest route for the signal through the telecommunications network.

Each node of a telecommunications network determines interface point connection type attributes available for each signal type supported by the node. Each signal type represents a different connection routing layer within the telecommunications network. Adaptation costs involved in traversing from one connection routing layer to another connection routing layer in the node are calculated. The connection type attributes and adaptation costs are included in a link state advertisement broadcasted by each node in the telecommunications network. A route calculation is performed for a desired signal to determine a route through the telecommunications network for the signal. The route calculation takes into account the various connection type attributes, availability, and adaptation costs in determining the shortest route for the signal through the telecommunications network.

Each router in a network is configured for executing a link state routing protocol based on outputting a corresponding first link state advertisement message describing a connected link of the router and that specifies a first dynamic routing metric identifying a first cost of the connected link, and a corresponding variation metric identifying a statistical variation of the dynamic routing metric. Each router also is configured for selectively outputting a corresponding second link state advertisement message describing the connected link and that specifies the corresponding variation metric and an updated dynamic routing metric identifying an updated cost of the connected link relative to the first cost, the second link state advertisement message selectively output based on the updated dynamic routing metric differing from the first dynamic routing metric by more than the variation metric, or the router having received another link state advertisement from another router in the network.

There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.

A network-connectivity system can receive a remote additive hash for a routing-data collection of a remote network node, and compares the remote additive hash with a local additive hash for a local routing-data collection. A respective additive hash represents one or more network-configuration items of a routing-data collection. Also, at least one of the network-configuration items of the routing-data collection includes reachability information for a network node of a computer network, such as a link-state advertisement. If the system determines that the remote additive hash does not match the local additive hash, the system synchronizes the local routing-data collection with the remote network node of the computer network.

A link state advertisement protocol message received from an originating device over an inbound interface is forwarded over the fast path according to a predetermined forwarding scheme. A forwarding state that defines rules for forwarding the link state advertisement protocol message may be installed in a forwarding table, in which case the link state advertisement protocol message is forwarded over the fast path according to the forwarding state. The forwarding state may indicate the preferred inbound interface and / or the outbound interface(s) for forwarding the link state advertisement protocol message over the fast path. The link state advertisement protocol message continues to be processed and forwarded by the control plane as usual for robustness.

A method for realizing flow engineering (FE) link state diffusion in optical network characterizes that according to the frequency of TE link attribute variation, different TE link attributes of a same TE link variable frequency are divided into different kinds to contain the said different kinds of TE link attributes in different LSA for flooding to make TELS to diffuse in the network zone, effectively realizing diffusion of TELS in the zone and reducing network bandwidth occupied by flood of flow information to realize TEDB synchronization quickly.

The present invention embodiments bypass congested links in a multi-hop Ad-Hoc wireless network. Initially, congestion is measured at each network node based on channel utilization for both transmission and reception of TDMA and CSMA messages. The measured utilization is quantized to conserve transmission bandwidth. Non-uniform quantization is applied to enable the measured utilization to be quantized to the highest value within the quantization range prior to occurrence of congestion, thereby effectively providing early notification of the congestion. The quantized utilization is distributed with the original use costs of a communication link to the remaining network nodes by a Link State Advertisement (LSA) flood and supplemental ACK and / or HELLO packets. After a network node receives the quantized utilization, the link cost is updated and used to select a routing path that minimizes the total costs from the source node to the destination node for a multi-hop network.

In the invention, traffic engineering-link state advertising (TE-LSA) method is adopted to diffuse link state information in traffic engineering by using OSPE flood mechanism. Based on unit triplet (LS Type, Link State ID, advertising Router), LSA is searched in link state database (LSDB), here Link State ID is link index of TE, making each LSA include TE attribute of only one TE router. Comparing with prior art, since TE-Router-LSA is redesigned, the invention makes one to one correspondence between TE router and TE-Router-LSA. Thus, it is not needed to carry out comparison procedure between sequence numbers of TE-Router-LSA and sequence numbers of each TE router existed in TE-Router-LSA of TEDB.

Each router in a network is configured for executing a link state routing protocol based on outputting a corresponding first link state advertisement message describing a connected link of the router and that specifies a first dynamic routing metric identifying a first cost of the connected link, and a corresponding variation metric identifying a statistical variation of the dynamic routing metric. Each router also is configured for selectively outputting a corresponding second link state advertisement message describing the connected link and that specifies the corresponding variation metric and an updated dynamic routing metric identifying an updated cost of the connected link relative to the first cost, the second link state advertisement message selectively output based on the updated dynamic routing metric differing from the first dynamic routing metric by more than the variation metric, or the router having received another link state advertisement from another router in the network.

The method comprises: creating and maintaining the edge connection information on the edge router supporting OSPF protocol in autonomous system; using link state advertisement (LSA) message to carry the edge connection message, and flood-broadcasting said message; the router in system receives the LSA message and extracts the edge connection message from said message. The invention also reveals an apparatus for advertizing an autonomous system edge information comprising a edge connection information collecting module, an edge connection information database, a message generating module for packing the edge connection information into RI LSA message, and a message advertisement module for flood-broadcasting the RI LSA message in the autonomous system.

The embodiment of the invention discloses a method for implementing link state database synchronization. The method comprises: receiving link state notifying message; comparing the link state notifying message with that in link state database, updating link state notifying message in the link state database if the received link state notifying message is new message, transmitting the received link state notifying message to virtual neighbor with established virtual neighbor relation. Accordingly, the embodiment of the invention provides a router including circuit board, master control board and standby master control bard. The embodiment of the invention also provides a circuit board and master control board. The embodiment of the invention can simply implement link state database synchronization.

The present invention provides a system, apparatus and method to compute a route through a network having both digital nodes and optical express-thru nodes. According to various embodiments of the invention, a network topology is generated in which both digital nodes, optical express-thru nodes, and optical nodes are identified, and both physical and virtual links between these nodes are mapped. The network connectivity is identified, at least in part, by broadcasting a local link state advertisement and optical carrier group binding information to neighboring nodes, which enables both physical and virtual neighboring nodes to be identified. Once a topology is generated, both physical and virtual link characteristics are analyzed to ensure link diversity for traffic through the network and load balancing functionality across the network.

A method for automatically detecting bi-directional link switched ring link provisioning errors. The method includes receiving an opaque link state advertisement containing bi-directional link switched ring ID and link information at a local node of the ring and checking ring IDs of neighbor nodes of the local node. If the ring IDs of the local node and neighbor nodes do not match a ring ID mismatch alarm is raised.

An efficient network formation technique for mobile ad-hoc wireless networks according to the present invention overcomes bandwidth overhead due to generation of database update or Link State Advertisement (LSA) messages in response to changes in certain parameters (e.g., node group size, etc.) with respect to both single and plural node group scenarios. The present invention controls flooding of LSA messages triggered by changes in these parameters (e.g., node group size), thereby reducing overhead traffic during network start-up. This is achieved without impact on message delivery capability and group merge operations. After network start-up is complete and the network is formed, the present invention continues to reduce LSA flooding in a mobile scenario when radios or nodes move into and out of range with one another.