-
31.发明申请Characterizing the capacity region in multi-channel, multi-radio mesh networks 有权表征多通道，多无线网状网络中的容量区域公开(公告)号：US20070147248A1
公开(公告)日：2007-06-28
申请号：US11316071
申请日：2005-12-22
IPC分类号： H04J1/16
CPC分类号： H04L41/145
摘要： A method of characterizing a capacity region in a multi-channel, multi-radio mesh network of nodes interconnected by links. The method includes: (a) modeling the network by determining one or more link-flow feasibility constraints; (b) obtaining a feasible upper-capacity bound by solving an optimization problem using the one or more link-flow feasibility constraints as necessary conditions; and (c) using an algorithm adapted to provide a feasible lower-capacity bound by (i) receiving the solution to the optimization problem as input, (ii) allocating channels to links to meet a demand vector that satisfies the one or more link-flow feasibility constraints, and (iii) scheduling flows along the allocated channels. The upper- and lower-capacity bounds define the capacity region.
摘要翻译： 一种表征通过链路互连的节点的多信道，多无线网状网络中的容量区域的方法。 该方法包括：（a）通过确定一个或多个链路可行性约束对网络进行建模; （b）使用一个或多个链路可行性约束作为必要条件来求解优化问题来获得可行的上限容限; （c）使用适于通过（i）接收所述优化问题的解决方案作为输入来提供可行的较低容量限制的算法，（ii）将信道分配给链路以满足满足所述一个或多个链路 - 流动可行性约束，以及（iii）沿着分配的信道调度流。 上限和下限容限界限定义容量区。
-
32.发明申请Characterizing achievable flow rates in multi-hop mesh networks with orthogonal channels 有权表征具有正交信道的多跳网状网络中可实现的流量公开(公告)号：US20070025364A1
公开(公告)日：2007-02-01
申请号：US11194748
申请日：2005-08-01
IPC分类号： H04L12/56
摘要： A method of routing data from a source node to a destination node in a multi-hop network of nodes interconnected by links comprises: (a) determining that a link-flow vector satisfies one or more necessary scheduling conditions for achievability, wherein the link-flow vector represents a set of flows to be routed on one or more links from the source node to the destination node; (b) generating a scheduling multi-graph for the network, wherein the scheduling multi-graph comprises a graph having at least one pair of nodes with multiple edges therebetween; (c) deriving one or more sufficient scheduling conditions for achievability of the link-flow vector by edge-coloring the scheduling multi-graph; (d) solving a linear optimization problem over the one or more necessary scheduling conditions to obtain an upper bound on the achievability of the link-flow vector; (e) generating, based on the scheduling multi-graph, a solution comprising a set of routes and an associated schedule for achieving the link-flow vector, the solution being a lower bound on the achievability of the link-flow vector; and (f) implementing a routing method using the set of routes and the associated schedule to route the link-flow vector from the source node to the destination node. At least one node v of the network is adapted to receive transmissions from a specified plurality Ω(v) of other nodes, and at least one of the scheduling conditions depends on Ω(v).
摘要翻译： 将数据从源节点路由到通过链路互连的节点的多跳网络中的目的地节点的方法包括：（a）确定链路流向量满足用于可实现性的一个或多个必要的调度条件，其中， 流向量表示要在从源节点到目的地节点的一个或多个链路上路由的一组流; （b）生成所述网络的调度多图，其中所述调度多图包括具有至少一对节点之间的多个边缘的图; （c）通过边缘着色调度多图来导出一个或多个足够的调度条件以实现链路流向量的可实现性; （d）在一个或多个必要的调度条件下求解线性优化问题，以获得链路流向量的可实现性的上限; （e）基于所述调度多图生成包括一组路线和用于实现所述链路流向量的相关调度的解的解，所述解是所述链路流向量的可实现性的下限; 以及（f）使用所述一组路由和相关联的调度来实现路由方法，以将所述链路流向量从所述源节点路由到所述目的地节点。 网络的至少一个节点v适于接收来自其他节点的指定多个Ω（v）的传输，并且至少一个调度条件取决于Ω（v）。
-
公开(公告)号：US20060092975A1
公开(公告)日：2006-05-04
申请号：US11147665
申请日：2005-06-08
CPC分类号： H04L45/00 , H04L2012/5627
摘要： The SoftRouter architecture separates the implementation of control plane functions from packet forwarding functions. In this architecture, all control plane functions are implemented on general purpose servers called the control elements (CEs) that may be multiple hops away from the forwarding elements (FEs). A network element (NE) or a router is formed using dynamic binding between the CEs and the FEs. There is a protocol failover mechanism for handling failovers initiated by FEs to transfer control from one CE to another CE.
-
公开(公告)号：US20060092974A1
公开(公告)日：2006-05-04
申请号：US11147642
申请日：2005-06-08
申请人： Tirunell Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Krishan Sabnani , Thomas Woo
发明人： Tirunell Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Krishan Sabnani , Thomas Woo
IPC分类号： H04L12/28
摘要： The SoftRouter architecture separates the implementation of control plane functions from packet forwarding functions. In this architecture, all control plane functions are implemented on general purpose servers called the control elements (CEs) that may be multiple hops away from the forwarding elements (FEs). A network element (NE) or a router is formed using dynamic binding between the CEs and the FEs. The flexibility of the SoftRouter architecture over conventional routers with collocated and tightly integrated control and forwarding functions results in increased reliability, increased scalability, increased security, ease of adding new functionality, and decreased cost.
摘要翻译： SoftRouter架构将控制平面功能的实现与数据包转发功能分开。 在这种架构中，所有控制平面功能都在通用服务器上实现，称为可能与转发元件（FE）之间多跳的控制元件（CE）。 使用CE和FE之间的动态绑定形成网元（NE）或路由器。 SoftRouter架构与具有并置且紧密集成的控制和转发功能的传统路由器的灵活性相结合，可提高可靠性，增加可扩展性，增加安全性，增加新功能以及降低成本。
-
公开(公告)号：US09480045B2
公开(公告)日：2016-10-25
申请号：US13272842
申请日：2011-10-13
CPC分类号： H04W68/02
摘要： At least one example embodiment discloses a paging message controller. The paging message controller includes a processor and an associated memory. The processor is configured to obtain an indication of a paging message for a user equipment (UE), the indication indicating that a paging message is to be forwarded to at least one destination cell of a first set of cells for paging the UE, and forward the paging message for paging the UE to at least one destination cell of a second set of cells in response to the indication.
摘要翻译： 至少一个示例性实施例公开了寻呼消息控制器。 寻呼消息控制器包括处理器和相关联的存储器。 处理器被配置为获得用于用户设备（UE）的寻呼消息的指示，该指示指示寻呼消息将被转发到用于寻呼UE的第一组小区的至少一个目的地小区，并且向前 所述寻呼消息用于响应于所述指示将所述UE寻呼到所述第二组小区的至少一个目的地小区。
-
36.发明授权公开(公告)号：US09444840B2
公开(公告)日：2016-09-13
申请号：US13418463
申请日：2012-03-13
IPC分类号： H04L29/06
CPC分类号： H04L63/20 , H04L63/0218
摘要： Various embodiments provide a method and apparatus of providing a distributed security service that runs light instances in a number of security devices and central instances of the security services in select security devices. A received or transmitted client content segment is directed to a light instance which either applies a security policy corresponding to the client content segment if the client content segment has been previously analyzed and has a valid security policy, or else, the light instance sends the client content segment to a central instance to be analyzed. The central instance may then provide a complete security analysis on the client content segment, determine a security policy corresponding to the client content segment and push the determined security policy to one or more of the light instances. Advantageously, a distributed security service delivery may provide highly secure, network efficient and cost effective security service delivery.
摘要翻译： 各种实施例提供了一种提供分布式安全服务的方法和装置，该分布式安全服务在选定的安全设备中的多个安全设备和安全服务的中心实例中运行轻实例。 接收或发送的客户端内容片段被引导到轻实例，其应用与客户端内容片段相对应的安全策略，如果客户端内容片段已经被分析并且具有有效的安全策略，否则，轻实例发送客户端 内容分段到要分析的中央实例。 中央实例然后可以在客户端内容段上提供完整的安全性分析，确定与客户端内容段对应的安全策略，并将确定的安全策略推送到一个或多个光实例。 有利地，分布式安全服务传送可以提供高度安全的，网络有效的和成本有效的安全服务传递。
-
公开(公告)号：US08542602B2
公开(公告)日：2013-09-24
申请号：US12317807
申请日：2008-12-30
IPC分类号： H04J1/16
CPC分类号： H04L47/10 , H04L47/20 , H04L47/50 , H04L47/60 , H04L47/621 , H04L49/901
摘要： An enmeshed hierarchy of policers, different from traditional tree-based hierarchical system of policers is used in accordance with the present invention. A goal of using an enmeshed architecture of policing systems is to allow for a more complex set of policies to be defined across a network. Hierarchical/cascading systems ensure that the higher granularity assignments essentially dictate/constrain the behavior of finer grained assignments at higher levels for sub-flows. There is only one type of metric possible for the largest granular policer, so the only way to implement multiple system-wide metrics is to repeat the hierarchy multiple times over, which adds to the delay of the packet and the complexity of the router. In accordance with the enmeshed architecture of the present invention, multiple system-wide metrics can be implemented simultaneously, which allows for easier management of the various macro-level policies by the manager of an access network.
摘要翻译： 根据本发明使用与传统的基于树的分层系统不同的策略层级的层次结构。 使用网络管理系统架构的目标是允许在整个网络中定义更复杂的策略集。 分级/级联系统确保较高的粒度分配基本上决定/限制较高级别的子流程中更细粒度分配的行为。 对于最大的粒度监控器只能有一种类型的度量，因此实现多个系统级度量的唯一方法是多次重复层次结构，这增加了数据包的延迟和路由器的复杂性。 根据本发明的嵌套体系结构，可以同时实现多个系统范围的度量，这允许由接入网络的管理者更容易地管理各种宏观级策略。
-
公开(公告)号：US20130185530A1
公开(公告)日：2013-07-18
申请号：US13348847
申请日：2012-01-12
CPC分类号： G06F12/0868 , G06F3/0608 , G06F3/0631 , G06F3/0653 , G06F11/1456 , G06F12/02 , G06F17/302 , G06F2201/84
摘要： Various embodiments provide a method and apparatus of providing a frugal cloud file system that efficiently uses the blocks of different types of storage devices with different properties for different purposes. The efficient use of the different types of available storage devices reduces the storage and bandwidth overhead. Advantageously, the reduction in storage and bandwidth overhead achieved using the frugal cloud file system reduces the economic costs of running the file system while maintaining high performance.
摘要翻译： 各种实施例提供了提供节俭云文件系统的方法和装置，其有效地使用具有不同属性的不同类型的存储设备的块用于不同的目的。 有效利用不同类型的可用存储设备减少了存储和带宽开销。 有利地，使用节俭云文件系统实现的存储和带宽开销的减少降低了在保持高性能的同时运行文件系统的经济成本。
-
39.发明授权Method and apparatus for managing an IP address space of an address server in a mobility network 有权用于管理移动网络中的地址服务器的IP地址空间的方法和装置公开(公告)号：US08488571B2
公开(公告)日：2013-07-16
申请号：US11946396
申请日：2007-11-28
CPC分类号： H04L29/12311 , H04L61/2084 , H04L67/303 , H04L69/28 , H04W8/26
摘要： The invention manages an IP address space in a mobility network, including partitioning of the IP address space, assignment of IP addresses from the IP address space, and/or use of hysteresis to control reassignment of IP addresses from the IP address space. The IP address assignment is performed using one or more residual time statistics from a residual time profile maintained for the mobile node requesting assignment of an IP address. A residual time profile of a mobile node includes one or more residual time statistics associated with the mobile node. The residual time statistics for a mobile node are determined using a residual time associated with each IP address assigned to the mobile node. The IP address space partitioning is performed using residual time statistics maintained for mobile nodes of the network. The reassignment of IP addresses from the IP address space is controlled using hysteresis.
摘要翻译： 本发明管理移动网络中的IP地址空间，包括分配IP地址空间，从IP地址空间分配IP地址和/或使用滞后来控制IP地址从IP地址空间的重新分配。 IP地址分配是使用一个或多个剩余时间统计来执行的，该剩余时间统计信息是为移动节点维护的，用于请求分配IP地址的剩余时间分布。 移动节点的剩余时间简档包括与移动节点相关联的一个或多个剩余时间统计。 使用与分配给移动节点的每个IP地址相关联的剩余时间来确定移动节点的剩余时间统计。 使用为网络的移动节点维护的剩余时间统计来执行IP地址空间划分。 从IP地址空间重新分配IP地址是通过滞后来控制的。
-
公开(公告)号：US20130174172A1
公开(公告)日：2013-07-04
申请号：US13338636
申请日：2011-12-28
CPC分类号： H04L67/1097 , G06F9/4881 , G06F2209/485 , H04L67/325
摘要： An exemplary data transfer manager includes a datacenter configured to communicate over at least one link and a scheduler that is configured to schedule a plurality of jobs for communicating data from the datacenter. The scheduler determines a minimum bandwidth requirement of each job and determines a maximum bandwidth limit of each job. The scheduler determines a flex parameter of each job. The flex parameter indicates how much a data transfer rate can vary between adjacent data transfer periods for the job.
摘要翻译： 示例性数据传输管理器包括被配置为通过至少一个链路进行通信的数据中心和被配置为调度用于从数据中心传送数据的多个作业的调度器。 调度程序确定每个作业的最小带宽需求，并确定每个作业的最大带宽限制。 调度程序确定每个作业的flex参数。 flex参数指示在作业的相邻数据传输周期之间数据传输速率可以变化多少。
-
-
-
-
-
-
-
-
-
搜索结果
65 条记录 (耗时 0.02 秒)
