78 results about "Fair distribution" patented technology

Bandwidth allocation configuration and fully decentralized adaptive medium access control (AMAC) systems and methods with support for time critical applications, spectrum efficiency, scalability enhancements, and fair allocation of bandwidth among nodes sharing a common channel. The methods fully integrate TDMA and CSMA/CA channel access approaches and incorporate adaptive congestion and collisions avoidance scheme to reduce bandwidth wastage and diminish adverse cross layers interactions. AMAC improves support for multi-media traffic while allowing higher transmission incidents from large number of transmitting devices sharing a common channel, with fair distribution of the available bandwidth, to enable improved multi-level-security connectivity over a common multi-hop wireless network, provide end-to-end performance enhancement for constant bit rate traffic, variable bit rate traffic, and distribute bandwidth fairly amongst competing TCP traffic flows that traverse varying length paths in multi-hop ad-hoc wireless networks.

Systems and methods which provide network congestion avoidance implementing a fairness scheme in which a cost function is used are shown. Transmission cost, for use in network congestion avoidance packet dropping decisions, may be determined from an amount of air time needed to transmit a data packet, a transmission data rate, a size of a packet, an amount of spectral energy or transmit power associated with transmission, etc. A packet dropping probability for a particular packet is preferably determined as a function of the current flow cost and average flow cost to provide fair allocation of network communications resources. Embodiments additionally implement buffer based packet dropping probability calculation in order to provide a robust network congestion avoidance technique. Cost based packet dropping probability calculation and buffer based packet dropping probability calculation implemented according to embodiments are adapted to accommodate quality of service applications.

The present invention is a shared buffer architecture that dynamically allocates buffer size to each of multiple sources depending on buffer pool utilization, estimated per-connection offered load, and the total number of connection established within a given class of service. When the buffer pool is almost empty, each source is allocated a large buffer space, proportional to its estimated offered load. When the buffer pool is more full each source is allocated a reduced buffer space, while maintaining the proportional weighting relationship. The invention keeps track of the amount of input per source and dynamically allocates a proportionate amount of buffer space in the buffer memory for that source. The dynamic allocation is made as a function of the fullness of the memory allocation for all sources. Additionally, thresholds are modulated dynamically as the number of established connections within a given class modulates, providing a predictive aspect to the system, with respect to congestion control. The main objective is to fairly allocate buffer space depending on the amount of traffic and the amount of buffer space taken up by each source. In operation, the memory allocation is readjusted depending on the total number of cells in the buffer memory, the estimated offered load, and the total number of connection established within each class of service, providing a highly dimensional solution to the multi-dimensional problem of congestion management in communication network nodes.

The present invention relates to a method for finding the best match between buyers (or buyers consortiums) and sellers (or sellers consortiums), by a set of software intermediaries, and for using the information developed in those matches to define monetary and performance commitments between parties, and to create fair distribution of the benefits of the agreement among the respective participants. The system solves three related optimization problems concurrently: the optimal aggregation of individual buyers into buyers consortiums; the optimal aggregation of individual sellers into sellers consortiums, and the optimal match of requirements, posed by the buyers consortium, to offers, posed by the sellers consortium.

Dice are disclosed that detect their state, i.e., their own value once at rest, using for instance gravity, piezoelectricity, or photoelectric cells that are assigned to all faces to recognize the lower face. Said dice preferably transmit said state to a computer. Said computer may be the same that is used for the game that depends on the throw of the dice, or may be used mostly for display as for some casino games. Electricity is used in the die to let it determine its own state and transmit it. Economical protocols of transmission are used such as Bluetooth. Such dice may securely send alerts whenever deviations from a fair distribution of the outcomes is detected and can monitor small modifications of their balance to maintain their fairness. Part or all of the teaching can be realized as MEMS (micro electro-mechanical systems) or NEMS (nano electromechanical systems) modifications of usual dice.

A wireless local area network that carries mixed traffic of voice and data communications may be provided. The wireless local area network may include an access point and a plurality of remote terminals that are associated with the access point. The access point may be operably coupled to a wireline network. The access point may receive voice and other communications packets from the remote terminals and the wireline network. Some of the packets may be for transmission to the remote terminals. The access point manages which packets to transmit and when to transmit packets. The access point may manage traffic to maintain a fair distribution of packets and to give priority to voice communications over other communications.

A telecommunication system uses a dynamic bandwidth allocation (DBA) algorithm based on current load conditions for controlling transmissions to a plurality of access modules of an access node in order to achieve a fair allocation of network bandwidth at the access node. As an example, access modules at an access node communicate via a control channel with dynamic bandwidth allocation (DBA) logic that receives load information from each of the access modules. Using such load information, the DBA logic dynamically controls the upstream data rates so that a fair allocation of network bandwidth is achieved across all of the access modules. Specifically, the data rates are controlled such that packet flows for services of the same class achieve the same or similar performance (e.g., average data rate) regardless of which access module is receiving each respective packet flow.

The invention disclosed comprises a method for encouraging fair sharing of limited material inventory and capacity between multiple customers when creating a production plan. the invention allocates resources among competing demands in a linear programming production planning system by first classifying the demands into fair share sets, wherein all demands within each set have the same priority, calculating the cumulative demand for each resource within each set, and then allocating the resources to the demands in order of fair share set priority. If, during the allocating process, the supply of a given resource cannot satisfy a given cumulative demand of a given set, the given resource is allocated proportionally (e.g., evenly or according to usage proportions) among all demands that contribute to the given cumulative demand within the given set. This is an advanced planning system for optimizing established planning objectives (e.g., customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) to compute a feasible production plan for the enterprise.

The invention discloses a congestion control method based on the node cache length equitable distribution rate. Congestion is detected by estimating the cache length of all nodes at the next moment T. If the cache length exceeds the maximum value of the cache length, congestion announcement information is broadcasted to upstream neighbor nodes to forbid the upstream neighbor nodes to send data, and congestion release is conducted. If the nodes are upstream neighbor nodes, firstly, the cache length of the nodes is estimated according to obtained downstream forward node data; next, congestion is detected according to the cache length of forward nodes; if the forward nodes generate congestion, the node congestion degree, namely the congestion state is graded; finally, a rate allocation algorithm is executed according to the congestion state, and congestion is relieved. If no congestion occurs, no processing is conducted. By means of the congestion control method based on the node cache length equitable distribution rate, fairness of channel using of the nodes is improved, collision can be reduced effectively, the packet loss probability can be reduced effectively, and throughout capacity can be improved effectively.

The invention discloses an old person nursing requirement evaluation system which realizes reasonable matching between an old person basic nursing requirement and a professional service and promotes fair distribution and effective use of limited old person nursing resources in an area. The old person nursing requirement evaluation system is characterized in that a unified nursing management platform and a service operation platform are built; and old persons access the unified nursing management platform through a service object interface platform. The system of the invention is based on concepts of providing service to the old persons and continuous nursing. The old person nursing requirement evaluation system aims to realize long-term nursing on the old persons and is around the old persons. Furthermore the old person nursing requirement evaluation system continuously perfects a social old person service system.

The embodiment of the invention provides a flow table updating method and device and relates to the communication field. According to the invention, a flow table can be updated under a full state, so that the requirement of a client to flow table resources is satisfied, and fair distribution of the flow table resources is realized. The method comprises the steps of: according to the information of a first client end and network establishing information, determining a threshold, corresponding to the information of the first client end and the network establishing information, of a flow table item number of the first client end; obtaining a data packet reported by a switch; generating a first flow table item, corresponding to the data packet, of the first client end; if the flow table is full and the flow table item number of the first client end in the flow table is smaller than the threshold of the flow table item number of the first client end, generating a first instruction; and issuing the first flow table item and the first instruction to the switch so as to enable the switch to replace any flow table item of at least one second client end maximum in flow table item number overflow with the first flow table item according to the first instruction.

The invention relates to a method for achieving the purpose of fairly allocating the band width of the upper node of an elastic packet ring, which comprises the following steps: calculating the elastic packet ring EPR to reach the total number k of business flow of blocking node, assuring each fair speed value of each business flow which gets to the blocking node in turn according to the k, and allocating band width for each business stream from current residual band width of the system according to fair speed value which is assured, utilizing the blocking node to seal the fair speed value of the business flow which is assured in a multiple blocking points fair frame MCFF to send to the upper node. The invention improves the capability of a system to resist external disturbance, lowers sensitivity of a system to the internal parameter variation, achieves a goal of dynamically and fairly allocating band width, leads all the nodes to fairly occupy band width according to weight value of local node, and meanwhile, leads the utilization ration of band width to be maximized.

This invention discloses a Token flow control method based on open Internet, involving packet switching network flow control technology. The methods include: user terminal equipment installed in accordance with network congestion data packets to be sent at the token; The end-user network access control into the network router the token rate; Intermediate routers in the network on the output interface controller Congestion has a physical, physical congestion controller bandwidth resources under the Congestion Adaptive extent to adjust physical congestion index, calculated in accordance with the fair probability of packet loss, random discarded token physical congestion level is less than the index data packets; Domain router interconnection between the output interface not only with physical congestion controller also has a virtual Congestion controller, controller under virtual Congestion token resources to adjust the degree virtual adaptive congestion index, lowering all output data packets token level.