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

1. 发明申请

WO2011014647A2 A METHOD FOR WIRELESS NETWORK VIRTUALIZATION THROUGH SEQUENTIAL AUCTIONS AND CONJECTURAL PRICING 审中-公开
标题翻译：一种通过顺序拍卖和对价定价的无线网络虚拟化方法
公开(公告)号：WO2011014647A2
公开(公告)日：2011-02-03
申请号：PCT/US2010/043699
申请日：2010-07-29
申请人： NTT DOCOMO, INC. , KOZAT, Ulas, C. , FU, Fangwen
发明人： KOZAT, Ulas, C. , FU, Fangwen
IPC分类号： G06Q10/00 , H04W74/04 , G06Q30/00
CPC分类号： H04W28/16 , G06Q30/08 , G06Q50/30
摘要： A method and apparatus is disclosed herein for wireless network virtualization through sequential auctions and conjectural pricing. In one embodiment, the apparatus comprises a plurality of service providers operable to bid on network resources on behalf of a plurality of individual receivers and a wireless network operator, communicably coupled to the plurality of service providers, to perform resource allocation using an auction to allocate network resources to the plurality of service providers based on instantaneous channel conditions and traffic information of each of the individual receivers and to schedule transmissions in time and space to the individual receivers.
摘要翻译：本文公开了用于通过连续拍卖和推测定价进行无线网络虚拟化的方法和设备。在一个实施例中，该装置包括多个服务提供商，该多个服务提供商可操作地代表多个单独的接收机对网络资源进行投标，并且可通信地耦合到多个服务提供商的无线网络运营商使用拍卖执行资源分配以分配网络资源基于每个单独接收机的瞬时信道条件和业务量信息，并且将时间和空间上的传输安排到单独的接收机。

2. 发明申请

WO2010036612A1 A METHOD AND APPARATUS FOR SECURITY-RISK BASED ADMISSION CONTROL 审中-公开
标题翻译：一种基于安全风险的入侵控制的方法和装置
公开(公告)号：WO2010036612A1
公开(公告)日：2010-04-01
申请号：PCT/US2009/057685
申请日：2009-09-21
申请人： NTT DOCOMO, INC. , KOZAT, Ulas, C. , RADOSAVAC, Svetlana , KEMPF, James
发明人： KOZAT, Ulas, C. , RADOSAVAC, Svetlana , KEMPF, James
IPC分类号： H04L29/06 , H04L29/08
CPC分类号： H04L63/14 , H04L63/102 , H04L67/303 , H04L67/34 , H04L2463/144
摘要： A method and apparatus is disclosed herein for security risk-based admission control. In one embodiment, the method comprises: receiving a request from the user device to access the network; determining whether to admit the user device based on a security-based admission control policy that admits user devices based on a constraint optimization that attempts to maximize the sum utility of the currently admitted user devices in view of a security assessment of the user device and security risk imposed on the network and already admitted user devices if the user device is admitted to the network, wherein the constraint optimization is based on a utility associated with admitting the user device to the network, a reputation value associated with the user device, and a botnet damage estimation on the network associated with the user device; and admitting the user device to the network based on results of determining whether to admit the user device.
摘要翻译：本文公开了一种用于基于安全风险的准入控制的方法和装置。在一个实施例中，该方法包括：从用户设备接收访问网络的请求; 基于基于用户设备的安全性评估，基于基于安全的接纳控制策略来接纳用户设备，该策略基于尝试最大化当前接纳的用户设备的和效用的约束优化如果用户设备被允许进入网络，施加在网络上的已经被接纳的用户设备的风险，其中约束优化基于与将用户设备接纳到网络相关联的实用程序，与用户设备相关联的信誉值，以及与用户设备相关联的网络上的僵尸网络损坏估计; 并且基于确定是否允许用户设备的结果将用户设备接纳到网络。

3. 发明申请

WO2011014647A3 A METHOD FOR WIRELESS NETWORK VIRTUALIZATION THROUGH SEQUENTIAL AUCTIONS AND CONJECTURAL PRICING 审中-公开
标题翻译：一种通过顺序拍卖和对等价格进行无线网络虚拟化的方法
公开(公告)号：WO2011014647A3
公开(公告)日：2011-07-21
申请号：PCT/US2010043699
申请日：2010-07-29
申请人： NTT DOCOMO INC , KOZAT ULAS C , FU FANGWEN
发明人： KOZAT ULAS C , FU FANGWEN
IPC分类号： H04W28/16
CPC分类号： H04W28/16 , G06Q30/08 , G06Q50/30
摘要： A method and apparatus is disclosed herein for wireless network virtualization through sequential auctions and conjectural pricing. In one embodiment, the apparatus comprises a plurality of service providers operable to bid on network resources on behalf of a plurality of individual receivers and a wireless network operator, communicably coupled to the plurality of service providers, to perform resource allocation using an auction to allocate network resources to the plurality of service providers based on instantaneous channel conditions and traffic information of each of the individual receivers and to schedule transmissions in time and space to the individual receivers.
摘要翻译：本文公开了一种通过连续拍卖和推测定价进行无线网络虚拟化的方法和装置。在一个实施例中，该装置包括多个服务提供商，其可操作以代表多个单独的接收者对网络资源进行投标，以及可通信地耦合到多个服务提供商的无线网络运营商，以使用拍卖来分配资源基于瞬时信道条件和每个单独接收机的业务信息向多个服务提供商提供网络资源，并且将时间和空间的传输调度到各个接收机。

4. 发明申请

WO2010151455A1 A METHOD AND APPARATUS FOR SENDING INFORMATION VIA SILENT SYMBOL CODING OVER UNDER-UTILIZED CHANNELS IN WIRELESS SYSTEMS 审中-公开
标题翻译：通过无线系统中未使用通道进行静音符号编码的方法和装置
公开(公告)号：WO2010151455A1
公开(公告)日：2010-12-29
申请号：PCT/US2010/038668
申请日：2010-06-15
申请人： NTT DOCOMO, INC. , KOZAT, Ulas, C.
发明人： KOZAT, Ulas, C.
IPC分类号： H04L5/00
CPC分类号： H04L5/003
摘要： A method and apparatus is disclosed herein for sending information over under-utilized channels in wireless systems. In one embodiment, a method for use in a cellular system in which a channel allocated to a primary user is underutilized at times, comprises: creating a unique 0- 1 valued permutation code to transmit bits of a secondary user on a channel of the primary user; creating one or more codewords based on a first set of symbols to be transmitted for the primary user and the permutation code; and transmitting the one or more codewords on the channel.
摘要翻译：本文公开了一种在无线系统中通过未充分利用的信道发送信息的方法和装置。在一个实施例中，一种在蜂窝系统中使用的方法，其中分配给主用户的信道有时被利用不足，包括：创建唯一的0-1值置换码以在主用户的信道上传送次用户的比特用户; 基于要为主用户发送的第一组符号和排列代码来创建一个或多个码字; 以及在所述信道上发送所述一个或多个码字。

5. 发明申请

WO2008112252A1 A METHOD AND APPARATUS FOR PRIORITIZED INFORMATION DELIVERY WITH NETWORK CODING OVER TIME-VARYING NETWORK TOPOLOGIES 审中-公开
标题翻译：用于通过网络编码优化信息传递的方法和装置，包括时变网络拓扑
公开(公告)号：WO2008112252A1
公开(公告)日：2008-09-18
申请号：PCT/US2008/003274
申请日：2008-03-12
申请人： NTT DOCOMO, INC. , KOZAT, Ulas, C. , PEPIN, Christine , PAPADOPOULOS, Haralabos , RAMPRASHAD, Sean, A. , SUNDBERG, Carl-erik, W.
发明人： KOZAT, Ulas, C. , PEPIN, Christine , PAPADOPOULOS, Haralabos , RAMPRASHAD, Sean, A. , SUNDBERG, Carl-erik, W.
IPC分类号： H04L12/56
CPC分类号： H04W40/12 , H04L12/1881 , H04L41/12 , H04L41/5003 , H04L41/5054 , H04L45/14 , H04L45/16 , H04L45/30 , H04L45/38 , H04L47/10 , H04L47/125 , H04L47/15 , H04L47/24 , H04L47/2408 , H04L47/2441 , H04L47/38 , H04L47/6215
摘要： A method and apparatus is disclosed herein for information delivery with network coding over time- varying network topologies. In one embodiment, the method comprises decomposing a sequence of topology graphs that model a time- varying network topology into a plurality of virtual graphs, where each virtual graph of the plurality of virtual graphs corresponds to a distinct traffic class, and the virtual topology graph representing a partial topology of a time- varying network. The method also includes selecting a network code for each virtual graph in the plurality of the virtual graphs to meet requirements of the distinct traffic class corresponding to said each topology graph, where the network code is used to encode packets of the associated traffic class, and processing packets of each traffic class using the network code determined by its corresponding virtual topology and the requirements of said each traffic class, including using a virtual buffer system to implement the network code corresponding to each traffic class over the physical network topology. The method also includes using a scheduler to determine the transmission schedules for each output packet from the virtual buffer system of each traffic class where the scheduling decisions are based, at least in part, on the QoS requirements of each class.
摘要翻译：本文公开了一种用于通过随时间变化的网络拓扑进行网络编码的信息传递的方法和装置。在一个实施例中，该方法包括分解将时变网络拓扑建模成多个虚拟图的拓扑图序列，其中多个虚拟图中的每个虚拟图对应于不同的流量类别，虚拟拓扑图代表时变网络的部分拓扑。该方法还包括为多个虚拟图中的每个虚拟图选择网络代码以满足对应于所述每个拓扑图的不同流量类别的要求，其中网络代码用于对相关联的流量类别的分组进行编码;以及使用由其对应的虚拟拓扑确定的网络代码和所述每个流量类别的要求来处理每个流量类别的分组，包括使用虚拟缓冲器系统来实现通过物理网络拓扑对应于每个流量类别的网络代码。该方法还包括使用调度器至少部分地基于每个类的QoS要求来确定来自调度决策所基于的每个业务类别的虚拟缓冲器系统的每个输出分组的传输调度。

6. 发明申请

WO2011031459A2 A METHOD AND APPARATUS FOR DATA CENTER AUTOMATION 审中-公开
标题翻译：一种用于数据中心自动化的方法和装置
公开(公告)号：WO2011031459A2
公开(公告)日：2011-03-17
申请号：PCT/US2010/046533
申请日：2010-08-24
申请人： NTT DOCOMO, INC. , KOZAT, Ulas, C. , URGAONKAR, Rahul
发明人： KOZAT, Ulas, C. , URGAONKAR, Rahul
IPC分类号： G06F9/50
CPC分类号： G06F9/505 , G06F9/5055 , G06F9/5077 , Y02D10/22 , Y02D10/36
摘要： A method and apparatus is disclosed herein for data center automation. In one embodiment, a virtualized data center architecture comprises: a buffer to receive a plurality of requests from a plurality of applications; a plurality of physical servers, wherein each server of the plurality of servers having one or more server resources allocable to one or more virtual machines on said each server, wherein each virtual machine handles requests for a different one of a plurality of applications, and local resource managers each running on said each server to generate resource allocation decisions to allocate the one or more resources to the one or more virtual machines running on said each server; a router communicably coupled to the plurality of servers to control routing of each of the plurality of requests to an individual server in the plurality of servers; an admission controller to determine whether to admit the plurality of requests into the buffer, and a central resource manager to determine which server of the plurality of servers are active, wherein decisions of the central resource manager depends on backlog information per application at each of the plurality of servers and the router.
摘要翻译：本文公开了用于数据中心自动化的方法和装置。在一个实施例中，虚拟化数据中心架构包括：缓冲器，用于从多个应用接收多个请求; 多个物理服务器，其中所述多个服务器中的每个服务器具有可分配给所述每个服务器上的一个或多个虚拟机的一个或多个服务器资源，其中每个虚拟机处理对多个应用中的不同应用的请求，以及本地每个在每个服务器上运行的资源管理器以产生资源分配决定，以将一个或多个资源分配给在所述每个服务器上运行的一个或多个虚拟机; 路由器，可通信地耦合到所述多个服务器，以控制所述多个请求中的每一个到所述多个服务器中的各个服务器的路由; 准入控制器，用于确定是否将所述多个请求准入所述缓冲器;以及中央资源管理器，用于确定所述多个服务器中的哪个服务器是活动的，其中所述中央资源管理器的决定取决于每个应用的每个应用的积压信息多台服务器和路由器。

7. 发明申请

WO2008066815A3 A METHOD AND APPARATUS FOR RELIABLE MULTICASTING IN WIRELESS RELAY NETWORKS 审中-公开
标题翻译：无线中继网络中可靠多播的方法和装置
公开(公告)号：WO2008066815A3
公开(公告)日：2008-07-24
申请号：PCT/US2007024455
申请日：2007-11-27
申请人： NTT DOCOMO INC , KOZAT ULAS C , GUVENC ISMAIL
发明人： KOZAT ULAS C , GUVENC ISMAIL
IPC分类号： H04L1/16
CPC分类号： H04L1/1685 , H04L1/1887 , H04L2001/0093
摘要： A method and apparatus is disclosed herein for performing multi casting. In one embodiment, the method comprises receiving routing, association, relaying, and/or topology information associated with a plurality of nodes in a multi-hop wireless network, the plurality of nodes communicably coupled in a tree or mesh arrangement via a plurality of broadcast channels; and determining a subset of the plurality of nodes over each broadcast channel on the multi-hop wireless network that is responsible for sending acknowledgment information, in response to receipt or lack of receipt of transmissions, back to senders of transmissions.
摘要翻译：本文公开了用于执行多投射的方法和装置。在一个实施例中，该方法包括接收与多跳无线网络中的多个节点相关联的路由，关联，中继和/或拓扑信息，所述多个节点经由多个广播渠道; 以及响应于接收到或不接收到传输，确定负责发送确认信息的多跳无线网络上的每个广播信道上的多个节点的子集，回到传输的发送者。

8. 发明申请

WO2008048651A3 NETWORK CODING IN TIME-VARYING NETWORK TOPOLOGIES 审中-公开
公开(公告)号：WO2008048651A3
公开(公告)日：2008-04-24
申请号：PCT/US2007/022189
申请日：2007-10-17
申请人： NTT DOCOMO, INC. , KOZAT, Ulas, C. , PAPADOPOULOS, Haralabos , PEPIN, Christine , RAMPRASHAD, Sean, A. , SUNDBERG, Carl-Erik, W.
发明人： KOZAT, Ulas, C. , PAPADOPOULOS, Haralabos , PEPIN, Christine , RAMPRASHAD, Sean, A. , SUNDBERG, Carl-Erik, W.
IPC分类号： H04L12/56 , H04L12/24
摘要： A method and apparatus is disclosed herein for delivering information over time- varying networks. In one embodiment, the method comprises, for each of a plurality of time intervals, determining a virtual network topology for use over each time interval; selecting for the time interval based on the virtual network topology, a fixed network code for use during the time interval; and coding information to be transmitted over the time-varying network topology using the fixed network code with necessary virtual buffering at each node.

9. 发明申请

WO2011031459A3 A METHOD AND APPARATUS FOR DATA CENTER AUTOMATION 审中-公开
标题翻译：一种用于数据中心自动化的方法和装置
公开(公告)号：WO2011031459A3
公开(公告)日：2011-09-29
申请号：PCT/US2010046533
申请日：2010-08-24
申请人： NTT DOCOMO INC , KOZAT ULAS C , URGAONKAR RAHUL
发明人： KOZAT ULAS C , URGAONKAR RAHUL
IPC分类号： G06F9/50
CPC分类号： G06F9/505 , G06F9/5055 , G06F9/5077 , Y02D10/22 , Y02D10/36
摘要： A method and apparatus is disclosed herein for data center automation. In one embodiment, a virtualized data center architecture comprises: a buffer (102) to receive a plurality of requests from a plurality of applications; a plurality of physical servers (104), wherein each server of the plurality of servers having one or more server resources (212) allocable to one or more virtual machines (221) on said each server, wherein each virtual machine handles requests for a different one of a plurality of applications, and local resource managers (210) each running on said each server to generate resource allocation decisions to allocate the one or more resources to the one or more virtual machines running on said each server; a router (105) communicably coupled to the plurality of servers to control routing of each of the plurality of requests to an individual server in the plurality of servers; an admission controller (101) to determine whether to admit the plurality of requests into the buffer (102), and a central resource manager (201) to determine which server of the plurality of servers are active, wherein decisions of the central resource manager depends on backlog information per application at each of the plurality of servers and the router.
摘要翻译：本文公开了用于数据中心自动化的方法和装置。在一个实施例中，虚拟化数据中心架构包括：缓冲器（102），用于从多个应用接收多个请求; 多个物理服务器（104），其中所述多个服务器中的每个服务器具有可分配给所述每个服务器上的一个或多个虚拟机（221）的一个或多个服务器资源（212），其中每个虚拟机处理对不同多个应用程序中的一个和每个在每个服务器上运行的本地资源管理器（210），以产生资源分配决定，以将一个或多个资源分配给在所述每个服务器上运行的一个或多个虚拟机; 路由器（105），可通信地耦合到所述多个服务器以控制所述多个请求中的每一个到所述多个服务器中的各个服务器的路由; 确定是否允许多个请求进入缓冲器（102）的准入控制器（101）和用于确定多个服务器中的哪个服务器是活动的中央资源管理器（201），其中中央资源管理器的决定取决于针对多个服务器和路由器中的每一个的每个应用的积压信息。

10. 发明申请

WO2010025093A1 A METHOD AND APPARATUS FOR RELIABLE MEDIA TRANSPORT 审中-公开
标题翻译：一种可靠的媒体传输方法与装置
公开(公告)号：WO2010025093A1
公开(公告)日：2010-03-04
申请号：PCT/US2009/054660
申请日：2009-08-21
申请人： NTT DOCOMO, INC. , SEFEROGLU, Hulya , KOZAT, Ulas, C. , CIVANLAR, M., Reha , KEMPF, James
发明人： SEFEROGLU, Hulya , KOZAT, Ulas, C. , CIVANLAR, M., Reha , KEMPF, James
IPC分类号： H04L1/00
CPC分类号： H04L1/0009 , H04L43/0858 , H04L43/0864
摘要： Methods and apparatuses to model the relation between the delay samples and congestion losses and to protect media flows against congestion losses are disclosed. In one embodiment, the method comprises measuring congestion by delay samples, and performing a dynamic FEC algorithm that uses convex hull clustering for loss-event classification, including determining an FEC rate according to the loss-event classification. In another embodiment, the method comprises measuring congestion by delay samples, modeling loss events associated with the delay samples by grouping loss events as unions of convex hulls to identify a period of potentially increased congestion, dynamically changing the FEC rate based on the modeling, and applying FEC protection to the media flow during the period based on the FEC rate. In yet another embodiment, the method comprises forming clusters using past loss events and their { FTT, FṪT } or { RTT, RṪT } estimates, and estimating future loss events using most recent { FTT, FṪT } or { RTT, RṪT } estimates and their membership in convex hull clusters.
摘要翻译：公开了对延迟样本和拥塞损失之间的关系进行建模并保护媒体流免遭拥塞损失的方法和装置。在一个实施例中，该方法包括通过延迟样本来测量拥塞，以及执行使用用于丢失事件分类的凸包聚类的动态FEC算法，包括根据丢失事件分类来确定FEC速率。在另一个实施例中，该方法包括通过延迟采样来测量拥塞，通过将损失事件分组为凸包的联合来建模与延迟样本相关联的损失事件，以识别潜在增加的拥塞的周期，基于建模来动态地改变FEC速率，以及基于FEC速率在该周期期间对媒体流应用FEC保护。在另一个实施例中，该方法包括使用过去的损失事件及其{FTT，F？T}或{RTT，R？T}估计来形成集群，并且使用最近的{FTT，F？T}或{ RTT，R？T}估计及其在凸包集群中的隶属度。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式