Patents by Inventor Giovanni Stea

Giovanni Stea has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20130336200
    Abstract: A method scheduling link activations within a wireless communications network including at least one network cell including a base station providing radio coverage over the network cell and at least one relay node putting the base station into communication with a user equipment within the network cell over an access link. The relay node communicates with the base station over a backhaul link. The method includes estimating, for the relay node, an access link capacity according to status information indicative of a status of the user equipment associated with the relay node, estimating a backhaul link capacity of the relay node according to the status information, and scheduling, for the relay node, either a backhaul link activation or an access link activation such that one of the backhaul link and access link is activated, in a predetermined time interval, based on a comparison between the access capacity and backhaul capacity.
    Type: Application
    Filed: March 3, 2011
    Publication date: December 19, 2013
    Applicant: Telecom Italia S.p.A.
    Inventors: Matteo Maria Andreozzi, Marco Caretti, Roberto Fantini, Daniele Migliorini, Vincenzo Maria Pii, Dario Sabella, Giovanni Stea
  • Publication number: 20130329826
    Abstract: A method executed in a wireless communication network including at least one base station associated to a corresponding area transmitting/receiving data to/from corresponding user terminals located within the area. The method generates a user-rate matrix for each base station. Each element of the user-rate matrix provides a corresponding score, in terms of achievable rate, to a user terminal or group of user terminals within the corresponding area when a transmission is made to/from the user terminal or group of user terminals, respectively, from/to the base station by employing a selected transmission mode. The method further processes the elements of the user-rate matrix to create a scheduling list sorting the elements by a decreasing score, and associating to each user terminal a corresponding selected transmission mode based on the scheduling list for the transmission/reception of data to/from the base station.
    Type: Application
    Filed: March 3, 2011
    Publication date: December 12, 2013
    Applicant: TELECOM ITALIA S.P.A.
    Inventors: Matteo Maria Andreozzi, Marco Caretti, Roberto Fantini, Daniele Migliorini, Generoso Pagano, Dario Sabella, Giovanni Stea
  • Publication number: 20130028220
    Abstract: In a communication network, a node receives from user equipment information on the length of a queue of information units to be transmitted to the node from the user equipment. The information, for possible use by the node in scheduling transmission of these information units from the user equipment, is in the form of quantized queue length information indicative of a lower bound and an upper bound for the queue length. Transmission of information units from the user equipment to the node is detected at the node, and an improved estimate of the queue length is produced by correcting the lower bound and the upper bound via subtraction of the number of the detected information units transmitted from the user equipment to the node.
    Type: Application
    Filed: April 6, 2010
    Publication date: January 31, 2013
    Inventors: Matteo Maria Andreozzi, Marco Caretti, Daniele Franceschini, Roberto Rossi, Dario Sabella, Giovanni Stea
  • Publication number: 20120250678
    Abstract: Data streams are transmitted from a node towards a receiver in a communication network in the form of data packets for playout via a reproduction buffer at the receiver. The data packets are arranged in a scheduling queue and dropped from the scheduling queue if their sojourn time in the queue exceeds a given drop deadline. The reproduction buffer is emulated at the node in order to determine respective playout values for the data packets which are indicative of expected playout instants for the data packets by the reproduction buffer at the receiver. The drop deadlines are assigned to the data packets as a function of the respective playout values determined via the reproduction buffer as emulated at the node.
    Type: Application
    Filed: December 24, 2009
    Publication date: October 4, 2012
    Applicant: TELECOM ITALIA S.P.A.
    Inventors: Dario Sabella, Marco Caretti, Matteo Maria Andreozzi, Giovanni Stea
  • Publication number: 20100278152
    Abstract: In a method of scheduling transmission services over a high speed packet access communication link such as a HSDPA and/or a HSUPA link a list of queues is created for transmission services to be provided over the link. The queues, which include both Real Time and Non Real Time queues, are allotted respective service priorities based e.g. on a channel quality indicator and/or a Quality of Service indicator to produce an ordered list of queues based on the service priorities. The link resources needed for serving at least one set of queues having higher priorities in the ordered list are estimated and a check is made. If these resources are available, the set of queues having higher priorities in the ordered list are served. If the resources required are not available, at least one queue is removed from the ordered list of queues.
    Type: Application
    Filed: December 21, 2007
    Publication date: November 4, 2010
    Applicant: Telecom Italia S.p.A.
    Inventors: Matteo Andreozzi, Andrea Bacioccola, Daniele Franceschini, Ettore Pulieri, Roberto Rossi, Giovanni Stea
  • Patent number: 7801152
    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.
    Type: Grant
    Filed: April 26, 2004
    Date of Patent: September 21, 2010
    Assignee: Telecom Italia S.p.A.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Massimo Sassi, Enrico Scarrone, Giovanni Stea, Vinicio Vercellone
  • Patent number: 7349331
    Abstract: Each synchronous flow (h=1, 2, Ns) is associated to a respective synchronous capacity value (Hh) indicative of the maximum amount of time for which a synchronous flow can be served before relinquishing the token. Each asynchronous flow (I=1, 2, NA) is, on the other hand, associated to a respective indicative value of the delay to be recovered so that the respective queue has the right to be served and to another value indicating the instant in which the server visited the respective queue in the pervious cycle. Each queue associated to a synchronous flow (h) is therefore served for a maximum amount of time that is equal to the aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is only served if the server's visit takes place with anticipation with respect to the expected instant.
    Type: Grant
    Filed: October 19, 2001
    Date of Patent: March 25, 2008
    Assignee: Telecom Italia S.p.A.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea
  • Patent number: 7336610
    Abstract: Each synchronous flow (i=1, 2 . . . , Ns) is associated to a respective synchronous capacity value (Hi) that is related the period of time for which a synchronous flow can be serviced before the server moves on. This value can be selected either according to a local allocation criteria or according to a global allocation criteria. Each asynchronous flow (i=1, 2, . . . , NA) s is associated to a respective first value indicating the delay to be made up so that the respective queues has the right to be serviced and to another value indicating the instant in which the server visited the respective queue associated to a synchronous flow (h) is then serviced for a period of time that is related to be aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is serviced only if the server's visit occurs before the expected moment.
    Type: Grant
    Filed: July 1, 2002
    Date of Patent: February 26, 2008
    Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea
  • Publication number: 20080025301
    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.
    Type: Application
    Filed: April 26, 2004
    Publication date: January 31, 2008
    Applicant: TELECOM ITALIA S.P.A.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Massimo Sassi, Enrico Scarrone, Giovanni Stea, Vinicio Vercellone
  • Publication number: 20050147030
    Abstract: Each synchronous flow (i=1, 2 . . . , Ns) is associated to a respective synchronous capacity value (Hi) that is related the period of time for which a synchronous flow can be serviced before the server moves on. This value can be selected either according to a local allocation criteria or according to a global allocation criteria. Each asynchronous flow (i=1, 2, . . . , NA) s is associated to a respective first value indicating the delay to be made up so that the respective queues has the right to be serviced and to another value indicating the instant in which the server visited the respective queue associated to a synchronous flow (h) is then serviced for a period of time that is related to be aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is serviced only if the server's visit occurs before the expected moment.
    Type: Application
    Filed: July 1, 2002
    Publication date: July 7, 2005
    Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea
  • Publication number: 20040014470
    Abstract: Each synchronous flow (h=1, 2, Ns) is associated to a respective synchronous capacity value (Hh) indicative of the maximum amount of time for which a synchronous flow can be served before relinquishing the token. Each asynchronous flow (I=1, 2, NA) is, on the other hand, associated to a respective indicative value of the delay to be recovered so that the respective queue has the right to be served and to another value indicating the instant in which the server visited the respective queue in the pervious cycle. Each queue associated to a synchronous flow (h) is therefore served for a maximum amount of time that is equal to the aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is only served if the server's visit takes place with anticipation with respect to the expected instant.
    Type: Application
    Filed: May 9, 2003
    Publication date: January 22, 2004
    Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea