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

1. 发明申请

US20050015511A1 Accelerated large data distribution in overlay networks 审中-公开
标题翻译：加速覆盖网络中的大数据分布
公开(公告)号：US20050015511A1
公开(公告)日：2005-01-20
申请号：US10749947
申请日：2003-12-31
申请人： Rauf Izmailov , Samrat Ganguly , Nan Tu , Aikaterini Varsou
发明人： Rauf Izmailov , Samrat Ganguly , Nan Tu , Aikaterini Varsou
IPC分类号： G06F15/173 , H04L12/18 , H04L12/56 , H04L29/06 , H04L29/08
CPC分类号： H04L67/06 , H04L12/18 , H04L45/04 , H04L45/12 , H04L45/16 , H04L45/48 , H04L69/14 , Y02D50/30
摘要： A Method and apparatus for dynamically discovering and utilizing unused resources for practical and efficient creation of optimized network mechanisms for data distribution. Proposed techniques for data distribution, assembly, routing and scheduling in broadband networks can be implemented as content-level server platform architecture enabled by application-level control plane. Such a platform accelerates content transfer, mirroring and replication. It applies coordinated data partitioning and resource discovery and sharing of information replication by multiple network systems. Furthermore, it harvests the unutilized bandwidth in the network by disassembling the large content to be distributed into different components. These components are then routed in spatially and temporally diverse routes through multiple paths and trees and assembled at the destination nodes. The result is accelerated content distribution, added security, scalability and robustness. No modifications of existing network communication protocols is required.
摘要翻译：一种用于动态发现和利用未使用资源的方法和装置，用于实际和有效地创建用于数据分发的优化网络机制。用于宽带网络中数据分发，组装，路由和调度的建议技术可以实现为由应用层控制平面启用的内容级服务器平台架构。这样的平台加速了内容传输，镜像和复制。它适用于多个网络系统的协同数据分区和信息复制的资源发现和共享。此外，它通过拆卸要分配到不同组件的大内容来收获网络中未使用的带宽。然后，这些组件通过多个路径和树在空间和时间上不同的路由路由，并在目的地节点处组装。结果是加速了内容分发，增加了安全性，可扩展性和鲁棒性。不需要修改现有的网络通信协议。

2. 发明申请

US20140355454A1 Communication Node Operable to Estimate Faults in an Ad Hoc Network and Method of Performing the Same 有权
标题翻译：可用于估计Ad Hoc网络中的故障的通信节点及其执行方法
公开(公告)号：US20140355454A1
公开(公告)日：2014-12-04
申请号：US13602796
申请日：2012-09-04
申请人： Constantin Serban , Akshay Vashist , Rauf Izmailov , Ritu Chadha , Kyriakos Manousakis , Cho-Yu Jason Chiang
发明人： Constantin Serban , Akshay Vashist , Rauf Izmailov , Ritu Chadha , Kyriakos Manousakis , Cho-Yu Jason Chiang
IPC分类号： H04L12/24 , H04W24/10 , H04W24/08
CPC分类号： H04W24/10 , H04L41/0631 , H04L41/142 , H04L41/16 , H04W24/04 , H04W24/08 , H04W84/18
摘要： A communication node operable to estimate faults in a mobile ad hoc network and method of performing the same. In one embodiment, the communication node includes a processor and memory including computer program code configured to, with the processor, cause the communication node to monitor a set of observable parameters at the communication node, produce a fault estimate at the communication node from the set of observable parameters, and provide the fault estimate to a global fault detector at another communication node.
摘要翻译：一种用于估计移动自组织网络中的故障的通信节点及其执行方法。在一个实施例中，通信节点包括处理器和存储器，其包括计算机程序代码，该计算机程序代码被配置为与处理器一起使得通信节点监视通信节点处的一组可观察参数，从该集合在通信节点处产生故障估计的可观察参数，并向另一个通信节点的全局故障检测器提供故障估计。

3. 发明申请

US20070198629A1 Scalable Content Based Event Multicast Platform 审中-公开
标题翻译：基于可扩展内容的事件多播平台
公开(公告)号：US20070198629A1
公开(公告)日：2007-08-23
申请号：US11276253
申请日：2006-02-21
申请人： Samrat Ganguly , Sudeept Bhatnagar , Akhilesh Saxena , Rauf Izmailov , Yasuhiro Miyao
发明人： Samrat Ganguly , Sudeept Bhatnagar , Akhilesh Saxena , Rauf Izmailov , Yasuhiro Miyao
IPC分类号： G06F15/16
CPC分类号： H04L12/66
摘要： In an infrastructure solution for content-based forwarding, filter pipelining enables handling of the high-rate message streams. Documents are distributed in the network by forwarding from publisher proxy servers to attribute trees associated with particular attributes in the message. The trees filter the messages based on attribute values, and deliver the messages to subscriber proxy servers for predicate-based distribution to subscribers. To maximize throughput, the attribute trees utilize the concept of weak filtering, wherein a message may be delivered to a node in the attribute tree that is associated with a range of attribute values that does not include the attribute value of the message.
摘要翻译：在基于内容转发的基础架构解决方案中，过滤器流水线可以处理高速率消息流。文档通过从发布者代理服务器转发到与消息中的特定属性相关联的属性树在网络中分发。这些树根据属性值过滤消息，并将消息传递给用户代理服务器以进行基于谓词的分发给用户。为了最大化吞吐量，属性树利用弱过滤的概念，其中消息可以被递送到与不包括消息的属性值的属性值的范围相关联的属性树中的节点。

4. 发明申请

US20070143442A1 Scalable Publish/Subscribe Broker Network Using Active Load Balancing 审中-公开
标题翻译：可扩展的发布/订阅代理网络使用主动负载平衡
公开(公告)号：US20070143442A1
公开(公告)日：2007-06-21
申请号：US11613227
申请日：2006-12-20
申请人： Hui Zhang , Samrat Ganguly , Sudeept Bhatnagar , Rauf Izmailov
发明人： Hui Zhang , Samrat Ganguly , Sudeept Bhatnagar , Rauf Izmailov
IPC分类号： G06F15/16
CPC分类号： G06Q10/107 , H04L67/1002 , H04L67/1008 , H04L67/1019 , H04L67/1023
摘要： A scalable broker publish/subscribe broker network using a suite of active load balancing schemes is disclosed. In a Distributed Hashing Table (DHT) network, a workload management mechanism, consisting of two load balancing schemes on events and subscriptions respectively and one load-balancing scheduling scheme, is implemented over an aggregation tree rooted on a data sink when the data has a uniform distribution over all nodes in the network. An active load balancing method and one of two alternative DHT node joining/leaving schemes are employed to achieve the uniform traffic distribution for any potential aggregation tree and any potential input traffic distribution in the network.
摘要翻译：公开了使用一套主动负载平衡方案的可扩展代理发布/订阅代理网络。在分布式哈希表（DHT）网络中，通过基于事件和订阅的两个负载平衡方案和一个负载平衡调度方案组成的工作负载管理机制，在数据有一个均匀分布在网络中的所有节点上。采用主动负载平衡方法和两种备选DHT节点加入/离开方案之一，以实现任何潜在的聚合树和网络中任何潜在的输入流量分布的统一业务分布。

5. 发明申请

US20080243731A1 GENERALIZED SEQUENTIAL MINIMAL OPTIMIZATION FOR SVM+ COMPUTATIONS 有权
标题翻译：用于SVM +计算的通用序列最小化优化
公开(公告)号：US20080243731A1
公开(公告)日：2008-10-02
申请号：US12046061
申请日：2008-03-11
申请人： RAUF IZMAILOV , AKSHAY VASHIST , VLADIMIR VAPNIK
发明人： RAUF IZMAILOV , AKSHAY VASHIST , VLADIMIR VAPNIK
IPC分类号： G06F15/18
CPC分类号： G06K9/6269
摘要： A system and method for support vector machine plus (SVM+) computations include selecting a set of indexes for a target function to create a quadratic function depending on a number of variables, and reducing the number of variables to two in the quadratic function using linear constraints. An extreme point is computed for the quadratic function in closed form. A two-dimensional set is defined where the indexes determine whether a data point is in the two-dimensional set or not. A determination is made of whether the extreme point belongs to the two-dimensional set. If the extreme point belongs to the two-dimensional set, the extreme point defines a maximum and defines a new set of parameters for a next iteration. Otherwise, the quadratic function is restricted on at least one boundary of the two-dimensional set to create a one-dimensional quadratic function. The steps are repeated until the maximum is determined.
摘要翻译：用于支持向量机加（SVM +）计算的系统和方法包括：根据变量数量选择一组目标函数的索引以创建二次函数，并使用线性约束将二次函数中的变量数目减少为两个。以封闭形式计算二次函数的极值点。定义二维集，其中索引确定数据点是否在二维集中。确定极值点是否属于二维集。如果极值属于二维集，则极值点定义最大值，并为下一次迭代定义一组新参数。否则，二次函数被限制在二维集合的至少一个边界上以产生一维二次函数。重复这些步骤直到确定最大值。

6. 发明授权

US07403482B2 Path provisioning for service level agreements in differentiated service networks 失效
标题翻译：差异化服务网络中服务级别协议的路径配置
公开(公告)号：US07403482B2
公开(公告)日：2008-07-22
申请号：US09897495
申请日：2001-07-03
申请人： Rauf Izmailov , Subir Biswas , Samrat Ganguly
发明人： Rauf Izmailov , Subir Biswas , Samrat Ganguly
IPC分类号： H04J3/16 , H04L12/56
CPC分类号： H04L45/00 , H04L41/12 , H04L41/5003 , H04L41/5019 , H04L45/124
摘要： A system and method for path provisioning in a network calculates an optimal path using a greedy algorithm with backtracking to execute service level agreements (SLAs). More specifically, a sequential path shifting (SPS) algorithm compares a cost of a suboptimal path for a present quadruplet with the cost of switching a path for a previous quadruplet configured for alteration. If the present path is already an optimal path, then no further operations are performed. However, if the cost of a suboptimal path is greater than the switching cost, the previous path is altered so that an optimal path may be configured for the present quadruplet. Otherwise, the present quadruplet maintains its existing path. The capacity of the network is iteratively adjusted to compensate for path selection. The present system may be applied to a differentiated services network or an optical network.
摘要翻译：用于网络中的路径配置的系统和方法使用具有回溯的贪心算法来计算最佳路径以执行服务水平协议（SLA）。更具体地，顺序路径移动（SPS）算法将当前四元组的次优路径的成本与为配置为改变的先前四元组的路径切换的成本进行比较。如果当前路径已经是最佳路径，则不再进行其他操作。然而，如果次优路径的成本大于切换成本，则改变先前的路径，使得可以为本发明的四元组配置最佳路径。否则，现在的四核维护其现有的路径。迭代地调整网络的容量以补偿路径选择。本系统可以应用于差分服务网络或光网络。

7. 发明申请

US20070201440A1 IMPROVED VOIC-OVER-INTERNET-PROTOCOL METHOD 审中-公开
标题翻译：改进的VOIC-OVER-INTERNET-PROTOCOL方法
公开(公告)号：US20070201440A1
公开(公告)日：2007-08-30
申请号：US11307948
申请日：2006-02-28
申请人： SAMRAT GANGULY , DRAGOS NICULESCU , KYUNG TAE KIM , RAUF IZMAILOV
发明人： SAMRAT GANGULY , DRAGOS NICULESCU , KYUNG TAE KIM , RAUF IZMAILOV
IPC分类号： H04L12/66
CPC分类号： H04L12/6418 , H04L29/06027 , H04L45/00 , H04L47/2408 , H04L65/1069 , H04L65/80 , H04W28/06 , H04W80/04
摘要： A method of transporting Voice-Over-Internet-Protocol Packets in a wireless mesh network wherein VoIP packets from independent call flows are aggregated prior to transmission over multiple hops of the wireless network. Significant performance improvements are realized including the number of simultaneous VoIP calls supported and overall Quality-of-Service (QoS) for the individual calls.
摘要翻译：一种在无线网状网络中传送因特网协议分组的方法，其中来自独立呼叫流的VoIP分组在无线网络的多跳之前传输之前被聚合。实现显着的性能改进，包括支持的同时VoIP呼叫的数量和各个呼叫的总体服务质量（QoS）。

8. 发明申请

US20070162462A1 Wide Area Networked File System 有权
标题翻译：广域网文件系统
公开(公告)号：US20070162462A1
公开(公告)日：2007-07-12
申请号：US11616925
申请日：2006-12-28
申请人： Hui Zhang , Aniruddha Bohra , Samrat Ganguly , Rauf Izmailov , Jian Liang
发明人： Hui Zhang , Aniruddha Bohra , Samrat Ganguly , Rauf Izmailov , Jian Liang
IPC分类号： G06F17/30
CPC分类号： G06F17/30067
摘要： Traditional networked file systems like NFS do not extend to wide-area due to network latency and dynamics introduced in the WAN environment. To address that problem, a wide-area networked file system is based on a traditional networked file system (NFS/CIFS) and extends to the WAN environment by introducing a file redirector infrastructure residing between the central file server and clients. The file redirector infrastructure is invisible to both the central server and clients so that the change to NFS is minimal. That minimizes the interruption to the existing file service when deploying WireFS on top of NFS. The system includes an architecture for an enterprise-wide read/write wide area network file system, protocols and data structures for metadata and data management in this system, algorithms for history based prefetching for access latency minimization in metadata operations, and a distributed randomized algorithm for the implementation of global LRU cache replacement scheme.
摘要翻译：由于WAN环境中引入的网络延迟和动态，传统的网络文件系统（如NFS）不会扩展到广域。为了解决这个问题，广域网络文件系统基于传统的网络文件系统（NFS / CIFS），并通过引入位于中央文件服务器和客户端之间的文件转发器基础架构来扩展到WAN环境。文件重定向器基础结构对于中央服务器和客户端都是不可见的，因此对NFS的更改是最小的。这可以最大程度地减少在NFS上部署WireFS时现有文件服务的中断。该系统包括用于企业级读/写广域网文件系统的架构，该系统中用于元数据和数据管理的协议和数据结构，用于基于历史的预取用于元数据操作中的访问延迟最小化的算法，以及分布式随机算法用于实施全局LRU缓存替换方案。

9. 发明授权

US09167463B2 Communication node operable to estimate faults in an ad hoc network and method of performing the same 有权
标题翻译：用于估计自组织网络中的故障的通信节点及其执行方法
公开(公告)号：US09167463B2
公开(公告)日：2015-10-20
申请号：US13602796
申请日：2012-09-04
申请人： Constantin Serban , Akshay Vashist , Rauf Izmailov , Ritu Chadha , Kyriakos Manousakis , Cho-Yu Jason Chiang
发明人： Constantin Serban , Akshay Vashist , Rauf Izmailov , Ritu Chadha , Kyriakos Manousakis , Cho-Yu Jason Chiang
IPC分类号： H04L12/24 , H04W84/18 , H04W24/10 , H04W24/08 , H04W4/00
CPC分类号： H04W24/10 , H04L41/0631 , H04L41/142 , H04L41/16 , H04W24/04 , H04W24/08 , H04W84/18
摘要： A communication node operable to estimate faults in a mobile ad hoc network and method of performing the same. In one embodiment, the communication node includes a processor and memory including computer program code configured to, with the processor, cause the communication node to monitor a set of observable parameters at the communication node, produce a fault estimate at the communication node from the set of observable parameters, and provide the fault estimate to a global fault detector at another communication node.
摘要翻译：一种用于估计移动自组织网络中的故障的通信节点及其执行方法。在一个实施例中，通信节点包括处理器和存储器，其包括计算机程序代码，该计算机程序代码被配置为与处理器一起使得通信节点监视通信节点处的一组可观察参数，从该集合在通信节点处产生故障估计的可观察参数，并向另一个通信节点的全局故障检测器提供故障估计。

10. 发明授权

US07840618B2 Wide area networked file system 有权
标题翻译：广域网络文件系统
公开(公告)号：US07840618B2
公开(公告)日：2010-11-23
申请号：US11616925
申请日：2006-12-28
申请人： Hui Zhang , Aniruddha Bohra , Samrat Ganguly , Rauf Izmailov , Jian Liang
发明人： Hui Zhang , Aniruddha Bohra , Samrat Ganguly , Rauf Izmailov , Jian Liang
IPC分类号： G06F17/30
CPC分类号： G06F17/30067
摘要： Traditional networked file systems like NFS do not extend to wide-area due to network latency and dynamics introduced in the WAN environment. To address that problem, a wide-area networked file system is based on a traditional networked file system (NFS/CIFS) and extends to the WAN environment by introducing a file redirector infrastructure residing between the central file server and clients. The file redirector infrastructure is invisible to both the central server and clients so that the change to NFS is minimal. That minimizes the interruption to the existing file service when deploying WireFS on top of NFS. The system includes an architecture for an enterprise-wide read/write wide area network file system, protocols and data structures for metadata and data management in this system, algorithms for history based prefetching for access latency minimization in metadata operations, and a distributed randomized algorithm for the implementation of global LRU cache replacement scheme.
摘要翻译：由于WAN环境中引入的网络延迟和动态，传统的网络文件系统（如NFS）不会扩展到广域。为了解决这个问题，广域网络文件系统基于传统的网络文件系统（NFS / CIFS），并通过引入位于中央文件服务器和客户端之间的文件重定向器基础架构来扩展到WAN环境。文件重定向器基础结构对于中央服务器和客户端都是不可见的，因此对NFS的更改是最小的。这可以最大程度地减少在NFS上部署WireFS时现有文件服务的中断。该系统包括用于企业级读/写广域网文件系统的架构，该系统中元数据和数据管理的协议和数据结构，用于基于历史的预取用于元数据操作中的访问延迟最小化的算法，以及分布式随机算法用于实施全局LRU缓存替换方案。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式