Abstract: This disclosure relates to techniques for detecting a signal and powering off at least some receiver components if no signal is detected. A wireless device may take one or more measurements of one or more signals. The wireless device may determine, based on the measurements, whether a signal (e.g., a signal of a licensed assisted access cell) is anticipated during an upcoming time period, e.g., a subframe or portion of a subframe. If no signal is anticipated, the wireless device may power off at least some receiver functions.

Abstract: A time synchronization method, a programmable logic device, a single board and a network element are provided. In the method, a programmable logic device receives a request message from a terminal, generates a time synchronization message according to the request message, and sends the time synchronization message to the terminal.

Abstract: A cryptographic accelerator (processor) retrieves data blocks for processing from a memory. These data blocks arrive and are stored in an input buffer in the order they were stored in memory (or other known order)—typically sequentially according to memory address (i.e., in-order.) The processor waits until a certain number of data blocks are available in the input buffer and then randomly selects blocks from the input buffer for processing. This randomizes the processing order of the data blocks. The processing order of data blocks may be randomized within sets of data blocks associated with a single read transaction, or across sets of data blocks associated with multiple read transactions.

Abstract: A method for determining link direction of resources in a wireless communication system, the method performed by a user equipment (UE) includes receiving frame configuration information from a base station, wherein the frame configuration information indicates at least one of default resources and flexible resources in a frame, receiving downlink control information (DCI) format from the base station, and determining link direction of the flexible resources in the frame based on the frame configuration information and the DCI format.

Abstract: Aspects of the present invention relate to the scheduling of resources in a telecommunication system that includes a mobile terminal and base station. In one embodiment, the mobile terminal sends an initial scheduling request to a base station. Subsequently, the mobile terminal does not transmit a scheduling request to the base station unless and until a scheduling request triggering event is detected.

Abstract: This application describes a network device, a controller, a queue management method, and a traffic management chip. The method may be applied to a traffic management chip that uses an HQoS technology, and can include receiving a queue management instruction sent by a controller, where the queue management instruction includes an identifier of a first scheduler and an identifier of a first queue, and the first scheduler is one of multiple first-level schedulers. The method may also include controlling, according to the queue management instruction, scheduling of the first queue by the first scheduler, where a queue scheduled by the first scheduler belongs to a queue resource pool of the TM chip, and the queue resource pool includes at least one to-be-allocated queue. In this application, decoupling between queue allocation and the first-level schedulers is implemented, flexibility of queue allocation is improved, and utilization of queue resources is improved.

Abstract: A method for updating a firmware of a complex programmable logic device comprises: electrically connecting a general purpose input/output pin of a baseboard management controller with a hitless enable pin of a complex programmable logic device; electrically connecting a first integrated circuit bus of the baseboard management controller with a second integrated circuit bus of the complex programmable logic device; inputting and transmitting a update command to the baseboard management controller by a local operating system; enabling the hitless enable pin by the baseboard management controller according to the update command; cleaning a first firmware in the complex programmable logic device by the baseboard management controller according to the update command; and burning a second firmware into the complex programmable logic device by the baseboard management controller according to the update command.

Abstract: The present disclosure provides a data packet transmission method and a device. The method includes: performing, by a transmit end device, channel coding on a to-be-sent data packet, and dividing the coded data packet into at least two data sub-packets; allocating a transmission resource to each data sub-packet; generating control information for each data sub-packet according to transmission resources of the at least two data sub-packets; and sending each data sub-packet and the control information of the data sub-packet on a corresponding transmission resource. A data packet and control information indicating a transmission resource of a data sub-packet are transmitted simultaneously, so that a receive end device can recognize multiple transmissions of a same data packet, and perform joint processing on multiple data sub-packets corresponding to the same data packet to obtain the sent data packet, and data packet transmission reliability is improved.

Abstract: An antenna system, including: M transmit antenna pairs, where two transmit antennas of each transmit antenna pair are symmetrically distributed on both sides of a same symmetry axis; N receive antenna pairs, where two receive antennas of each receive antenna pair are symmetrically distributed on both sides of the symmetry axis; M dividing devices, which are one-to-one corresponding to the M transmit antenna pairs, and each dividing device is configured to: divide one transmit signal into two transmit signals and separately send the two transmit signals to a corresponding transmit antenna pair; and N combining devices, which are one-to-one corresponding to the N receive antenna pairs. Each combining device is configured to combine two receive signals received by a corresponding receive antenna pair into one receive signal. One of the dividing device and the combining device is an in-phase dividing device, and the other is an out-of-phase combining device.

Abstract: The present disclosure relates to a communication method and system for converging a 5th-Generation (5G) communication system for supporting higher data rates beyond a 4th-Generation (4G) system with a technology for Internet of Things (IoT). The present disclosure may be applied to intelligent services based on the 5G communication technology and the IoT-related technology, such as smart home, smart building, smart city, smart car, connected car, health care, digital education, smart retail, security and safety services. A transmission control method and a central management apparatus for performing the method are provided.

Abstract: This application relates to a data transmission method. The method includes: determining, by a second node, first indication information based on basic information of a terminal device and/or network information, and sending the first indication information to a first node, where the first indication information is used for indicating that the terminal device is scheduled by the first node or is scheduled by the second node; if the first indication information indicates that the terminal device is scheduled by the first node, sending, by the second node to the first node, a data packet that has not been processed by using a scheduling function of the second node; or if the first indication information indicates that the terminal device is scheduled by the second node, sending, by the second node to the first node, a data packet that has been processed by using a scheduling function of the second node.

Abstract: Remotely debugging a non-responsive operating system (OS) of a computer system. Central processing units (CPUs) in a computer system are bound to receive queues of a network adapter. Interrupts for a CPU is disabled, wherein the CPU is not available to process hardware interrupt requests queued in the bound receive queues. A debugging message including debugging commands is received by the network adapter, wherein the debugging message is stored in a first receive queue of the network adapter bound to a first CPU. If the first CPU is available, the debugging commands in the debugging message stored in the first of the one or more receive queues of the network adapter are identified by a debugger of the computer system. The identified debugging commands are executed by the CPU to debug the non-responsive OS of the computer system.

Abstract: A computing resource service receives a request. In response to the request, the computing resource service queries a probabilistic data structure for an entry corresponding to the request. The computing resource service obtains, from the probabilistic data structure, a value that corresponds to the entry. Based at least in part on this value, the computing resource service determines whether the entry has expired. If the entry is expired, the request is fulfilled. However, if the entry has not expired, the request is denied.

Abstract: An end user premises device includes a memory, one or more transceivers, and one or more processors. The one or more processors are configured to receive a user request for data and determine a time to retrieve the data that is during an off-peak time for a network. The retrieval time is determined based on a time when the data will likely be accessed by a client device. At the determined retrieval time, the data is retrieved via the network and stored in the memory. In response to another user request, the data is transmitted to the client device. The one or more processors are optionally also configured to predict data that will likely be accessed by the client device and to retrieve the predicted data during an off-peak time for the network and before a time when the data will likely be accessed.

Abstract: In one embodiment, a device in a network maintains a plurality of applications executed by the device. The device associates the plurality of applications with a node in the network. The device schedules a time period during which a particular one of the applications is authorized to access the node associated with the applications. The device relays data packets between the node and the particular application during the scheduled time period.

Abstract: Micro-schedulers control bandwidth allocation for clients, each client subscribing to a respective predefined portion of bandwidth of an outgoing communication link. A macro-scheduler controls the micro-schedulers, by allocating the respective subscribed portion of bandwidth associated with each respective client that is active, by a predefined first deadline, with residual bandwidth that is unused by the respective clients being shared proportionately among respective active clients by a predefined second deadline, while minimizing coordination among micro-schedulers by the macro-scheduler periodically adjusting respective bandwidth allocations to each micro-scheduler.

Abstract: Examples of the disclosure provide for providing a global timestamp in a distributed system. A plurality of nodes are connected via a network. A logical clock is implemented on a node of the plurality of nodes. The logical clock sets a global time for the network, such that another node of the plurality of nodes labels a local event with a global timestamp interval based on the global time provided by the logical clock.

Abstract: A wireless transmit/receive unit (WTRU) may select a first type of buffer status information or a second type of buffer status information. The first type of buffer status information may indicate an amount of data buffered and the second type of buffer status information has less bits and is a different format than the first type of buffer status information. The WTRU may select, subsequent to a number of subframes of a transmission of buffer status information of a first type, buffer status information of the first type for transmission.

Abstract: According to some embodiments, system and methods are provided, comprising at least one asset; a computer programmed with a data share module for the asset, the data share module for controlling data flow in the asset; the computer including a data share processor and a memory in communication with the data share processor, the memory storing the data share module and additional program instructions, wherein the data share processor is operative with the data share module and additional program instructions to perform functions as follows: receiving a message from a source at the data share module; determining, via the data share module, whether the source is one of a non-real time domain of the asset and the real-time domain of the asset; determining, via the data share module, when a destination is able to respond to the message, wherein the destination is one of the non-real time domain and the real-time domain, and wherein the destination is different from the source; transmitting, via the data share modu

Abstract: An antenna arrangement includes antenna elements that are arranged, at each end of a Line of Sight communication link, into a selected shape. Distances between the antenna elements at each end of the link are determined based on a Line of Sight distance between the ends of the link and interference alignment between the antenna elements at the ends of the link. Different subsets of the antenna elements are coupled to communication modules at each end of the link. Signals are exchanged between the antenna elements at the ends of the link, and the signals are processed for interference alignment. The antenna element subsets may include two or more antenna elements, and may be unique or include common antenna elements that are common to multiple subsets.

Abstract: The present disclosure describes methods, systems, and computer program products for using DeltaIterators in a database. One computer-implemented method includes, for each of multiple delta parts of a database that store values of an attribute of a table: identifying, by operation of a computer system, a set of values of the attribute stored in the delta part of the database, and identifying a current value in the set of values; identifying, a first critical value among the multiple current values, wherein the first critical value is a current value of a first set of values of the attribute stored in a first delta part of the database; outputting the first critical value; identifying a next value in first set of values; identifying a second critical value among the next value and the multiple current values except the first critical value; and outputting the second critical value.

Abstract: Systems and methods for purposeful computing that, among other things, include a fact reliability system employing standardized and interoperably interpretable one or more fact test methods.

Abstract: A method and rate controlling node (206) for providing a recommended data rate for a communication i of data on a radio channel between a data sending node (200) and a data receiving node (202) over a shared radio link (204). The rate controlling node (206) determines a fair data rate Ri for the data communication based on a current load on the shared radio link (204), and also determines a maximum flow data rate Rmax,i for the data communication i a highest possible data rate that the data sending node (200) is able to use in the data communication. The rate controlling node (206) then signals (2:5) a recommended data rate for the data communication i as a minimum of the determined fair data rate Ri and the determined maximum flow data rate Rmax,i to the data sending node (200).

Abstract: Systems, methods, apparatuses, and computer program products for a new radio (NR) physical layer arrangement are provided. One method may include receiving, by user equipment, configuration of scheduling request resources on a plurality of resource pools. The method may also include determining a slot type when the user equipment is to transmit a scheduling request in a certain slot, and, based on the determined slot type and the received scheduling request resources configuration, determining whether the user equipment has a scheduling request resource allocated in the plurality of resource pools in the certain slot.

Abstract: Modifiable guard periods are provided for time division duplexing (TDD) wireless communications. Guard periods may be modified based at least in part on propagation delay information, such as timing advance (TA) information, for one or more user equipment (UE) in a TDD wireless system. Modifiable guard periods may allow for enhanced system efficiency for the TDD wireless system relative to systems that may use a static or semi-statically configured guard period for TDD communications. Modifiable guard periods may in some cases allow one or more uplink or downlink transmissions to be provided within a legacy guard period of a legacy TDD special subframe.

Abstract: Methods and apparatus for multiple user uplink are provided. In one aspect, a method includes generating, at an access point, an aggregated message. The aggregated message includes a single-user broadcast message and at least one other message. The method further includes transmitting the aggregated message to one or more stations.

Abstract: Systems and methods for purposeful computing that, among other things, facilitate identification and evaluation of resources based, at least in part, on the use of purpose expressions.

Abstract: A path computation method involves receiving (200) a request for computation of a new path in the network, the request indicating a future time interval when the path is desired. Subsequently a future network status is generated (210, 212, 214), having a representation of availability of path resources at the future time interval, based on selected paths already reserved at that future time interval. Then there is a step of computing (220) which of the path resources to select for the new path according to the future network status. By generating this future network status when the future time interval is known, it can be generated in respect of a limited time interval rather than covering all possible future reservable times. Thus the benefits of time aware path computation can be achieved without the need for maintaining a huge database of availability at all future times, of all the path resources.

Abstract: A method and system for assigning working addresses to slave units in a vehicle fire system. Slave units responding to a default address are identified along with available working addresses. Individual slave units are isolated at the default address by instructing the slaves to compare their serial numbers to a broadcast serial number until only a single slave responds, wherein bits in the serial numbers are reversed to create a more sparse distribution of the serial numbers of the slave units, and assigning the slave units, which responded to the default address, to the available working addresses.

Abstract: Disclosed herein are system, method, and computer program product embodiments for network-based user identification. An embodiment operates by transmitting a discovery signal over a network, and receiving a response to the discovery signal from a mobile device coupled to the network. Based on the response it is determined whether the mobile device is within a threshold vicinity of the streaming media device. Which if it is, user settings corresponding to a user of the mobile device, which may also be a user of another device associated with the settings are determined. The other device is then configured based on the user settings.

Abstract: Task-based data transmission comprises, at a user end, sending a data synchronization request related to a task to a server end, wherein the data synchronization request comprises information about the task and a data synchronization strategy corresponding to the task, and receiving data corresponding to the data synchronization request that is returned by the server end. At the server end, a data synchronization request related to a task can be received by a requesting end. Data corresponding to the data synchronization request is determined, and then the requested corresponding data can be returned to the requesting end. Data related to a task currently to be done by a user is acquired from a server end by using a task-related data synchronization request, so that the user can quickly and flexibly virtualize a working environment of the user related to the task.

Abstract: One embodiment relates to a method for transmitting data via an optical network comprising a plurality of optical nodes, in which at least one wavelength is dedicated to the transmission, in the network, of data bursts transmitted by at least one source node and wherein the data bursts are intended for an addressee node. The method may comprise transmitting a control message from the addressee node to the at least one source node wherein the control message is conveyed in an optical signal emitted according to the wavelength dedicated to the transmission, in the network, of data bursts intended for the addressee node.

Abstract: Systems, methods, and computer-readable media are disclosed for streaming media content. The systems, methods, and computer-readable media described herein may improve user experiences and reduce device failures by mitigating problems between devices. In an example method described herein, a media streaming device may be connected to a display device in order to facilitate streaming of content. A processing apparatus of the media streaming device may determine that the display device is not presenting content streamed from the media streaming device and in turn switch the antenna radiation pattern from a first pattern to a second pattern.

Abstract: Systems, methods, and devices for transmitting data are described herein. In some aspects, a method comprises generating a first message. The first message may comprise an allocation of a first station to a first frequency channel and a second station to a second frequency channel. The method further comprises transmitting the first message over the first frequency channel and the second frequency channel. The method further comprises transmitting, after transmission of the first message, a second message to the first station using the first frequency channel. The method further comprises transmitting, after transmission of the first message, a third message to the second station using the second frequency channel.

Abstract: Provided are systems and methods for a network station receiving a communication schedule announced by a first wireless network station, determining that the first wireless network station has a right to generate an adjusted communication schedule, and transmitting an availability window schedule to the first wireless network station. The availability window schedule indicates one or more time slots during which communication with the wireless network station is inhibited.

Abstract: A USB-to-coaxial network bridging system and method includes receiving data frames from a USB or FireWire device via a corresponding USB or FireWire communication interface, wherein the received data frames are intended for transmittal to a predetermined remote device on a coaxial network; combining the received data frames into an aggregated frame and addressing the aggregated frame to allow the aggregated frame to be routed to the predetermined remote device on the coaxial network; and sending the aggregated frame to the remote device over the coaxial network.

Abstract: The present disclosure provides a method for a base station informing a user equipment (UE) of a resource configuration for D2D PSCCH, and corresponding base station and user equipment. The method comprising: generating D2D grant information, the D2D grant information including D2D PSCCH resource configuration instruction information which is used to indicate the time-frequency position of a first physical resource block pair for transmitting PSCCH; and transmitting the D2D grant information to the UE, wherein the time-frequency position of a second physical resource block pair for transmitting PSCCH can be derived from the time-frequency position of the first physical resource block pair.

Abstract: To solve the problem of still being able to use an inexpensive network controller which can store only a single transmission time, even when telegrams from a plurality of application modules need to be sent in synchronized fashion and the transmission times thereof need to be reliably ascertained and reliably associated with the respective telegrams, provided is a communication device for the synchronized sending of telegrams, a communication system including such a communication device, and a method for the synchronized sending of telegrams. The communication device comprises a coordination device.

Abstract: A communication device includes a communication port including network interface circuitry; and a processor, and a non-transitory storage medium configured to store program instructions which, when executed by the processor cause the communication device to perform a network operation comprising: entering into a listening phase; and searching for and attempting to acquire a network.

Abstract: A computer-implemented medium using a scheduler for processing requests by receiving packet data from multiple source ports and then classifying, the received packet data based upon the source port received and a destination port the data being sent. Next, sorting, the classified packet data into multiple queues in a buffer, and updating, a static component of one or more of the multiple queues upon the queue receiving the sorted classified data packet. Further, scheduling, using the scheduler based upon the destination port availability and a set of fairness factors including priority weights and positions, for selecting a dequeuing of data packets from a set of corresponding queues of the multiple queues, and then updating the static of the dequeued queue upon the data packet being outputted from the dequeued queue.

Abstract: Aspects of the subject disclosure may include, for example, a device including a processing system that receives items of media content; delivers the items over a network according to a schedule determined by a content delivery scheduling system; detects a level of broadcast network capacity utilization; and periodically generates and transmits to the scheduling system a forecast of network capacity utilization. A new forecast is generated and transmitted responsive to the network capacity utilization deviating from the forecast by more than a predetermined tolerance. A resource for delivering the items of media content is dynamically assigned to the processing system by the scheduling system in accordance with a current forecast. The items of media content comprise a queue accessible to the content delivery scheduling system; the queue is maintained by the scheduling system and is uniquely assigned to the processing system. Other embodiments are disclosed.

Abstract: Certain aspects of the present disclosure provide a method for wireless communications. The method comprises generating a frame comprising a first portion and a second portion. The method also comprises outputting the first portion of the frame for transmission on at least one channel, shifting a center frequency of the at least one channel, and outputting the second portion of the frame for transmission on the at least one channel after the center frequency shift.

Abstract: In certain embodiments, a system includes one or more memory units and one or more processing units. The memory units store blocks that each include a number of identifiers. The memory units include executable instructions that upon execution by the processing units cause the system to receive a request to allocate an identifier to an entity. The request includes data identifying the entity. A target block of identifiers is identified. The target block includes more unallocated identifiers than any other block. The target block is split into first and second blocks. The identifiers of the second block are each higher than any identifier of the first block. The second block is assigned to the entity, and a lowest identifier of the second block is allocated to the entity.

Abstract: According to an aspect, a method for estimating available user data rate in a communications channel is provided. Node weight selection parameters are monitored by a resource manager executing on a node in communication with neighbor nodes. Neighbor node weight selection parameters are analyzed by the node. The node determines whether a change to a node weight or a neighbor node weight is needed to balance the available user data rate. The available user data rate is estimated for the node and the node weight is predictively adjusted as needed. The available user data rate is estimated for one or more of the neighbor nodes and an estimate of the neighbor node weight is generated as needed. A scheduler for the communications channel is updated based on the node weight and the estimate of the neighbor node weight.

Abstract: A non-volatile memory system receives a request to read data. That request includes a quality of service indication. The memory system performs a read process that satisfies the quality of service indication and identifies a set of data with errors. The memory system returns the set of data with errors in response to the request.

Abstract: Sensitive data is sent through insecure network regions across different software defined networks (SDNs) over an encrypted path without requiring encryption applications at the source or destination hosts. One or more special-purpose encryptors are strategically placed within each SDN, which can act as an encryptor or decryptor, of both the data packet content and the header. Using the controller and a special encryption service application, the encrypted IP packets are forwarded from an encryptor, closest to the source, towards a decryptor, closest to the destination, utilizing a tagging method. Each encryptor has a static and globally unique tag. Each controller advertises to other controllers its encryptor information: IP of the encryptor, the IP block of the users the encryptor is responsible for and the unique encryptor tag(s). Each forwarder along the flow path is instructed by its respective controller how to forward packets towards the destination according to the tag.

Abstract: Techniques for allocating resources for communication in a communication network are disclosed. In one particular embodiment, the techniques may be realized as a method for allocating resources for communication in a communication network comprising receiving a request for a session associated with a mobile device from a mobility management device, wherein the request comprises a group identifier identifying a group of communication sessions in which the requested session is a member; receiving the service plan associated with the group of communication sessions; allocating shared resources to the group of communication sessions in accordance with the service plan; and sending a response to the mobility management device, indicating that the requested session has been established for the mobile device.

Abstract: Embodiments include methods, systems and computer program products a for offloading multiple processing operations to an accelerator includes receiving, by a processing device, a database query from an application. The method also includes performing analysis on the database query and selecting an accelerator template from a plurality of accelerator templates based on the analysis of the database query. The method further includes transmitting an indication of the accelerator template to the accelerator and executing at least a portion of the database query on the accelerator.

Abstract: A method to schedule multiple traffic flows through a multiplexer server to provide fairness while minimizing the sizes of the associated queues, is proposed. The multiplexer server minimizes a quantity called the maximum Normalized Service Lag for each traffic flow. In each time-slot, the normalized service lag of every traffic flow may be updated by adding the normalized lag increment value, whether or not there is a packet in the queue associated with the flow. In each time-slot, a multiplexer server selects a traffic flow to service with an available packet and with the maximum normalized service lag. When the traffic rate requested by each traffic flow is stable, the multiplexer server schedule may repeat periodically. Efficient methods to compute periodic schedules are proposed. The methods can be applied to packet-switched Internet routers to achieve reduced queue sizes and delay.

Abstract: K classifiers and S network service processors are deployed in a network device. A network adapter receiving queue is divided into multiple queue areas. Each classifier may acquire a packet identifier from a queue area that corresponds to the classifier and is in the network adapter receiving queue, that is, the network adapter receiving queue has multiple information reading interfaces such that the K classifiers may concurrently read packet identifiers from corresponding queue areas in the network adapter receiving queue, and the K classifiers may further concurrently determine, based on the packet identifiers acquired by the K classifiers, corresponding flow queue identifiers. Related operations before the K classifiers distribute packet description information to flow queues may all be concurrently executed, and concurrent execution makes processing times of the related operations become partially or completely overlapped.