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:
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 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:
Ethylenically unsaturated, particularly acrylic, monomers are polymerised using a catalyst system including a manganese carbonyl initiator, an organic halogen reactive substrate and an allylic halide chain termination agent. Desirably the manganese carbonyl initiator is a dimanganese compound, particularly dimanganese decacarbonyl (Mn2(CO)10). The catalysis mechanism appears to involve initiator homolysis, abstraction of halogen from the reactive substrate forming an organic free radical which acts as a chain initiator for polymerisation and eventual reaction of the propagating chain radical with the chain terminating agent. The speed or extent of reaction may be modified by the inclusion of Lewis acids in the reaction mixture. The resulting polymers are telechelic and may have different end groups. The polymers can be reacted further to functionalise them and/or to form block copolymers.
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:
A data network wherein network links have an assigned service weight and a restoration weight that are used as factors for respectively determining an optimum primary data path and a back-up data path through the network. The restoration path is used in the event of a failure of the primary service path and a Dijkstra or similar algorithm may be used for determining these paths. Service weights may be assigned to the links to prioritize finding the shortest possible path, whereas restoration weights may be assigned to the links to find a path with the maximum available capacity.
Abstract:
A method, apparatus, and article of manufacture for providing to a signature hash for checking versions of abstract data types. An identifier is constructed for the abstract data type that is substantially unique to the abstract data type, wherein the identifier comprises a concatenation of various attributes for the abstract data type. The constructed identifier is hashed to generate a signature hash value for the abstract data type, which is then stored both in the database and a class definition for the abstract data type. When the class definition is instantiated as a library function, it accesses the abstract data type from the database, and compares the signature hash value from the database and the signature hash value from the class definition in order to verify that the class definition is not outdated. The class definition is outdated when the abstract data type has been altered without the signature hash value being re-generated and re-stored in the database and the class definition.
Abstract:
Flexibility is achieved in provisioning communication rings with an integrated DCS that allows any port that is connected to a line interface unit within the integrated DCS to be coupled within the integrated DCS—pursuant to software controlled provisioning—to any other port that is connected to a line interface unit within the integrated DCS. This is accomplished by merging the cross connect fabrics of the ADM portions of the integrated DCS with the cross connect fabric of the DCS portion of the integrated DCS, by incorporating at least some of the switching controls of the ADMs in the ADM portion of the integrated DCS in the controller of the DCS, and by insuring that the SONET K-bytes can be passed by the controller of the flexible integrated DCS from any line interface unit to any other line interface unit.
Abstract:
A system and method for joining a build table to a probe table in response to a query for data includes executing a hash loops join of the build table and the probe table. Matched rows are joined and output when the rows match each other by satisfying a join predicate. In an outer join, unmatched rows in the probe table are joined to a NULL build table field values and output, such that all rows of the probe table are output regardless of whether they have matched rows in the build table. In an early-out join, on the other hand, a “match once” table defines the probe table and in response to a query for unique probe table outputs, the joining of a probe table row, once joined and output a first time, to any other rows in the other table is prevented regardless of whether the row might match other rows. In both the hash loops early-out join and the hash loops outer join, when the build table is larger than main memory, the roles of the build and probe tables are reversed.
Abstract:
A method of operating a switched communications network redirects certain types of messages away from the switch to free up switch resources for other messages, thereby decreasing the size of switch needed or delaying necessary switch size upgrading. Messages are redirected by intelligent concentrators that can connect certain types of messages to their destinations without routing them through the switch. For example, messages between an origination and a destination connected to the same concentrator need not be sent through the switch. Similarly, messages between originations and certain high-volume, long-duration destinations such as data service gateways can be connected directly without passing through the switch. The intelligent concentrators communicate with the switch on a control channel so that the switch remains aware of the status of each origination or destination (e.g., so that it knows not to attempt to route messages to an origination or destination that is in use).