会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Accelerated large data distribution in overlay networks
    • 加速覆盖网络中的大数据分布
    • US20050015511A1
    • 2005-01-20
    • US10749947
    • 2003-12-31
    • Rauf IzmailovSamrat GangulyNan TuAikaterini Varsou
    • Rauf IzmailovSamrat GangulyNan TuAikaterini Varsou
    • G06F15/173H04L12/18H04L12/56H04L29/06H04L29/08
    • H04L67/06H04L12/18H04L45/04H04L45/12H04L45/16H04L45/48H04L69/14Y02D50/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.
    • 一种用于动态发现和利用未使用资源的方法和装置,用于实际和有效地创建用于数据分发的优化网络机制。 用于宽带网络中数据分发,组装,路由和调度的建议技术可以实现为由应用层控制平面启用的内容级服务器平台架构。 这样的平台加速了内容传输,镜像和复制。 它适用于多个网络系统的协同数据分区和信息复制的资源发现和共享。 此外,它通过拆卸要分配到不同组件的大内容来收获网络中未使用的带宽。 然后,这些组件通过多个路径和树在空间和时间上不同的路由路由,并在目的地节点处组装。 结果是加速了内容分发,增加了安全性,可扩展性和鲁棒性。 不需要修改现有的网络通信协议。
    • 5. 发明申请
    • GENERALIZED SEQUENTIAL MINIMAL OPTIMIZATION FOR SVM+ COMPUTATIONS
    • 用于SVM +计算的通用序列最小化优化
    • US20080243731A1
    • 2008-10-02
    • US12046061
    • 2008-03-11
    • RAUF IZMAILOVAKSHAY VASHISTVLADIMIR VAPNIK
    • RAUF IZMAILOVAKSHAY VASHISTVLADIMIR VAPNIK
    • G06F15/18
    • 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. 发明授权
    • Path provisioning for service level agreements in differentiated service networks
    • 差异化服务网络中服务级别协议的路径配置
    • US07403482B2
    • 2008-07-22
    • US09897495
    • 2001-07-03
    • Rauf IzmailovSubir BiswasSamrat Ganguly
    • Rauf IzmailovSubir BiswasSamrat Ganguly
    • H04J3/16H04L12/56
    • H04L45/00H04L41/12H04L41/5003H04L41/5019H04L45/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)算法将当前四元组的次优路径的成本与为配置为改变的先前四元组的路径切换的成本进行比较。 如果当前路径已经是最佳路径,则不再进行其他操作。 然而,如果次优路径的成本大于切换成本,则改变先前的路径,使得可以为本发明的四元组配置最佳路径。 否则,现在的四核维护其现有的路径。 迭代地调整网络的容量以补偿路径选择。 本系统可以应用于差分服务网络或光网络。
    • 8. 发明申请
    • Wide Area Networked File System
    • 广域网文件系统
    • US20070162462A1
    • 2007-07-12
    • US11616925
    • 2006-12-28
    • Hui ZhangAniruddha BohraSamrat GangulyRauf IzmailovJian Liang
    • Hui ZhangAniruddha BohraSamrat GangulyRauf IzmailovJian Liang
    • G06F17/30
    • 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缓存替换方案。
    • 10. 发明授权
    • Wide area networked file system
    • 广域网络文件系统
    • US07840618B2
    • 2010-11-23
    • US11616925
    • 2006-12-28
    • Hui ZhangAniruddha BohraSamrat GangulyRauf IzmailovJian Liang
    • Hui ZhangAniruddha BohraSamrat GangulyRauf IzmailovJian Liang
    • G06F17/30
    • 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缓存替换方案。