Abstract: The present invention relates generally to restoration of services in a network. More particularly, the invention encompasses a scheme for randomized selection of equal cost links during restoration in a communication network. The invention further includes multiple schemes for restoring services. The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.

Abstract: A first log reader publishes first messages to a plurality of queues. The messages comprise changes for transactions extracted from a log by the first log reader. In response to one of the queues becoming unavailable, a second log reader is launched to read and extract from the log, and to publish second messages comprising changes for transactions extracted from the log by the second log reader to the unavailable queue as a catch-up queue. In response to the catch-up queue becoming available and the second log reader reaching the end of the log, the publishing of the second messages for the catch-up queue is transferred from the second log reader to the first log reader.

Abstract: The present invention relates generally to restoration of services in a network. More particularly, the invention encompasses a scheme for randomized selection of equal cost links during restoration in a communication network. The invention further includes multiple schemes for restoring services. The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.

Abstract: A method and system for distributing tasks from an external application among concurrent database application server instances in a database system for optimum load balancing, based on consensus among the instances. Each application instance identifies a task partition ownership by those in a membership group based on a time window and generates a new membership group and partition ownership based on the current partition ownership. The instance makes the new membership group and partition ownership known to other members by recoding them in the membership table and partition map. Each participation by an instance in the membership group is identified by a random number. The new membership group and partition ownership are generated and adjusted based on an average partition allocation to achieve consensus among the instances.

Abstract: A system is disclosed that records position data for portions of a body as a function of time. The position data can be collected from one or more sensors secured to the body either individually or using a patch. The sensors, in some embodiments, can include stretch sensors that produce a change in electrical resistance as the stretch sensors are stretched. A data logger can be used to record the data. Various other elements such as a feedback mechanism or a manual pain indicator can also be included.

Abstract: A method and system provide capacity-efficient restoration within an optical fiber communication system. The system includes a plurality of nodes each interconnected by optical fibers. Each optical fiber connection between nodes includes at least three channel groups with different priority levels for restoration switching in response to a connection failure. The system maintains and restores full-capacity communication services by switching at least a portion of the channel groups from a first optical fiber connection to a second optical fiber connection system based on the priority levels assigned to the channel groups. Service reliability is effectively maintained without to incurring additional costs for dedicated spare optical fiber equipment by improving idle capacity utilization.

Abstract: Switches within a telecommunications network exchange so-called available bandwidth messages, each of which advertises how much bandwidth remains unassigned on a respective link. The network is of a type in which circuits are provisioned with various predefined numbers of time slots (equivalent to bandwidth). The sending of an available bandwidth message for a given link is triggered by a change in the number of time slots available on that link if that change results in a change in the number of circuit bandwidths that can be accommodated by that link for a newly provisioned circuit.

Abstract: Switches within a telecommunications network exchange so-called available bandwidth messages, each of which advertises how much bandwidth remains unassigned on a respective link. The network is of a type in which circuits are provisioned with various predefined numbers of time slots (equivalent to bandwidth). The sending of an available bandwidth message for a given link is triggered by a change in the number of time slots available on that link if that change results in a change in the number of circuit bandwidths that can be accommodated by that link for a newly provisioned circuit.

Abstract: A method and system for provisioning circuits on multiple parallel links with a single setup message is disclosed. A setup message specifying links in a circuit path is transmitted to switches along the circuit path. If a switch determines that a link specified in the setup message has insufficient bandwidth for the circuit, the switch substitutes a parallel link having sufficient bandwidth for the specified link in the circuit path. The setup message can indicate whether substitution for a link is permitted. This can be used to prevent substitution for links when provisioning service routes for new circuits in order to maintain diversity requirements, while allowing substitution for links when provisioning restoration routes for failed circuits in order to reduce restoration time.

Abstract: A method and system for provisioning circuits on multiple parallel links with a single setup message is disclosed. A setup message specifying links in a circuit path is transmitted to switches along the circuit path. If a switch determines that a link specified in the setup message has insufficient bandwidth for the circuit, the switch substitutes a parallel link having sufficient bandwidth for the specified link in the circuit path. The setup message can indicate whether substitution for a link is permitted. This can be used to prevent substitution for links when provisioning service routes for new circuits in order to maintain diversity requirements, while allowing substitution for links when provisioning restoration routes for failed circuits in order to reduce restoration time.

Abstract: The present invention relates generally to routing of circuits in a network. More particularly, the invention encompasses a method and an apparatus for routing circuits using dynamic self-adjusting link weights within a network. The invention further includes multiple schemes for routing circuits with dynamic self-adjusting link weights in a SCN (Switched Communication Network). The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.

Abstract: A method and a system for allocating restoration capacity in a network link in a communications network provides that a common pool of communication capacity is provisioned in a network link, such that the common pool of communication capacity includes spare capacity for new service and restoration capacity. A pool of pre-allocated communication capacity for future growth of at least one connection in the network link is also provisioned. The pool of pre-allocated communication capacity for future growth is available for restoration capacity, but not for spare capacity for new service. The communications network can be, for example, a private line (PL) network, a SONET-based network, an Asynchronous Transfer Mode (ATM)-based network, an Internet Protocol/MultiProtocol Label Switching (IP/MPLS)-based network or a frame relay (FR)-based network.

Abstract: Certain exemplary embodiments can include, but are not limited to, a method that can include, but is not limited to, a plurality of activities, that can include, but are not limited to: via a capacity planning simulation, for a circuit affected by a failure scenario of a communication network: failing the affected circuit; and rendering an indication that a selected unaffected link has a maximum available capacity of at least a predetermined amount of capacity associated with the communication network being fully restorable.

Abstract: The present invention relates generally to restoration of low priority services in a network. More particularly, the invention encompasses a method and an apparatus for delaying the start of the restoration of low priority services in a communication network. The invention further includes multiple schemes for restoring low priority services. The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.

Abstract: Disclosed is a data processing system implemented method, a data processing system and an article of manufacture for executing a query having a union operator. A data processing system implemented method direct the data processing system to execute a query against a database having data objects. The query has sub-queries and having a union operator. The union operator is operable on sub-queries associated with the query. The database is operatively coupled to the data processing system.

Abstract: A first log reader publishes first messages to a plurality of queues. The messages comprise changes for transactions extracted from a log by the first log reader. In response to one of the queues becoming unavailable, a second log reader is launched to read and extract from the log, and to publish second messages comprising changes for transactions extracted from the log by the second log reader to the unavailable queue as a catch-up queue. In response to the catch-up queue becoming available and the second log reader reaching the end of the log, the publishing of the second messages for the catch-up queue is transferred from the second log reader to the first log reader.

Abstract: A first log reader publishes first messages to a plurality of queues. The first messages comprise changes for transactions extracted from a log by the first log reader. In response to one of the queues becoming unavailable, launching a second log reader to read and extract from the log, and to publish second messages comprising changes for transactions extracted from the log by the second log reader to the unavailable queue as a catch-up queue. In response to the catch-up queue becoming available and the second log reader reaches the end of the log, the publishing of the second messages for the catch-up queue is transferred from the second log reader to the first log reader.

Abstract: Disclosed is a data processing system implemented method, a data processing system and an article of manufacture for executing a query having a union operator. The data processing system implemented method directs the data processing system to process a query against data objects. The data objects are operatively coupled to the data processing system. The query includes a parent operator. The parent operator references a union operator. The union operator references sub-queries. The sub-queries reference the data objects. The data processing system implemented method includes noting a set of partitionings for the union operator, the noted set of partitionings being based on the sub-queries and being based on the data objects reference by the sub-queries, and executing the query having the union operator, the execution of the query being based on the noted set of partitionings and the parent operator.

Abstract: The present invention relates generally to restoration of services in a network. More particularly, the invention encompasses a scheme for randomized selection of equal cost links during restoration in a communication network. The invention further includes multiple schemes for restoring services. The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.

Abstract: A method and system provide capacity-efficient restoration within an optical fiber communication system. The system includes a plurality of nodes each interconnected by optical fibers. Each optical fiber connection between nodes includes at least three channel groups with different priority levels for restoration switching in response to a connection failure. The system maintains and restores full-capacity communication services by switching at least a portion of the channel groups from a first optical fiber connection to a second optical fiber connection system based on the priority levels assigned to the channel groups. Service reliability is effectively maintained without incurring additional costs for dedicated spare optical fiber equipment by improving idle capacity utilization.