会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • REDUCTION OF MESSAGE AND COMPUTATIONAL OVERHEAD IN NETWORKS
    • 减少网络中的信息和计算量
    • US20120120808A1
    • 2012-05-17
    • US12945318
    • 2010-11-12
    • Thyaga NandagopalKiran M. RegeKrishan SabnaniWim Henderickx
    • Thyaga NandagopalKiran M. RegeKrishan SabnaniWim Henderickx
    • H04L12/26
    • H04L45/025H04L45/028
    • Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the node, a network update message; determining whether the network update message should be propagated to other nodes; if the network update message should be propagated to other nodes, forwarding the network update message to at least one other node; and if the network update message should not be propagated to other nodes, refraining from forwarding the network update message to any other node. Various further embodiments relate to a method and related network node including one or more of the following: determining a first time period for the network update message; setting the first time period as a delay time; waiting for the delay time; and after the delay time has elapsed, computing new routing information based on the network update message.
    • 各种示例性实施例涉及包括以下一个或多个的方法和相关网络节点:在节点处接收网络更新消息; 确定网络更新消息是否应传播到其他节点; 如果网络更新消息应该被传播到其他节点,则将网络更新消息转发到至少一个其他节点; 并且如果网络更新消息不应传播到其他节点,则不要将网络更新消息转发到任何其他节点。 各种另外的实施例涉及包括以下的一个或多个的方法和相关网络节点:确定网络更新消息的第一时间段; 将第一时间段设置为延迟时间; 等待延迟时间; 并且在延迟时间过去之后,基于网络更新消息来计算新的路由信息​​。
    • 4. 发明授权
    • Reduction of message and computational overhead in networks
    • 降低网络中的消息和计算开销
    • US08797913B2
    • 2014-08-05
    • US12945318
    • 2010-11-12
    • Thyaga NandagopalKiran M. RegeKrishan SabnaniWim Henderickx
    • Thyaga NandagopalKiran M. RegeKrishan SabnaniWim Henderickx
    • H04L12/28
    • H04L45/025H04L45/028
    • Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the node, a network update message; determining whether the network update message should be propagated to other nodes; if the network update message should be propagated to other nodes, forwarding the network update message to at least one other node; and if the network update message should not be propagated to other nodes, refraining from forwarding the network update message to any other node. Various further embodiments relate to a method and related network node including one or more of the following: determining a first time period for the network update message; setting the first time period as a delay time; waiting for the delay time; and after the delay time has elapsed, computing new routing information based on the network update message.
    • 各种示例性实施例涉及包括以下一个或多个的方法和相关网络节点:在节点处接收网络更新消息; 确定网络更新消息是否应传播到其他节点; 如果网络更新消息应该被传播到其他节点,则将网络更新消息转发到至少一个其他节点; 并且如果网络更新消息不应传播到其他节点,则不要将网络更新消息转发到任何其他节点。 各种另外的实施例涉及包括以下的一个或多个的方法和相关网络节点:确定网络更新消息的第一时间段; 将第一时间段设置为延迟时间; 等待延迟时间; 并且在延迟时间过去之后,基于网络更新消息来计算新的路由信息​​。
    • 6. 发明授权
    • Streaming algorithms for robust, real-time detection of DDoS attacks
    • 用于强大,实时检测DDoS攻击的流式算法
    • US07669241B2
    • 2010-02-23
    • US10954901
    • 2004-09-30
    • Sumit GangulyMinos GarofalakisRajeev RastogiKrishan Sabnani
    • Sumit GangulyMinos GarofalakisRajeev RastogiKrishan Sabnani
    • G06F12/14
    • H04L29/06027H04L63/1458H04L65/607
    • A distinct-count estimate is obtained in a guaranteed small footprint using a two level hash, distinct count sketch. A first hash fills the first-level hash buckets with an exponentially decreasing number of data-elements. These are then uniformly hashed to an array of second-level-hash tables, and have an associated total-element counter and bit-location counters. These counters are used to identify singletons and so provide a distinct-sample and a distinct-count. An estimate of the total distinct-count is obtained by dividing by the distinct-count by the probability of mapping a data-element to that bucket. An estimate of the total distinct-source frequencies of destination address can be found in a similar fashion. By further associating the distinct-count sketch with a list of singletons, a total singleton count and a heap containing the destination addresses ordered by their distinct-source frequencies, a tracking distinct-count sketch may be formed that has considerably improved query time.
    • 使用两级散列,不同的计数草图在保证的小尺寸中获得不同的计数估计。 第一个散列填充了数据元素数量级数下降的第一级哈希桶。 然后将它们均匀地散列到二级哈希表的阵列,并具有关联的全元计数器和位位计数器。 这些计数器用于识别单例,因此提供了不同的样本和不同的数字。 通过将distinct-count除以将数据元素映射到该存储桶的概率,可以获得总区分计数的估计。 可以以类似的方式找到目的地地址的不同源频率的总体估计。 通过进一步将不同数量的草图与单例列表相关联,总共单例数和包含由其不同源频率排​​序的目的地地址的堆,可以形成具有显着改进的查询时间的跟踪不同计划草图。
    • 7. 发明申请
    • Softrouter feature server
    • Softrouter功能服务器
    • US20060092935A1
    • 2006-05-04
    • US11147768
    • 2005-06-08
    • Tirunell LakshmanKrishan SabnaniThomas Woo
    • Tirunell LakshmanKrishan SabnaniThomas Woo
    • H04L12/56H04L12/28
    • H04L45/00H04L49/602
    • A network architecture includes one or more feature servers and control servers in a control plane that is logically separate from a data plane that includes forwarding elements. Feature servers facilitate adding network-based functionality in a centralized way that is has better scalability than the traditional router architecture. Some examples of network-based functionality are voice over IP, enhancing QoS support, scaling BGP route reflectors, network-based VPN support, scaling mobile IP support, introducing IPv6 into existing and future networks, and enhancing end-to-end network security. Feature servers remove complexity from routers, allow functions to be implemented on a standard-off-the-shelf server platform, facilitate easy introduction of value-added functions, and scale well.
    • 网络架构包括控制平面中的一个或多个特征服务器和控制服务器,逻辑上与包括转发元件的数据平面分离。 功能服务器便于以比传统路由器架构更好的可扩展性的集中方式添加基于网络的功能。 基于网络的功能的一些示例是IP语音,增强QoS支持,扩展BGP路由反射器,基于网络的VPN支持,扩展移动IP支持,将IPv6 6引入现有和未来的网络,以及增强端到端网络安全 。 功能服务器消除了路由器的复杂性,允许在标准的现成服务器平台上实现功能,便于简单的引入增值功能,并扩展好。
    • 9. 发明申请
    • Method and apparatus for improved multicast streaming in wireless networks
    • 用于改善无线网络中的多播流的方法和装置
    • US20070233889A1
    • 2007-10-04
    • US11396230
    • 2006-03-31
    • Katherine GuoArun NetravaliKrishan Sabnani
    • Katherine GuoArun NetravaliKrishan Sabnani
    • G06F15/16
    • H04L12/189H04L29/06027H04L65/4076H04L65/80H04W4/18H04W72/005
    • The invention includes a method and apparatus for providing multimedia content to a plurality of wireless terminals. The method includes transcoding an original media stream to form at least one companion media stream, each media stream having a different data rate, and advertising each media stream to each of the plurality of wireless terminals, each wireless terminal having an associated channel condition. The original media stream and at least one companion media stream are each adapted for being selected by each of the wireless terminals. For each wireless terminal selecting one of the media streams, the selected one of the media streams is selected using the data rates of the media streams and the channel condition of the wireless terminal. The transcoding of the media stream to form the at least one companion media stream may be performed using channel condition information.
    • 本发明包括一种用于向多个无线终端提供多媒体内容的方法和装置。 该方法包括对原始媒体流进行代码转换以形成至少一个伴随媒体流,每个媒体流具有不同的数据速率,以及向每个无线终端广告每个媒体流,每个无线终端具有相关联的信道条件。 原始媒体流和至少一个伴随媒体流分别适于被每个无线终端选择。 对于选择媒体流之一的每个无线终端,使用媒体流的数据速率和无线终端的信道状况来选择所选择的一个媒体流。 可以使用信道条件信息来执行媒体流的代码转换以形成至少一个伴随媒体流。