H04L12/801

METHOD AND DEVICE FOR PERFORMING CARRIER SCHEDULING

Embodiments of the present application relate to the technical field of wireless communications, and in particular, to a method and a device for performing carrier scheduling, which are used to perform scheduling for an unlicensed carrier. In the embodiments of the present application, a terminal performs uplink channel measurement in an uplink subframe or an uplink measurement time period of an unlicensed carrier, to determine uplink channel quality information, and/or performs downlink channel measurement in a downlink subframe of the unlicensed carrier, to determine downlink channel quality information; and the terminal notifies a network side device of the determined uplink channel quality information, and the network side device determines, according to the received uplink channel quality information, whether to perform uplink scheduling on the terminal on the unlicensed carrier, and the terminal notifies the network side device of the determined downlink channel quality information, so that the network side device determines, according to the received downlink channel quality information, whether to perform downlink scheduling on the terminal on the unlicensed carrier. In this way, scheduling is implemented for the unlicensed carrier, thereby further improving system performance.

KIND OF SELF-ADAPTIVE NETWORK CONGESTION CONTROL METHOD BASED ON SCPS-TP

A kind of self-adaptive network congestion control method based on SCPS-TP, which includes the following steps: The SCPS-TP's gateway source-end receives and transmits the packets to destination end; Judge if there is new packet received in accordance with the analyzed ACK; If there is no new packet received, when the duplicate ACK counter increase to a certain value, change the window size's growth pattern to linear self-adaptive pattern; If there is new packet received, the congestion control is in the exponential growth pattern. After window is enlarged, Diff is bigger than the set threshold value and the congestion control method is changed to linear self-adaptive pattern; If congestion control is in the linear self-adaptive pattern, adjust window size in accordance with Diff; The SCPS-TP's gateway source-end sends the packets in the packet loss buffer to destination end and sends new packets in accordance with the size of congestion window.

METHOD AND DEVICE FOR FORWARDING DATA MESSAGES

The present application discloses a method and device for forwarding a data message. A specific embodiment of the method comprises: receiving the data message and reading a data context length value of a first row in the data message; determining whether the data context length value is less than or equal to a maximum segment size in a single transmission according to a transmission control protocol; reading data from the data message in segments in response to the data context length value being less than or equal to the maximum segment size in the single transmission according to the transmission control protocol; reading data from the data message in rows in response to the data context length value being greater than the maximum segment size in the single transmission according to the transmission control protocol; and storing the read data in a user buffer, and sending the data in the user buffer to a terminal if the data in the user buffer exceeds a preset capacity threshold. According to this embodiment, the data messages can be quickly and efficiently forwarded.

PHYSICAL RESOURCE SHARING ON WIRELESS INTERFACE
20170347351 · 2017-11-30 · ·

The present disclosure generally discloses a wireless resource sharing mechanism configured to support sharing of physical wireless resources of a wireless interface of a wireless access device. The wireless resource sharing mechanism is configured to support sharing of physical wireless resources of a wireless interface of a wireless access device in order to support Machine-Type Communications (MTCs). The wireless resource sharing mechanism is configured to support sharing of physical wireless resources, of a wireless interface of a wireless access device, between MTC traffic of MTC devices and non-MTC traffic of non-MTC devices (referred to herein as legacy traffic of legacy devices). The wireless resource sharing mechanism is configured to support sharing of physical wireless resources, of a wireless interface of a wireless access device, within a scheduling time interval of the wireless interface of the wireless access device.

MONITORING AND MANAGEMENT OF eMBMS SYSTEMS

The present disclosure generally discloses dynamic monitoring and management capabilities for use in wireless communication systems. The dynamic monitoring and management capabilities may be configured to support dynamic monitoring and management within various types of contexts and associated environments. The dynamic monitoring and management capabilities may include feedback collection capabilities, service quality evaluation capabilities, parameter tuning capabilities, or the like, as well as various combinations thereof.

Upstream Channels for Distributed CMTS

A novel method of operating a Distributed Cable Modem Termination System is provided. Each branch CMTS node in a distributed CMTS supports a complete CMTS system and with full-spectrum ports. One or more MAC domains are defined at each branch CMTS node. A MAC domain defined at a branch CMTS node includes only service flows of the CMs that are connected to the branch CMTS node. Identifiers of service flows coming from a branch CMTS node are always unique, i.e., two different service flows of the branch CMTS would always have different SIDs, even if they belong to different MAC domains. On the other hand, service flows belonging to different branch CMTS nodes are free to reuse the same identifiers.

MANAGING BUFFERS FOR RATE PACING
20170346745 · 2017-11-30 ·

A method, decoder and server for managing buffers for rate pacing. The decoder includes a memory, a transceiver configured to transmit and receive a signal, and processing circuitry operably connected to the memory and the transceiver. The processing circuitry receives, from the server, a removal rate message indicating a drain rate of a pacing buffer of the decoder. The processing circuitry also provides packets from the pacing buffer to a decoding buffer of the decoder according to the drain rate.

DYNAMIC MULTI-PATH CONTROL AND ADAPTIVE END-TO-END CONTENT DELIVERY OVER WIRELESS MEDIA
20170346724 · 2017-11-30 ·

A radio access network element includes at least one transceiver coupled to at least one processor. The at least one processor configured to execute computer readable instructions to: determine a first available throughput for a first path traversing a first wireless network; determine a second available throughput for a second path traversing a second wireless network; and establish, for at least one packet communication protocol connection, at least one of a first multipath packet flow via the first path and a second multipath packet flow via the second path based on (i) a throughput gap threshold value and (ii) a throughput gap parameter for the first and second paths, the throughput gap parameter indicative of a difference between the first available throughput and the second available throughput.

End-to-end Enhanced Reliable Datagram Transport
20170346742 · 2017-11-30 ·

A method for communication includes establishing, using an end-to-end reliable transport context, a channel for exchange of data packets over a network between a first network interface controller (NIC) of a first computing node on the network and a second NIC of a second computing node on the network. The first NIC accepts first and second work items for execution on behalf of different, first and second sender processes, respectively, that are running on the first computing node. The first and second work items are executed by transmitting over the network from the first NIC to the second NIC, using the end-to-end reliable transport context, first and second messages directed to different, first and second receiver process running on the second computing node, using the same end-to-end reliable transport context. The second message is sent before receiving from the second NIC any acknowledgment of the first message.

VERIFICATION MECHANISM FOR NETWORK SERVICE CHAIN PATHS

Data packets passing from a source to a destination in a network according to a Service Function Chain (SFC) are processed by an ordered sequence of at least one service function (SF). For each SF in the SFC in order, a current value of a function, such as a hash function, is recursively computed including, as input values, at least current identifying data that identifies a corresponding current one of the SFs, and a value of the function output from an immediately preceding SF. After computing the current value of the function for a selected SF in the SFC, the current value of the function is compared with an expected value. If the value of the function for the selected SF is the same as the expected value, the data packet is allowed to be transmitted to a subsequent processing stage; if not, then an error response action is taken.