100 results about "Network utility" patented technology

The present invention relates to the field of software defined network, and particularly relates to an SDN load balancing method with highest network utility. The method comprises the steps of determining that multiple paths between a source node and a destination node are available; assigning different weights to impact factors meeting service quality according to different data flow service attributes; then collecting information of a switch to acquire values of impact factors of service quality in the network, wherein the information comprises link use ratio, time delay and packet loss rate; calculating a utility value and a load of each path in a path set; and finally, selecting an optimal path for the data flow according to overall consideration. Through adoption of the SDN load balancing method with highest network utility, network dynamic load is balanced, further, the service quality demands are met to the greatest extent.

A fixed network utility data collection system includes a plurality of endpoints arranged in a tiered and spoke-like configuration relative to a central data collecting device. An RF transmission from the central device transmits out over the endpoints in a spoke. The first endpoint in the spoke to hear the transmission then hops the transmission to the other endpoints in the spoke. Once all of the endpoints in a spoke have received the transmission they respond to the transmission. The response starts with the outer-most endpoint and is transmitted to the next endpoint in the spoke line. That endpoint adds its response and forwards the message to the next endpoint in the spoke line and so on. Upon the inner-most endpoint of the spoke receiving the response, it adds its response and transmits the final collective response to the central device.

The invention relates to a resource allocation method for a low-delay high-reliability service in mobile edge computing, and belongs to the technical field of mobile communication. According to the method, in a multi-MEC multi-user environment, a user task queue model and an MEC task queue model are described respectively, a theoretical model of mobile service provider network utility maximizationis established with the task queue overflow probability as the constraint, and joint allocation is performed on power resources, bandwidth resources and computing resources. Considering that a constraint condition in the optimization model comprises a limit constraint of a task queue overflow probability; a random optimization problem of time averaging is converted and decomposed into three sub-problems of single-time-slot solving through a Lyapunov optimization theory, including calculation resource allocation of users, bandwidth and power allocation and calculation resource allocation of MEC, and then the three sub-problems are solved respectively. According to the method, the average total income of the MSP is improved while the requirements of users for low time delay and high reliability are met.

The disclosed NID method based on modified adaptive boost (Adaboost) algorithm comprises: connecting data with original network, extracting network connection behavior feature, and marking much training sample; according to pre-process result, providing a set of feeble classifiers for Adaboost algorithm; training a strong classifier; inputting the extracted feature into the strong classifier, and deciding whether the network access is invading according to classifier result. This invention reduces complexity and time consumption, convenient to on-line re-train, and benefit to improve entire network utility.

The invention relates to a hierarchy-based heterogeneous network joint access control method. A terminal and a network side both have an access judgment function; the terminal carries out judgment and selection on first-level access networks according to simple or single condition of wireless network signal intensity, user network-selecting preference, service type and movement speed and the like; and only when the judgment cannot be carried out through the simple condition, the network side carries out judgment on second-level access networks, that is, according to the information of position where the terminal locates, and by utilizing an entropy evaluation method and an improved AHP analysis method, network utility is comprehensively calculated, and a network, of which the utility is the largest, is selected to notify the terminal to carry out service access, thereby realizing load balance of terminal service being accessed to the appropriate network and heterogeneous network. The method not only can improve the whole system access judgment efficiency, thereby reducing load of a core network, but also can guarantee customer service to be accessed to the appropriate network, thereby fully utilizing radio resources and reducing access reject rate.

The invention discloses a heterogeneous converged network bandwidth resource optimizing distribution method based on utility function and bankruptcy game theory, and belongs to the technical field of communication. By optimizing the bandwidth demands of users in a common coverage area of a heterogeneous radio access network, user services are categorized, a network association utility function is modeled, and a bandwidth resource optimizing distribution scheme for various services in networks is obtained by maximizing the network utility function under the condition of meeting the bandwidth demands of the various services. Further, a bankruptcy game model is established, and a bandwidth optimizing distribution scheme for the users is obtained by solving the Shapley value. Cooperation and competition relationships between the networks and between the users are comprehensively considered, overall network gains are optimized under the condition of equitable distribution of various service resources by means of joint resource management, and access bandwidths of the users are reasonably and effectively distributed based on the game theory, so that network resource utilization rate and QoS (quality of service) of the users are improved.

The invention relates to a vertical network switching method based on self-adaptive weight adjustment. The vertical network switching method comprises the following steps: a terminal side monitors link quality of each network, and screens out an available network set by utilizing a judgment method based on received signal strength and threshold; the terminal integrates parameters obtained from the network side and selects alternative networks from the available network set through utilizing a load balancing mechanism based on network utility; and subjective and objective weight values ate adjusted through a self-adaptive weight adjustment algorithm, and the order of the alternative networks is calculated with a TOPSIS algorithm being combined, and a final switching decision is made. The vertical network switching method can help the mobile terminal to be accessed to the most appropriate network accurately and efficiently, thereby guaranteeing the available communication process of the mobile terminal in a low electric quantity mode to be longer, and improving the throughput of the whole system.

A method and system for central management of plural network clients interfaced with a network host, each network client automatically calling a login routine (20) and a start-up routine (22) associated with initiation of a login script at the network client. Configuration and start-up management can be based upon an operating system determination with several different operating systems, such as Windows 95 and Windows NT, deployed across the network. The login routine (20) can install the start-up routine (22) on the network client at login, allowing the start-up routine (22) to direct the network client to install predetermined local utilities and to load predetermined network utilities. An associated launch manager (24) can establish launch manager values to allow a network user to individualize his network client within constraints defined by computing standards established through the login routine.

The invention discloses a method used for the sharing of frequency spectrum in a plurality of distributed systems. The method comprises the following steps of: adopting one system of a plurality of the systems to send instruction information instructing a corresponding time slot used for a corresponding system to broadcast payment information and network utility functions used for a plurality of the systems to other systems; adopting the corresponding time slot instructed by the received instruction information to broadcast the self payment information to other systems in each of a plurality of the systems; determining corresponding frequency spectrum sharing proposals according to the self payment information and the received payment information; and selecting and adopting a frequency spectrum sharing proposal reaching the maximum network effectiveness from the determined frequency spectrum sharing proposals. The invention also discloses a system for carrying out the distributed frequency spectrum sharing with a plurality of other systems. The invention avoids low effectiveness and unfairness caused by determining frequency spectrum sharing proposals in series by systems, reduces signal overhead and frequency spectrum waste, and realizes the optimal network performance.

Systems, methods and apparatuses are provided for mitigating interference in wireless networks, and particularly in an advanced backhaul wireless network comprising several hubs, each hub serving its own remote backhaul modules (RBMs). Preferred embodiments provide practical power spectrum adaptation methods for the management of interhub interference. These methods are shown to improve the overall network throughput significantly compared to a conventional network with fixed transmit power spectrum. Optionally, joint scheduling and power control are used to optimize the network utility. Also provided are methods which evoke the channel average gains generated by measurements for managed adaptive resource allocation (MARA). The proposed methods are computationally feasible and fast in convergence. They can be implemented in a distributed fashion across all hubs. Some of the proposed methods can be implemented asynchronously at each hub.

The invention provides a method, equipment and a system for controlling network congestion. The method comprises that a congestion judge parameter and an input reference speed corresponding to data flow are obtained by an entrance network node, the congestion judge parameter is determined according to accumulated matters, and the input reference speed is the most excellent solution which guarantees the non-congestion of a network; and occurrence of the network congestion is judged according to the congestion judge parameter by the entrance network node, and if the network congestion occurs, according to SLA (service level arrangement) information corresponding to the input reference speed and the data flow, the data flow is subjected to network congestion control. By the adoption of the method, the equipment and the system of the embodiment, the situation of congestion on an overall chain can be effectively relieved, aspiration of a user can be reflected, and the network utility is high.

The invention provides a network topology reconstruction method including the following steps: the information of the network topology and the information of a spare router are collected; the collected information is utilized for forming the reconstructed network topology meeting the requirements of various performance indexes; and other routers are informed about the formed reconstructed network topology to carry out the topology reconstruction. The invention provides a device and equipment for topology reconstruction. The invention dynamically optimizes various performance indexes, such as reliability, total network construction cost, total network utility ratio, and the like in the process of reconstruction, thereby achieving the optimal effect of optimization and upgrading.

The invention discloses a distributed cross-layer optimization method for an MIMO (Multiple Input Multiple Output) wireless multi-hop network. The method comprises the following steps: solving the problems of routing of a network layer and rate optimization of a transport layer according to a current session and routing information in a network by a source node of each session stream, and updating the session streams and the routing information; and solving the problems of multi-antenna power control of a physical layer and bandwidth allocation of a link layer on each node. An alternate iterative update method based on linearization is provided to solve problems; a power control sub-problem is solved by fixing of a link bandwidth on each node; then, power is fixed as a previous solution; a bandwidth allocation sub-problem is solved; and a physical layer problem is solved by alternate iterative update. Finally, solutions of the problems of a network transport layer and a physical link layer are converged through iterative update of Lagrange dual variables, so that network utility is realized, and the transmitted power is lowered at the same time. Through adoption of the method, the loss of the transmitted power, namely, energy consumption is lowered greatly while the network utility is ensured.

The invention discloses a network routing forwarding method and system based on business service quality requirements, and belongs to the field of network communication. Time delay, jitter and bandwidth constraints are adopted to express the requirements for the service quality. Compared with the prior art, the service quality requirements are expressed by adopting time delay, jitter and bandwidthconstraints, so the service quality requirements are more accurately matched, the service requirements are expressed, different types of services are refined and distinguished, and the differentiatedrequirements of diversified services are realized. The specific service quality constraint index is embedded into the BPP metadata. A forwarding node directly knows the specific service quality indexrequirements by extracting the BPP header information, so that the routing strategy and the reward standard are customized according to the service quality requirement indexes, the optimal routing configuration under the requirements is obtained, and the differentiated requirements of diversified services are realized. A DDPG method based on deep reinforcement learning is adopted, the learning target is the weight of each link, the trained link weights are used for executing routing algorithms such as OSPF and the like for routing, an optimal network routing strategy is obtained, and the network utility is improved.

The invention discloses a multi-path congestion control method for a space-ground integrated intelligent network, which comprises the following steps of: establishing a congestion state judgment method, and judging a network congestion state by adopting round-trip time (RTT) and bottleneck bandwidth estimation; and establishing an improved congestion control method. Aiming at the high bit error rate and the high delay characteristic of the space-ground integrated intelligent network, a scheme based on RTT and bandwidth estimation is improved by referring to a BBR congestion control mechanism, and a calculation method based on bottleneck bandwidth and propagation delay is refined, so that the judgment on the network congestion state is more accurate. On the basis of mechanism research on MPTCP multi-path congestion control, an improved LIA algorithm is provided, aiming at different QoS requirements, under the condition that network utility is maximized, the congestion window reduction proportion is adjusted in a self-adaptive mode, and the throughput and the bandwidth utilization rate are improved. The space-ground integrated intelligent network congestion control mechanism provided by the invention has a good application prospect.

The invention discloses a method for distributed congestion control, routing and power allocation of a wireless multi-hop network. Aiming at the scene that multi-path routing is performed, power of anetwork node is limited, and the network node sets an independent cache region for each service flow, the method has the goal of maximizing network utility, utilizes a Newton method to solve an optimization model so as to obtain an original variable Newton direction updating formula and a dual variable updating formula, then further utilizes matrix splitting to enable dual variables to achieve distributed update, and finally utilizes Newton decrement to calculate an iteration step length so as to achieve the optimum distribution of a service flow source rate, a link rate and link power. The method of the invention has the beneficial effects that in comparison with a traditional algorithm, a convergence rate is greatly raised; in addition, in comparison with a primal dual interior point method and a novel back-pressure algorithm, network utility and energy utility are significantly improved, and the queue length in a network cache region can be controlled at an extremely low level.

The provided buffer control method for bandwidth comprises: real-time every user bandwidth by a network management device; if user bandwidth within the limit, the management device takes no any limit; or else, the management device limits any one with both bandwidth and time over the limit to cast off its message; for one with bandwidth over limit but time within limit, the device allows it immediate outburst; when one within limit again, the device relieves control. This invention improves network utility.

Disclosed is a device (1000) for providing power to one or more Optical Network Utilities (NUs) (1100) in an optical network (1300) used to provide communication to a plurality of devices (1400) of subscribers. The device (1000) includes one or more Power over Ethernet (POE) adapters (1200) operatively coupled to the subscriber devices. The POE adapters are configured to derive AC power and data signals from the plurality of devices, and convert the derived AC power into DC signals. Further, the device includes a Power over Ethernet (POE) splitter (1500) operatively coupled to the POE adapters. The POE splitter is configured to split the DC signals from the data signals, and feed the DC signals to the one or more NUs for satisfying their power needs.

Methods are disclosed for scheduling resources in a wireless backhaul network comprising a plurality of N Hubs, each Hub serving a plurality of K Remote Backhaul Modules (RBMs), using a coordinated power zone assignment across the backhaul network. For each Hub, a one-to-one power zone assignment, of each of the K RBM to one of the K power zones, is computed by maximizing a selected network utility across the backhaul network. Coordinated power zone assignment according to preferred embodiments based on the auction approach offers a close-to-global-optimal solution. Coordinated scheduling based on first assigning RBMs to hubs heuristically, and then optimally scheduling RBMs within each hub also offers significant performance improvement as compared to non-coordinated systems. Preferred embodiments offer a significant performance improvement as compared to conventional systems. They are low in complexity, and compatible with the physical constraints of SFR-based wireless backhaul network, which make them amenable to practical implementation.

Methods and apparatus for performing dynamic channel selection are provided. In an example, a method includes receiving, at a central self-organizing network server, data from an access point (AP) including a number of stations associated with the AP. The method includes calculating downlink capacities for the associated stations and selecting a channel for the AP which maximizes a pre-defined network utility that is based on the downlink capacities. Further, it is determined if the network utility gain resulting from selecting the channel exceeds a threshold when compared to a previous channel selection state. If the network utility gain exceeds the threshold, a channel change command is issued to the AP, directing the AP to use the selected channel to communicate with a specific station.

The invention discloses a joint user scheduling method based on large-scale MIMO and a corresponding power distribution method. The joint user scheduling method comprises the following steps: 1, obtaining a channel matrix, a power allocation vector, a scheduling vector and a precoding matrix; 2, calculating signal to interference plus noise ratios and average data rate areas of a macro user, a small base station and a small user; 3, calculating an optimal scheduling vector on the basis of maximizing a network utility function under the conditions of non-ideal channel state information and limited wireless backhaul queues; and 4, updating a queue according to the optimal scheduling vector. According to the method, the performance of the whole network can be optimized when the system dynamically changes, and the overall throughput of the large-scale MIMO system is remarkably improved.

The invention discloses an optimal sampling frequency allocation method and an optimal sampling frequency allocation device of a wireless sensor network. According to the method, in the iteration process, a source node issues the data task information e<j>(t+1); a node j receives the data task information e<j>(t+1) form the source node, and in addition, beta (t<+>) is calculated; the node j judges whether the constraint condition is broken through or not according to the e<j>(t+1) and the beta (t<+>); if the constraint condition is broken through, the updating is carried out, the self link information is sent from the node j to the source node, and if the constraint condition is not broken through, the updating is not carried out; and the source node issues the data task information to a forwarding node of a routing path according to the link information. Through the iteration process, the utility function can be continually increased, when the increase trend of the network utility function approaches to zero, the algorithm completes the convergence, and the optimal solution is obtained. Only when the constraint condition is broken through, the source node and a target node can generate updating data packets, the updating is carried out, and the communication cost can be obviously reduced, so the expenditure of the whole iteration process is far smaller than that of the classical optimization algorithm.