专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20050147030A1 Scheduling a shared resource among synchronous and asynchronous packet flows 有权
标题翻译：在同步和异步数据包流中调度共享资源
公开(公告)号：US20050147030A1
公开(公告)日：2005-07-07
申请号：US10511187
申请日：2002-07-01
申请人： Luciano Lenzini , Enzo Mingozzi , Enrico Scarrone , Giovanni Stea
发明人： Luciano Lenzini , Enzo Mingozzi , Enrico Scarrone , Giovanni Stea
IPC分类号： H04L12/54 , H04L12/64 , H04L12/851 , H04L12/863 , H04L12/873 , H04L12/875 , H04Q7/36 , H04L1/00
CPC分类号： H04L47/24 , H04L12/6418 , H04L47/50 , H04L47/521 , H04L47/522 , H04L47/562 , H04L47/621 , H04L47/6225 , H04L47/6265 , H04L2012/6421 , H04L2012/6451 , H04L2012/6456
摘要： 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. The server's visit (10) to the synchronous queues should preferably take place during two successive cycles in order to optimise the use of the resources available.
摘要翻译：每个同步流（i = 1,2，...，N N）与相应的同步容量值（H SUB i）相关联，在服务器移动之前可以对同步流进行处理。该值可以根据本地分配标准或根据全局分配标准进行选择。每个异步流（i = 1,2，...，N A A）与相应的第一值相关联，该第一值指示要被补偿的延迟，使得相应队列具有被服务的权限并且指示服务器访问与同步流（h）相关联的相应队列的时刻的另一个值然后被服务于与前述同步容量值相关的时间段，而与异步流相关联的每个队列（ i）仅在服务器的访问发生在预期时刻之前进行服务。服务器对同步队列的访问（10）应优选在两个连续循环期间进行，以优化可用资源的使用。

2. 发明申请

US20120257572A1 Method and System for Automatic Selection of Detour Paths in a Wireless Mesh Network 有权
标题翻译：在无线网状网络中自动选择绕行路径的方法和系统
公开(公告)号：US20120257572A1
公开(公告)日：2012-10-11
申请号：US13442543
申请日：2012-04-09
申请人： Luciano Lenzini , Enzo Mingozzi , Luca Bisti , Torquato Bertani , Alessandro Erta , Umberto Malesci
发明人： Luciano Lenzini , Enzo Mingozzi , Luca Bisti , Torquato Bertani , Alessandro Erta , Umberto Malesci
IPC分类号： H04W40/00
CPC分类号： H04L45/50 , H04L45/22 , H04W40/24
摘要： 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个节点的网状网络中的数据分组重路由的迂回路径确定方法，根据网络拓扑布置，每个节点具有网络拓扑的K-hop邻域知识，其中1＆nlE; K

3. 发明授权

US08355368B2 Method and system for automatic selection of detour paths in a wireless mesh network 有权
标题翻译：在无线网状网络中自动选择迂回路径的方法和系统
公开(公告)号：US08355368B2
公开(公告)日：2013-01-15
申请号：US13442543
申请日：2012-04-09
申请人： Luciano Lenzini , Enzo Mingozzi , Luca Bisti , Torquato Bertani , Alessandro Erta , Umberto Malesci
发明人： Luciano Lenzini , Enzo Mingozzi , Luca Bisti , Torquato Bertani , Alessandro Erta , Umberto Malesci
IPC分类号： H04W40/00 , H04J1/16
CPC分类号： H04L45/50 , H04L45/22 , H04W40/24
摘要： 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个节点的网状网络中的数据分组重路由的迂回路径确定方法，根据网络拓扑布置，每个节点具有网络拓扑的K-hop邻域知识，其中1＆nlE; K

4. 发明授权

US08031660B2 Data transmission method, system, base station, subscriber station, data processing unit, computer program product, computer program distribution medium and baseband module 有权
标题翻译：数据传输方式，系统，基站，用户站，数据处理单元，计算机程序产品，计算机程序分发介质和基带模块
公开(公告)号：US08031660B2
公开(公告)日：2011-10-04
申请号：US10630971
申请日：2003-07-31
申请人： Luciano Lenzini , Enzo Mingozzi
发明人： Luciano Lenzini , Enzo Mingozzi
IPC分类号： G01R31/08 , H04J3/22
CPC分类号： H04W72/121 , H04W24/00 , H04W28/24 , H04W72/1247
摘要： 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.
摘要翻译：一种通信系统中的数据传输方法，包括从用户台发送至少一个容量请求消息，授予基站特定的容量用户站，从基站发送至少一个容量授权消息，分配授权的容量连接特定由用户台从用户台发送至少一个消息，其包括关于先前的容量请求的信息，根据容量分配从用户台发送数据，由基站请求消息进行监视，容量授权消息和接收到的传输。

5. 发明授权

US07801152B2 Method and system for scheduling utilization of resources, related communication network and computer program product 有权
标题翻译：调度资源利用的方法和系统，相关通信网络和计算机程序产品
公开(公告)号：US07801152B2
公开(公告)日：2010-09-21
申请号：US11587417
申请日：2004-04-26
申请人： Luciano Lenzini , Enzo Mingozzi , Massimo Sassi , Enrico Scarrone , Giovanni Stea , Vinicio Vercellone
发明人： Luciano Lenzini , Enzo Mingozzi , Massimo Sassi , Enrico Scarrone , Giovanni Stea , Vinicio Vercellone
IPC分类号： H04L12/56
CPC分类号： H04L47/6215 , H04L47/10 , H04L47/2408 , H04L47/2416 , H04L47/245 , H04L47/283 , H04L47/50 , H04L47/521 , H04L47/522 , H04L47/562
摘要： 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.
摘要翻译：一种用于通过多个信息分组流调度服务资源利用的系统，其中所述流包括速率保证同步流和尽力而为的异步流，所述异步流利用由同步流未被利用的资源的服务容量。服务器将在后续访问流中，先访问异步流后面的同步流。服务器被配置为检测任何积压的同步流，并且当服务器访问任何所述积压的同步流时，其允许积压的同步流在给定时间内利用资源，由此同步流在每一轮上具有保证的传输窗口。当服务器访问任何异步流时，确定服务器上次访问同一个异步流后所经过的时间。如果访问异步流是基于参考循环时间晚于预期的，那么所访问的异步流被限制在利用正在进行的一轮的资源之外，如果访问比基于参考循环时间早的预期发生异步被访问的流被允许在相应的给定时间内利用资源。

6. 发明授权

US07626955B2 System and method for providing a fast and optimized uplink and downlink scheduling algorithm for use in FDD communication systems with half-duplex stations 失效
标题翻译：用于提供用于具有半双工站的FDD通信系统中的快速和优化的上行链路和下行链路调度算法的系统和方法
公开(公告)号：US07626955B2
公开(公告)日：2009-12-01
申请号：US11119550
申请日：2005-05-02
申请人： Luciano Lenzini , Enzo Mingozzi , Andrea Bacioccola , Claudio Cicconetti , Alessandro Erta
发明人： Luciano Lenzini , Enzo Mingozzi , Andrea Bacioccola , Claudio Cicconetti , Alessandro Erta
IPC分类号： H04L5/16 , H04J3/00 , H04J1/00 , H04L12/43 , H04M3/42
CPC分类号： H04L5/023 , H04L5/16 , H04W72/1236
摘要： 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.
摘要翻译：一种用于在通信系统中为半双工终端调度上行链路和下行链路突发数据传输的系统和方法。在为多个半双工终端调度第一半双工终端容量分配之后，所有可用的第二半双工终端以与半双工终端第一容量分配相同的相对顺序被放置。使用迭代过程来确定最终的第二帧布局。一旦确定了一组潜在的解决方案，就选择一个解决方案，并确定最后的第二个框架结构。

7. 发明申请

US20110261778A1 METHOD AND SYSTEM FOR DOWNLINK TRANSMISSION SCHEDULING IN MULTI-CARRIER NETWORKS 有权
标题翻译：多载波网络下行链路传输调度方法与系统
公开(公告)号：US20110261778A1
公开(公告)日：2011-10-27
申请号：US13142632
申请日：2008-12-31
申请人： Marco Caretti , Claudio Cicconetti , Ivano Salvatore Collotta , Paolo Tongiani , Luciano Lenzini , Enzo Mingozzi
发明人： Marco Caretti , Claudio Cicconetti , Ivano Salvatore Collotta , Paolo Tongiani , Luciano Lenzini , Enzo Mingozzi
IPC分类号： H04W72/04
CPC分类号： H04L5/0044 , H04L5/0007 , H04L5/0037 , H04L5/0053 , H04L5/006 , H04L5/0064 , H04W72/04 , H04W72/0446 , H04W72/12
摘要： 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., the smallest residual number of slots.
摘要翻译：一种在多载波传输系统中调度传输的方法，对于每个下行链路传输帧包括：将所述下行链路传输帧划分为多个数据区，每个数据区包括相等数量的时隙，每个数据区对应于相应的逻辑带; 对于当前活动的连接：a）创建未完全占用以用于传输的第一组逻辑带，并具有使接收终端可接收的传输的最小提升级; b）从第一组中提取第二组逻辑带，其可用于分配用于下行链路传输的活动连接的最大数量的时隙; 以及c）从所述第二组中选择用于下行链路传输到所述活动连接的逻辑频带作为所述逻辑频带，所述逻辑频带在将所述时隙分配给所考虑的连接之后留下等于或小于所述第一组中的预定最小残差的剩余数量的时隙逻辑频带，例如，最小的时隙剩余数。

8. 发明授权

US07764659B2 Scheduling method and apparatus for half-duplex transmission 有权
标题翻译：半双工传输调度方法及装置
公开(公告)号：US07764659B2
公开(公告)日：2010-07-27
申请号：US10516022
申请日：2002-06-27
申请人： Luciano Lenzini , Enzo Mingozzi
发明人： Luciano Lenzini , Enzo Mingozzi
IPC分类号： H04J3/00 , H04B7/212 , H04J4/00
CPC分类号： H04W72/1257 , H04L12/2856
摘要： 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.
摘要翻译：本发明涉及一种用于通过至少两个半双工时分多址连接来调度用于传输的数据的方法和装置，其中对于每个连接，分配数据部分到传输帧的各自的容量，使得所有数据的总容量传输帧的部分对于每个传输方向不超过预定容量，并且传输帧在两个传输方向上的每个连接的数据部分的容量之和不超过预定容量。然后，传输帧内的数据部分的发送定时被设定为使得每个连接的发送和接收间隔不重叠的方式。因此，可以优化调度以满足QoS和半双工要求。

9. 发明授权

US07349331B2 Procedure and system for scheduling a shared recourse between multiple information packet flows 有权
标题翻译：在多个信息包流之间调度共享资源的过程和系统
公开(公告)号：US07349331B2
公开(公告)日：2008-03-25
申请号：US10399887
申请日：2001-10-19
申请人： Luciano Lenzini , Enzo Mingozzi , Enrico Scarrone , Giovanni Stea
发明人： Luciano Lenzini , Enzo Mingozzi , Enrico Scarrone , Giovanni Stea
IPC分类号： H04L12/26
CPC分类号： H04L47/10 , H04L12/6418 , H04L29/06 , H04L47/50 , H04L47/525 , H04L2012/6451 , H04L2012/6456 , H04L2012/6464 , H04L2012/6489
摘要： 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. This anticipation is determined as the difference between the expected rotation time, needed by the server (10) to complete a visit cycle (T) of the queues associated to the aforesaid flows (h, i), and the time that has passed since the server's previous visit (10) and the delay accumulated. This difference, if positive, defines the maximum service time for the asynchronous queue. If the queue is empty when the server visits it, the server (10) moves on to the next queue even before the relative maximum service time has passed.
摘要翻译：每个同步流（h = 1,2，N S）与相应的同步容量值（H H h H）相关联，该相应同步电容值表示最大时间量在放弃令牌之前可以提供流量。另一方面，每个异步流（I = 1,2，N A A）与要恢复的延迟的相应指示值相关联，使得相应的队列具有被服务的权利以及指示服务器在上一个周期中访问相应队列的时刻的另一个值。因此，与同步流（h）相关联的每个队列服务等于上述同步容量值的最大时间量，而与异步流（i）相关联的每个队列仅在服务器的访问与相对于预期时刻的预期。该预期被确定为服务器（10）完成与上述流（h，i）相关联的队列的访问周期（T）所需的预期旋转时间之间的差异以及自服务器以前的访问（10）和累积的延迟。该差异如果为正，则定义异步队列的最大服务时间。如果服务器访问队列为空，即使在相对最大服务时间过去之前，服务器（10）也移动到下一个队列。

10. 发明申请

US20080025301A1 Method and System for Scheduling Utilization of Resources, Related Communication Network and Computer Program Product 有权
标题翻译：资源利用调度方法与系统，相关通信网络和计算机程序产品
公开(公告)号：US20080025301A1
公开(公告)日：2008-01-31
申请号：US11587417
申请日：2004-04-26
申请人： Luciano Lenzini , Enzo Mingozzi , Massimo Sassi , Enrico Scarrone , Giovanni Stea , Vinicio Vercellone
发明人： Luciano Lenzini , Enzo Mingozzi , Massimo Sassi , Enrico Scarrone , Giovanni Stea , Vinicio Vercellone
IPC分类号： H04L12/56
CPC分类号： H04L47/6215 , H04L47/10 , H04L47/2408 , H04L47/2416 , H04L47/245 , H04L47/283 , H04L47/50 , H04L47/521 , H04L47/522 , H04L47/562
摘要： 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.
摘要翻译：一种用于通过多个信息分组流调度服务资源利用的系统，其中所述流包括速率保证同步流和尽力而为的异步流，所述异步流利用由同步流未被利用的资源的服务容量。服务器将在后续访问流中，先访问异步流后面的同步流。服务器被配置为检测任何积压的同步流，并且当服务器访问任何所述积压的同步流时，其允许积压的同步流在给定时间内利用资源，由此同步流在每一轮上具有保证的传输窗口。当服务器访问任何异步流时，确定服务器上次访问同一个异步流后所经过的时间。如果访问异步流是基于参考循环时间晚于预期的，那么所访问的异步流被限制在利用正在进行的一轮的资源之外，如果访问比基于参考循环时间早的预期发生异步被访问的流被允许在相应的给定时间内利用资源。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式