373 results about "Flow scheduling" patented technology

An apparatus and method to distribute applications and services in and throughout a network and to secure the network includes the functionality of a switch with the ability to apply applications and services to received data according to respective subscriber profiles. Front-end processors, or Network Processor Modules (NPMs), receive and recognize data flows from subscribers, extract profile information for the respective subscribers, utilize flow scheduling techniques to forward the data to applications processors, or Flow Processor Modules (FPMs). The FPMs utilize resident applications to process data received from the NPMs. A Control Processor Module (CPM) facilitates applications processing and maintains connections to the NPMs, FPMs, local and remote storage devices, and a Management Server (MS) module that can monitor the health and maintenance of the various modules.

An apparatus and method to distribute applications and services in and throughout a network and to secure the network includes the functionality of a switch with the ability to apply applications and services to received data according to respective subscriber profiles. Front-end processors, or Network Processor Modules (NPMs), receive and recognize data flows from subscribers, extract profile information for the respective subscribers, utilize flow scheduling techniques to forward the data to applications processors, or Flow Processor Modules (FPMs). The FPMs utilize resident applications to process data received from the NPMs. A Control Processor Module (CPM) facilitates applications processing and maintains connections to the NPMs, FPMs, local and remote storage devices, and a Management Server (MS) module that can monitor the health and maintenance of the various modules.

An apparatus and method to distribute applications and services in and throughout a network and to secure the network includes the functionality of a switch with the ability to apply applications and services to received data according to respective subscriber profiles. Front-end processors, or Network Processor Modules (NPMs), receive and recognize data flows from subscribers, extract profile information for the respective subscribers, utilize flow scheduling techniques to forward the data to applications processors, or Flow Processor Modules (FPMs). The FPMs utilize resident applications to process data received from the NPMs. A Control Processor Module (CPM) facilitates applications processing and maintains connections to the NPMs, FPMs, local and remote storage devices, and a Management Server (MS) module that can monitor the health and maintenance of the various modules.

An apparatus and method to distribute applications and services in and throughout a network and to secure the network includes the functionality of a switch with the ability to apply applications and services to received data according to respective subscriber profiles. Front-end processors, or Network Processor Modules (NPMs), receive and recognize data flows from subscribers, extract profile information for the respective subscribers, utilize flow scheduling techniques to forward the data to applications processors, or Flow Processor Modules (FPMs). The FPMs utilize resident applications to process data received from the NPMs. A Control Processor Module (CPM) facilitates applications processing and maintains connections to the NPMs, FPMs, local and remote storage devices, and a Management Server (MS) module that can monitor the health and maintenance of the various modules.

An apparatus and method to distribute applications and services in and throughout a network and to secure the network includes the functionality of a switch with the ability to apply applications and services to received data according to respective subscriber profiles. Front-end processors, or Network Processor Modules (NPMs), receive and recognize data flows from subscribers, extract profile information for the respective subscribers, utilize flow scheduling techniques to forward the data to applications processors, or Flow Processor Modules (FPMs). The FPMs utilize resident applications to process data received from the NPMs. A Control Processor Module (CPM) facilitates applications processing and maintains connections to the NPMs, FPMs, local and remote storage devices, and a Management Server (MS) module that can monitor the health and maintenance of the various modules.

An apparatus and method to distribute applications and services in and throughout a network and to secure the network includes the functionality of a switch with the ability to apply applications and services to received data according to respective subscriber profiles. Front-end processors, or Network Processor Modules (NPMs), receive and recognize data flows from subscribers, extract profile information for the respective subscribers, utilize flow scheduling techniques to forward the data to applications processors, or Flow Processor Modules (FPMs). The FPMs utilize resident applications to process data received from the NPMs. A Control Processor Module (CPM) facilitates applications processing and maintains connections to the NPMs, FPMs, local and remote storage devices, and a Management Server (MS) module that can monitor the health and maintenance of the various modules.

The invention provides a dynamic flow dispatch method and system based on a software definition network. The method comprises a step of carrying out deep analysis of flow through flow information uploaded by a switch, and classifying flow types by a flow identification and grading module according to priorities, a step of calling a statistic management module to obtain information of switch ports, calculating joint links of the switch, and sending information of the joint links to a topology management module, a step of calling the topology management module to obtain a feasible path for flow direction and calculating real-time sate statistic information of the feasible path, and a step of analyzing features of the joint links to calculate weight of the joint links in the overall selection, working out the optimal dispatch strategy based on the weight and giving out the optimal dispatch strategy. The invention can achieve the optimal real-time dispatch of network flow, so that flow is enabled to reach a destination in a fastest manner, and purposes of improving the bandwidth utilization rate and optimizing network performances are finally realized.

Disclosed is a method, upstream processing node, and computer readable medium for processing data packets. The method includes receiving an allocation for at least one computing resource. At least one data packet at one or more upstream processing elements in an upstream processing node is received. The method also includes determining if at least one output queue of the upstream processing elements includes available space for processing of the data packet. The data packet is processed in response to the output queue including available space to form a resulting data packet. The method further includes determining that an input queue of at least one downstream processing element of a plurality of downstream processing elements includes available space for receiving the resulting data packet In response to the determining, the resulting data packet is transmitted from the upstream processing element to the downstream processing element.

Methods to achieve bounded router buffer sizes and Quality of Service guarantees for traffic flows in a packet-switched network are described. The network can be an Internet Protocol (IP) network, a Differentiated Services network, an MPLS network, wireless mesh network or an optical network. The routers can use input queueing, possibly in combination with crosspoint queueing and / or output queueing. Routers may schedule QoS-enabled traffic flows to ensure a bounded normalized service lead / lag. Each QoS-enabled traffic flow will buffer O(K) packets per router, where K is an integer bound on the normalized service lead / lag. Three flow-scheduling methods are analysed. Non-work-conserving flow-scheduling methods can guarantee a bound on the normalized service lead / lag, while work-conserving flow-scheduling methods typically cannot guarantee the same small bound. The amount of buffering required in a router can be reduced significantly, the network links can operate near peak capacity, and strict QoS guarantees can be achieved.

An apparatus and method to distribute applications and services in and throughout a network. The apparatus includes the functionality of a switch with the ability to apply applications and services to received data according to respective subscriber profiles. Front-end processors, or Network Processor Modules (NPMs), receive and recognize data flows from subscribers, extract profile information for the respective subscribers, utilize flow scheduling techniques to forward the data to applications processors, or Flow Processor Modules (FPMs). The FPMs utilize resident applications to process data received from the NPMS. A Control Processor Module (CPM) facilitates applications processing and maintains connections to the NPMs, FPMs, local and remote storage devices, and a Management Server (MS) module that can monitor the health and maintenance of the various modules. In an embodiment, the MS can download and otherwise control applications on the FPMs that execute the Linux operating system to provide an open architecture for downloading, executing, modifying, and otherwise managing applications.

The invention discloses a configurable workflow realization method and system. The method comprises the following process that a table sheet model and a workflow model are defined; a table sheet model definition library and a workflow model definition library are established, and the defined table sheet model and the workflow model are respectively stored in the table sheet model definition library and the workflow model definition library; a table sheet engine and a workflow engine are established; an interactive interface is established between a table sheet scheduling component and a flow scheduling component so as to perform data interaction; the flow scheduling component acquires table sheet data via the interactive interface according to control flow instructions so as to generate a flow task; and the generated flow task is processed. The system comprises a table sheet modeling tool, a workflow modeling tool, the table sheet model definition library, the workflow model definition library, the table sheet engine component, the workflow engine component and a database. Table sheet and workflow customized definition is realized so that a conventional workflow framework is effectively utilized, and flexibility of flow circulation is also guaranteed simultaneously.

The invention discloses a flow management method capable of being sensed by QoS (Quality of Service) in a software defined network. The flow management method comprises the following steps: sending a QoS requirement to the network through network upper-layer application of the software defined network; inspecting an application service quality request by the network and dividing application flow into a plurality of classes with different priority levels; identifying the application flow and carrying out different routing on the application flow with different classes; monitoring utilization rates of all links and carrying out flow scheduling on a congestion link; carrying out flow limitation on the congestion link subjected to the flow scheduling. According to the flow management method, different QoS strategies are adopted on data flows with different requirements; the data with a high priority level is subjected to priority processing and flow in the network is discriminately treated; critical business flow smoothly passes through the network.

Embodiments are provided for path flow scheduling of multicast traffic through a network. The paths for traffic flow are determined to optimize link utilization in terms of bandwidth and link capacity, and limit link cost. In an embodiment, a method is implemented for network flow scheduling. The method includes establishing, by a controller of a network, a multicast tree which includes a plurality of links for sending multicast traffic from a source to multiple destinations. The tree is established based on minimizing a number of links in the multicast tree. The tree is then adjusted by replacing one or more of the plurality of links to reduce the link utilization. The tree adjustment is repeated by further replacing one or more links in the multicast tree to further reduce the link utilization.

The invention relates to a congestion control method for a wireless sensor network, which comprises the following five steps: 1) at a source end of the sensor network, choosing representative nodes instead of all sensing nodes to report events; 2) detecting the congestion by the nodes according to an occupancy rate of a local buffer zone; 3) dividing the nodes between the source and a gathering node sink into far sink nodes and near sink nodes according to the distances from the nodes to the gathering node sink; 4) if detecting the congestion by the far sink nodes, sending a backward congestion report and spreading the report information along the direction of a data source, and adopting a congestion processing method based on flow scheduling by the node which receives the report information; and 5) if detecting the congestion by the near sink nodes, sending a forward congestion report to the gathering node sink, and adjusting the speed or quantity of the representative nodes by the gathering node sink according to an application requirement after receiving the congestion report information. According to the method, the congestion problems probably occurring in different areas of the wireless sensor network are solved by using different processing methods, thereby timely and efficiently avoiding or relieving congestion.

This invention belongs to information transmission technique field and relates to a robust flow dispatching method based on point to point. The method is to integrate dispatching server, flow media server and customer terminal points into one living broadcast network gives different definitions to functions in network of each customer points and gives different functions to each customer points in the network. The entrance and exit of the new customer point make changes of the network topological structure and realizes the flow dispatching through network topological form dynamic update and monitoring and part of changing customer point.

The invention relates to a flow scheduling system and method based on SDN. The method comprises the following steps: acquiring a network link parameter configured by a user; starting routing collection and flow collection processes; performing link analysis; judging whether a congested link exists, if so, scheduling the flow of the congested link to an idle link by a flow scheduling module, and otherwise, continuing to perform periodic link analysis. By adoption of the system and the method, being different from the system under distributed architecture, the flow scheduling method and system based on the SDN can comprehensively sense the link congestion or link faults; the network link heath condition updated in real time can be converted to a network link metric coefficient, and thus the selection of an optimal path is more accurate; and in the case of network link congestion, the flow scheduling method and system based on the SDN provided by the invention are started to quickly and effectively eliminate the link congestion, and the links are reasonably configured to maximize the bandwidth utilization rate, and flow load balance of the whole network can be realized.

The invention relates to a CDN cloud platform and a flow scheduling method thereof. The CDN cloud platform comprises a monitoring probe network, an operation support system, and multiple CDN cloud platforms. The monitoring probe network monitors the CDN cloud platforms in real time. The operation support system evaluates the quality of the CDN cloud platforms according to acquired service quality indexes, and accurately schedules service flow by using a scheduling algorithm according to an evaluated result. The CDN cloud platform provides better service for Internet users and lower in cost because of a resource gather effect. The flow scheduling method can be used by an Internet company for establishing a strong CDN platform and has benefit to conventional PC business and mobile business.

The DiffServ architecture is an increasingly preferred approach for providing varying levels of Quality of Service in an IP network. This discovery presents a new framework for improving the performance of the DiffServ architecture where heterogeneous traffic flows share the same aggregate class. The new framework requires minimal modification to existing DiffServ routers by adding a second layer of classification of flows based on their average packet sizes and using Weighted Fair Queueing for flow scheduling. The efficiency of the new framework is demonstrated by simulation results for delay, packet delivery, throughput, and packet loss, under different traffic scenarios.

The invention discloses a management system of mirror network flow in a virtual network environment and a software definition based mirror flow management and control method. A mirror network flow management and control system comprises a mirror network flow central control node, virtual mirror flow management nodes and virtual mirror flow distribution nodes. The mirror network flow central control node is utilized for global control; the virtual mirror flow management nodes deployed near a service virtual machine are utilized for realizing capturing of data packets and forwarding based on a flow table; and the virtual mirror flow distribution nodes deployed near a safety device are utilized for copying and distribution of the data packets based on safety services. According to the management system of the mirror network flow in the virtual network environment and the software definition based mirror flow management and control method, an optimal mirror flow exporting policy in a global perspective is obtained, the mirror flow scheduling is quick and complete, and only a few computing resource is occupied by the mirror flow management nodes.

The invention provides a connecting management and control method suitable for multi-path transmitting. According to the technical scheme, sub-flow states are decomposed into an INUSE state and a STANDBY state, sub flows are built among all IP addresses sets of the two communicating parties firstly, and all the sub-flow states are set as STANDBY, and the sub flows are not used for transmitting user data; then one end of communication is chosen to serve as a sub flow performance test main control terminal and is used for measuring the round-trip delay of all the sub flows on each network interface and the sub flow which is of the minimum round-trip delay is selected on each network interface to set as the INUSE state to be used for transmitting the date. Accordingly, the two communication terminals with multiple network interfaces can use the partial sub flows with better performance in all the possible sub flows to transmit the data, so that the advantages brought by the multiple network interfaces can be adopted, better handling capacity is obtained, the number of the used sub flow is reduced as far as possible, and cost of sub flow scheduling management is reduced.

The invention belongs to the technical field of traffic scheduling and discloses a service perceived flow policy customization method based on a software defined network. Traffic recognition and traffic scheduling are carried out in a controller. Through expansion of basic modules of the controller, two modules: a service traffic recognition and classification module and a service traffic policy scheduling module are developed and are respectively used for processing traffic classification and scheduling functions. The method is a relatively reasonable traffic recognition and traffic scheduling scheme in the software defined network (SDN). Service perception can be carried out on the traffic. The service traffic can be recognized and classified relatively precisely. Forwarding policies ofdifferent QoS levels are made for the service traffic of different classes. The quality of service required by business access provided by an enterprise portal for a user is guaranteed. The QoE of theuser for the service is improved. Moreover, the load balance and a utilization rate of a link are guaranteed to a certain degree.

The invention provides a data transmission flow scheduling method and system based on token buckets. Common token buckets are set for all scheduling entities respectively, and a token bucket shared by the scheduling entities is set; each common token bucket records the number of tokens distributed to the corresponding scheduling entity; when one common token bucket is idle, the token formation rate of the common token bucket is transferred and added to that of the shared token bucket by adjusting the token formation rate of the common token bucket and the token formation rate of the shared token bucket; when all the common token buckets are not idle, the token formation rate transferred to the shared token bucket is transferred back to the common token bucket, and the number of overflowing tokens does not need to be calculated. In this way, the shared token bucket can distribute the idler bandwidth resources of all the scheduling entities, the situation that a counter is set to calculate the numbers of the overflowing tokens of the common token buckets is avoided, the calculation amount of setting of the counters of the common token buckets is greatly reduced, and the consumption of the resource processing is reduced.

The invention relates to a flow scheduling method of a regional air traffic network, which is researched on the basis of the air traffic network. From the standpoint of air traffic flow, the invention researches the relation between the change of weather and the change of flight segment capacity, thereby establishing the relation between flight segment flow and travel time, discussing the relation between the reliability of the travel time of a scheduled flight and a scheduling rule under uncertain weather conditions, establishing a flow scheduling model based on Wardrop balance in the regional air traffic network, providing a method for balanced distribution of flow of each flight segment and scheduling policy of each flight route, providing decision support for air traffic planning management, and achieving the optimal scheduling of the scheduled flight.

The invention discloses a water supplement and algae control method for a large-scale shallow lake water bloom agglomeration water area. The method utilizes a water environment simulation technology, a soft enclosure technology and a dynamic monitoring and scheduling technology and comprises building a lake water environment analogy model, constructing soft enclosure engineering to form a desired water area, carrying out on-line monitoring on the desired water area, building a space-time high precision water environment analogy model of the desired water area, constructing a water quality neural network model and building a flow scheduling system of a water supplement river. The method is a systematic and quantitative technical system which utilizes a river flowing into lake to supply water for a large-scale shallow lake water bloom agglomeration water area so that algal density is controlled. The method builds a defined quantification relationship between supplement water amount and quality and water quality response of a desired water area so that quantitative water environment in the water resource scheduling system is realized, and the problem that the existing water diversion-based alga control engineering measures cannot form a quantitative technical solution so that alga control effects are uncertain or unconspicuous is solved.

The invention provides a flow detection and control mechanism capable of realizing application perception under the SDN and a method. The mechanism comprises an application perception module used for analyzing content of a data packet, expanding the data packet information to an application layer, sharing the valuable data packet characteristic information and carrying out consistency maintenance, and a flow control module used for detecting and classifying flows in combination with a network state and the deep data packet characteristics, providing different service for different application programs through dynamically configuring an OpenFlow flow table and processing abnormal flow perception and attacks. According to the mechanism, on the basis of comprehensively evaluating the network state and the flow behavior characteristics, flow application perception is realized, so different flow scheduling strategies are employed to alleviate possible congestion of the network, network load capability is improved, and actual demands of the different application programs are satisfied.

The invention relates to an Internet communication technology field and discloses a flow scheduling method based on a DNS analysis, an apparatus and a server thereof. Through the method, an ability of dynamically adjusting flow is given to the DNS so that dynamic load balancing can be achieved. Setting is proper. Service quality can be increased. A bandwidth utilization rate can be increased. The utilization rate of the server can be increased and usage quantity of the server can be reduced. The method of the invention comprises the following steps: receiving a domain name analysis request and acquiring the domain name; selecting one content server from a plurality of content servers corresponding to the domain name so that a selection frequency between the content servers after the selection basically satisfies a setting proportion; returning the selected content server to a domain name analysis requester.

The embodiment of the invention discloses a network topology information acquisition method and device. According to the technical scheme provided by the embodiment of the invention, the network topology information acquisition method and device expand the current IGP link state description message and allow the message to carry information such as interface names, interface description information, address information, flow occupation information and the like so as to allow the local LSDB of a network device to record more comprehensive link state information, facilitate the collection of network topology information by a controller through the IGP link state description message and perform flow scheduling based on more accurate network topology information, therefore the accuracy of the network topology information acquisition process and the accuracy of the flow scheduling process based on the network topology information are improved.

The invention provides an optimal access flow scheduling method based on a DNS (Domain Name System) and optimal access flow scheduling equipment based on the DNS. The method comprises the following steps: a user request acquiring step, namely analyzing the request resolving behavior of a target DNS and acquiring a domain name address required for resolving by a user; an IP (Internet Protocol) address inquiring step, namely distributing the domain name address to DNSes of multiple ISP (Internet Service Provider) lines and inquiring multiple IP addresses corresponding to the domain name address; a quality sequencing step, namely performing quality sequencing on the multiple IP addresses according to a preset optimization algorithm, wherein the sequence of the multiple IP addresses indicates the access quality levels of multiple IP addresses accessed by the user; an IP address feedback step, namely feeding the IP address with highest access quality back to the user. By virtue of the method and equipment provided by the invention, analysis can be automatically performed on the basis of the resolving behavior of the DNS, and the access quality of the different IP addresses corresponding to the user access domain name is automatically analyzed.

The present invention describes a method and system for optimizing a test flow within each ATE (Automated Test Equipment) station. The test flow includes a plurality of test blocks. A test block includes a plurality of individual tests. A computing system schedule the test flow based one or more of: a test failure model, test block duration and a yield model. The failure model determines an order or sequence of the test blocks. There are at least two failure models: independent failure model and dependant failure model. The yield model describes whether a semiconductor chip is defective or not. Upon completing the scheduling, the ATE station conducts tests according to the scheduled test flow. The present invention can also be applied to software testing.