Patent US1938534A successfully refreshed from Google Patents.
US7801152B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for scheduling utilization of resources, related communication network and computer program product
Assignee: TIM SpA
•
Filing: 2004-04-26
•
Granted: 2010-09-21
•
Expires: 2024-04-26
Abstract
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.
Inventors
- 👤 Luciano Lenzini
- 👤 Enzo Mingozzi
- 👤 Massimo Sassi
- 👤 Enrico Scarrone
- 👤 Giovanni Stea
- 👤 Vinicio Vercellone
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 17:54
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/50; H04L47/62; H04L47/6215; H04L47/10; H04L47/24; H04L47/2408; H04L47/2416; H04L47/245; H04L47/28; H04L47/283; H04L47/52; H04L47/521; H04L47/522; H04L47/56; H04L47/562
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
330 words
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 an earliness value representing an amount of time the server visit is earlier than expected, whereby said function regulates the exploitation by each said asynchronous flows of said service capacity of said resource left unexploited by said synchronous flows, wherein said respective given time is proportional to said earliness value via a proportionality factor, and wherein said proportionality factor is a ratio of a weight assigned to said asynchronous flow to a maximum weight among a plurality of weights assigned to said asynchronous flows.
Claim 2
Independent Claim
330 words
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 an earliness value representing an amount of time the server visit is earlier than expected, whereby said function regulates the exploitation by each said asynchronous flows of said service capacity of said resource left unexploited by said synchronous flows, wherein said respective given time is proportional to said earliness value via a proportionality factor, and wherein said proportionality factor is a ratio of a weight assigned to said asynchronous flow to a maximum weight among a plurality of weights assigned to said asynchronous flows.
Claim 3
Dependent Claim
37 words
The method of claim 1 , wherein said server stops visiting any said flows, when said given time or respective given time has elapsed, or when the flow being visited has cleared its backlog, whichever occurs first.
Claim 4
Dependent Claim
34 words
The method of claim 1 , comprising the steps of: determining a synchronous bandwidth for said synchronous flows; and setting an upper bound to said given time as a function of said synchronous bandwidth.
Claim 5
Dependent Claim
74 words
The method of claim 1 , comprising the steps of: associating with each said asynchronous flow a value indicative of delay accumulated by said server in visiting said asynchronous flow in previous rounds; when said server visits said asynchronous flow, subtracting from said reference round time a duration of a previous round to obtain a subtraction result; and subtracting said value from said subtraction result thus computing said earliness value for a current round.
Claim 6
Dependent Claim
43 words
The method of claim 4 , comprising the steps of: if said earliness value is negative, storing an absolute value thereof in said value indicative of delay accumulated; and restraining said asynchronous flow being visited from utilizing said resource for said current round.
Claim 7
Dependent Claim
40 words
The method of claim 4 , comprising the steps of: if said earliness value is positive, resetting to zero said value indicative of delay accumulated; and granting said asynchronous flow being visited said respective given time for utilizing said resource.
Claim 8
Dependent Claim
18 words
The method of claim 1 , comprising the step of selecting said proportionality factor in a range (0,1].
Claim 9
Dependent Claim
18 words
The method of claim 1 , comprising the step of selecting respective proportionality factors for said asynchronous flows.
Claim 10
Dependent Claim
39 words
The method of claim 1 , comprising the step of determining respective synchronous bandwidths for said synchronous flows, wherein a sum of time intervals corresponding to said synchronous bandwidths is lower than or equal to said reference round time.
Claim 11
Independent Claim
334 words
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 an earliness value representing an amount of time the server visit is earlier than expected, whereby said function regulates the exploitation by each said asynchronous flows of said service capacity of said resource left unexploited by said synchronous flows, wherein said respective given time is proportional to said earliness value via a proportionality factor, and wherein said proportionality factor is a ratio of a weight assigned to said asynchronous flow to a maximum weight among a plurality of weights assigned to said asynchronous flows.
Claim 12
Independent Claim
334 words
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 an earliness value representing an amount of time the server visit is earlier than expected, whereby said function regulates the exploitation by each said asynchronous flows of said service capacity of said resource left unexploited by said synchronous flows, wherein said respective given time is proportional to said earliness value via a proportionality factor, and wherein said proportionality factor is a ratio of a weight assigned to said asynchronous flow to a maximum weight among a plurality of weights assigned to said asynchronous flows.
Claim 13
Dependent Claim
40 words
The system of claim 10 , wherein said server is configured for stopping visiting any said flows: when said given time or respective given time has elapsed, or when the flow being visited has cleared its backlog, whichever occurs first.
Claim 14
Dependent Claim
36 words
The system of claim 10 , wherein said sever is configured for: determining a synchronous bandwidth for said synchronous flows; and setting an upper bound to said given time as a function of said synchronous bandwidth.
Claim 15
Dependent Claim
76 words
The system of claim 10 , wherein said server is configured for: associating with each said asynchronous flow a value indicative of delay accumulated by said server in visiting said asynchronous flow in previous rounds, when said server visits said asynchronous flow, subtracting from said reference round time a duration of a previous round to obtain a subtraction result, and subtracting said value from said subtraction result, thus computing said earliness value for a current round.
Claim 16
Dependent Claim
45 words
The system of claim 13 , wherein said server is configured for: if said earliness value is negative, storing an absolute value thereof in said value indicative of delay accumulated; and restraining said asynchronous flow being visited from utilizing said resource for said current round.
Claim 17
Dependent Claim
42 words
The system of claim 13 , wherein said server is configured for: if said earliness value is positive, resetting to zero said value indicative of delay accumulated; and granting said asynchronous flow being visited said respective given time for utilizing said resource.
Claim 18
Dependent Claim
21 words
The system of claim 10 , wherein said server is configured for using as said proportionality factors in a range (0,1].
Claim 19
Dependent Claim
20 words
The system of claim 10 , wherein said server is configured for using respective proportionality factors for said asynchronous flows.
Claim 20
Dependent Claim
41 words
The system of claim 10 , wherein said server is configured for determining respective synchronous bandwidths for said synchronous flows, wherein a sum of time intervals corresponding to said synchronous bandwidths is lower than or equal to said reference round time.
Claim 21
Dependent Claim
10 words
A communication network comprising the system of claim 10 .
Claim 22
Dependent Claim
33 words
A non-transitory computer readable medium encoded with a computer program product loadable into a memory of at least one computer and comprising software code portions for performing the method of claim 1 .
References Cited (Backward Citations)
US6493316B1
Cited
WO2001024428A1
Cited
WO2001079992A2
Cited
WO2002035777A1
Cited
US7349331B2
Cited
US20020114334A1
Cited
US20030093526A1
Cited
US20030103514A1
Cited
US20050172030A1
Cited
WO2003088605A1
Cited
US7336610B2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2013-09-20 | 2014-03-22 | 2014-09-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2017-09-20 | 2018-03-22 | 2018-09-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2021-09-20 | 2022-03-22 | 2022-09-21 | $7700.00 | Window Closed / Lapsed |