Abstract: A congestion control mechanism for TCP communication sessions is described. The congestion control mechanism adjusts the size of the congestion window based on a number of parallel virtual TCP Hybla connections. The number of parallel virtual TCP Hybla connections used to determine the congestion window can be dynamically adjusted. The enhanced TCP Hybla congestion control mechanism provides improved throughput for heterogenous networks having a high latency link and having possible packet loss.

Abstract: Embodiments of the present disclosure describe systems and methods for user equipment (UE)-initiated reporting of congestion information. Various embodiments may include systems and methods for reporting congestion information to an evolved node B (eNB) by UEs. In embodiments, the congestion information may be utilized in managing access requests made by the UEs. Other embodiments may be described and/or claimed.

Abstract: A system may receive user input that identifies network entities in an optical network. The system may provide a user interface that displays a representation of the network entities and of optical link types configured to carry optical signals among the network entities. The system may receive user input that identifies a particular optical link type, and may display a representation of optical links, of the particular optical link type, that are associated with the network entities. The system may also display an indication of an allocation status of the optical links. The system may receive user input that identifies an available optical link to be allocated for an optical transmission, and may provide, to the network entities and based on the user input, information that identifies the available optical link to permit the available optical link to be allocated for the optical transmission between the network entities.

Abstract: According to a disclosed embodiment, a flow indication counter is incremented each time a data packet is transmitted from a buffer. When the number of data packets transmitted equals or exceeds a threshold number, a flow indication message comprising the buffer window size is generated and transmitted to the base station controller. Further, flow indication messages can be generated and transmitted every threshold time interval, independently of the number of data packets transmitted to ensure that flow indication messages are sent at least every preset time interval. Moreover, a system for flow control can be constructed comprising a flow indication counter module configured to provide an updated number of data packets transmitted. The system further comprises a window size monitoring module which determines the buffer window size and a message generating module which generates a flow indication message comprising the buffer window size.

Abstract: A packet radio communications system communicates internet packets to and/or from mobile user equipment. The system comprises a core network comprising a plurality of packet data networks, each including network communications elements operable to communicate internet packets using an internet protocol transport plane, and a common gateway support node. The gateway support node is operable to route the internet packets via communications bearers established through the packet data networks using the network communications elements. The system includes a plurality of radio access networks connected by the internet protocol transport plane to the core network components of the packet data networks for communicating the internet protocol packets to and/or from the mobile user equipment. Each of the radio access networks is operable to provide radio access bearers for communicating the internet packets to and/or from the mobile user equipment.

Abstract: A method for communication includes transmitting data packets from a communication device to a network. Upon receiving in the communication device a congestion notification from the network, a rate of transmission of the data packets from the communication device to the network is reduced. While transmitting the data packets, after reducing the rate of transmission, the rate of transmission is increased incrementally when a predefined volume of data has been transmitted since having made a previous change in the rate of transmission.

Abstract: An embodiment relates to a scalable computer arrangement and method, which enables the accessing of certain stored information by utilizing algorithms. The validity of the algorithms and/or retrieved data are determined by a validity management module. If the algorithm and/or the retrieved data is determined by the validity management module to be invalid, the algorithm and/or the retrieved data may be updated, whereby self correction occurs dynamically over time with changing stored information. In another embodiment, the computer arrangement and method enables networked computer systems each including a standardized database access system having hyper objects employing embedded algorithms or rules for accessing information across the network in a standardized manner, even though the networked computer system databases may employ different schema and formats. Each computer system operates independently, and yet is able to dynamically self correct when invalid algorithms or data is determined.

Abstract: Various exemplary embodiments relate to a method of offline traffic matrix aware segment routing. The method may include receiving a traffic matrix based upon all the traffic between nodes i and j that is routed in the network; and determining the amount of traffic between nodes i and j will be routed through node k, based on minimizing a maximum link utilization for the traffic matrix by determining that the total amount of flow on a link e in the network is less than the link's capacity.

Abstract: Disclosed herein are system, method, and computer program product embodiments for performing load balancing of a data packet received by a hybrid virtual load balancer. An embodiment operates by detecting a hardware capability of a switch. The hybrid virtual load balancer may also receive policy code from a user specifying a desired load balancing behavior for the data packet. Based on the hardware capability and the policy code, the hybrid virtual load balancer may determine whether to offload load balancing of the data packet to the switch or process the data packet in software on the hybrid virtual load balancer. If the load balancing is to be offloaded, the hybrid virtual load balancer may send programming instructions to an SDN controller coupled to the switch. The programming instructions direct the SDN controller to program the switch to load balance the data packet.

Abstract: Measures for controlling communication access in a data center network are provided. A packet forwarding function in a server in a data center network is configured to access an access control data store when making forwarding decisions for received data packets which are being routed to/from virtual systems hosted on that server. In response to receipt, at the server, of a setup notification relating to setup of a virtual machine on the server, one or more entries are populated in the access control data store. The entries comprise an internet protocol (IP) address of the virtual system and at least one associated IP address of one or more other communication endpoints.

Abstract: A computer implemented method of providing registry services is disclosed. The method includes identifying one or more top level domains to be serviced; creating, by a processor, a TLD group for the one or more top level domains, wherein top level domains in the TLD group share at least one characteristic; provisioning the one or more top level domains; and registering the one or more top level domains with the TLD group.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include collecting, from a software-defined storage system including one or more computing nodes that are configured to provide a storage service, performance metrics for each of the computing nodes, and detecting, based on the performance metrics, a performance bottleneck in the software-defined storage system. In embodiments of the present invention, each of the computing nodes includes one or more software modules and one or more hardware components, and the performance bottleneck is either a given software module or a given hardware component. In some embodiments, detecting the performance bottleneck includes predicting the performance bottleneck. Upon detecting the performance bottleneck, a solution for the performance bottleneck can be determined, and the performance bottleneck and the solution can be presented to a user on a display.

Abstract: Some embodiments increase throughput across a connection between a host and a client by initializing the congestion window for that connection dynamically using a previously settled value from a prior instance of the connection established between the same or similar endpoints. An initialization agent tracks congestion window values for previously established connections between a host and various clients. For the tracked congestion window values of each monitored connection, the initialization agent stores an address identifying the client endpoint. When establishing a new connection, the initialization agent determines if the new connection is a recurring connection. A new connection is recurring when the new connection client address is similar or related to an address identified for a previous monitored connection.

Abstract: Provided is communication control device including a determination unit which determines whether an access type of a small cell which at least partially overlaps a macro cell of a radio communication system is a closed access type or an open access type, an identification unit which, when it is determined that the access type of the small cell is the closed access type, identifies a user terminal of the macro cell which should be protected from interference caused by a radio signal from the small cell, and an interference control unit which transmits an interference control signal to a base station of the small cell so that the interference on the user terminal identified by the identification unit is reduced.

Abstract: Systems and methods for performing self-healing tasks using information technology management data are disclosed. In aspects, a computer-implemented method of the invention comprises: storing alert data indicating that an alert condition has been detected at a client data center, the alert data including a monitoring situation; performing a matching function to determine whether the monitoring situation matches an assigned monitoring situation or is an unassigned monitoring situation; determining that the monitoring situation is unassigned; sending a ticket including a list of virtual engineers to the client data center; detecting a ticket update in a ticket database, the ticket update including an assignment of one of the virtual engineers to the monitoring situation; updating a monitoring situation database to include the assignment of the one of the virtual engineers; and initiating the one of the virtual engineers to resolve the monitoring situation.

Abstract: A hypervisor executed by a processing device retrieves a plurality of packets from a network device and forwards the packets to one or more virtual machines. The hypervisor determines a number of the plurality of packets successfully received by the one or more virtual machines, and when a function of the number is below a first threshold, decreases a priority for the network device associated with handling incoming packets.

Abstract: A method and apparatus for a collision-free carrier sense multiple access (CSMA) are provided. The method of a node associated with a beacon enabled carrier sense multiple access (CSMA)-based wireless communication network through an access point (AP) includes receiving a beacon from the AP, the beacon comprising a back-off prime number and a beacon random number, and generating a back-off interval based on the beacon random number, the back-off prime number, a mapped identification (ID) of the node, and a current time slot of a frame of the beacon. The method and apparatus provide a collision-free CSMA scheme for a beacon enabled CSMA-based wireless communication network. In the collision-free CSMA scheme, uniformly distributed back-off intervals may be generated in a distributed fashion at each node for a CSMA-based wireless communication network. The back-off intervals may be correlated among the nodes even though the nodes do not communicate with each other.

Abstract: Approaches are provided for an SDSN that employs a satellite network nodes, where central L2 network nodes are controlled via a centralized Controller. Link status information is obtained regarding links of each L2 node. Global routing constraints, satellite ephemeris data, and resource allocation information are obtained. A constellation topology of the network nodes is determined based on the ephemeris data. Network routes between pairs of endpoints are determined. Each route includes links based on the link status information regarding the links, the global routing constraints, the bandwidth resources of the links and the current allocation of bandwidth resources, and/or the constellation topology. A forwarding table is generated for each network node, wherein each forwarding table includes route entries providing a next hop indicating a destination for data packets, wherein the destination is associated with a link of the respective network node that represents a link of a respective route.

Abstract: The present invention discloses a method of dual stack access, wherein a network device authenticates the first protocol address of a requesting client, stores the user name, first protocol address, and address status information of the client in the user information table if the authentication succeeds, assigns a second protocol address to the client, stores this second protocol address and address status information in the user information table, generates control rules for the client according to its user information, and controls dual stack access of the client according to the rules. This invention provides effective authentication-based access control of dual stack users.

Abstract: Signaling-less call setup and teardown by employing observed Quality of Experience (QoE) and resource demands. A system provides an environment for supersonic treatment of observed QoE and Quality of Service (QoS) demands for mobile applications. Specifically, a monitoring component is employed to determine session state information associated with a traffic flow, which includes observed QoE and resource demand data. The session state information is stored in a shared memory location and can be analyzed to modify and/or create a network policy for the traffic flow. The network policy is applied to one or more traffic flows to minimize signaling exchanges between a communication network and a mobile station.

Abstract: Methods, systems, and devices are described for enhanced network utilization between an access point and a number of wireless stations. A station (STA), following a transmit opportunity (TXOP), may determine a utilization of the TXOP. Based on the determination, the STA may adjust a delay time for a subsequent transmission. The adjustment of the delay time may include increasing an initial contention window (CW), increasing a backoff value, and/or increasing a number of backoffs for TXOPs following an underutilized TXOP. The increased delay time may result in, on average, increased backoff times in such situations. The delay time may be reduced to a minimum delay time following a certain number of TXOPs that more fully utilize the TXOP. Utilization of the TXOP may be determined based on an amount of time used for the TXOP relative to a TXOP limit that may be set by an access point.

Abstract: Systems and methods for delivering fractions of content to user devices before the content is selected or requested (e.g., a pre-delivery of content) are described. In some embodiments, the systems and methods receive an indication that content is available for pre-delivery from a content server to a user device over a network, determine a fraction (e.g., size) of the content available for pre-delivery that satisfies one or more predicted content playback conditions, and causes the determined fraction of the content available for pre-delivery to be delivered to the user device.

Abstract: Mechanisms are provided, in a data processing system comprising a plurality of nodes, each node being a computing device, for controlling access to a critical section of code. These mechanisms send, by a sender node of the data processing system, an access request for requesting access to the critical section of code. The critical section of code is a portion of code that accesses a shared resource. The mechanisms receive, in the sender node, from a plurality of receiver nodes in the data processing system, responses to the access request. Each response in the responses includes a number of active nodes perceived by a corresponding receiver node that transmitted the response. The mechanisms control, by the sender node, access to the critical section of code based on the number of active nodes identified in each of the responses received from the receiver nodes.

Abstract: Mechanisms are provided, in a data processing system comprising a plurality of nodes, each node being a computing device, for controlling access to a critical section of code. These mechanisms send, by a sender node of the data processing system, an access request for requesting access to the critical section of code. The critical section of code is a portion of code that accesses a shared resource. The mechanisms receive, in the sender node, from a plurality of receiver nodes in the data processing system, responses to the access request. Each response in the responses includes a number of active nodes perceived by a corresponding receiver node that transmitted the response. The mechanisms control, by the sender node, access to the critical section of code based on the number of active nodes identified in each of the responses received from the receiver nodes.

Abstract: An information terminal sequentially transmits one or more packets to an information distribution server, receives acknowledgments for the transmitted packets from the information distribution server, and records a round trip time and occurrence of packet loss for each of the transmitted packets. Among one or more packet sequences, the information terminal counts the number of packet sequences which are such that the number of packet losses included in each of the packet sequences and an increase state of the round trip time for packets included in the packet sequence satisfy respective predetermined conditions. Each of the one or more packet sequences has multiple continuous packets including one or more packets, for which packet loss is recorded among the transmitted packets, at the top. The information terminal calculates a packet loss ratio on the basis of the counted number and the number of transmitted packets.

Abstract: A system for providing media services on behalf of a customer contact center includes: a processor; and a memory, wherein the memory has stored thereon instructions that, when executed by the processor, cause the processor to: transmit and receive signaling messages to and from a control server over an established data network connection; in response to the signaling messages, invoke a media device for transmitting media to an end-user device; detect loss of the data network connection; identify a configurable parameter for determining whether a failed message transmission should be retried; and in response to determining that the failed message transmission should be retried, re-transmitting the failed message to the control server.

Abstract: Techniques are described for wireless communication. A first method includes performing a clear channel assessment (CCA) for a first node associated with a first operator in a deployment of operators over an unlicensed radio frequency spectrum band, and transmitting data over the unlicensed radio frequency spectrum band when the CCA is successful. The data may be transmitted by the first node in accordance with an agreement between the first operator and a second operator in the deployment of operators. A second method includes receiving over an unlicensed radio frequency spectrum band, at a user equipment (UE), a first transmission from a first node associated with a first operator in a deployment of operators. The first transmission may include data originating from a second operator in the deployment of operators.

Abstract: A sensor network system 1000 is provided with a plurality of sensor nodes 1100, . . . and configured to decide a parent node for each of the plurality of sensor nodes so as to form a network topology having a tree structure using each of the plurality of sensor nodes as a node. The sensor network system forms the network topology so that, with respect to each of the plurality of sensor nodes, the number of child nodes owned by the sensor node is close to a value obtained by multiplying a maximum containing number, which is a maximum number of sensor data that can be contained by one packet, by a natural number (1200).

Abstract: A data packet structure conveys data of service data units (SDU) using protocol data units (PDU). The data packet structure includes a data packet payload having at least one protocol data unit (PDU). A protocol data unit (PDU) includes a service data unit (SDU) or a fragment of a service data unit and a data packet header including an indicator indicating whether or not the data packet payload begins with a protocol data unit (PDU) being a fragment of a service data unit and whether or not the data packet payload ends with a protocol data unit (PDU) being a fragment of a service data unit.

Abstract: A system can monitor the server for indications of an attack and adjusts server settings accordingly. In response, the system can increase server tolerance in a systematic way to deal with DDoS by adjusting server settings appropriately. Conversely, when the server is not under attack, the settings can be adjusted to those for standard operations (e.g., adjusted downward), as they are more optimal for normal, non-attack operations.

Abstract: Some demonstrative embodiments include devices, systems and/or methods of communicating aggregate data units. For example, a device may include a wireless communication unit to communicate an aggregate data unit including a plurality of data units in an increasing order of sequence numbers assigned to the data units, such that a first data unit having a first sequence number always precedes a second data unit having a second sequence number, greater than the first sequence number.

Abstract: A host computer has a plurality of containers including a first container executing therein, where the host also includes a physical network interface controller (NIC). A packet handling interrupt is detected upon receipt of a first data packet associated with the first container If the first virtual machine is latency sensitive, then the packet handling interrupt is processed. If the first virtual machine is not latency sensitive, then the first data packet is queued and processing of the packet handling interrupt is delayed.

Abstract: Example embodiments presented herein are directed towards a Packet Domain Network Gateway (PGW), and corresponding methods therein, for service usage reporting and quota management in a Policy and Charging Control (PCC) based network. Example embodiments presented herein are also directed towards an Online Charging System (OCS) for receiving service usage reporting and quota management in a PCC based network. Quota reporting and quota management is performed on a pre-rating group basis.

Abstract: A reset of a synchronization counter is synchronized to an external deterministic signal. Entry into the link transmitting state is further synchronized with the deterministic signal. A target latency is identified for a serial data link. A data sequence is received synchronized with a synchronization counter associated with the data link. Target latency can be maintained using the data sequence.

Abstract: A mobile station for transferring delay-sensitive data to a wireless communications network is provided with an uplink resource release controller that selectively inhibits release of an uplink resource in order to meet requirements of a delay-sensitive data application, such as a VoIP or streaming application. In one embodiment, the uplink resource release controller causes dummy blocks to be written to a data buffer to prevent initiation of a countdown process. By intelligently controlling resource release, delay-sensitive data may be transmitted in a more reliable fashion, thereby increasing application performance.

Abstract: A first transmission device transmits a signal to a third transmission device by using an active line and a spare line. The first transmission device includes a CRC generator and an SN adder. The CRC generator calculates the CRC value of the signal. The SN adder stores, in a FCS byte filed in the signal, the FCS calculated value obtained by adding the SN representing consecutiveness of the signal to the CRC value. Furthermore, the first transmission device outputs the signal in which the FCS calculated value is stored to the second transmission device by using the active line and the spare line.

Abstract: The discovery of a topology of a network with an unknown topology can enable the selection of a data path within the network, and the establishment of a data stream over the selected data path. Routing tables mapping originating nodes to input ports can be created based on the receipt of discovery messages generated by the originating nodes. A source node can select a data path between the source node and a sink node in order to establish a data stream using the routing tables. Data paths can be selected based on, for instance, routing table bandwidth information, latency information, and/or distance information. Data streams can be established over the selected data path, and each node can release any reserved output bandwidth determined to be unnecessary for the data stream.

Abstract: A method for scheduling a crossbar using distributed request-grant-accept arbitration between input group arbiters and output group arbiters in a switch unit is provided. Each input group arbiter and output group arbiter maintains an ordered queue of links in an input group or an output group. The ordered queue prioritizes links in the output group or output group that was least recently selected. To satisfy an arbitration slot won on the group-level, the input group arbiter or output group arbiter starts a search from the oldest link that was selected and maintains fairness among links in the group.

Abstract: A method for scheduling a crossbar using distributed request-grant-accept arbitration between input group arbiters and output group arbiters in a switch unit is provided. Each input group arbiter and output group arbiter maintains an ordered queue of links in an input group or an output group. The ordered queue prioritizes links in the output group or output group that was least recently selected. To satisfy an arbitration slot won on the group-level, the input group arbiter or output group arbiter starts a search from the oldest link that was selected and maintains fairness among links in the group.

Abstract: This disclosure relates to techniques for synchronizing playback of media data between a source device and one or more sink devices in a Wireless Display (WD) system. WD systems enable mobile devices to share a local display of the source device with remote sink devices. The techniques of this disclosure include a management procedure at the source device to select a universal queue size for the source device and the participating sink devices. The source device selects the universal queue size based at least on supported queue sizes of the source device and the sink devices. The media packets are then held in queues having the universal queue size at the source device and the sink devices. The uniform queue size combined with compensation for transmission delay enables each of the devices to begin processing the media packets at the same time.

Abstract: In an embodiment, an apparatus is provided that may include an integrated circuit including switch circuitry to determine, at least in part, an action to be executed involving a packet. This determination may be based, at least in part, upon flow information determined, at least in part, from the packet, and packet processing policy information. The circuitry may examine the policy information to determine whether a previously-established packet processing policy has been established that corresponds, at least in part, to the flow information. If the circuitry determines, at least in part, that the policy has not been established and the packet is a first packet in a flow corresponding at least in part to the flow information, the switch circuitry may request that at least one switch control program module establish, at least in part, a new packet processing policy corresponding, at least in part, to the flow information.

Abstract: A port extender includes a chassis with uplink ports that are operable to receive power and data from a power sourcing device, and user device ports that are operable to connect to user devices. A power management processor is coupled to each of the uplink ports and the user device ports. The power management processor is operable to determine a power budget using power received by the uplink ports. The power management processor is also operable to detect a port configuration event such as the removal of a connection of a user device to a user device port, the inactivity of a user device port, or the addition of a connection of a user device to a user device port, and in response, selectively provide power to one or more of the plurality of user device ports based on the power budget and the port configuration event.

Abstract: In one embodiment, a device in a network determines that a particular packet flow in the network is sensitive to packet reordering. The device determines whether a particular packet of the packet flow is to be routed differently than an immediately prior packet in the packet flow, in response to determining that the particular packet flow is sensitive to reordering. The device marks the particular packet as taking a different route than the immediately prior packet in the packet flow, prior to forwarding the marked packet and in response to determining that the particular packet is to be routed differently than the immediately prior packet in the packet flow.

Abstract: A mobile terminal obtains a measurement value of a round-trip time in a communication channel used for communication with a server and a measurement value of a packet loss ratio in the communication channel (S502 and S503). Then, the mobile terminal determines whether or not a retransmission timeout is occurring in the server (S504, S505, and S506). If a retransmission timeout is occurring in the server, the mobile terminal calculates an estimate value of the bandwidth in the communication channel by using a special throughput equation including a timeout time (S507). On the other hand, if a retransmission timeout is not occurring in the server, the mobile terminal calculates an estimate value of the bandwidth by using a normal throughput equation which does not include a timeout time.

Abstract: A method for a GSM/EDGE node (105, 130), comprising establishing a TBF to another node and entering a transmit state in which data blocks are transmitted via said TBF to said other node. The transmit state is left if (205) there are no data blocks to transmit and positive ACK/NACKs have been received for transmitted data blocks, and, upon leaving said transmit state, a timer is started for the release of said TBF and a predefined TBF mode is entered in which the TBF is regarded (230) as released if the TBF release timer expires before data blocks are received by the network node to transmit to the other node, while, if data blocks are received by the network node to transmit to the receiving node, the predefined TBF mode is exited, the timer is stopped (225) and reset, and the first state is entered.

Abstract: A method includes counting a number of successive information frame (I-frame) retransmissions due to a guard timer expiring. A contactless front-end (CLF) transmits the I-frame to a secure element (SE) over a single wire protocol (SWP) interface. The method also includes discontinuing I-frame retransmission when the count equals a retransmission threshold. The method further includes deactivating the SWP interface.

Abstract: A GTP correlation cluster (GCC) can automatically program a network element to forward copies of packets originating from a mobile device and having a shared attribute to the same analytic server, regardless of the regions into which the mobile device moves. The GCC can monitor attributes of copies of control packets that the network element receives. In response to detecting a changed attribute within a control packet originating from a mobile device, the GCC can update a session map specific to that mobile device in order to cause packets having that changed attribute to be forwarded to the same port to which packets having the former attribute were being forwarded prior to the change. As a result, the network element can ensure that packets belonging to a particular session still are forwarded to the same analytic server even if the mobile device has moved to a different region.

Abstract: Technology is described for monitoring computing instance launch times. A launch plan for launching a computing instance in a computing service environment may be identified. A predicted launch time for launching the computing instance on a selected physical host in the computing service environment may be determined using a launch time prediction model. An actual launch time for launching the computing instance in the computing service environment may be identified. The predicted launch time that is determined using the launch time prediction model may be compared with the actual launch time for launching the computing instance in the computing service environment. The actual launch time may be determined as not being within a defined threshold of the predicted launch time. An alert may be generated to indicate that the actual launch time is not within the defined threshold of the predicted launch time.

Abstract: In methods and devices for controlling a TCP proxy server, the TCP-proxy initial window size is set based on TCP RTT measurements. This is possible because the TCP proxy has knowledge about both sides Round Trip Time RTT values just after opening the TCP connections. The proxy can set its initial window size higher in the download case if it notices that the RTT in the link between the proxy and internet is shorter than the RTT in the other link, typically a wireless link. In the opposite case, when the RTT in the link between the proxy and internet is longer than the RTT in the other link, typically a wireless link, the TCP proxy can be configured to send more Acknowledgements (ACKs) to increase the internet TCP server congestion window size faster.

Abstract: A method for operating a plurality of stations in a cooperative station network, wherein each of the stations transmits signals and receives signals from other stations, includes determining a path loss between at least two of the stations. A carrier sense range for signals of a first station of the stations is determined based on the path loss and received power of signals from the other stations. A load on a dedicated signal exchange channel is determined based on the determined carrier sense range. A maximum output power for the first station is determined based on the determined load. The first station is operated by adjusting the output power of the first station to be, at least on average below the determined maximum output power for the first station.