Method and System for Scheduling Utilization of Resources, Related Communication Network and Computer Program Product
1 Assignment
0 Petitions
Accused Products
Abstract
A system for scheduling utilization of a service resource by a plurality of flows of information packets, wherein the flows include rate-guaranteed synchronous flows and best-effort asynchronous flows, the asynchronous flows exploiting the service capacity of the resource left unexploited by the synchronous flows. A server visits the flows, in subsequent rounds, by visiting first the synchronous flows followed by the asynchronous flows. The server is configured for detecting any backlogged synchronous flow, and when the server visits any said backlogged synchronous flow, it allows the backlogged synchronous flow to utilize the resource for a given time, whereby the synchronous flows have a guaranteed transmission window on each round. When the server visits any asynchronous flow, the time elapsed since the last visit by the server to the same asynchronous flow is determined. If the visit to the asynchronous flow occurs later than expected based on a reference round time, the asynchronous flow being visited is restrained from utilizing the resource for the ongoing round, and if the visit occurs earlier than expected based on the reference round time the asynchronous flow being visited is allowed to utilize the resource for a respective given time.
-
Citations
48 Claims
-
1-24. -24. (canceled)
-
25. A method of scheduling utilization of a service resource by a plurality of flows of information packets, said plurality of flows comprising rate-guaranteed synchronous flows and best-efforts asynchronous flows, wherein said asynchronous flows exploit the service capacity of said resource left unexploited by said synchronous flows, comprising the steps of:
-
providing a server that visits said plurality of flows in subsequent rounds, said server visiting first within each said round said synchronous flows followed by said asynchronous flows;
detecting any backlogged synchronous flow in said plurality of synchronous flows, when said server visits any said backlogged synchronous flow, allowing said backlogged synchronous flow to utilize said resource for a given time, whereby said synchronous flows have a guaranteed transmission window on each said round;
determining a reference round time indicative of the expected time for said server to complete a round of visits of said plurality of flows, when said server visits any said asynchronous flow, determining the time elapsed since the last visit by said server to the same asynchronous flow, and;
i) if the visit to said asynchronous flow occurs later than expected based on said reference round time, restraining said asynchronous flow being visited from utilizing said resource for the ongoing round, ii) if the visit to said asynchronous flow occurs earlier than expected based on said reference round time, allowing said asynchronous flow being visited to utilize said resource for a respective given time, said respective given time being a function of the earliness of the server visit, whereby said function regulates the exploitation by each said asynchronous flows of said service capacity of said resource left unexploited by said synchronous flows. - View Dependent Claims (26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 48)
-
-
36. A system for scheduling utilization of a service resource by a plurality of flows of information packets, said plurality of flows comprising rate-guaranteed synchronous flows and best-effort asynchronous flows, wherein said asynchronous flows exploit the service capacity of said resource left unexploited by said synchronous flows, the system comprising a server configured for visiting said plurality of flows in subsequent rounds, said server visiting first within each said round said synchronous flows followed by said asynchronous flows, said server being configured for:
-
detecting any backlogged synchronous flow in said plurality of synchronous flows, when said server visits any said backlogged synchronous flow, allowing said backlogged synchronous flow to utilize said resource for a given time, whereby said synchronous flows have a guaranteed transmission window on each said round;
determining a reference round time indicative of the expected time for said server to complete a round of visits of said plurality of flows, when said server visits any said asynchronous flow, determining the time elapsed since the last visit by said server to the same asynchronous flow, and;
i) if the visit to said asynchronous flow occurs later than expected based on said reference round time, restraining said asynchronous flow being visited from utilizing said resource for the ongoing round, ii) if the visit to said asynchronous flow occurs earlier than expected based on said reference round time, allowing said asynchronous flow being visited to utilize said resource for a respective given time, said respective given time being a function of the earliness of the server visit, whereby said function regulates the exploitation by each said asynchronous flows of said service capacity of said resource left unexploited by said synchronous flows. - View Dependent Claims (37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47)
-
Specification