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

61. 发明授权

US07808923B2 High-speed traffic measurement and analysis methodologies and protocols 有权
标题翻译：高速交通测量和分析方法和协议
公开(公告)号：US07808923B2
公开(公告)日：2010-10-05
申请号：US12125972
申请日：2008-05-23
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Wing Cheong Lau
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Wing Cheong Lau
IPC分类号： H04L12/26
CPC分类号： H04L41/14 , H04L43/0852 , H04L43/50
摘要： In one embodiment, a node-implemented method for performing analysis of traffic within a packet communications network. First, the node measures a traffic aggregate at specified nodes within the network with regard to a packet set of interest. Each traffic aggregate (i) is a set of packets, observed at one of the specified nodes, having a common characteristic and (ii) is measured at one of the specified nodes by creating a digest for the packets having the common characteristic. The digest characterizes the traffic aggregate without containing the actual packets themselves. Next, the node formulates an intersection set cardinality determination for a network traffic-characterizing parameter to be measured in the network utilizing the digests characterizing the traffic aggregates. Next, the node solves the set cardinality determination for the network traffic-characterizing parameter to be measured.
摘要翻译：在一个实施例中，一种用于执行分组通信网络内的业务分析的节点实现的方法。首先，节点针对感兴趣的分组集合来测量网络内的指定节点处的业务聚合。每个业务聚合（i）是在一个指定节点上观察到的具有共同特征的一组分组，并且（ii）通过为具有共同特征的分组创建摘要来测量其中一个指定节点。摘要表征流量聚合，而不包含实际的数据包本身。接下来，节点利用表征业务聚合的摘要，制定网络中要测量的网络业务特征参数的交集集基数确定。接下来，节点解决要测量的网络流量特征参数的集合基数确定。

62. 发明申请

US20100251290A1 ADVERTISEMENT SCHEDULING IN A PACKET-BASED MEDIA-DELIVERY SYSTEM 有权
标题翻译：基于分组媒体传送系统的广告调度
公开(公告)号：US20100251290A1
公开(公告)日：2010-09-30
申请号：US12415392
申请日：2009-03-31
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
IPC分类号： H04N7/025 , H04N7/173
CPC分类号： H04N7/17318 , G06Q30/0255 , H04N21/25883 , H04N21/25891 , H04N21/44222 , H04N21/6175 , H04N21/6582 , H04N21/812
摘要： In one embodiment, a scheme for the display of targeted and personalized advertisements in a packet-based media-delivery system, such as an Internet Protocol Television (IPTV) service. An Internet keyword-based advertisement-bidding model is used to place the most-appropriate IPTV advertisements for viewers depending on their interests as determined through the users' Internet activities, while maximizing advertising revenue for the IPTV service provider. One method for scheduling an advertisement for rendering in one or more time slots in packet-based media programming comprises: (a) obtaining at least one keyword from one or more Internet sessions corresponding to at least one user; (b) receiving a plurality of bid amounts corresponding to a plurality of available advertisements for the one or more time slots; and (c) scheduling, based on the at least one keyword and at least one of the bid amounts, the advertisement to be rendered to the at least one user in the one or more time slots.
摘要翻译：在一个实施例中，用于在基于分组的媒体传送系统（诸如因特网协议电视（IPTV））服务中显示目标和个性化广告的方案。基于互联网关键词的广告投标模型用于根据用户的互联网活动确定的兴趣为观众放置最适合的IPTV广告，同时最大化IPTV服务提供商的广告收入。一种用于在基于分组的媒体编程中的一个或多个时隙中调度用于呈现广告的方法包括：（a）从与至少一个用户对应的一个或多个因特网会话中获得至少一个关键字; （b）接收与所述一个或多个时隙的多个可用广告相对应的多个出价金额; 以及（c）基于所述至少一个关键字和所述投标金额中的至少一个，在所述一个或多个时隙中对所述至少一个用户呈现的广告进行调度。

63. 发明申请

US20100040066A1 NETWORK ADDRESS LOOKUP BASED ON BLOOM FILTERS 有权
标题翻译：基于BLOOM过滤器的网络地址查找
公开(公告)号：US20100040066A1
公开(公告)日：2010-02-18
申请号：US12190633
申请日：2008-08-13
申请人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
发明人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/745 , H04L45/7457
摘要： In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed using a Bloom filter that was programmed with the prefixes corresponding to all of the different prefix lengths without having to expand any of the prefixes programmed into the Bloom filter. Membership probes are performed into the Bloom filter using candidate prefix values of a given network address. The Bloom filter can be implemented in a distributed manner using Bloom sub-filters, where each Bloom sub-filter is hashed based on a set of hash functions, where each different hash function in the set corresponds to a different prefix length in the routing table. Each Bloom sub-filter can in turn be implemented using a plurality of practically realizable multi-port memory devices controlled by a port scheduler. False-positive matches can be detected and next-hop information for true-positive matches retrieved using an off-chip, hash-based prefix table.
摘要翻译：在一个实施例中，使用具有与所有不同前缀长度相对应的前缀编程的布隆过滤器来执行具有不同前缀长度的前缀的路由表的IP查找，而不必将编程到布隆过滤器中的任何前缀扩展。使用给定网络地址的候选前缀值对Bloom过滤器进行成员资格探测。 Bloom过滤器可以使用Bloom子过滤器以Bloom子过滤器实现，其中每个Bloom子过滤器基于一组散列函数进行散列，其中集合中的每个不同的散列函数对应于路由表中的不同的前缀长度。可以使用由端口调度器控制的多个实际可实现的多端口存储器件来实现每个Bloom子滤波器。可以检测到假阳性匹配，并使用片外基于散列的前缀表检索真正匹配的下一跳信息。

64. 发明授权

US07558209B2 Maximum-throughput routing of traffic in the hose model 有权
标题翻译：软管模型中流量的最大吞吐量路由
公开(公告)号：US07558209B2
公开(公告)日：2009-07-07
申请号：US11414147
申请日：2006-04-28
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
IPC分类号： G01R31/08 , H04L12/28
CPC分类号： H04L45/00 , H04L45/14 , H04L45/62
摘要： A computer-implemented method of computing throughput of a data-routing scheme for a network of nodes interconnected by links and having at least one ingress point and at least one egress point. The method includes: deriving a polynomial-size linear program from a combination of a first linear program and a second linear program and solving the polynomial-size linear program. The first linear program has infinite constraints and minimizes maximum-link utilization of a link in a path between the ingress point and the egress point. The second linear program determines whether any constraint of the first linear program is violated.
摘要翻译：一种计算机实现的方法，用于计算通过链路互连并具有至少一个入口点和至少一个出口点的节点网络的数据路由方案的吞吐量。该方法包括：从第一线性程序和第二线性程序的组合中导出多项式大小的线性程序并求解多项式大小的线性程序。第一个线性程序具有无穷大的约束，并且使进入点和出口点之间的路径中的链路的最大链路利用率最小化。第二线性程序确定是否违反了第一线性程序的任何约束。

65. 发明授权

US07394763B2 Routing for networks with content filtering 有权
标题翻译：具有内容过滤功能的网路路由
公开(公告)号：US07394763B2
公开(公告)日：2008-07-01
申请号：US10851493
申请日：2004-05-21
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
IPC分类号： G01R31/08 , G06F11/00 , G08C15/00 , H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L45/125 , H04L45/02 , H04L45/306 , H04L63/0227 , H04L63/1441
摘要： A network of nodes interconnected by links has content filtering specified at certain nodes, and routing of packet connections through the network is generated based on the specified content-filtering nodes. The network is specified via a content-filtering node placement method and a network-capacity maximization method so as to apply content filtering to packets for substantially all traffic (packet streams) carried by the network.
摘要翻译：通过链路互连的节点网络具有在某些节点处指定的内容过滤，并且基于指定的内容过滤节点生成通过网络的分组连接的路由。通过内容过滤节点放置方法和网络容量最大化方法来指定网络，以对网络承载的基本上所有业务（分组流）的分组应用内容过滤。

66. 发明授权

US5951651A Packet filter system using BITMAP vector of filter rules for routing packet through network 失效
标题翻译：包过滤系统使用BITMAP向量的过滤规则，通过网络路由数据包
公开(公告)号：US5951651A
公开(公告)日：1999-09-14
申请号：US899423
申请日：1997-07-23
申请人： Tirunell V. Lakshman , Dimitrios Stiliadis
发明人： Tirunell V. Lakshman , Dimitrios Stiliadis
IPC分类号： H04L29/06 , H04J15/00 , G06F13/38
CPC分类号： H04L63/0263 , H04L29/06 , H04L45/742 , H04L69/22
摘要： A filter method for designating one of a plurality of packet filter rules contained in a router for routing a packet of information through a network, each packet characterized as having parameters, the method comprising: generating one or more partitioned sets, each partitioned set associated with a different packet parameter with each partition of a set having zero or more associated filter rules; generating a vector corresponding to each of the parameters, the vector defining structure indicating one or more potential filter rules to be applied; comparing each parameter of the received packet with each partition of a corresponding partitioned set and determining one or more potential filter rules to be applied to the packet for each parameter; and determining from each of the vectors one or more identical potential filter rules associated with each vector, one of the identical filter rules capable of being applied to the received packet, with the rule to be applied being the rule of greatest priority.
摘要翻译：一种过滤方法，用于指定包含在路由器中的多个分组过滤规则中的一个，用于通过网络路由信息分组，每个分组被表征为具有参数，所述方法包括：生成一个或多个分区集，每个分区集与不同的分组参数，其中具有零个或多个相关联的过滤规则的集合的每个分区; 生成与每个参数对应的向量，所述向量定义结构指示要应用的一个或多个潜在过滤规则; 将接收的分组的每个参数与对应的分区集的每个分区进行比较，并且确定要应用于每个参数的分组的一个或多个潜在过滤规则; 并且从每个向量确定与每个向量相关联的一个或多个相同的电势滤波器规则，能够被应用于所接收的分组的相同的过滤规则中的一个，要应用的规则是最优先的规则。

67. 发明授权

US08953432B2 Softrouter dynamic binding protocol 有权
标题翻译： Softrouter动态绑定协议
公开(公告)号：US08953432B2
公开(公告)日：2015-02-10
申请号：US11147491
申请日：2005-06-08
申请人： Furquan Ahmed Ansari , Martin Havemann , Tirunell V. Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Thomas Y. Woo
发明人： Furquan Ahmed Ansari , Martin Havemann , Tirunell V. Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Thomas Y. Woo
IPC分类号： G06F11/00 , H04L12/721 , H04L12/751 , H04L12/707 , H04L12/703 , H04L12/773
CPC分类号： H04L45/26 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/60
摘要： A dynamic binding protocol has three tasks that run in parallel: discovery, association, and operation. During discovery, control elements (CEs) and forwarding elements (FEs) learn about immediate neighbors and CEs in a SoftRouter network that has separate control and data planes. During association, FEs associate with CEs and are configured with basic parameters, such as IP interface addresses, hostnames, and the like. During operation, failover and packet tunneling between CEs and FEs is handled.
摘要翻译：动态绑定协议具有并行运行的三个任务：发现，关联和操作。在发现期间，控制元件（CE）和转发元件（FE）可以了解具有单独控制和数据平面的SoftRouter网络中的直接邻居和CE。在关联期间，FE与CE相关联，并配置有基本参数，如IP接口地址，主机名等。在操作期间，处理CE和FE之间的故障转移和数据包隧道。

68. 发明申请

US20140294392A1 HIGH-THROUGHPUT ROUTING IN AN OPTICAL NETWORK HAVING A MESH TOPOLOGY 有权
标题翻译：具有网格拓扑的光网络中的高通路径
公开(公告)号：US20140294392A1
公开(公告)日：2014-10-02
申请号：US13852328
申请日：2013-03-28
申请人： Peter J. Winzer , Kodialam Murali , Tirunell V. Lakshman
发明人： Peter J. Winzer , Kodialam Murali , Tirunell V. Lakshman
IPC分类号： H04J14/02
CPC分类号： H04J14/0284 , H04J14/0201 , H04J14/0227 , H04J14/0257 , H04J14/0267 , H04L45/121 , H04L45/62 , H04L45/64
摘要： An optical routing scheme in which an optical network having a mesh topology is configured to route optical packets through an optical routing layout superimposable with the mesh topology, but having a star-like topology. Using this routing layout, the optical network can be configured to transport optical packets from respective ingress nodes, through the hub node located at the star center, to respective egress nodes in a manner that enables a data throughput that approaches the theoretical capacity. No special hardware is required for implementing the hub functionality, and any node of the optical network can be configured to serve as the hub node. The latter feature enables relatively straightforward optimization of the optical routing layout and transmission schedule, e.g., by changing the identity of the hub node and adjusting the transmission schedule at the ingress nodes to synchronize packet arrivals to the hub node.
摘要翻译：一种光路由方案，其中具有网状拓扑的光网络被配置为通过与网状拓扑重叠但具有星形拓扑的光路由布局路由光分组。使用该路由布局，光网络可以被配置为以使得能够接近理论容量的数据吞吐量的方式将来自相应入口节点的光分组传输到位于星中心的集线器节点到相应出口节点。实现集线器功能不需要特殊硬件，光网络的任何节点都可以配置为集线器节点。后者的特征使得可以例如通过改变集线器节点的身份并调整入口节点处的传输调度以使分组到达中心到集线器节点而使光路由布局和传输调度相对简单的优化。

69. 发明申请

US20140089510A1 JOINT ALLOCATION OF CLOUD AND NETWORK RESOURCES IN A DISTRIBUTED CLOUD SYSTEM 审中-公开
标题翻译：在分布式云系统中的云和网络资源的联合分配
公开(公告)号：US20140089510A1
公开(公告)日：2014-03-27
申请号：US13628421
申请日：2012-09-27
申请人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
发明人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
IPC分类号： G06F15/173
CPC分类号： G06F9/5072
摘要： A capability is provided for allocating cloud and network resources in a distributed cloud system including a plurality of data centers. A request for resources is received. The request for resources includes a request for cloud resources and an indication of an amount of cloud resources requested. The request for resources also may include a request for network resources or one or more constraints. A set of feasible resource mappings is determined based on the request for resources and information associated with the distributed cloud system. A resource mapping to use for the request for resources is selected from the set of feasible resource mappings. The selected resource mapping includes a mapping of the requested cloud resources to cloud resources of one or more of the data centers and an identification of network resources configured to support communications for the cloud resources of the one or more data centers.
摘要翻译：提供了在包括多个数据中心的分布式云系统中分配云和网络资源的能力。收到资源请求。对资源的请求包括对云资源的请求以及所请求的云资源量的指示。对资源的请求还可以包括对网络资源的请求或一个或多个约束。基于对与分布式云系统相关联的资源和信息的请求确定一组可行的资源映射。从可用资源映射的集合中选择用于资源请求的资源映射。所选择的资源映射包括所请求的云资源与一个或多个数据中心的云资源的映射以及被配置为支持一个或多个数据中心的云资源的通信的网络资源的标识。

70. 发明授权

US08566373B2 Probabilistic fingerprint checking for preventing data leakage 有权
标题翻译：用于防止数据泄漏的概率指纹检查
公开(公告)号：US08566373B2
公开(公告)日：2013-10-22
申请号：US13367441
申请日：2012-02-07
申请人： Fang Hao , Krishna P. Puttaswamy Naga , Murali Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Krishna P. Puttaswamy Naga , Murali Kodialam , Tirunell V. Lakshman
IPC分类号： G06F17/30
CPC分类号： G06F17/30109 , G06F21/6236
摘要： A data-leakage prevention capability is presented herein. The data-leakage prevention capability prevents leakage of data, of a file set having a plurality of files, from a secure network using online fingerprint checking of data flows at a boundary of the secure network. The online fingerprint checking is performed using a set of data structures configured for the file set. The data structures for the file set are configured based on file set characteristics information of the file set and a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined. The data structure configuration is computed for a plurality of data structures configured for use in monitoring the files of the file set. The data structure configuration includes a plurality of data structure locations and data structure sizes for the respective plurality of data structures.
摘要翻译：本文介绍了数据泄漏防护功能。数据泄漏防止能力通过使用在安全网络的边界上的数据流的在线指纹检查来防止来自安全网络的具有多个文件的文件组的数据的泄漏。使用为文件集配置的一组数据结构来执行在线指纹检查。文件集的数据结构是基于文件集的文件集特征信息和指示要确定文件集的数据泄漏事件的最大位数的目标检测滞后来配置的。为配置为用于监视文件集文件的多个数据结构计算数据结构配置。数据结构配置包括用于各个多个数据结构的多个数据结构位置和数据结构大小。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式