Abstract: A method of routing data that is part of a grid job. The method also includes receiving a data packet in a first computer environment. The method also includes determining whether the data packet is identified as part of the grid job. The method also includes routing the data packet that is identified as part of the grid job through at least one firewall to a second computer environment. The method also includes where the data packet that is identified as part of the grid job does not have a destination address.

Abstract: A call flow manager includes a graph of connected nodes implementing a call center routing flow, and corresponding views for examining and modifying the nodes and graph. The call flow manager implements a set of fundamental node types, with complexity and behavior encapsulated within the nodes. The nodes process calls and add tags to the calls that may be utilized in downstream nodes of the call flow.

Abstract: Various embodiments disclosed herein are related to a non-transitory computer readable storage medium. In some embodiments, the medium includes instructions stored thereon that, when executed by a processor, cause the processor to determine, in a cluster of host machines, a priority level of telemetry data collected in the cluster, at least based on a data type of the telemetry data and a tag and store the telemetry data in a storage in the cluster. In some embodiments, a quality-of-service (QoS) is associated with the priority level. In some embodiments, the storage is associated with the priority level. In some embodiments, the medium includes the instructions stored thereon that, when executed by the processor, cause the processor to send the telemetry data from the storage to a server in accordance with the QoS, wherein the server is separate from the cluster.

Abstract: A method may include determining, with a queue availability module, that an entry is available in a queue, asserting a bit in a register based on determining that an entry is available in the queue, determining, with a processor, that the bit is asserted, and processing, with the processor, the entry in the queue based on determining that the bit is asserted. The method may further include storing the register in a tightly coupled memory associated with the processor. The method may further include storing the queue in the tightly coupled memory. The method may further include determining, with the queue availability module, that an entry is available in a second queue, and asserting a second bit in the register based on determining that an entry is available in the second queue. The method may further include finding the first bit in the register using a find first instruction.

Abstract: A device receives network segment information identifying network segments associated with a network, and receives endpoint host session information identifying sessions associated with endpoint hosts communicating with the network. The device generates, based on the network segment information and the endpoint host session information, a data structure that includes information associating the network segments with the sessions associated with the endpoint hosts. The device updates the data structure based on changes in the sessions associated with the endpoint hosts and based on changes in locations of the endpoint hosts within the network segments, and identifies, based on the data structure, a particular endpoint host, of the endpoint hosts, that changed locations within the network segments. The device determines a threat policy action to enforce for the particular endpoint host, and causes the threat policy action to be enforced, by the network, for the particular endpoint host.

Abstract: Methods and apparatus are provided for periodic message transmission. Transmission of messages by the apparatus onto a communication bus are enabled during time ticks. The time ticks are separated by tick time intervals. A plurality of periodic messages configured to be transmitted on the communication bus are identified. Each periodic message has a periodicity that is a multiple of the tick time interval. The periodic messages are sorted by increasing periodicities to generate a sequence of periodic messages. A zero-start-up delay is assigned to a first periodic message in the sequence. A start-up delay is generated for each periodic message in the sequence based on a previous start-up delay associated with a previous periodic message, the tick time interval, and a periodicity of that periodic message. A transmission schedule is generated for the periodic messages based on the start-up delay and the periodicity associated with each of the periodic messages.

Abstract: A system includes processing circuitry; and a memory device including instructions embodied thereon, wherein the instructions, which when executed by the processing circuitry, configure the processing circuitry to perform operations comprising: accessing input data, at an aggregator node, the input data including sensor data from a plurality of sensor nodes, each sensor data having a respective signature; validating the sensor data by using respective cryptographic hash functions on the sensor data and evaluating the respective result using the respective signature; performing an aggregation function on the sensor data to produce aggregate data; executing a hash function on the aggregate data to produce a hash value for the aggregate data; bundling the sensor data, respective signatures of the sensor data, aggregate data, and hash value for the aggregate data in a data structure; and exposing the data structure to subscriber nodes on the IoT network.

Abstract: Some embodiments provide a method for a global manager that manages a logical network spanning multiple physical sites. The method receives a set of data describing a modification to a definition of the logical network. From multiple queues that each correspond to a different one of the physical sites spanned by the logical network, the method identifying a set of queues to which to store the received set of data. The method stores the received set of data in the identified set of queues. From each respective queue in the identified set of queues, the method sends the set of data through a respective channel between the global manager and a respective local manager at the respective physical site corresponding to the respective queue.

Abstract: Attributes of graphics objects are processed in a plurality of graphics processing pipelines. A streaming multiprocessor (SM) retrieves a first set of parameters associated with a set of graphics objects from a first set of buffers. The SM performs a first set of operations on the first set of parameters according to a first phase of processing to produce a second set of parameters stored in a second set of buffers. The SM performs a second set of operations on the second set of parameters according to a second phase of processing to produce a third set of parameters stored in a third set of buffers. One advantage of the disclosed techniques is that work is redistributed from a first phase to a second phase of graphics processing without having to copy the attributes to and retrieve the attributes from the cache or system memory, resulting in reduced power consumption.

Abstract: A method may include determining, with a queue availability module, that an entry is available in a queue, asserting a bit in a register based on determining that an entry is available in the queue, determining, with a processor, that the bit is asserted, and processing, with the processor, the entry in the queue based on determining that the bit is asserted. The method may further include storing the register in a tightly coupled memory associated with the processor. The method may further include storing the queue in the tightly coupled memory. The method may further include determining, with the queue availability module, that an entry is available in a second queue, and asserting a second bit in the register based on determining that an entry is available in the second queue. The method may further include finding the first bit in the register using a find first instruction.

Abstract: Systems, apparatus, and methods for effectively allowing consumers to request promotions from a merchant are discussed herein. Some embodiments may provide for a networked device, apparatus, or server configured to: in response to determining that a merchant device is not associated with at least one available promotion, determine, via a processor, a promotion request threshold value indicating a required number of promotion requests for generating a promotion associated with the merchant device; receive a plurality of promotion requests from a plurality of consumer devices via the network; calculate, via the processor, a promotion request count associated with the plurality of promotion requests; and in response to determining that the promotion request count satisfies the promotion request threshold value, generate a promotion offer request indicating a request to generate the promotion.

Abstract: Techniques for reduction and acceleration of a deterministic finite automaton (DFA) are disclosed. In some embodiments, a system, process, and/or computer program product for reduction and acceleration of a DFA includes receiving an input value; performing a reduced deterministic finite automaton lookup using a lookup key, wherein the lookup key comprises a current state and the input value; and determining a next state based on the lookup key.

Abstract: The subject matter described herein includes methods, systems and computer media for monitoring communications networks using cross-correlation of packet flows. One method for monitoring a communications network using cross-correlation of packet flows includes receiving a plurality of packets copied from a communications network. The method further includes classifying the packets into flows. The method further includes, for at least one of the flows, generating a trace value sequence, where the trace value sequence is sequence of values that characterizes the flow according to a cross-correlation metric. The method further includes performing a frequency domain cross-correlation for the at least one flow using the trace value sequence. The method further includes outputting an indication of a network or flow characteristic based on results of the cross-correlation.

Abstract: Some embodiments provide a method for a managed forwarding element (MFE) operating within a first data compute node (DCN) that executes on a first host machine. The MFE is for implementing a logical network that logically connects the first DCN to a plurality of other DCNs. At the MFE, the method receives several packets generated within the first DCN to be forwarded to a second DCN that is logically connected to the first DCN. The method determines whether the second DCN executes on the first host machine or on a second, different host machine. When the second DCN executes on the first host machine, the method stores the packets in a memory space of the first host machine that is shared between the first and second DCNs.

Abstract: An apparatus may include a circuit configured to determine a first encoded address is in a bitwise range of addresses, determine a first physical address in a storage memory from the first encoded address using bitwise mapping and retrieve first data from the first physical address in the storage memory. The circuit may further be configured to determine a second encoded address is in an offset linear range of addresses, determine a second physical address in the storage memory from the second encoded address using offset linear mapping and write second data to the second physical address in the storage memory.

Abstract: An apparatus and a method for transmitting a multimedia frame through a heterogeneous network in a broadcast system supporting a multimedia service based on an internet protocol are provided. The method includes generating header information including a frame identifier distinguishing a multimedia frame and information measuring a quality of a connection service between network layers and end-to-end network capabilities, and combining the header information and multimedia data to configure the multimedia frame.

Abstract: A receiving circuit of a communications link comprises: a first data buffer configured to input, under control of a first clock signal, data of a first data stream transmitted by a transmitting circuit, and to generate a credit trigger signal indicating when a data value is read from the first data buffer, wherein data is read from the first data buffer, or from a further data buffer coupled to the output of the first data buffer, under control of a second clock signal; and a credit generation circuit configured to generate, based on the credit trigger signal, a credit signal for transmission to the transmitting circuit under control of the first clock signal, the credit signal indicating that one or more further data values of the first data stream can be transmitted by the transmitting circuit.

Abstract: An embodiment of the invention may include a method, computer program product, and system for network attached storage configuration. The embodiment may include receiving a request, from a network storage administrator, to create a network share on a network attached storage for a network server. Based on the received request, sending an operating system identifier probe to the network server to identify an operating system deployed on the network server. The embodiment may include receiving an identification of the operating system deployed on the network server. Based on the identified operating system deployed on the network server, configuring the network share on the network attached storage. Configuring the network share on the network attached storage may include selecting a network protocol filesystem type compatible with the identified operating system deployed on the network server. The embodiment may include testing compatibility between the network share and network server.

Abstract: The present invention discloses a method and an apparatus for extracting data stream information by an Ethernet switch chip in a low-latency mode. The method includes: setting, by a data feature extraction module, one piece of starting information including feature information and one piece of ending information including a packet length; performing matching, by a data stream feature comparison module, on the feature information, and if the matching succeeds, sending the starting information and the ending information to a module for collecting statistics on data stream information; and combining, by the module for collecting statistics on data stream information, the feature information in the starting information and the packet length in the ending information into one piece of data stream information, and sending the data stream information to a CPU.

Abstract: The subject matter described herein includes methods, systems and computer media for monitoring communications networks using cross-correlation of packet flows. One method for monitoring a communications network using cross-correlation of packet flows includes receiving a plurality of packets copied from a communications network. The method further includes classifying the packets into flows. The method further includes, for at least one of the flows, generating a trace value sequence, where the trace value sequence is sequence of values that characterizes the flow according to a cross-correlation metric. The method further includes performing a frequency domain cross-correlation for the at least one flow using the trace value sequence. The method further includes outputting an indication of a network or flow characteristic based on results of the cross-correlation.

Abstract: An apparatus comprises a processor configured to create a Dynamic Adaptive Streaming over Hypertext Transfer Protocol (DASH) media presentation description (MPD), wherein the MPD comprises an AssetIdentifier element associated with a period, wherein the AssetIdentifier element specifies that the period belongs to a certain asset, and wherein the asset is content including media and metadata together with the rights to use the content by a content provider, and a transmitter configured to transmit the MPD. An apparatus comprises a receiver configured to receive a Dynamic Adaptive Streaming over Hypertext Transfer Protocol (DASH) media presentation description (MPD), wherein the MPD comprises an AssetIdentifier element associated with a period, wherein the AssetIdentifier element specifies that the period belongs to a certain asset, and wherein the asset is content including media and metadata together with the rights to use the content by a content provider, and a processor configured to process the MPD.

Abstract: An embodiment of the invention may include a method, computer program product, and system for network attached storage configuration. The embodiment may include receiving a request, from a network storage administrator, to create a network share on a network attached storage for a network server. Based on the received request, sending an operating system identifier probe to the network server to identify an operating system deployed on the network server. The embodiment may include receiving an identification of the operating system deployed on the network server. Based on the identified operating system deployed on the network server, configuring the network share on the network attached storage. Configuring the network share on the network attached storage may include selecting a network protocol filesystem type compatible with the identified operating system deployed on the network server. The embodiment may include testing compatibility between the network share and network server.

Abstract: A method includes, with a computing system, receiving a plurality of packets for transcoding, the plurality of packets comprising a first set of packets having data in a first format and a second set of packets having data in a second format, with the computing system, placing the first set of packets in a first queue, the first queue comprising packets from more than one communication session, with the computing system, placing the second set of packets in a second queue, the second queue having packets from more than one communication session, with the computing system, processing packets of the first queue with a graphics processing unit, and with the computing system, after processing the packets of the first queue with the graphics processing unit, processing packets of the second queue with the graphics processing unit.

Abstract: A circuit for merging streams of data to generate sorted output data is described. The circuit comprises a first input coupled to receive a first data stream having a first set of N values; a second input coupled to receive a second data stream having second set of N values; a routing circuit coupled to the first input and the second input, the routing circuit enabling the routing of the first set of N values of the first data stream and the second set of N values of the second data stream; and a comparator circuit coupled to receive each value of the first set of N values and the second set of N values from the routing circuit, the comparator circuit having N comparators, wherein each comparator of the N comparators is coupled to receive a value of the first set of N values and a value of the second set of N values. A method of merging streams of data is also disclosed.

Abstract: An apparatus is provided, which includes monitor circuitry for monitoring the behaviour of processing circuitry and for generating at least a packet indicating the behaviour. Compare circuitry compares the packet to a base packet and generates a delta packet based on the comparison. Compress circuitry forms a compressed packet on the basis of the delta packet. Output circuitry outputs the compressed packet and update circuitry updates the base packet in dependence on one or more triggers.

Abstract: A described embodiment of the present invention includes a network having a first, second and third plurality of routers connected to a plurality of endpoints. At least one of the first plurality of routers includes a plurality of interposers having a number of queues. The at least one of the first plurality of routers has a demultiplexer for each interposer configured to receive multiplexed data from the interposer and provide demultiplexed data on to a plurality of second queues corresponding to the first queues of the number of queues. The at least one of the first plurality of routers also includes a number multiplexers, each of the number multiplexers having inputs configured to receive data from the number of queues.

Abstract: An apparatus, method, system, and program product are disclosed for command-based storage scenario prediction. A registration module registers a listener to receive notifications associated with a scenario, which comprises a predefined sequence of a plurality of commands. A command module determines an initial scenario sequence comprising a subset of the plurality of commands of the scenario. A monitor module detects execution of commands on a device. A notification module sends a notification to the listener in response to detecting execution of a sequence of commands comprising the initial scenario sequence. The notification includes a hint indicating to the listener to prepare for one or more remaining commands of the scenario.

Abstract: Embodiments are directed towards generating and managing schedules. In at least one of the various embodiments, these schedules may be configured to schedule team members, rotating which team member is active (“on-call”). In at least one of the various embodiments, these may be employed to determine which resource is responsible to respond and/or resolve incidents that may be reported and/or detected. In at least one of the various embodiments, if a team member is determined to be the on-call or responsible team member, the notification engine may determine the methods for notify the responsible of the incidents. Schedules previews may be updated in real-time as the schedule is edited.

Abstract: A method, system and computer program product are disclosed for compressing encrypted data, wherein the data is encrypted by using a block encryption algorithm in a chained mode of operation, and the encrypted data is comprised of a set of N encrypted blocks, C1 . . . CN. In one embodiment, the method comprises leaving block CN uncompressed, and compressing all of the blocks C1 . . . CN in a defined sequence using a Slepian-Wolf code. In an embodiment, the data is encrypted using an encryption key K, and the compressing includes compressing all of the blocks C1 . . . CN without using the encryption key. In one embodiment, the compressing includes outputting the blocks C1 . . . CN as a set of compressed blocks CmprC1 . . . CmprCN-1, and the method further comprises decrypting CN to generate a reconstructed block {tilde over (X)}n, and decrypting and decompressing the set of compressed blocks using {tilde over (X)}n.

Abstract: A wireless communication apparatus stores therein, in an associated manner, each piece of path information on a plurality of destinations and a use frequency of data communication that is performed by using the path information. When the wireless communication apparatus receives data whose send source is a first destination, the wireless communication apparatus specifies, on the basis of the use frequency, path information that is less frequently used from among the pieces of the stored path information. The wireless communication apparatus updates the specified path information to path information whose destination is the first destination.

Abstract: In one embodiment, a system includes a hardware processor and logic integrated with and/or executable by the processor. The logic is configured to classify a traffic flow into a traffic class based on at least one criteria related to the traffic flow and request that a credit manager remap flow credits corresponding to a first traffic class to flow credits corresponding to a second traffic class. In another embodiment, a method for providing credit-based flow control includes classifying a traffic flow into a traffic class based on at least one criteria related to the traffic flow, the traffic class being selected from a plurality of traffic classes. The method also includes storing an identifier indicating the traffic class of packets of the traffic flow according to a virtual local area network (VLAN) identifier in a three bit VLAN tag portion of a header of one or more of the packets.

Abstract: A method of updating a document object model (DOM) is disclosed. A message is received from a web browser requesting for information to update the DOM. A dummy response message is sent to the web browser, wherein the dummy response message does not include the information to update the DOM, and wherein the dummy response message causes the web browser to create a dummy node in the DOM. A request message is received from a client as part of a client-server protocol, wherein the request message requests at least a portion of the information to be sent to the client. A first response message is sent including at least a portion of the information to the client, wherein the first response message is processed by the client to determine a first update to the DOM, and wherein the first update is applied to the DOM.

Abstract: A method of routing data that is part of a grid job including steps of: receiving a data packet at a routing device; determining whether the data packet is identified as part of a grid job; and routing the data packet that is identified as part of a grid job through the Internet to an external node.

Abstract: Techniques for automating configuration and migrating configurations of assets in a storage area network (SAN). For example, a method comprises the following steps. An element representing an event in a project is generated. One or more assets are added to the element. A group within the element including a sub-set of the one or more assets from the element is generated, wherein the one or more assets in the sub-set are to be configured.

Abstract: Embodiments provide bandwidth efficient mechanisms for delivering data to a receiver device via a wireless broadcast network such that data may be assembled in the receiver device for use by a local application. In the various embodiments, data files may be broadcast as content elements via the broadcast network using the FLUTE protocol during a FLUTE session. In an embodiment, the content elements may be broadcast according to a broadcast schedule that may identify a time at which the content elements will be broadcast and the broadcast schedule may be communicated in a file delivery table (FDT) transmitted during a FLUTE session.

Abstract: A method of updating a document object model (DOM) is disclosed. A request by a web browser for information to update the DOM is intercepted by intercepting an interaction with the DOM. The request is converted to a server request as part of a client-server protocol, requesting at least a portion of the information from a server. The server request is sent to the server. A first server response including at least a portion of the information from the server is received. The first server response is processed according to the client-server protocol to determine a first update to the DOM. The first update is applied to the DOM.

Abstract: Systems and methods for controlling data traffic offload to a WLAN (e.g., a Wi-Fi network) from a WWAN (e.g., a 4G LTE network) are generally disclosed herein. One embodiment includes data traffic offload techniques managed by a Radio Resource Control (RRC) in a networked device including offloading data at the IP, PDCP, RLC, or MAC layers; another embodiment includes data traffic offload techniques managed by a MAC Scheduler with RRC control. Configurations for multimode user equipment (UE) and multimode base stations are also described herein, including configurations for implementing a Multiple Radio Access Technology (Multi-RAT) aggregation function to offload data from a WWAN to a WLAN and transmit the data via the WLAN using a Layer 2 transport.

Abstract: A network includes node devices each storing a table that manages paths to plural gateway devices for connecting to another network. A node device generates a hello frame for specifying a main gateway device of the node device at a predetermined timing, and transmits the hello frame to adjacent node devices. The node device, upon receiving a hello frame from an adjacent node device operating as a first hop destination of a data frame destined for the main gateway device, determines whether quality of a path to the main gateway device is lowest among paths to the plural gateway devices, based on path quality information included in the hello frame. When the quality of a path to the main gateway device is lowest, the node device changes the main gateway device to a gateway device that is registered in the table and specified by information included in the hello frame.

Abstract: Probabilistic arbitration is combined with distance-based weights to achieve equality of service in interconnection networks, such as those used with chip multiprocessors. This arbitration desirably used incorporates nonlinear weights that are assigned to requests. The nonlinear weights incorporate different arbitration weight metrics, namely fixed weight, constantly increasing weight, and variably increasing weight. Probabilistic arbitration for an on-chip router avoids the need for additional buffers or virtual channels, creating a simple, low-cost mechanism for achieving equality of service. The nonlinearly weighted probabilistic arbitration includes additional benefits such as providing quality-of-service features and fairness in terms of both throughput and latency that approaches the global fairness achieved with age-base arbitration. This provides a more stable network by achieving high sustained throughput beyond saturation.

Abstract: Disclosed is a method and apparatus for pre-fetching child states in an NFA cell array. A pre-fetch depth value is determined for each transition in an NFA graph. The pre-fetch depth value is accessed for transition from an active state in the NFA graph. The child states of the active state are pre-fetched to the depth of the pre-fetch depth value recursively. A loader loads the pre-fetched states into the NFA cell array.

Abstract: A method for providing a virtualization system includes receiving a plurality of virtualization system requirements from a customer that include a plurality of information handling systems (IHSs), at least one storage, and a plurality of configuration details. A primary IHS and a secondary IHS are designated, and configuration data, an application interface, and a primary IHS operating system are provided on the primary IHS. Following physical connection of the plurality of the IHSs and in response to activation of the primary IHS, a primary IHS first boot process initiates the application interface that then automatically activates the secondary IHS and uses the configuration data to automatically configure the at least one storage. In response to activation of the secondary IHS, a secondary IHS operating system on the secondary IHS initiates a secondary IHS first boot process that automatically configures virtualization software installed on the secondary IHS.

Abstract: A method of updating a document object model (DOM) is disclosed. A request by a web browser for information to update the DOM is intercepted by intercepting an interaction with the DOM. The request is converted to a server request as part of a client-server protocol, requesting at least a portion of the information from a server. The server request is sent to the server. A first server response including at least a portion of the information from the server is received. The first server response is processed according to the client-server protocol to determine a first update to the DOM. The first update is applied to the DOM.

Abstract: A method of updating a document object model (DOM) is disclosed. A message is received from a web browser requesting for information to update the DOM. A dummy response message is sent to the web browser, wherein the dummy response message does not include the information to update the DOM, and wherein the dummy response message causes the web browser to create a dummy node in the DOM. A request message is received from a client as part of a client-server protocol, wherein the request message requests at least a portion of the information to be sent to the client. A first response message is sent including at least a portion of the information to the client, wherein the first response message is processed by the client to determine a first update to the DOM, and wherein the first update is applied to the DOM.

Abstract: A method of managing traffic of packet transport system according to some embodiments of the inventive concept may include calculating an average queue size of input traffic with reference to a link capacity; and differently applying allowable length and probability of disuse with respect to the calculated average queue size according to marking information with respect to packets of the input traffic. The input traffic includes a CCM packet for OAM.

Abstract: Network resources are provisioned within an application broker according to aggregated requests in an optical network. Resource requests are sorted to form sorted resource requests. The sorted resource requests are sorted according to destinations of the resource requests. The sorted resource requests are aggregated to form aggregated resource requests. Resource allocation is requested for each of the aggregated resource requests from a network border controller based on requirements of the set of set of aggregated resource requests. A set of allocated resources is received from the network border controller. The set of allocated resources is based on requirements of the aggregated resource requests. For each of the aggregated resource requests, network transmissions network receptions are executed utilizing associated allocated resources.

Abstract: An arrangement (17) is provided for setting and adjusting at least one parameter in a radio communication network (11), which is used in control of communication in the radio communication network and which is dependent on a round trip time for a signal travelling from a radio network controller (13) to a user equipment (16) and back to the radio network controller. The arrangement comprises a module (17a) for initially estimating a maximum value of the round trip time; a setting module (17b) for initially setting the parameter depending on the initially estimated maximum value of the round trip time; a module (17c) for measuring the round trip time; and a module (17d) for adjusting the parameter depending on the measured round trip time, wherein the measured round trip time is expected to be shorter than the initially estimated maximum value of the round trip time.

Abstract: A data segment of a data packet destined for an egress port of an egress node may be received at a first ingress node. An egress statement vector and an ingress statement vector may be identified at the first ingress node. A determination may be made, based on the egress statement vector and ingress statement vector, whether the first ingress node is authorized to transfer the data segment to the egress port before the other data segments of the data packet are received at the first ingress node. The data segment may be transferred to the egress port before the other data segments of the data packet are received at the first ingress node when the determination indicates the first ingress node is authorized. The data segment may be stored in a buffer of the first ingress node when the determination indicates the first ingress node is not authorized.

Abstract: Disclosed are various embodiments of a network switch for storing a prefix address and a mask corresponding to the prefix address, the prefix address and the mask each representing a binary value, the mask representing a number of significant bits of an address beginning with a most significant bit. The network switch obtains a network frame via one of a plurality of network interfaces, the network frame comprising a network address in a header of the network frame, the network address being a binary value representing a physical address of a network interface device. The network switch determines a truth value associated with a comparison of a mask number of bits of the prefix and network addresses, the truth value indicating an equivalence of the comparison. In response to the truth value, the network switch may initiate at least one action associated with the network frame.

Abstract: A method for facilitating a sequenced, anonymous communications session in a communications environment is provided in one example that includes receiving, from a first endpoint, an anonymous, sequenced request for a communication session involving a second endpoint. The communication session is sequenced to occur at designated periods provided by the end user(s) and/or an administrator, while maintaining end user(s) anonymity.

Abstract: The invention discloses a user terminal (115) for a wireless communications system (100) which is arranged to establish and carry out a communications session with a gateway node (120) in the system (100) according to a first protocol over at least one bearer (110, 140). The user terminal (115) is arranged to provide a predefined issued message to the gateway node (120) during the establishment of a session with an indicator that the user terminal (115) is arranged to handle traffic to and from the gateway node (120) using a predefined version of a defined filter (130).