Patent application number | Description | Published |
20090260276 | Behavior-tuned bed bug trap and monitoring device - A trap for ectoparasitic arthropods with cryptic behavior, such as bed bugs, includes one or more dimensions of attractants, as well as the physical attributes of hiding places preferred by bed bugs. The trap may have an adhesive or fabric layer disposed within it, and the adhesive or fabric layer may include a non-volatile attractant such as a fecal matter attractant. With respect to attractants, such a trap may include one or more of a slow CO | 10-22-2009 |
20130283671 | DEVICES AND METHODS FOR DETECTING AND TRAPPING PESTS - Pest detecting and trapping devices, including insect-trapping sheets defining adhesive surfaces, light sources supported proximate the adhesive surfaces, and power sources configured to deliver power to the light sources. In some examples, pest detecting and trapping devices may be particularly tailored to monitor pest activity within shipping containers during transit. Additionally, this disclosure discusses methods of detecting and trapping pests in shipping containers by providing pest detecting and trapping devices, placing the pest detecting and trapping devices within the shipping containers, and manipulating the pest detecting and trapping devices into closed configurations after passages of time. | 10-31-2013 |
Patent application number | Description | Published |
20080222388 | Simulation of processor status flags - The dynamic efficient and accurate simulation of processor status flags is described. One exemplary embodiment includes simulation of processor status flags of a first CPU type on a second CPU type using simple arithmetic operations to calculate status flags in parallel, and by keeping an intermediate state that allows efficient calculation of status flags when they are needed. In this way, sufficient intermediate state exists to generate desired status flags either directly or with a simple operation. | 09-11-2008 |
20090006750 | Leveraging transactional memory hardware to accelerate virtualization and emulation - Various technologies and techniques are disclosed for using transactional memory hardware to accelerate virtualization or emulation. State isolation can be facilitated by providing isolated private state on transactional memory hardware and storing the stack of a host that is performing an emulation in the isolated private state. Memory accesses performed by a central processing unit can be monitored by software to detect that a guest being emulated has made a self modification to its own code sequence. Transactional memory hardware can be used to facilitate dispatch table updates in multithreaded environments by taking advantage of the atomic commit feature. An emulator is provided that uses a dispatch table stored in main memory to convert a guest program counter into a host program counter. The dispatch table is accessed to see if the dispatch table contains a particular host program counter for a particular guest program counter. | 01-01-2009 |
20090006751 | Leveraging transactional memory hardware to accelerate virtualization and emulation - Various technologies and techniques are disclosed for using transactional memory hardware to accelerate virtualization or emulation. A central processing unit is provided with the transactional memory hardware. Code backpatching can be facilitated by providing transactional memory hardware that supports a facility to maintain private memory state and an atomic commit feature. Changes made to certain code are stored in the private state facility. Backpatching changes are enacted by attempting to commit all the changes to memory at once using the atomic commit feature. An efficient call return stack can be provided by using transactional memory hardware. A call return cache stored in the private state facility captures a host address to return to after execution of a guest function completes. A direct-lookup hardware-based hash table is used for the call return cache. | 01-01-2009 |
20090007107 | Leveraging transactional memory hardware to accelerate virtualization emulation - Various technologies and techniques are disclosed for using transactional memory hardware to accelerate virtualization or emulation. One or more central processing units are provided with transactional memory hardware that is operable to accelerate virtualization. The transactional memory hardware has a facility to maintain private state, a facility to render memory accesses from other central processing units visible to software, and support for atomic commit of the private state. The transactional memory hardware can be used, for example, to facilitate emulation of precise exception semantics. The private state is operable to enable an emulated state to remain inconsistent with an architectural state and only synchronized on certain boundaries. An optimized sequence of instructions is executed using chunk-accurate simulation to try and achieve a same end effect. | 01-01-2009 |
20090030668 | SIGNED/UNSIGNED INTEGER GUEST COMPARE INSTRUCTIONS USING UNSIGNED HOST COMPARE INSTRUCTIONS FOR PRECISE ARCHITECTURE EMULATION - Architecture for efficient translation and processing of PowerPC guest instructions on an x86 host machine. In an x86-based architecture, signed integer values are projected into the unsigned integer value space for processing by the host using the negation of the left-most (sign) bit. Compare operations are performed in the unsigned space and the compare results are written into the host flags register. Once the compare results are written into the host flags register, the flag values can be read out and used in a table lookup to retrieve the corresponding values for the guest register. The guest flag values are then passed into the guest flags register for processing by the guest application. | 01-29-2009 |
Patent application number | Description | Published |
20120224845 | ADMINISTRATIVE BOUNDARIES IN SINGLE OR MULTIPLE DOMAIN OPTICAL NETWORKS - The present disclosure provides systems and methods for administrative boundaries in a single domain optical network such as emulation of an External network-network interface (ENNI) using an Internal-Network to Network Interface (INNI). For example, in a single monolithic domain, a network and associated network elements may discover network elements, build topology, compute paths, establish new calls, etc. A user may identify/mark specific links as emulated “ENNI” links with the specific links actually being INNI links. As a call traverses this emulated link, a new call is initiated (much in the same way a new call segment would be created for a call). Signaling proceeds as normal. When the call set-up is fully complete, instead of a single call segment, many call segments exists. Advantageously, this allows use of INNI control plane features while allowing a network operator to future-proof their network by installing call segments at future boundary points. | 09-06-2012 |
20130007230 | METHOD OF NETWORK RECONFIGURATION IN OPTICAL TRANSPORT NETWORKS - A method of reconfiguring a network having a transport plane for carrying subscriber traffic flows within end-to-end connections, a control plane for managing at least a portion of resources of the transport plane allocated to each connection, and a management plane for implementing management functions in the control plane and any resources of the transport plane that are not managed by the control plane. The method comprises installing an updated version of a control plane name space for a target node of the network. For each connection traversing the target node: a control plane to management plane migration is performed for removing connection state in the control plane associated with the connection, so as to transfer ownership of the connection from the control plane to the management plane; followed by a management plane to control plane migration for installing new connection state in the control plane associated with the connection, so as to transfer ownership of the connection from the management plant to the control plane, the new connection state being defined using the updated version of the control plane name space. | 01-03-2013 |
20130272318 | COMMUNICATION LINK BANDWIDTH FRAGMENTATION AVOIDANCE - A method and system for routing a connection on a communication network. A first bandwidth pool is classified as a long lived bandwidth pool and a second bandwidth pool is classified as a short lived bandwidth pool. The long lived bandwidth pool is used to route connections having a duration that are expected to equal or exceed a predetermined time. The short lived bandwidth pool is used to route connections having a duration that are not expected to exceed the predetermined time. A request to route a connection on the communication network is received. At least one characteristic of the connection is determined and is used to determine whether to route the connection on the long lived bandwidth pool or short lived bandwidth pool. | 10-17-2013 |
20140044008 | CONSTRAINING TOPOLOGY SIZE AND RECURSIVELY CALCULATING ROUTES IN LARGE NETWORKS - A method of managing a network comprising a plurality of nodes. Each node maintains a respective topology database containing topology information of the network within a local region of the node, the local region encompassing a subset of the plurality of nodes of the network. The nodes of the network implementing a Recursive Path Computation algorithm to compute end-to-end routes through the network. | 02-13-2014 |
20140314409 | INTELLIGENT AND SCALABLE ROUTING IN MULTI-DOMAIN OPTICAL NETWORKS - A method of extending the control plane to a metro sub-domain for a network having a transport plane for carrying subscriber traffic within end-to-end connections, and a control plane for managing at least a portion of resources of the transport plane allocated to the connections. A first set of control-plane enabled nodes of the network is designated as core nodes, each core node being operable to route subscriber traffic between a pair of neighbor core nodes in the network. A second set of control-plane enabled nodes of the network is designated as metro nodes, each metro node being connected to a core node and operating as a sub-domain of the network. Each core node that is connected to at least one metro node is designated as a host node. The host node is controlled to advertise summary information of its connected metro nodes to other core and metro nodes in the network, thus making it possible to extend control plane function to the metro nodes that can calculate connection routes, set-up/tear-down connections and perform connection failure recovery functions. | 10-23-2014 |
Patent application number | Description | Published |
20080281987 | FACILITATING AUTOMATIC PROTECTION SWITCHING FOR PROVIDER BACKBONE NETWORK - An existing protection mechanism is enhanced through the use of an automatic protection switching protocol data unit (APS PDU). In conjunction with transmitting Ethernet frames to a second bridge over a primary path, a first bridge transmits APS PDUs to the second bridge over a secondary path. The APS PDUs provide the second bridge with information about the protection switching mechanism being used and provide indications regarding the status of the primary path. In particular, protection switching may be facilitated by forming an APS PDU that is extended to include an indication of an identity for a trunk or a primary path before transmitting the APS PDU to the second bridge. Alternatively, after forming a regular APS PDU, protection switching may be facilitated by encapsulating the regular APS PDU with information identifying a trunk or a primary path before transmitting the APS PDU to the second bridge. | 11-13-2008 |
20100074101 | Distributed Connection Establishment and Restoration - Connection constraints are flooded using an extension to a routing protocol being used to control forwarding on network. Nodes maintain topology and connection database and calculate routes for connections based on the constraints. If a node is on a calculated route for a connection it will install forwarding state for the connection. Since each node has a consistent view of the network topology and has been provided with the constraints associated with the connection, each node on the network will calculate the same route for the connection. When a failure occurs, the nodes will calculate restoration paths for the connections on a network-wide priority basis to enable restoration paths to be created for the affected connections without requiring the restoration paths to be signaled. Time-stamps are used to allow events to be applied by nodes in a consistent order regardless of the order in which they arrive. | 03-25-2010 |
20100118878 | METHOD AND APPARATUS FOR NON-DISRUPTIVE CALL MODIFICATION - A method and system for changing the extent of data plane resources controlled by a control plane for a network connection which spans a contiguous set of nodes controlled by existing network control resources is disclosed. This is done in a non-disruptive manner. This typically involves two steps: i) Creating a new set of control plane resources for said network connection such that said data plane resources are shared with said existing network control resources; and ii) then terminating the existing network control resources such that said data plane resources are fully transferred to the new set of control plane resources without disrupting said network connection. The existing network control resources can be either a control plane resource or a non control plane resource. An example of a non control plane resource is network management software (e.g., an OSS (Operation Support System)), which forms part of the Management Plane. It should be noted that this does not need to be done for a complete end-to-end connection, but rather can be executed for the portion of the end-to-end connection which is to be controlled by the control plane. | 05-13-2010 |
20110206044 | Link Bundled Co-Routed VCAT Via RSVP Message Bundling - Multiple RSVP messages are used to separately signal components of co-routed VCAT to enable the separate components to be implemented on different physical fibers of a link bundle. To enable the PATH messages to be handled as a group, the multiple PATH messages are grouped together and sent out in a RSVP bundle message. When a RSVP bundle message containing multiple PATH messages is received at a network element, such as an ENNI, where the route for the PATH messages needs to be expanded, the route is expanded collectively rather than individually. Specifically, the route will first be expanded and this expanded route will be inserted into each individual PATH message. The modified PATH messages with the expanded route will then be passed through the RSVP finite state machine one at a time to enable resources to be reserved for the connections of the VCAT. Thus, a single LSP may be created for each channel, and the channels may be co-routed even where route expansion is required. | 08-25-2011 |
20110219128 | FAST VIRTUAL CONCATENATION SETUP - The invention is directed to optimizing setup of a VCAT connections using (largest) CCAT containers so as to minimize the number of cross-connection commands needed to enable data transfer. A system and method are provided for enhancing VCAT networks to include faster service restoration rates and faster connection setup times. One embodiment includes expanding available VCAT timeslots to include available CCAT timeslots. A routing and signaling control module alerts a source network element, internal network elements and a destination network element that the data transmission includes VCAT payloads rather than the expected CCAT payloads. By issuing this alert, the routing and signaling control module instructs an end-point monitoring function to overlook any mismatch between the expected CCAT rate and the received VCAT traffic. Otherwise, if the mismatch is not overlooked, then the end-point monitoring function will squelch the received VCAT traffic, which terminates the data communication | 09-08-2011 |
20110255443 | VIRTUAL ROUTERS FOR GMPLS NETWORKS - Virtual routers that abstract photonic sub-domains are provided for GMPLS networks. A virtual router uses a link viability matrix to keep track of the set of viable connections between inputs and outputs of a photonic sub-domain. A virtual router may receive RSVP-TE signaling messages and either allocate a working input to output link pair or, if explicitly signaled, verify that the requested link is currently viable. A virtual router also advertises, in its link state updates, the current set of possible outputs for any input link. Shortest path computations can be implemented utilizing virtual routers by modifying a topology graph in accordance with the link viability matrix of the virtual router. | 10-20-2011 |
20130308948 | EXTENDING CONTROL PLANE FUNCTIONS TO THE ENTWORK EDGE IN AN OPTICAL TRANSPORT NETWORK - A method of extending the control plane to a network edge for a network having first set of nodes of the network are designated as core nodes, each core node being operable to route subscriber traffic between a pair of neighbour core nodes and a second set of control-plane enabled nodes of the network designated as tail nodes, each tail node connected to a core node and operating only as a source or sink of subscriber traffic. Each core node that is connected to at least one tail node is designated as a host node. The host node is controlled to advertise summary information of its connected tail nodes to other core and tail nodes in the network, thus making it possible to extend control plane function to the tail nodes which can calculate connection routes, set-up/tear-down connections and perform connection failure recovery functions. | 11-21-2013 |
20140078901 | Link Bundle Co-Routed VCAT Via RSVP Message Bundling - Multiple RSVP messages are used to separately signal components of co-routed VCAT to enable the separate components to be implemented on different physical fibers of a link bundle. To enable the PATH messages to be handled as a group, the multiple PATH messages are grouped together and sent out in a RSVP bundle message. When a RSVP bundle message containing multiple PATH messages is received at a network element, such as an ENNI, where the route for the PATH messages needs to be expanded, the route is expanded collectively and the expanded route is inserted into each individual PATH message. The modified PATH messages are then passed through the RSVP finite state machine one at a time to enable resources to be reserved for the connections of the VCAT. Thus, a single LSP may be created for each channel, and channels may be co-routed even where route expansion is required. | 03-20-2014 |
20140286344 | DISTRIBUTED CONNECTION ESTABLISHMENT AND RESTORATION - Connection constraints are flooded using an extension to a routing protocol being used to control forwarding on network. Nodes maintain topology and connection database and calculate routes for connections based on the constraints. If a node is on a calculated route for a connection it will install forwarding state for the connection. Since each node has a consistent view of the network topology and has been provided with the constraints associated with the connection, each node on the network will calculate the same route for the connection. When a failure occurs, the nodes will calculate restoration paths for the connections on a network-wide priority basis to enable restoration paths to be created for the affected connections without requiring the restoration paths to be signaled. Time-stamps are used to allow events to be applied by nodes in a consistent order regardless of the order in which they arrive. | 09-25-2014 |
Patent application number | Description | Published |
20100022813 | Process for Reducing Ethylbenzene Content from an Aromatic Stream - A method of reducing the ethylbenzene content in a stream containing xylene is disclosed. The method includes the reaction of ethylbenzene, such as a disproportionation or transalkylation reaction, to produce benzene and other hydrocarbon compound and can include the separation of at least a portion of the resulting benzene and other hydrocarbon compounds to produce a xylene stream having reduced ethylbenzene content. | 01-28-2010 |
20100185035 | Nb/Mordenite Transalkylation Catalyst - A niobium-modified mordenite catalyst can be made from water soluble niobium precursors such as niobium oxalate and ammonium niobate(V) oxalate and can be used in toluene disproportionation reactions. Embodiments can provide a toluene conversion of at least 30 wt % of the toluene feed with selectivity to benzene above 40 wt % of the reaction product composition and to xylenes above 40 wt % of the reaction product composition and non-aromatics selectivity of less than 1.0 wt % of the reaction product composition. | 07-22-2010 |
20110253596 | Regenerable Composite Catalysts for Paraffin Aromatization - A composite catalyst for aromatization of paraffins includes a molecular sieve catalyst and metal dehydrogenation catalyst present as discrete catalysts in a physical admixture. The molecular sieve catalyst can be a zeolite and the metal dehydrogenation catalyst can be in the form of a nanoctructure, such as zinc oxide nanopowder. The catalyst can convert feedstocks such as LPG to aromatics and can be regenerated in-situ. | 10-20-2011 |
20110295048 | Rhenium Promoted Catalyst - A group V metal/rhenium-modified molecular sieve catalyst can be used in hydrocarbon conversion reactions. Embodiments can provide a toluene conversion of at least 30 wt % with selectivity to benzene above 40 wt % and to xylenes above 40 wt % and non-aromatics selectivity of less than 2.0 wt %. | 12-01-2011 |
20130331628 | Rhenium Promoted Catalyst - A group V metal/rhenium-modified molecular sieve catalyst can be used in hydrocarbon conversion reactions. Embodiments can provide a toluene conversion of at least 30 wt % with selectivity to benzene above 40 wt % and to xylenes above 40 wt % and non-aromatics selectivity of less than 2.0 wt %. | 12-12-2013 |
20140357916 | Rhenium Promoted Catalyst - A group V metal/rhenium-modified molecular sieve catalyst can be used in hydrocarbon conversion reactions. Embodiments can provide a toluene conversion of at least 30 wt % with selectivity to benzene above 40 wt % and to xylenes above 40 wt % and non-aromatics selectivity of less than 2.0 wt %. | 12-04-2014 |