Abstract: For location-based communication with mobile devices, an instruction for making a telecommunication call to a location is received at a device associated with a caller. the location is a place where different callees with different mobile devices are present at different times, and a callee is present with a mobile device at the place at a specified time therefore the call is made to the mobile device of the callee in order to call the location. A set of potential callees is identified such that each mobile device associated with each callee in set of callees is present at the location at the given time. From the device associated with the caller, the telecommunication call is initiated to mobile devices associated with a subset of potential callees, including the callee.

Abstract: Mechanisms are provided for determining an event rate. The mechanisms sample a sequence of events to generate a set of sampled events. At least a subset of the sampled events have associated event sequence values indicating a position of the sampled event within the sequence of events. The mechanisms group the sampled events into a plurality of event groups based on a common characteristic of the events. The mechanisms determine, for each event group, sequence values of sampled events associated with the event group. The mechanisms calculate, for each event group, an estimated event rate based on the sequence values of the sampled events associated with the event group and the total number of events in the sequence of events.

Abstract: To manage channel ownership in a publish-subscribe data processing environment, a determination is made at a first server that a subscription request from a client relates to a channel, the channel having a channel identifier. At an exchange component in a messaging middleware, a session queue associated with the client is bound to the channel. A mandatory delivery message is configured to be routed using a publisher identifier by the exchange component, the publisher identifier being related to the channel identifier. The mandatory delivery message is communicated from the first server to the exchange component to indicate an intent of the first server to become a publisher of the channel. The mandatory delivery message causes the channel ownership of the channel to be limited to a single publisher.

Abstract: To provide client-side fault-tolerance in a publish-subscribe system, a message is received on a channel from a server. At a function executing using a processor and a memory, a determination is made whether the message contains a heartbeat data. When the message contains the heartbeat data, a determination is made whether a content signature contained in the message matches a last known content signature saved from a previous message. When the content signature contained in the message does not match the last known content signature saved from a previous message, a refresh message is sent to the channel.

Abstract: A method, system, and computer program product for scalable and self-healing architecture for client-server operations in transient connectivity conditions are provided in the illustrative embodiments. An application in a second system receives a request from a first system, the request requesting data from a type of service. A first response responds to the request. The request is queued in a service queue corresponding to the type of the service, to make the request available to a third system that provides the type of the service. A notification is received that a second response from the third data processing system has been posted into a session specific queue, the second response being responsive to the request. In response to another request received from the first system, a third response is sent to the first system, the third response including the data from the second response from the session specific queue.

Abstract: An instruction for making a call to a location is received at an application executing in a service provider system. The location is a place where different callees with different mobile devices are present at different times, and a callee is present with a mobile device at the place at a given time therefore the call is made to the mobile device of the callee in order to call the location. Using the application, a set of locations corresponding to a set of subscribers is detected. From the set of subscribers, a set of potential callees is identified. Each mobile device associated with each callee in the set of potential callees is present at the location at the given time. Using the application, the call is established between a caller's device and the mobile devices of a subset of potential callees, the subset of potential callees including the callee.

Abstract: A network adapter for handling packet reordering receives a set of packets. The network adapter is configured to aggregate a subset of in-sequence packets from the set of packets into at least one segment before passing the at least one segment from the network adapter to a next layer in a protocol stack. An in-sequence packet from the set of packets is stored into a first segment. Responsive to receiving an out of sequence packet in the set of packets, the out of sequence packet is stored in a second segment. An adaptive timeout timer is activated responsive to receiving the out of sequence packet, and the first segment is held at the network adapter while the adaptive timeout timer runs. Prior to the adaptive timeout timer expiring, a missing packet is received and included in the first segment. The network adapter sends the first segment to the next layer.

Abstract: An approach is provided in which a hardware accelerator receives a request to decompress a data stream that includes multiple deflate blocks and multiple deflate elements compressed according to block-specific compression configuration information. The hardware accelerator identifies a commit point that is based upon an interruption of a first decompression session of the data stream and corresponds to one of the deflate blocks. As such, the hardware accelerator configures a decompression engine based upon the corresponding deflate block's configuration information and, in turn, recommences decompression of the data stream at an input bit location corresponding to the commit point.

Abstract: A method, system, and computer program product for determining a congestion value in a networking component in a data network are provided in the illustrative embodiments. A first packet is set to use a first priority level and a second packet is set to use a second priority level. The second priority level is lower than the first priority level. The second packet is transmitted after the first packet to the networking component, causing the networking component to transmit the first and the second packets after they are received at the networking component. A function is applied to an arrival delay to compute the congestion value of the networking component, wherein the arrival delay comprises a length of an elapsed period between receiving a transmission of the first packet from the networking component and receiving a transmission of the second packet from the networking component.

Abstract: Mechanisms are provided for determining an event rate. The mechanisms sample a sequence of events to generate a set of sampled events. At least a subset of the sampled events have associated event sequence values indicating a position of the sampled event within the sequence of events. The mechanisms group the sampled events into a plurality of event groups based on a common characteristic of the events. The mechanisms determine, for each event group, sequence values of sampled events associated with the event group. The mechanisms calculate, for each event group, an estimated event rate based on the sequence values of the sampled events associated with the event group and the total number of events in the sequence of events.

Abstract: At an application at a sender system, when an amount of data to be transmitted from the sender exceeds a flow size threshold, the data is divided into a set of chunks of a size. According to a mapping selection rule, a subset is selected from a set of selected label mappings, wherein each label mapping in the subset maps an original label in the data to a different virtual label. For a chunk, when by routing the chunk to a first networking component corresponding to a first virtual label a fraction of the amount of data that will have been routed to the first component will exceed a mapping threshold, the original label in the chunk is replaced with a second virtual label from a second label mapping in the subset. The chunk is routed to a second networking component corresponding to the second virtual label.

Abstract: A hardware accelerator receives a request to decompress a data stream that includes multiple deflate blocks and multiple deflate elements compressed according to block-specific compression configuration information. The hardware accelerator identifies a commit point that is based upon an interruption of a first decompression session of the data stream and corresponds to one of the deflate blocks. As such, the hardware accelerator configures a decompression engine based upon the corresponding deflate block's configuration information and, in turn, recommences decompression of the data stream at an input bit location corresponding to the commit point.

Abstract: Mechanisms are provided for configuring a data flow between a source device and a destination device in a network. The mechanisms receive, from a network control application, a request to establish a network configuration corresponding to a data flow between the source device and the destination device. The request comprises a fine grained header field tuple for defining the data flow. The mechanisms allocate, from a shadow address pool, a shadow address to be mapped to the fine grained header field tuple. The shadow address pool comprises addresses not being used by devices coupled to the network. The mechanisms configure a network infrastructure of the network to route data packets of the data flow from the source device to the destination device based on the shadow address.

Abstract: Mechanisms are provided for analyzing data traffic through a network. The mechanisms sample data packets of a data flow through a normal port of a network forwarding device of the network. The sampling is performed at least by configuring the network forwarding device to implement port mirroring of the normal port to a designated mirror port of the network forwarding device. The mechanisms forward sampled data packets, copied to the mirror port by virtue of the port mirroring, to a collector computing device. The mechanisms process, by the collector computing device, the sampled data packets to analyze the data flow through the normal port of the network forwarding device. The mechanisms perform, by the collector computing device, an operation based on results of the analysis.

Abstract: Mechanisms are provided for analyzing data traffic through a network. The mechanisms sample data packets of a data flow through a normal port of a network forwarding device of the network. The sampling is performed at least by configuring the network forwarding device to implement port mirroring of the normal port to a designated mirror port of the network forwarding device. The mechanisms forward sampled data packets, copied to the mirror port by virtue of the port mirroring, to a collector computing device. The mechanisms process, by the collector computing device, the sampled data packets to analyze the data flow through the normal port of the network forwarding device. The mechanisms perform, by the collector computing device, an operation based on results of the analysis.

Abstract: Mechanisms are provided for tracing a route taken by a packet in a Software Defined Network (SDN). Each switch in the SDN is assigned a first color label, from a set of color labels, such that such that adjacent switches have different color labels. Rules are installed in each switch to forward a received data packet to the SDN controller in response to a second color label of the received data packet not matching the first color label assigned to the switch. A second color label, from the set of color labels, is assigned to a trace data packet. A route of the trace data packet is traced through the SDN based on the second color label and application of the one or more rules to the trace data packet at each of the switches in the SDN as the trace data packet is received by each of the switches in the SDN.

Abstract: A mechanism is provided in a logically centralized controller for dynamic multipath forwarding in a software defined network. The mechanism identifies a set of multiple forwarding paths for a flow. The mechanism assigns a virtual destination address for each multiple forwarding path in the set of multiple forwarding paths. The mechanism installs virtual destination address based forwarding rules in switches for each multiple forwarding path and installs rewriting rules in an egress switch for all paths in the set of multiple forwarding paths. Each rewriting rule rewrites one of the virtual destination address to the real destination address. The mechanism configures an ingress switch to dynamically select a path from the set of multiple forwarding paths based on a multipath policy and rewrite the destination address from the real destination address to a virtual destination address corresponding to the selected path.

Abstract: In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output.

Abstract: In response to receiving an input string to be compressed, a plurality of diverse lossless compression techniques are applied to the input string to obtain a plurality of compressed strings. The plurality of diverse lossless compression techniques include a template-based compression technique and a non-template-based compression technique. A most compressed string among the plurality of compressed strings is selected. A determination is made regarding whether or not the most compressed string was obtained by application of the template-based compression technique. In response to determining that the most compressed string was obtained by application of the template-based compression technique, the most compressed string is compressed utilizing the non-template-based compression technique to obtain an output string and outputting the output string.

Abstract: A plurality of SYN packets is sent from a first system, each of the plurality of SYN packets traverses a different path in a first set of paths between the first system and a second system in a multipath data communication network and includes a unique source identifier. From a plurality of SYN-ACK packets, a SYN-ACK packet is selected that is first to arrive at the first system. Each SYN-ACK packet includes a unique source identifier of a selected SYN packet. A path is configured corresponding to the selected SYN packet, as an outbound path from the first system. A path corresponding to the selected SYN-ACK packet is configured as an inbound path to the first system. A session between the first and the second systems is established using the outbound and inbound paths.