Abstract: A system for, and method of, determining a physical topology of a network having multiple subnets. In one embodiment, the system includes: (1) a skeleton path initializer that uses addressing information from elements in the network to develop a collection of skeleton paths of direct physical connections between labeled ones of the elements, the skeleton paths traversing multiple of the subnets and (2) a skeleton path refiner, coupled to the skeleton path initializer, that refines the collection by inferring, from the direct physical connections and path constraints derived therefrom, other physical connections in the skeleton paths involving unlabeled ones of the elements.

Abstract: Systems and methods for provisioning QoS paths with restoration in a network. In one embodiment, one system includes: (1) a primary path generator configured to identify a suitable primary path between source and destination nodes in a network, (2) an auxiliary graph generator, associated with the primary path generator, configured to construct a directed auxiliary graph from an undirected graph representing the network by reversing each link in a primary QoS path of the undirected graph and replacing each other link in the undirected graph by two directed links, (3) a walk identifier, associated with the auxiliary graph generator, configured to identify a walk in the auxiliary directed graph corresponding to a set of bridges in the network and (4) a bridge identifier, associated with the walk identifier, configured to identify a set of bridges in the network such that at least one link of the primary path is protected by a bridge.

Abstract: Systems and method for selecting open shortest path first (OSPF) aggregates and aggregate weights for a particular area. In one embodiment, an aggregate selecting system includes: (1) a database for containing data pertaining to candidate OSPF aggregates and corresponding weights and (2) an aggregate selector, associated with the database, that selects at least a subset of the OSPF aggregates such that the shortest path length between the particular source and destination subnets resulting from advertisement of a set of weighted aggregates approaches the shortest path length between the particular source and destination subnets irrespective of the advertisement.

Abstract: A personal Web view is created that includes a plurality of Web clippings. Each Web clipping contains information from a user-selected Web page, which can be essentially any Web page that is accessible on any Web server. In creating the page, the user loads a personalization applet into his browser and retrieves each Web page of interest. The applet then generates an access script for automatically accessing that Web page and the user specifies the attributes of the Web clipping derived from that Web page. A specification of the Web view is then stored in a file. When the Web view specification is later replayed, the Web page for each Web clipping is retrieved and the specified information is extracted. The plural Web clippings are then displayed in a browser in accordance with the specified layout.

Abstract: A system for, and method of, determining a physical topology of a network having multiple subnets. In one embodiment, the system includes: (1) a skeleton path initializer that uses addressing information from elements in the network to develop a collection of skeleton paths of direct physical connections between labeled ones of the elements, the skeleton paths traversing multiple of the subnets and (2) a skeleton path refiner, coupled to the skeleton path initializer, that refines the collection by inferring, from the direct physical connections and path constraints derived therefrom, other physical connections in the skeleton paths involving unlabeled ones of the elements.

Abstract: A system for, and method of, ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph. In one embodiment, the system includes: (1) a timestamp module that creates a unique timestamp for each of the lazy updates and (2) a propagation module, associated with the timestamp module, that employs edges of the directed acyclic copy graph to propagate the lazy updates among replicas in the distributed database according to said unique timestamp and ensure the serialization.

Abstract: A system for, and method of, ensuring serialization of updates from a replica site in a distributed database that is described by a copy graph and a distributed database incorporating the system or the method. In one embodiment, the system includes: (1) a directed acyclic copy graph (DAG) creation module that identifies backedges in, and removes the backedges from, the copy graph to yield a DAG and (2) a propagation module, associated with the DAG creation module, that initially employs eager updating to propagate the updates along the backedges and thereafter employs lazy updating to propagate the updates along edges of the directed acyclic copy graph to ensure the serialization.

Abstract: Systems and method for selecting open shortest path first (OSPF) aggregates and aggregate weights for a particular area. In one embodiment, an aggregate selecting system includes: (1) a database for containing data pertaining to candidate OSPF aggregates and corresponding weights and (2) an aggregate selector, associated with the database, that selects at least a subset of the OSPF aggregates such that the shortest path length between the particular source and destination subnets resulting from advertisement of a set of weighted aggregates approaches the shortest path length between the particular source and destination subnets irrespective of the advertisement.

Abstract: A system for, and method of, ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph. In one embodiment, the system includes: (1) a timestamp module that creates a unique timestamp for each of the lazy updates and (2) a propagation module, associated with the timestamp module, that employs edges of the directed acyclic copy graph to propagate the lazy updates among replicas in the distributed database according to said unique timestamp and ensure the serialization.

Abstract: A system for, and method of, ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph. In one embodiment, the system includes: (1) a forest construction module that creates a forest having trees and edges from the directed acyclic copy graph and (2) a propagation module, associated with the forest construction module, that employs the edges of the forest to propagate the lazy updates among replicas in the distributed database and ensure the serialization.

Abstract: Disclosed is a concurrency control method and related system for permitting the correct execution of multiple concurrent transactions, each comprising one or more read and/or write operations, in a heterogeneous distributed database system. Read and write operations are processed at the required sites if no site cycles are detected. If any site cycles are detected in a read operation, then new sites are searched for. If any site cycle is detected for any of the sites for a write operation, then the transaction is aborted.