Abstract: Disclosed is an apparatus and a method of establishing an interface between entities in a local network. A stand-alone local H(e)NB network has a structure in which one or more H(e)NBs are separated from one or more L-GWs in order to support mobility of a user equipment. The one or more H(e)NBs or the one or more L-GWs provide an information management device with information necessary for establishing an interface and receive information necessary for establishing the interface with a target entity as a response to the provision of the information. The one or more H(e)NBs or the one or more L-GWs establish the interface with the target entity based on the received information.

Abstract: The present disclosure is directed towards methods and systems for caching packet steering sessions for steering data packets between intermediary devices of a cluster of intermediary devices intermediary to a client and a plurality of servers. A first intermediary device receives a first data packet and determines, from a hash of a tuple of the first packet, a second intermediary device to which to steer the first packet. The first device stores, to a session for storing packet steering information, the identity of the second device and the tuple. The first device receives a second packet having a corresponding tuple that matches the tuple of the first packet and determines, based on a lookup for the session using the tuple of the second packet, that the second device is the intermediary device to which to steer the second packet. The first device steers the second packet to the second device.

Abstract: The invention relates to apparatuses, methods, a system, computer programs, computer program products and computer-readable media.

Abstract: Systems and methods of propagating maximum segment size and path maximum transmission unit of network paths between an intermediary device of a cluster with a plurality of destinations are described. A first core of a node including multiple cores and intermediary to a client and a plurality of servers may receive a response to a packet transmitted to a destination indicating that the packet has a size greater than a MTU of a network path between the node and a destination. The first core identifies the MTU of the network path and determines that the identified MTU is different than an MTU used by the first core. The first core replaces the MTU stored in an entry corresponding to the destination in a PMTU table maintained with the identified MTU. The first core transmits, to other cores of the node, the identified MTU to update each core's PMTU table.

Abstract: A method is disclosed of applying a non-secure warning tone to a packetized voice signal which includes receiving a voice signal containing a sequence of voice samples; providing a non-secure warning tone signal containing a plurality of tone samples; and modifying the voice signal by selectively including tone samples in the sequence of voice samples.

Abstract: A Channel State Information (CSI) feedback method and a User Equipment (UE) are provided for better support of Joint Transmission (JT) and Beamforming/Coordinated Scheduling (CB/CS). For JT, phase information for an adjacent Base Station (BS) is fed back. For CB/CS, enhanced CSI for an adjacent BS is fed back. The UE according to the present invention includes: a coordinated BS set determining unit configured for determining a set of coordinated BSs participating in multi-BS coordination, the set of coordinated BSs containing a serving BS and at least one non-serving BS; and a CSI feedback unit configured for feeding back CSI for JT or CB/CS for each non-serving BS in the set of coordinated BSs. The present invention has the advantages of simple implementation and low overhead and is applicable in LTE-A and 4G systems.

Abstract: Techniques are described herein for optimizing communications in a network. At a router in a virtual private network, a packet is received from a device in a subnetwork protected by the router. The router examines the packet to determine a source address that identifies the device and a destination address that identifies a destination network device for the packet. The router also analyzes the packet to determine a size of the packet and determines whether or not the size of the packet is larger than a maximum transmission unit size. If the size of the packet is larger than the maximum transmission unit size, the router encapsulates the packet with a header that includes the destination address and a new source address that identifies the router.

Abstract: A near field communication device, such as an RFID wand, transmits network configuration information to non-volatile memory of a networking device while the networking device is powered down, and even packaged at a retail store. The networking device powers up, reads the network configuration information, and applies the network configuration to automatically interface the networking device with a wireless network.

Abstract: In a wireless communications network, access points and connected mobile devices transmit data via a radio frequency spectrum channel. When a device has packets for transmission it must check the channel is available before it can transmit the data. Furthermore there is a Transmission Opportunity (TXOP) parameter which limits the maximum amount of time that a device can transmit packets before it must relinquish the channel so that other devices are not locked out. Each device in the network is capable of updating its own TXOP parameters in order to respond to changes in the level of interference and contention in the surrounding area. In this way devices can transmit for longer periods of time when contention is low, while responding to increased network contention by shortening the TXOP to ensure fair access for all other devices in the network.

Abstract: A method of creating an object store is provided. Node table information reading and link table information are read. The node table information includes node information for a plurality of nodes. The link table information includes link information between pairs of nodes of the plurality of nodes. An anchored network record is created for each node of the plurality of nodes based on the node information and the link information and a defined maximum degree of separation. The anchored network record includes anchor node information associated with an anchor node of the anchored network record and a node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record. The created anchored network record is stored for each node of the plurality of nodes.

Abstract: An island-based network flow processor (IB-NFP) integrated circuit includes islands organized in rows. A configurable mesh event bus extends through the islands and is configured to form a local event ring. The configurable mesh event bus is configured with configuration information received via a configurable mesh control bus. The local event ring involves event ring circuits and event ring segments. In one example, a packet is received onto a first island. If an amount of a processing resource (for example, memory buffer space) available to the first island is below a threshold, then an event packet is communicated from the first island to a second island via the local event ring. In response, the second island causes a third island to communicate via a command/push/pull data bus with the first island, thereby increasing the amount of the processing resource available to the first island for handing incoming packets.

Abstract: In accordance with an example embodiment of the present invention, an apparatus comprises transceiver circuitry configured to receive information from a fixed network node, initiate sending information toward the fixed network node and initiate communication with at least one peer node, the peer node being a mobile node. The apparatus further comprises a memory configured to store information received from the fixed network node, and logic circuitry operably connected to the memory, configured to derive internet protocol address information from the information received from the fixed node and to initiate sending the internet protocol address information to the at least one peer node.

Abstract: Described are systems and methods for jointly optimizing Wide Area Network (WAN) and Local Area Network (LAN) network communications. In one embodiment, a management device communicatively interfaced with a WAN and a LAN includes a collection module to collect LAN information from the LAN and WAN information from the WAN; an analysis module to jointly analyze the collected WAN information and the collected LAN information to identify an operational condition; and an implementation module to initiate a management event responsive to the operational condition being identified. In one embodiment, the management event includes generating and transmitting a diagnostics report responsive to a fault being identified. The management device may further generate and execute instructions to remedy the diagnosed fault.

Abstract: Systems and methods are provided for voice communication. For example, multiple friendship chains are acquired from a relation server upon launching an application; a voice room is accessed via a voice server upon receipt of a voice-communication request from a user; a voice-invitation signal is sent to the relation server, the voice-invitation signal including identification of the voice room, where one or more friends of the user in the friendship chains determine whether to access the voice room based on at least information associated with the voice-invitation signal; and one or more voice connections associated with the one or more friends are established via the voice server in response to the friends accessing the voice room.

Abstract: A method for serially communicating by exchanging data frames between a transmitting and at least one receiving node connected by a bus, transmit/receive roles being assigned to nodes for each data frame by the CAN ISO 11898-1 (“CAN”) arbitration procedure, exchanged data frames having a structure based on CAN, data frames being a bit sequence, the structure of the data frames including a Start-Of-Frame-Bit, and Fields for Arbitration, Control, Data, CRC, Acknowledge, and End-Of-Frame, the Data Field may have a zero-bit length, other Fields containing at least two bits, each having a bit time divided into Time Segments, the bit-rate defined by the bit time's reciprocal value, for at least one first predeterminable part of the exchanged data frames the bit-rate lies below 1 Mbit/s, for at least one second predeterminable part the bit-rate lies higher, at least two different Time Segment value sets being predeterminable for each part.

Abstract: Alternative network access for a mobile device having a first radio and a second radio, or in some cases, only one radio can include using a first radio in a first connection with a first access point. Whether to establish a second connection with a second access point using a second radio is determined. The determination is based on a first set of access conditions associated with the first access point and a second set of access conditions associated with the second access point. The second connection is established with the second access point using the second radio based on the determining, which indicates establishing the second connection.

Abstract: A method, system, and computer-readable media are provided for allowing a mobile device to maintain communication connectivity during a handoff between wireless access points. In one aspect, the method may include negotiating security association information and establishing a first communication tunnel by tunneling an inner IP address within a first outer IP address. The method may further include authenticating a request for establishing a second communication tunnel by identifying the negotiated security association information within the request. Additionally, the method may include establishing the second communication tunnel by tunneling the inner IP address within a second outer IP address. Moreover, the method may include pushing data associated with the communication session through the second communication tunnel.

Abstract: A method of load balancing implemented at a data network is disclosed. The data network contains a number of data plane nodes and a number of clusters of a control node. The method starts with deriving a graph from a topology of the data plane nodes, where the graph contains vertices, each representing one of the data plane nodes, and edges, each representing a connection between a pair of data plane nodes. The method continues with partitioning the graph into a number of sub-graphs, where the partition aims at minimizing connectivity among the number of sub-graphs, and where the number of sub-graphs equal to the number of clusters. The control node then assigns each cluster to one of the data plane nodes, where each cluster is assigned to one or more data plane node partitioned into the same sub-graph.

Abstract: It is determined whether or not the address of a first type specified in an address resolution query is an address that allows direct routing to a first network. If the direct routing is determined to be allowed, a routing table is configured such that a packet including, as a destination, the address of a second type obtained by the address resolution query is forwarded to the first network. If the direct routing is determined not to be allowed, the routing table is configured such that a packet including the obtained address of the second type as a destination is forwarded to a second network.

Abstract: High-speed processing of packets to, and from, a virtualization environment can be provided while utilizing segmentation offload and other such functionality of commodity hardware. Virtualization information can be added to extension portions of protocol headers, for example, such that the payload portion is unchanged and, when physical address information is added to a frame, a frame can be processed using commodity hardware. In some embodiments, the virtualization information can be hashed and added to the payload or stream at, or relative to, various segmentation boundaries, such that the virtualization or additional header information will only be added to a subset of the packets once segmented, thereby reducing the necessary overhead. Further, the hashing of the information can allow for reconstruction of the virtualization information upon desegmentation even in the event of packet loss.