70results about How to "Reduce queuing delay" patented technology

An apparatus 300 for a cellular communication system (100) comprises a buffer (303) which receives data for transmission over an air interface (115). The buffer (303) is coupled to a scheduler (305) which schedules the data and allocates the physical resource of the air interface (115). The transmissions are performed using a retransmission scheme such as a Hybrid-Automatic Repeat reQuest scheme. A load processor (309) determines a load characteristic associated with the scheduler (305) and a target controller (311) sets a target parameter for the retransmission scheme in response to the load characteristic. Specifically, a block error rate target may be set in response to a load level of a cell or plurality of cells. A transmission controller (307) sets a transmission parameter for a transmission in response to the target parameter and a transmitter (301) transmits the data using the transmission parameter. Accordingly, an operating point of the retransmission scheme may be dynamically adjusted thereby reducing overall latency.

Systems and methods are provided that schedule task requests within a computing system based upon the history of task requests. The history of task requests can be represented by a historical log that monitors the receipt of high priority task request submissions over time. This historical log in combination with other user defined scheduling rules is used to schedule the task requests. Task requests in the computer system are maintained in a list that can be divided into a hierarchy of queues differentiated by the level of priority associated with the task requests contained within that queue. The user-defined scheduling rules give scheduling priority to the higher priority task requests, and the historical log is used to predict subsequent submissions of high priority task requests so that lower priority task requests that would interfere with the higher priority task requests will be delayed or will not be scheduled for processing.

The invention discloses an explicit congestion control method based on bandwidth estimation in a high-bandwidth delay network, which comprises the following steps of: calculating the current available bandwidth of a network by a TCP (Transmission Control Protocol) sender through observing an ACK (Acknowledgement Character) receiving interval, loading a router by a packet header ECN (Explicit Congestion Notification) 2bits information feedback network, carrying out network state judgment by the sender through explicit feedback information and estimated available bandwidth values, and adjusting a congestion mechanism according to a judgment result. The congestion is judged by combining end-to-end feedback and router explicit feedback, i.e. finer congestion information is given by using the bandwidth estimation values based on the explicit feedback of coarseness, thus an algorithm ensures high congestion feedback precision while reducing the explicit feedback overhead and improving the protocol popularization, and improves the efficiency and the convergence rate of the protocol.

The invention discloses a TDMA based long propagation delay wireless link time slot distribution method which is mainly used for solving the problem of low throughput rate and low channel utilization rate of an existing long propagation delay wireless ad hoc network. The implementation scheme comprises the steps of 1, initializing a node; 2, judging whether the node receives a synchronous frame, if so, carrying out network access synchronization by the node, and otherwise, building a network by regarding the local clock as a reference by the node; 3, after synchronization is finished, generating a super-frame structure automatically by the node, and dividing the local time into multiple time slots with different functions; and 4, judging whether the current time slot is a service time slot by the node, if so, sending and receiving data, and otherwise, updating network information. as the TDMA is adopted as a channel access mode, the node can access the channel without any conflict; and through an interactive sending mechanism and a data frame queue scheduling mechanism, the network throughput rate and the channel utilization rate are increased, the queuing delay of the data frames is reduced; and the TDMA based long propagation delay wireless link time slot distribution method can be used for a time division multiple access ad hoc network.

The invention provides a vehicle scheduling method for a junction without signal lights in an autonomous driving environment. The method includes that communication requests of a vehicle are transmitted to an RSU (remote subscriber unit) and form communication request sets, and the communication request sets are sequenced in an ascending manner according to scheduled time when the vehicle reachesthe junction; the RSU updates intermediate times of the vehicle according to the nearest vehicle allocation time and nearest vehicle belonging road segment, and the communication request sets are constructed to optimize the vehicle allocation time; the RSU traverses the communication request sets of the vehicle allocation time, the allocation time of the vehicle passing through the junction is calculated, and the intermediate time of the vehicle is updated; the head end of the vehicle reaches the junction at the time allocated by the RSU, the vehicle leaves finally, and the RSU updates the vehicle allocation time and the vehicle belonging road section; the RSU schedules all the vehicles corresponding to the communication requests in the communication request sets to pass through the junction. Compared with the prior art, the vehicle scheduling method has the advantages that time for the vehicles passing through the junction is integrally reduced.

A queue buffer control system is described, in which a queue length parameter QL is compared with a length threshold value Lth for triggering a congestion notification procedure that comprises a decision procedure for deciding whether to perform congestion notification or not. Also, an automatic threshold adaptation procedure S5 for adapting the threshold Lth on the basis of an estimated link capacity value LC is provided. The automatic threshold adaptation procedure S5 is operable notification in one of at least a first and a second adaptation mode, the first adaptation mode being associated with minimizing queuing delay and adapting the threshold value Lth on the basis of n·LC, where n≧1, and the second adaptation mode being associated with maximizing utilization and adapting the threshold value Lth on the basis of m·LC, where m>1 and m>n.

The invention relates to a virtual node based distributed GEO/LEO mixed network routing method, and aims at solving the problem that a present satellite network routing algorithm cannot calculate routes in real time and is too long in delayed time when considering queuing time delay. The earth surface is averagely divided into 72 logical areas according to latitude and longitude, and LEO satellites are associated with the logical areas; the bottom LEO satellites are divided into three groups by a GEO, and each group serves as an LEO family; data is driven and routing is updated; and a routing calculation method is provided. According to different requirements of real-time service and non-real-time service, advantages of GEO and LEO networks are comprehensively utilized to construct a double-layer satellite network, and different layers are used for transmitting different type of packets in the mixed network to prevent the satellites from congestion in the present hop. The virtual node based method can be used to solve the problem that mobility of satellites causes continuous change of topology, and influence of queuing time delay is taken into consideration.

The invention, which belongs to the technical field of car networking communinication, relates to an adaptive rate control method based on mobility and DSRC/WAVE network relevance feedback. The method comprises establishment of a traffic flow density prediction module, a t+1 time communication interference calculation module, an SINR calculation module, a t+1 time available link bandwidth calculation module, a channel congestion cost calculating module and an adaptive message generation rate calculation module. A traffic flow density value at a next time is predicted; according to the density value of the next time, a transmitting power, and a rate, an interference module of a communication process is established, a signal to noise ratio is calculated, and an available link bandwidth of a node at the next time is predicted; on the basis of mismatching of a transmission rate and mismatching of a transmission queue length, a channel congestion cost module is established, so that a message generation rate at the next time is adjusted adaptively. According to the method, adaptive rate adjustment is carried out in advance by using the prediction technology, so that the channel congestion is avoided; and the low communication delay and the high data packet transmission rate are guaranteed with the low calculation time and cost.

The invention relates to an adaptive congestion control method for a communication network and belongs to the technical field of network engineering. The method comprises the following steps: calculating a queue difference e(k) in each sampling period; measuring input flow rate r(k) of a data package; calculating a data flow rate difference x(k); calculating a variance ratio deltar(k) of the dataflow rate; obtaining an average value delta*(k) of the variance ratio of the data flow rate; comparing a transient queue error e(k) with a preset error threshold e[th]; calculating a modified price pr(k) and probability conversion coefficient mu(k) according to a selected control method; calculating a drop probability p(k) by the following formula according to the price pr(k) and the conversion coefficient mu(k), and performing data package drop operation. The method requires simple structure and has strong expandability, and can effectively solve technical problems in REM, reduces route queuing time delay and jitter, ensures high link availability, and has good adaptability in a complicated dynamic environment.

The invention discloses a data center network flow scheduling method based on round-robin, and belongs to the field of data center networks. In the data center networks having redundancy links, the method utilizes the SDN technology, comprehensively takes long flow and short flow distribution situations into account, dynamically controls the forwarding of flows in the networks, and dynamically adjusts queuing states of the flows in an SDN switch according to the size of the flows in the networks. By employing the method, load balancing of the data flows in the data center networks can be achieved, and the delay of the short flow in the internet can be reduced.

A switch at a transmission end of a system including a number of memory devices defining queues for receiving traffic to be switched, each queue having an associated predetermined priority classification, and a processor for controlling the transmission of traffic from the queues. The processor transmits traffic from the higher priority queues before traffic from lower priority queues. The processor monitors the queues to determine whether traffic has arrived at a queue having a higher priority classification than the queue from which traffic is currently being transmitted. The processor suspends the current transmission after transmission of the current minimum transmittable element if traffic has arrived at a higher priority queue, transmits traffic from the higher priority queue, and then resumes the suspended transmission. At a receiving end, a switch that includes a processor separates the interleaved traffic into output queues for reassembly of individual traffic streams from the data stream.

The invention provides a cross-layer QOS (Quality of Service) routing method based on a node occupancy rate in a wireless sensor network. The method comprises the following routing steps of: 1) sending RREQ (Routing Request) grouping information to adjacent idle nodes by a source node; if no adjacent idle nodes exist, sending the RREQ grouping information to the adjacent nodes with the low occupancy rate; 2) comparing a target node address with a self routing table; if the target node address is on the routing table, carrying out step 3); otherwise, carrying out step 4); 3) sending the RREQ grouping information to the target node; 4) sending the RREQ grouping information to the adjacent idle nodes; if no adjacent idle nodes exist, sending the RREQ grouping information to the adjacent nodes with the low occupancy rate and returning back to the step 2); and 5), after receiving the RREQ grouping information by the target node, establishing a communication link. According to the invention, the selection of the nodes is controlled by the node occupancy rate; in a route inquiring process, the nodes at a transmission state are bypassed, so that the queuing time delay is reduced.

The invention relates to a method for setting a message buffer queue length, and belongs to the technical field of computer networks. According to the invention, an Ethernet buffer queue mathematic model is established according to a queuing theory, and then based on an M/G/1/ infinitely great queuing model, loss cost of Ethernet communication is calculated; and finally, an Ethernet optimal buffer queue length existing when the minimum loss cost is obtained is calculated, so that the optimal network buffer queue length at present can be dynamically calculated and set according to changes of the Ethernet bandwidth utilization rate, thereby reducing network data queuing time-delay, guaranteeing real time transmission of the network data and reaching an optimal Ethernet bandwidth utilization rate.

The embodiment of the invention provides a multi-path transmission method and device based on an SCTP-CMT transmission protocol. The method comprises the following steps: according to the number of path groups and the transmission stability of each path group, sending grouped data packets through each path group respectively; wherein the path group comprises one or more transmission paths; and ifit is judged that the cache data volume of the receiving end exceeds the specified cache threshold value, reducing the data transmission rate of one or more path groups, or pausing the data transmission of one or more path groups. Due to the fact that more transmission links are used, the data transmission amount is increased, the transmission pressure of each link is reduced, and the data sendingefficiency can be improved. Meanwhile, when the cache of the receiving end is too large, rate control can be carried out according to the cache data size of the receiving end, and the problems that acache region of the receiving end is blocked due to the too large data size, the data receiving efficiency is reduced, and the efficiency of a whole communication link is influenced are solved.

The invention discloses a packet loss method in a long term evolution (LTE) system and a long term evolution-advanced (LTE-A) system based on an RED (Random Early Detection) algorithm, relates to a packet loss method, and aims to solve the delay problem of long waiting of delay sensitive data flow in a radio link control (RLC) layer buffer of the LTE system and the LTE-A system caused by congestion and even buffer overflow. The packet loss is controlled and implemented by changing the set value of a discard timer in the LTE system and the LTE-A system and comparing an instantaneous queue length in the buffer with a minimal threshold Qmin and a maximal threshold Qmax. The randomness of a probability P ensures the randomness and fairness of the packet loss, and is favorable for the algorithm to avoid continuous packet loss. The method provided by the invention is used for implementing the packet loss in the LTE system and the LTE-A system.

The invention discloses a load balancing edge cooperative caching method for an Internet scene differentiated service. The method comprises the following steps: S1, defining response actions and caching parameters made by edge nodes in an edge cooperative caching system after a user sends an application service request; and S2, initializing parameters, executing an edge cooperative caching process, and calling a load balancing strategy and a differentiated service strategy. The differentiated service strategy is adopted in the edge cooperative caching system to meet the requirements of different service levels of different users in an Internet scene, queuing delay of user requests is reduced through the load balancing strategy, stability of node response request delay is improved, and userexperience is improved.

The embodiment of the invention provides a non-blocking content caching method and device for a content router. The method comprises the steps of analyzing a packet head of a received first target interest packet request; obtaining keywords and offset; judging whether content corresponding to the keywords exists in a CS (Content Store) or not through utilization of a bloom filter; if the content exists, judging whether an I/O waiting queue in the CS is smaller than a preset threshold or not; if the I/O waiting queue is smaller than the preset threshold, pushing a first target data packet to a server which sends the first target interest packet request; if the I/O waiting queue is not smaller than the preset threshold, judging whether the keywords exists in a pending interest table PIT or not; for the fact that the keywords do not exist in the PIT, sending the keywords to an FIB (forwarding information base); carrying out routing forwarding on the keywords by an upstream router through utilization of the FIB; receiving a sent second target data packet; sending the second target data packet to the server corresponding to a port and then deleting a mapping relationship record; and adding the keywords to a data structure of the bloom filter. According to the method, the problem that the CS is congested frequently is solved.

The invention discloses a new energy automobile charging control system which comprises the following parts of new energy automobiles 1, a control center 2, user phones 3, charging piles 4 and a powergrid 5. The charging automobiles are accurately distributed to the charging piles according to the time sequence, charging is standard and controllable, and charging and discharging control efficiency is brought into full play. In the whole automobile dispatching process, the automobiles do not need to queue up to wait, queuing time delay is reduced, the time required for charging and dischargingis shortened, due to the fact that voice or video call data packages serve as channel carriers, channels can be established between automobile users and the control center at any time, hidden addresses are embedded in effective information of the data packages, the capacity of the channels is greatly increased, and the channels are unlikely to interfere in each other when the automobiles are multiple.

A multi-wavelength optical network using single-fibre bidirectional transmission to realize the multiplexing of partial wavelengthes is composed of a link/control module, two bidirectional star couplers and 2(N-1) nodes. Each bidirectional star coupler is connected to the link/control module via a port and an optical fiber, and can be connected to (N-1) nodes via an optical fibre for each node. Its advantages are more number of nodes (increased by one time), high network through put, short time delay, and optical fibres saved by one time.

The invention discloses an AFDX (avionics full-duplex switch Ethernet) network switch with a time-space separation characteristic. The AFDX network switch comprises N input ports, N output ports, 2N DMAs (direct memory accesses), a switch controller and N memories, wherein each input port is connected with one memory by one DMA, and the memory is further connected with an output port by one DMA; and the 2N DMAs are connected with the switch controller. The switch with a time-space separation characteristic in an AFDX system provided by the invention is easy to realize by software and hardware; and in case of keeping 100% of throughput, the time delay of a data package after passing through the switch, the queuing time delay of the data package in a buffer area of the switch, and the queue size of the buffer area are respectively and greatly reduced.