1374results about How to "Improve fairness" patented technology

The invention herein described consists of an algorithm, which performs an end-to-end estimation of the bandwidth available in an end-to-end connection established between a server and a client via a packet switching network such as the Internet Protocol Network (IP). This algorithm is used to properly regulate the input rate at the send side. Typical applications are delivering best effort traffic over TCP, or audio and video traffic over RTP / UDP. The invention is particularly effective over wireless Internet and can be used in a content delivery system to dynamically choose the best server between a set of servers to satisfy the request of a client, or to select the best route in a content deliver or global hosting system.

A system and method that addresses the issue of inducing and exploiting multi-user diversity in, e.g., a WLAN system in a fully distributed and opportunistic manner. In some embodiments, the system includes: an access point having a variable beamformer configured to fluctuate signal strength as perceived by stations within a range of the access point; and a plurality of stations having modified distributed-MAC protocol such as to be channel-aware and opportunistic.

A method based on predefined connection priorities for assigning link bandwidth to a requesting user in a high speed digital network interconnecting network users through a path including network nodes connected through high speed links.According to this method, a predefined reservable link bandwidth is split into so-called nominal bandwidth portions and common bandwidth portions, both assignable to the same connections on a priority basis. Each of the common bandwidth priorities is individually related to a nominal bandwidth priority through a predefined relationship, making the common bandwidth priorities always lower than any nominal priority. In this way the requested link connection bandwidth, whatever be its nominal priority, is made preemptable primarily on all common bandwidth, thus avoiding the disruption of any network connection which is already established.

The invention herein described consists of a method to compute in a end-to-end fashion the sending rate of data, audio and video flows over a packet switching network such as the Internet Protocol Network. The sending rate is computed as a function of the data sent in the recent past and as a function of a probing function w(t) that is dynamically set by taking into account signals of network congestion and the network changing available bandwidth.

Association control is utilized for associating wireless local area network users with at least one wireless local area network access point and thereby achieving simultaneous fairness and load balancing. In the present method, a network operation center receives user parameters from each user in the wireless network via the access points. It then sets out both to determine a set of associations between each user and one or more access points based on the user parameters using fractional load balancing and produce a second set of associations by rounding so that, in said second set, each user is associated with only one access point. The present method achieves close to optimal load balancing and max-min fairness while outperforming commonly-used heuristic approaches.

A monolithic shaper-scheduler is used for the efficient integration of scheduling and dual-leaky-bucket shaping in a single structure. By making the evolution of the timestamps of the backlogged flows independent of their shaping parameters, the performance drawbacks of prior-art shaping architectures are overcome. The monolithic shaper-scheduler tests each packet flow as being either “virtually compliant” or “virtually incompliant” when a new packet arrives to the head of its queue. The test for “virtual compliance” is based on traffic profiles associated with the flows. The result of the test is used in conjunction with the timestamp and eligibility flag of each packet flow to efficiently schedule the transmission of packets.

The invention relates to a multi-objective optimization method for collaborative allocation of time slots of multi-runway approaching-departing flights, belonging to the technical field of civil aviation. The multi-objective optimization method is mainly based on a collaborative decision-making idea and comprises the following steps of: firstly, dividing a time interval into a plurality of time slots, determining the approaching-departing capacity of an airport and dynamically creating time slots; secondly, establishing a multi-objective optimization model with minimum total delay cost, fair delay loss of each aviation company and balanced use frequency of each runway as objectives and with the effectiveness and the approaching-departing capacity of the airport as constraining conditions; and finally, solving by using a genetic algorithm to obtain an optimal flight time slot allocation scheme. The multi-objective optimization method disclosed by the invention is suitable for solving the time slot allocation problem of the approaching-departing flights of each airport.

The invention herein described consists of an algorithm, which performs an end-to-end estimation of the bandwidth available in an end-to-end connection established between a server and a client via a packet switching network such as the Internet Protocol Network (IP). This algorithm is used to properly regulate the input rate at the send side. Typical applications are delivering best effort traffic over TCP, or audio and video traffic over RTP / UDP. The invention is particularly effective over wireless Internet and can be used in a content delivery system to dynamically choose the best server between a set of servers to satisfy the request of a client, or to select the best route in a content deliver or global hosting system.

In a data network congestion control in a virtualized environment is enforced in packet flows to and from virtual machines in a host. A hypervisor and network interface hardware in the host are trusted components. Enforcement comprises estimating congestion states in the data network attributable to respective packet flows, recognizing a new packet that belongs to one of the data packet flows, and using one or more of the trusted components and to make a determination based on the congestion states that the new packet belongs to a congestion-producing packet flow. A congestion-control policy is applied by one or more of the trusted components to the new packet responsively to the determination.

This invention relates to a centralized packet scheduler for a wireless communications network such as HSDPA, 1×EV-DO Revisions 0, A and B, WiMAX, infrastructure-mode WiFi and any other type of network where centralized packet scheduling is applicable. The invention provides a utility-opportunity cost packet scheduling scheme for high-speed access that simultaneously achieves efficiency, fairness, user satisfaction, and flexibility. The scheme employs a flexible utility function that incorporates the channel quality conditions of the users as well as a fairness measure. The utility function maximizes user satisfaction as perceived by the service provider while ensuring that users with favourable instantaneous channel quality conditions do not monopolize the radio resources. In addition, the scheme uses an opportunity cost function to allow the service provider to optimize fairness in the context of network throughput and hence, to control the system capacity. The scheme combines the requirements of users (e.g., throughput, delay, fairness, etc.) with the requirements of the service provider (e.g., revenue) in making scheduling decisions.

As a result of lottery using the roulette device 3, if the ball 27 enters in the bonus pocket 24 among the pockets formed on the wheel 22, the special bonus game using the WIN lamp 11 occurs and all credits betted to each station 4 in the present game are paid out (S15) to one station 4 which is determined based on the lottery (S123) by the server control CPU 81 that winning is obtained.

A voter Vi encrypts his vote content vi with a public key kPC of a counter C, then concatenates the encrypted vote content xi with a tag ti to obtain a ballot zi, then randomizes it with a random number ri to create a preprocessed text ei, and sends it and a signature si therefor to an election administrator A. The administrator A generates a blind signature di for the preprocessed text ei and sends it back to the voter Vi. The voter Vi excludes the influence of the random number ri from the blind signature di to obtain administrator signature yi, and sends vote data <zi, yi> to a counter C. The counter C verifies the validity of the administrator signature yi and, if valid, generates and publishes a vote list containing the data <zi, yi> to the voter Vi. The voter Vi checks the vote list to make sure that it contains the data <zi, yi> with his tag ti held in the ballot zi. The counter C decrypts the encrypted vote content xi in the ballot zi to obtain the vote content vi, and counts the number of votes polled for each candidate.

The invention provides a distributed resource scheduling method and system. The method comprises the steps of allocating tasks to a corresponding priority waiting queue according to assessed priorities of new task processing requests; according to the priority waiting queue obtaining the tasks, selecting a current scheduling queue; and according to the selected scheduling queue, calling a resourceallocation policy to allocate available distributed node resources. The system comprises a queue manager, a queue scheduler, a task monitor and a resource allocator. According to the technical schemeprovided by the distributed resource scheduling method and system, the total task completion time cost and the total task completion cost is effectively balanced according to a user demand; the resource utilization rate is improved; the task execution efficiency is improved; the service quality is guaranteed; and the user satisfaction is improved.

A wireless communication system is disclosed that includes forming one or more beam patterns by a transmitter at a first time, where the beam patterns are made up of a first set of beam patterns used to transmit data during the first time, and a second set of beam patterns used to transmit data during a subsequent time. A pilot signal is transmitted on each of the beam patterns and is detectable and decodable by one or more receivers. The receivers test the quality of the beam patterns and transmit an indicator to the transmitter that relates to one of the beam patterns that has a high channel quality. The transmitter determines channel estimation, transmission scheduling, and / or resource allocation based, at least in part, on the indicator.

The invention discloses a signal processing method, a base station and a terminal. The signal processing method comprises the following steps: presetting a sub-frame structure, wherein the sub-frame structure at least comprises a first time slot and a second time slot, the first time slot is used for sending a downlink signal, or is idle, or is switched to receive an uplink signal and schedule the transmission of the uplink signal, or not schedule the transmission of the uplink signal, or is switched to only receive and measure other signals without scheduling the signal reception of the uplink signal, and the second time slot is used for receiving the uplink signal and scheduling the transmission of the uplink signal, or is idle, or is switched to only measure the signal without scheduling the signal reception of the uplink signal; and receiving and sending signals by the base station based on the set sub-frame structure. By adopting the method disclosed by the invention, the use fairness of an unauthorized carrier frequency spectrum is improved, so that the unauthorized carrier frequency spectrum is effectively used.

In a wireless communication system formed by a plurality of access points constituting a wireless network, through which user terminals make accesses, and at least one control station configured to control the access points, public access points are systematically set up by a manager of the control station, while user's personal access points to be freely set up by users at desired locations according to needs of users are accommodated by operating the control station to measure a utilization level of each user's personal access point and charge an owner of each user's personal access point according to a measured utilization level and set up relay routes using the public access points and the user's personal access points.

A system combines project management, learning management, and content management in an augmented reality game. Significant business objectives correspond to “Quests” where a Quest includes Missions and Tasks. In the augmented reality game, individual employees are scored for individual Tasks in a game in which individuals can compare their point standing with other players.

The invention relates to a large-scale fading based pilot frequency distribution method in a large-scale MIMO (multiple input multiple output) system, wherein a large-scale fading coefficient of a user is utilized to determine the strength of interference on the expected user, SINR maximization is taken as a target, the greedy-strategy-based user scheduling algorithm is adopted to determine user grouping according to the order from high degree of interference to low degree of interference on the expected user, so as to distribute the pilot frequency. With adoption of the method, the large-scale fading slowly changing with time is utilized to distribute the pilot frequency and certain practicality is realized, the influences of the pilot pollution effect are reduced, and the fairness of the system is improved.

Construct and operation of a large-scale tracking tax control system for circulation tax verification amount and note control, note verification and tax control and data, based on EPC and EBC goods web, as well as a relevant tax control terminal. State Administration of Taxation provides an EPC code root directory DNS server; production enterprises and merchandising enterprises establish EPC code allocation servers, EPC system Savant servers, ONS servers and PML databases, in order to construct a commodity goods web based on EPC; State Administration of Taxation comprises an EBC code root directory DNS server and an EBC code allocation server; different levels of tax administrations and customs are composed of EBC system Savant servers, ONS databases and PML databases, so as to construct a nationwide goods web for EBC electronic invoices, machines and tools; as for all product arrangement RFID verification amount vouchers, the system utilizes RFID decoders to record commodity primary information and goods flow path information; all the enterprises utilize EBC tax control machines and tools to add EBC codes into invoice contents electronic data, and instaneously transmit to downstream tax administrations for comprehensive comparison; all market law enforcement agencies and purchasers and consumers can use EPC interpreters to verify commodity RFIDs, in order to form a powerful tax control system that covers everywhere.

A method and apparatus is provided for scheduling access to a common resource for a plurality of objects queued in a plurality of connection queues. Tokens associated with the connection queues are stored in scheduling queues. Each scheduling queue has a scheduling weight assigned thereto. Each connection queue has a connection weight value assigned thereto. A serving value is used to determine which scheduling queue to select. When a scheduling queue is selected, an object stored in a connection queue having an associated token stored in the selected scheduling queue is provided to the common resource. Tokens are moved among the scheduling queues as a function of the connection weight values, scheduling weights, and serving value. The objects queued in the connection queues may be fixed length cells or variable length packets. When the objects are variable length packets, a residual weight value is also maintained for each connection queue, the residual weight values being useful to prevent the connection queues from receiving an undue amount of service relative to their connection weights during each serving cycle.

The invention discloses a charge and passenger flow information acquisition method for bus IC (integrated circuit) cards and belongs to the technical field of transportation. After segmental decreasing rate and the effective time duration of accumulative distance are continuously accumulated by a vehicular terminal according to riding distance, charging by distance is completed by swinging at the moment of boarding and alighting, and data related to boarding and alighting of passengers are uploaded to an information center. Data such as boarding flow, alighting flow, OD (origin and destination) flow and interchange flow on specified time scale are acquired first in real time from the information center terminal according to a specific line, a specific area and an additionally designated traffic zone; the data such as the ratio of passengers ranging from average riding distance to different riding distances and the ratio of passengers ranging from average riding time and different riding times on specified time scale are obtained then in non-real time. Real-time acquisition of bus passenger flow information and continuous acquisition of bus riding feature information are achieved by the method while fairness in public resources consumption is improved effectively, and information base for the fair charge and the related decisions for buses are provided.

The invention discloses an intersection signal optical control method in an environment of Internet of vehicles. A signal timing plan is optimized by combining vehicle state information acquired at a signal intersection in real time, so that the delay time that a vehicle passes through the intersection is shortened. The method disclosed by the invention realizes an actual application of the technology of Internet of vehicles at the signal intersection, thereby favorably improving the traffic efficiency at the signal intersection.

As a result of lottery using the roulette device 3, if the ball 27 enters in the bonus pocket 24 among the pockets formed on the wheel 22, the special bonus game using the WIN lamp 11 occurs and all credits betted to each station 4 in the present game are paid out (S15) to one station 4 which is determined based on the lottery (S123) by the server control CPU 81 that winning is obtained.

A deficit fair priority queue scheduling technique includes arranging connections in a waiting queue according to a plurality of priority classes including a first class having a higher priority than a second class. Each time a scheduler visits a queue having waiting connections, a deficit value for each priority class is initialized and used to determine how many bandwidth request packets for that class will be serviced in a round. The highest priority packets will be serviced until the deficit value for that class falls below a selected threshold or there are no remaining waiting packets of that class. Within the same round, the scheduler can service lower priority connections until the deficit value for that service class is below the threshold or there are no remaining packets of that class. Because the lower class packets have a chance of being serviced before all higher priority class packets have been serviced, the disclosed example is a deficit fair priority queuing technique.

An on-board call access control method is characterized in that for access request, firstly judge the type of call: if a switching call, determine the switching call service is low-priority or high-priority, and implement the switching call request access process on the low-priority or the high-priority call service; if a new call, determine the new call service is low-priority or high-priority, and implement the new call request access process on the low-priority or the high-priority call service. Under the circumstances of ensuring the indexes of handoff failure probability of satellite systems, the new call-blocking probability, the link bandwidth utilization and so on, the invention fully considers the satisfaction of users and the influence of network-load changes on the system performances, effectively ensures the QOS requirement of mobile satellites, and improves comprehensive properties and robustness of satellite systems.

The invention discloses a joint power control and proportional fair scheduling method for D2D communication in a cellular network, relates to the field of D2D communication in the cellular network, and aims to solve the problem of common-channel interference between users and the problem of fairness between the users due to the fact that the maximum throughput capacity of a system is used as a target in the existing interference suppression algorithm. An optimal power control method is used for realizing interference suppression. Meanwhile, aiming at the problem of user fairness caused by the time-varying characteristic of a channel under the condition of coexistence of multiple users, the invention adopts the proportional fair scheduling method so as to meet the demand of the users for the fairness. A cellular network model for multiplexing uplink resources for D2D communication is constructed, and mathematical modeling and solving for joint power control and proportional fair scheduling are carried out for the network model. The interference suppression method for joint power control and proportional fair scheduling, which is provided by the invention, can guarantee the quality of user communication and improve the throughput capacity and the fairness of the system.

A user location information based large-scale MIMO system pilot frequency distribution method comprises initializing user numbers to be natural numbers; obtaining information of distances from users in all communities to a base station in a central community; dividing distance sections through Monte-Carlo simulation; determining section numbers of the distances of all users, and determining the interfered degree of expectation users and the interfering degree of interfering users; performing user scheduling and obtaining user groups with SINR maximization as the criterion and using a greedy user scheduling algorithm; the base station performs pilot frequency distribution on all the groups. By the aid of the method, pilot frequency distribution is performed on user location information changing slowly along with time, and accordingly, the influence of pilot frequency pollution effect is reduced; by the method of user equivalence class division through the distance, the influence of shadow effect uncertainty on the interference degree is reduced effectively, and the pilot frequency distribution result robustness is improved.

A method for enhancing the fairness and performance in a multihop ad hoc network, the method usually including providing contention synchronization information regarding a transmission between nodes of the network, wherein the information is routinely provided to nodes in a range of two hops from the nodes participating at the transmission. The method also typically includes setting, after successfully finishing the transmission, a waiting time for the nodes participating at the transmission, in which these nodes backoff from accessing a transmission medium.

The invention discloses a distributed computing power resource calling method based on a block chain smart contract and a distributed computing power resource calling system based on the block chain smart contract. A smart contract is created through a computing power demand side and deployed in a block chain network; then the computing power demand side transmits the computing demand to the smartcontract, and the smart contract allocates the computing demand to more than two computing power providers; and finally the smart contract receives the computing result of more than two computing power providers and performs consistency verification on the computing result. Therefore, the distributed computing power resources can be utilized by the method through overall planning, the payment settlement period of the distributed computing power providers can be greatly shortened and the computing power resource utilization rate and settlement efficiency can be enhanced.