38 results about "Network scheduler" patented technology

A hybird Notes / DB2 environment provides a requisition catalog on the Web. Client browsers are connected to a GWA infrastructure including a first network dispatcher and a virtual cluster of Domino.Go servers. The network dispatcher sprays out browser requests among configured .nsf servers in virtual server cluster. Communications from this virtual server cluster are, in turn, dispatched by a second network dispatcher servers in a Domino cluster. External objects, primarily for a GUI, are served in a .dfs and include graphic files, Java files, HTML images and net.data macros. The catalog is built from supplier provided flat files. A front end is provided for business logic and validation, as also is a relation database backend. HTML forms are populated using relational database agents. A role table is used for controlling access both to Notes code and DB2 data. Large amounts of data is quickly transferred using an intermediate agent and window.

A networked computer system provides a way to quickly switch to a backup data center when a primary data center fails. Each data center includes a redirect table that specifies a geographical area corresponding to each user. The redirect table is replicated on one or more data centers so that each data center has the same information. When a data center fails, the redirect table in one of the non-failed data centers is updated to specify a new data center for each client that used the failed data center as its primary data center. A network dispatcher recognizes that the failed data center is unavailable, and routes a request to the backup data center. Network routing logic then issues a redirection command that causes all subsequent requests from that client to be redirected directly to the backup data center.

Embodiments are provided for traffic scheduling based on user equipment (UE) in wireless networks. A location prediction-based network scheduler (NS) interfaces with a traffic engineering (TE) function to enable location-prediction-based routing for UE traffic. The NS obtains location prediction information for a UE for a next time window comprising a plurality of next time slots, and obtains available network resource prediction for the next time slots. The NS then determines, for each of the next time slots, a weight value as a priority parameter for forwarding data to the UE, in accordance with the location prediction information and the available network resource prediction. The result for the first time slot is then forwarded from the NS to the TE function, which optimizes, for the first time slot, the weight value with a route and data for forwarding the data to the UE.

A system that indicates which frame should next be removed by a scheduler from flow queues within a network device, such as a router, network processor, and like devices is disclosed. The system includes a search engine that searches a set of calendars under the control of a Finite State Machine (FSM), a current pointer and input signals from array and a clock line providing current time. The results of the search are loaded into a Winner Valid array and a Winner Location array. A final decision logic circuit parses information in the Winner Valid array and Winner Location array to generate a final Winner Valid Signal, the identity of the winning calendar and the winning location. Winning is used to define the status of the calendar in the calendar status array that is selected as a result of a search process being executed on a plurality of calendars in the calendar status array.

A network node in a resource reservation network includes a data receiver, a transmitter and a timing adjustment requester. The data receiver receives fixed size application protocol data units (APDUs) from an application at fixed intervals. The transmitter transmits data from the network node to the network within transmission opportunities (TXOPs) associated with a constant data service flow for the application specified associated with the application and the network node in a media access plan (MAP) generated by a network scheduler. The timing adjustment requester requests adjustments of the network scheduler to the timing of TXOPs associated with the constant data service flow in order to minimize a delay between the arrival of the APDUs and their transmittal to the network.

A method, system and apparatus for server failure diagnosis and self-healing in a server farm. An autonomic server farm which has been configured in accordance with the inventive arrangements can include a multiplicity of servers enabled to respond to requests received from clients which are external to the server farm. A resource director such as an IP sprayer or a network dispatcher can be configured to route requests to selected ones of the servers, in accordance with resource allocation algorithms such as random, round-robin and least recently used. Significantly, unlike conventional server farms whose management of failure diagnosis and self-healing relies exclusively upon the capabilities of the resource director, in the present invention, client-assisted failure detection logic can be coupled to the resource director so as to provide client-assisted management of failure diagnosis and self-healing.

Techniques for network state-aware and network scheduling policy-aware task scheduling are provided. In one aspect, a method for scheduling tasks in a distributed computing network includes the steps of: collecting a pool of candidate resources in the distributed computing network for performing a given one of the tasks; predicting a performance of each of the candidate resources in performing the given task based on both i) a state and ii) a scheduling policy of the distributed computing network; and selecting a best candidate resource for the given task based on the performance. A system for scheduling tasks in a distributed computing network is also provided which includes a task scheduler; and a network scheduler, wherein the task scheduler is configured to schedule the tasks in the distributed computing network based on both i) the state and ii) the scheduling policy of the distributed computing network.

A media content packaging and distribution system that generates a plurality of disparate live media output streams to be viewed on a plurality of consumer devices, receives a programming schedule for a channel from a network scheduler. The programming schedule corresponds to at least a first manifest associated with a first pre-encoded media asset. Information related to a plurality of first media segments and one or more events from the first pre-encoded media asset indicated in the first manifest is inserted into a live output stream manifest at defined intervals. A disparate live media output stream, to be viewed by a consumer device for a channel via a media player, is generated based on the insertion of the information related to the plurality of first media segments from the first pre-encoded media asset indicated in the first manifest into the live output stream manifest.