Patents by Inventor Enzo Mingozzi
Enzo Mingozzi 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).
-
Patent number: 9307413Abstract: In a wireless or hybrid mesh communication system, radio frequencies are managed by assigning an in-use frequency channel to each local family of nodes, distributing spare frequency channel(s) among the local families of nodes, and changing the in-use frequency channel of at least one selected local family of nodes to a new frequency channel selected among its spare frequency channel(s), if any, or among the spare frequency channel(s) of another local family of nodes if said at least one selected local family of nodes has no spare frequency channel(s), and/or as the in-use frequency channel of another local family of nodes if none of said local families of nodes has spare frequency channel(s).Type: GrantFiled: April 9, 2012Date of Patent: April 5, 2016Assignee: FLUIDMESH NETWORKS S.R.L.Inventors: Luciano Lenzini, Enzo Mingozzi, Luca Bisti, Torquato Bertani, Alessandro Erta, Umberto Malesci
-
Patent number: 8355368Abstract: Method of detour path determination for data packets re-routing in a mesh network comprising a plurality of N nodes, arranged according to a network topology, each node has a K-hops neighborhood knowledge of the network topology, with 1?K<N, primary paths are predefined for routing data packets within the mesh network. Detour paths are automatically discovered and set up while expending relatively few resources in terms of processing complexity, signaling and information spreading. The method is particularly advantageous when used in a wireless mesh network wherein the available bandwidth and the node resources and capabilities are much more limited than in wired networks.Type: GrantFiled: April 9, 2012Date of Patent: January 15, 2013Assignee: Fluidmesh Networks S.R.L.Inventors: Luciano Lenzini, Enzo Mingozzi, Luca Bisti, Torquato Bertani, Alessandro Erta, Umberto Malesci
-
Patent number: 8320320Abstract: A method of scheduling transmissions in a multi-carrier transmission system, includes, for each downlink transmission frame: partitioning the downlink transmission frame into a plurality of data regions each including an equal number of slots, each data region corresponding to a respective logical band; for a currently active connection: a) creating a first set of logical bands not fully occupied for transmission and having a minimum boosting level making the transmission receivable by a receiving terminal; b) extracting from the first set, a second set of logical bands available for allocating a maximum number of slots for downlink transmission to the active connection; and c) selecting the logical band for downlink transmission to the active connection from the second set as the logical band that, after allocating the slots to the considered connection, leaves a residual number of slots equal to or smaller than a predetermined minimum residual in the logical band, e.g.Type: GrantFiled: December 31, 2008Date of Patent: November 27, 2012Assignee: Telecom Italia S.p.A.Inventors: Marco Caretti, Claudio Cicconetti, Ivano Salvatore Collotta, Paolo Tongiani, Luciano Lenzini, Enzo Mingozzi
-
Publication number: 20120257572Abstract: Method of detour path determination for data packets re-routing in a mesh network comprising a plurality of N nodes, arranged according to a network topology, each node has a K-hops neighborhood knowledge of the network topology, with 1?K<N, primary paths are predefined for routing data packets within the mesh network. Detour paths are automatically discovered and set up while expending relatively few resources in terms of processing complexity, signaling and information spreading. The method is particularly advantageous when used in a wireless mesh network wherein the available bandwidth and the node resources and capabilities are much more limited than in wired networks.Type: ApplicationFiled: April 9, 2012Publication date: October 11, 2012Applicant: FLUIDMESH NETWORKS S.R.L.Inventors: Luciano Lenzini, Enzo Mingozzi, Luca Bisti, Torquato Bertani, Alessandro Erta, Umberto Malesci
-
Publication number: 20120258749Abstract: In a wireless or hybrid mesh communication system, radio frequencies are managed by assigning an in-use frequency channel to each local family of nodes, distributing spare frequency channel(s) among the local families of nodes, and changing the in-use frequency channel of at least one selected local family of nodes to a new frequency channel selected among its spare frequency channel(s), if any, or among the spare frequency channel(s) of another local family of nodes if said at least one selected local family of nodes has no spare frequency channel(s), and/or as the in-use frequency channel of another local family of nodes if none of said local families of nodes has spare frequency channel(s).Type: ApplicationFiled: April 9, 2012Publication date: October 11, 2012Applicant: FLUIDMESH NETWORKS S.R.L.Inventors: Luciano Lenzini, Enzo Mingozzi, Luca Bisti, Torquato Bertani, Alessandro Erta, Umberto Malesci
-
Patent number: 8180359Abstract: A data transmission method in a communication system including transmitting at least one capacity request message from a subscriber station, granting capacity subscriber station-specific by a base station, transmitting at least one capacity grant message from the base station, allocating granted capacity connection-specific by the subscriber station, transmitting from the subscriber station at least one message, which includes information on previous capacity requests, transmitting data from the subscriber station according to capacity allocation, monitoring by the base station request messages, capacity grant messages and received transmissions.Type: GrantFiled: February 2, 2007Date of Patent: May 15, 2012Assignee: Nokia CorporationInventors: Luciano Lenzini, Enzo Mingozzi
-
Publication number: 20110261778Abstract: A method of scheduling transmissions in a multi-carrier transmission system, includes, for each downlink transmission frame: partitioning the downlink transmission frame into a plurality of data regions each including an equal number of slots, each data region corresponding to a respective logical band; for a currently active connection: a) creating a first set of logical bands not fully occupied for transmission and having a minimum boosting level making the transmission receivable by a receiving terminal; b) extracting from the first set, a second set of logical bands available for allocating a maximum number of slots for downlink transmission to the active connection; and c) selecting the logical band for downlink transmission to the active connection from the second set as the logical band that, after allocating the slots to the considered connection, leaves a residual number of slots equal to or smaller than a predetermined minimum residual in the logical band, e.g.Type: ApplicationFiled: December 31, 2008Publication date: October 27, 2011Inventors: Marco Caretti, Claudio Cicconetti, Ivano Salvatore Collotta, Paolo Tongiani, Luciano Lenzini, Enzo Mingozzi
-
Patent number: 8031660Abstract: A data transmission method in a communication system including transmitting at least one capacity request message from a subscriber station, granting capacity subscriber station-specific by a base station, transmitting at least one capacity grant message from the base station, allocating granted capacity connection-specific by the subscriber station, transmitting from the subscriber station at least one message, which includes information on previous capacity requests, transmitting data from the subscriber station according to capacity allocation, monitoring by the base station request messages, capacity grant messages and received transmissions.Type: GrantFiled: July 31, 2003Date of Patent: October 4, 2011Assignee: Nokia CorporationInventors: Luciano Lenzini, Enzo Mingozzi
-
Patent number: 7801152Abstract: 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: GrantFiled: April 26, 2004Date of Patent: September 21, 2010Assignee: Telecom Italia S.p.A.Inventors: Luciano Lenzini, Enzo Mingozzi, Massimo Sassi, Enrico Scarrone, Giovanni Stea, Vinicio Vercellone
-
Patent number: 7764659Abstract: The present invention relates to a method and apparatus for scheduling data for transmission via at least two half-duplex time division multiple access connections, wherein for each connection respective capacities of data portions to a transmission frame are allocated so that the total capacity of all data portions of the transmission frame does not exceed a predetermined capacity for each transmission direction, and that the sum of capacities of data portions of each connection of the transmission frame in both transmission directions does not exceed the predetermined capacity. Then, the transmission timing of the data portions within the transmission frame is set in such a manner that transmission and reception intervals of each connection do not overlap. Accordingly, scheduling can be optimized to meet both QoS and half-duplex requirements.Type: GrantFiled: June 27, 2002Date of Patent: July 27, 2010Assignee: Nokia CorporationInventors: Luciano Lenzini, Enzo Mingozzi
-
Patent number: 7626955Abstract: A system and method for scheduling uplink and downlink burst data transmissions for half-duplex terminals in a communication system. After the first half duplex terminal capacity allocation is scheduled for a plurality of half duplex terminals, all available second half duplex terminals are placed in the same relative order as that of the half duplex terminal first capacity allocation. An iterative process is used in order to determine a final second frame layout. Once a set of potential solutions are determined, one solution is selected, and a final second frame structure is determined.Type: GrantFiled: May 2, 2005Date of Patent: December 1, 2009Assignee: Nokia CorporationInventors: Luciano Lenzini, Enzo Mingozzi, Andrea Bacioccola, Claudio Cicconetti, Alessandro Erta
-
Patent number: 7349331Abstract: 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: GrantFiled: October 19, 2001Date of Patent: March 25, 2008Assignee: Telecom Italia S.p.A.Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea
-
Patent number: 7336610Abstract: 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: GrantFiled: July 1, 2002Date of Patent: February 26, 2008Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea
-
Publication number: 20080025301Abstract: 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: ApplicationFiled: April 26, 2004Publication date: January 31, 2008Applicant: TELECOM ITALIA S.P.A.Inventors: Luciano Lenzini, Enzo Mingozzi, Massimo Sassi, Enrico Scarrone, Giovanni Stea, Vinicio Vercellone
-
Publication number: 20070133461Abstract: A data transmission method in a communication system including transmitting at least one capacity request message from a subscriber station, granting capacity subscriber station-specific by a base station, transmitting at least one capacity grant message from the base station, allocating granted capacity connection-specific by the subscriber station, transmitting from the subscriber station at least one message, which includes information on previous capacity requests, transmitting data from the subscriber station according to capacity allocation, monitoring by the base station request messages, capacity grant messages and received transmissions.Type: ApplicationFiled: February 2, 2007Publication date: June 14, 2007Inventors: Luciano Lenzini, Enzo Mingozzi
-
Publication number: 20060245380Abstract: A system and method for scheduling uplink and downlink burst data transmissions for half-duplex terminals in a communication system. After the first half duplex terminal capacity allocation is scheduled for a plurality of half duplex terminals, all available second half duplex terminals are placed in the same relative order as that of the half duplex terminal first capacity allocation. An iterative process is used in order to determine a final second frame layout. Once a set of potential solutions are determined, one solution is selected, and a final second frame structure is determined.Type: ApplicationFiled: May 2, 2005Publication date: November 2, 2006Inventors: Luciano Lenzini, Enzo Mingozzi, Andrea Bacioccola, Claudio Cicconetti, Alessandro Erta
-
Publication number: 20050174971Abstract: The present invention relates to a method and apparatus for scheduling data for transmission via at least two half-duplex time division multiple access connections, wherein for each connection respective capacities of data portions to a transmission frame are allocated so that the total capacity of all data portions of the transmission frame does not exceed a predetermined capacity for each transmission direction, and that the sum of capacities of data portions of each connection of the transmission frame in both transmission directions does not exceed the predetermined capacity. Then, the transmission timing of the data portions within the transmission frame is set in such a manner that transmission and reception intervals of each connection do not overlap. Accordingly, scheduling can be optimised to meet both QoS and half-duplex requirements.Type: ApplicationFiled: June 27, 2002Publication date: August 11, 2005Inventors: Luciano Lenzini, Enzo Mingozzi
-
Publication number: 20050147030Abstract: 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: ApplicationFiled: July 1, 2002Publication date: July 7, 2005Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea
-
Publication number: 20040228296Abstract: A data transmission method in a communication system including transmitting at least one capacity request message from a subscriber station, granting capacity subscriber station-specific by a base station, transmitting at least one capacity grant message from the base station, allocating granted capacity connection-specific by the subscriber station, transmitting from the subscriber station at least one message, which includes information on previous capacity requests, transmitting data from the subscriber station according to capacity allocation, monitoring by the base station request messages, capacity grant messages and received transmissions.Type: ApplicationFiled: July 31, 2003Publication date: November 18, 2004Inventors: Luciano Lenzini, Enzo Mingozzi
-
Publication number: 20040014470Abstract: 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: ApplicationFiled: May 9, 2003Publication date: January 22, 2004Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea