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

1. 发明申请

US20050259648A1 Routing for networks with content filtering 有权
标题翻译：具有内容过滤功能的网路路由
公开(公告)号：US20050259648A1
公开(公告)日：2005-11-24
申请号：US10851493
申请日：2004-05-21
申请人： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
发明人： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
IPC分类号： H04L12/56 , H04L29/06
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.
摘要翻译：通过链路互连的节点网络具有在某些节点处指定的内容过滤，并且基于指定的内容过滤节点生成通过网络的分组连接的路由。通过内容过滤节点放置方法和网络容量最大化方法来指定网络，以对网络承载的基本上所有业务（分组流）的分组应用内容过滤。

2. 发明申请

US20050147031A1 Method for fast network re-optimization 有权
标题翻译：快速网络重新优化的方法
公开(公告)号：US20050147031A1
公开(公告)日：2005-07-07
申请号：US10753796
申请日：2004-01-07
申请人： Randeep Bhatia , Muralidharan Kodialam , Tirunell Lakshman
发明人： Randeep Bhatia , Muralidharan Kodialam , Tirunell Lakshman
IPC分类号： H04L1/00 , H04L12/56
CPC分类号： H04L47/822 , H04L1/0001 , H04L45/00 , H04L45/22 , H04L45/302 , H04L47/70 , H04L47/762
摘要： A fast and efficient method for network re-optimization is described. In one embodiment, the technique uses an algorithm that requires limited aggregate information to continually monitor the network for re-optimization opportunities. The re-optimization of the present invention enables a network to accommodate more traffic without adding capacity. The re-optimization of the present invention is performed only when network efficiency benefits above a predetermined threshold may be obtained. In addition, a least-cost set of sessions is determined to perform the re-routing of the present invention to attain the desired network efficiency.
摘要翻译：描述了一种快速有效的网络重新优化方法。在一个实施例中，该技术使用需要有限聚合信息的算法来连续监视网络以进行重新优化机会。本发明的重新优化使得网络能够容纳更多的流量而不增加容量。只有当网络效率有益于高于预定阈值时才执行本发明的重新优化。此外，确定了一个成本最低的会话集，以执行本发明的重新路由以达到期望的网络效率。

3. 发明授权

US5923742A System and method for detecting mass addressing events 失效
标题翻译：检测大容量寻址事件的系统和方法
公开(公告)号：US5923742A
公开(公告)日：1999-07-13
申请号：US800796
申请日：1997-02-14
申请人： Muralidharan Kodialam , Donald Jay Mintz
发明人： Muralidharan Kodialam , Donald Jay Mintz
IPC分类号： H04M3/10 , H04M3/36 , H04M15/00
CPC分类号： H04M3/36 , H04M2201/12 , H04M2203/1041 , H04M3/10
摘要： A system and method for detecting mass addressing events comprising a first register, a second register, a first counter, and a second counter is disclosed. Potential mass addressing events are detected by comparing a most recently selected address to the contents of the first register and incrementing the first counter if they are equal, or loading the most recently selected address into the first register and initializing the first counter if they are unequal. If the first counter's count reaches a first count threshold, the contents of the first register are compared to the contents of the second register and the second counter is incremented if they are equal, or, if they are unequal, the contents of the first register are loaded into the second register and the second counter is initialized. If the second counter's count reaches a second count threshold, an alarm is issued. In an alternative preferred embodiment, the first and second registers and the first and second counters are periodically reset to reduce false mass addressing event alarms.
摘要翻译：公开了一种用于检测包括第一寄存器，第二寄存器，第一计数器和第二计数器的质量寻址事件的系统和方法。通过将最近选择的地址与第一寄存器的内容进行比较来检测潜在的质量寻址事件，如果它们相等则递增第一计数器，或者将最近选择的地址加载到第一寄存器中并且如果它们不相等则初始化第一计数器。如果第一计数器的计数达到第一计数阈值，则将第一寄存器的内容与第二寄存器的内容进行比较，如果第二计数器相等则第二计数器递增，或者如果它们不相等，则第一寄存器的内容被加载到第二寄存器中，并且第二计数器被初始化。如果第二个计数器的计数达到第二个计数阈值，则发出一个警报。在替代的优选实施例中，第一和第二寄存器以及第一和第二计数器被周期性地复位以减少伪质量寻址事件警报。

4. 发明授权

US08631043B2 Method and apparatus for generating a shape graph from a binary trie 有权
标题翻译：用于从二进制trie生成形状图的方法和装置
公开(公告)号：US08631043B2
公开(公告)日：2014-01-14
申请号：US12633845
申请日：2009-12-09
申请人： Fang Hao , Muralidharan Kodialam , Tirunell V. Lakshman , Haoyu Song
发明人： Fang Hao , Muralidharan Kodialam , Tirunell V. Lakshman , Haoyu Song
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： A capability is provided for representing a set of data values using data structures, including converting a binary trie data structure representing the set of data values to a shape graph data structure representing the set of data values. The shape graph data structure is generated from the binary trie data structure based on the shapes of the sub-trees rooted at the nodes of the binary trie data structure. The shape graph includes vertices representing shapes of the sub-trees of the binary trie data structure. A shape graph data structure permits operations similar to the operations that may be performed on the binary trie data structure for performing lookups for data values from the set of data values, while at the same time reducing the structural redundancy of the binary trie data structure such that the shape graph data structure provides significant improvements in memory usage over the binary trie data structure.
摘要翻译：提供了一种用于使用数据结构表示一组数据值的能力，包括将表示该组数据值的二进制特里数据结构转换为表示数据值集合的形状图数据结构。形状图数据结构是从二进制trie数据结构生成的基于二叉树数据结构的节点的子树的形状。形状图包括表示二进制trie数据结构的子树形状的顶点。形状图数据结构允许类似于可以对二进制特里数据结构执行的操作的操作，以执行来自该组数据值的数据值的查找，同时减少二进制特里数据结构的结构冗余，形状图数据结构在二进制数据结构中提供了对存储器使用的显着改进。

5. 发明申请

US20110035277A1 SYSTEM FOR SCHEDULING ADVERTISEMENTS AND METHOD THEREOF 审中-公开
标题翻译：调度广告系统及其方法
公开(公告)号：US20110035277A1
公开(公告)日：2011-02-10
申请号：US12536159
申请日：2009-08-05
申请人： Muralidharan Kodialam , Tirunell Lakshman , Sarit Mukherjee , Limin Wang
发明人： Muralidharan Kodialam , Tirunell Lakshman , Sarit Mukherjee , Limin Wang
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0247
摘要： The system for scheduling advertisements includes at least one ad bidder and an ad scheduler. The ad bidder is configured to receive bidding information for a plurality of ads from one or more advertisers. The bidding information for each ad includes at least one target profile information and a bid associated with the target profile information. The bid indicates expected revenue for showing the ad to a viewer having actual profile information corresponding to the target profile information associated with the bid. The ad scheduler is configured to schedule which of the plurality of ads is received by which of a plurality of viewers based on the actual profile information of the plurality of viewers and the bidding information such that an ad scheduled for one of the plurality of viewers is influenced by a correspondence of the scheduled ad to others of the plurality of viewers.
摘要翻译：用于调度广告的系统包括至少一个广告出价者和广告调度器。广告出价者被配置为从一个或多个广告商接收多个广告的投标信息。每个广告的投标信息包括至少一个目标简档信息和与目标简档信息相关联的出价。该出价表示预期的收入，用于向具有与出价相关联的目标简档信息相对应的实际简档信息的观众展示该广告。广告调度器被配置为基于多个观看者的实际简档信息以及投标信息来调度多个观看者中的哪一个接收多个广告中的哪一个，使得为多个观看者之一调度的广告是受到预定广告与多个观众中的其他人的通信的影响。

6. 发明申请

US20060221855A1 Method and system for real-time detection of hidden traffic patterns 有权
标题翻译：实时检测隐藏流量模式的方法和系统
公开(公告)号：US20060221855A1
公开(公告)日：2006-10-05
申请号：US11096220
申请日：2005-03-31
申请人： Fang Hao , Muralidharan Kodialam , Tirunell Lakshman
发明人： Fang Hao , Muralidharan Kodialam , Tirunell Lakshman
IPC分类号： G01R31/08 , H04L12/28
CPC分类号： H04L63/1408 , H04L43/024
摘要： A method for measuring flow is disclosed. The method includes receiving an IP packet; determining if another IP packet is stored in a register; if another IP packet is stored in the register, comparing the stored IP packet with the received IP packet; and determining the longest match between the stored IP packet and the received IP packet.
摘要翻译：公开了一种测量流量的方法。该方法包括：接收IP包; 确定另一个IP包是否存储在一个寄存器中; 如果另一IP分组存储在寄存器中，则将所存储的IP分组与接收的IP分组进行比较; 并确定所存储的IP分组与所接收的IP分组之间的最长匹配。

7. 发明申请

US20050270984A1 Per-flow traffic estimation 有权
标题翻译：每流量估算
公开(公告)号：US20050270984A1
公开(公告)日：2005-12-08
申请号：US10947070
申请日：2004-09-22
申请人： Muralidharan Kodialam , Tirunell Lakshman
发明人： Muralidharan Kodialam , Tirunell Lakshman
IPC分类号： H04L12/56 , H04L12/24 , H04L12/26 , H04L1/00 , H04J1/16 , H04J3/14
CPC分类号： H04L41/14 , H04L43/024 , H04L43/026
摘要： A method of estimating per-flow traffic in a network of nodes interconnected by links samples an incoming traffic stream to a node. A sampling interval is derived based on a desired level of accuracy. The number of two-run occurrences for each flow is tracked in the sample stream. The number of two-runs per flow is then employed to generate an estimate of the traffic of the flow.
摘要翻译：通过链路相互连接的节点网络估计每流量流量的方法将输入业务流采样到节点。基于期望的精度水平导出采样间隔。在流程中跟踪每个流程的两次运行次数。然后使用每个流的两次运行的数量来生成流量的流量的估计。

8. 发明申请

US20050265255A1 Efficient and robust routing of potentially-variable traffic in IP-over-optical networks with resiliency against router failures 有权
标题翻译：在具有针对路由器故障的弹性的IP-over-optical网络中，潜在可变流量的高效且可靠的路由
公开(公告)号：US20050265255A1
公开(公告)日：2005-12-01
申请号：US11141257
申请日：2005-05-31
申请人： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
发明人： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
IPC分类号： H04L12/56 , H04L12/28 , H04L12/26
CPC分类号： H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
摘要： A method for supporting recovery from failure of a node in a network of nodes interconnected by links, wherein the failed node is in a path providing a service level between an ingress point and an egress point of the network, comprises: (a) selecting a set of one or more intermediate nodes between the ingress point and the egress point, the set excluding the failed node; (b) determining, based on available bandwidth of the network, a non-zero fraction of the service level to route from the ingress point to each intermediate node; (c) implementing, during a first routing phase, a first routing method to determine one or more paths from the ingress point to each intermediate node for routing the corresponding fraction of the service level; and (d) implementing, during a second routing phase, a second routing method to determine one or more paths from each intermediate node to the egress point for routing the corresponding fraction of the service level.
摘要翻译：一种用于支持通过链路互连的节点网络中的节点的故障恢复的方法，其中所述故障节点处于提供所述网络的入口点和出口点之间的服务水平的路径中，包括：（a）选择在入口点和出口点之间的一个或多个中间节点的集合，不包括故障节点的集合; （b）基于网络的可用带宽确定从入口点到每个中间节点路由的服务级别的非零分数; （c）在第一路由阶段期间实施第一路由方法，以确定从入口点到每个中间节点的一条或多条路径，用于路由服务级别的相应部分; 以及（d）在第二路由阶段期间实施第二路由方法，以确定从每个中间节点到出口点的一条或多条路径，用于路由服务级别的相应部分。

9. 发明申请

US20110029374A1 DYNAMIC AD SCHEDULING METHOD FOR IMPROVING UTILITY IN INTERACTIVE TV ENVIRONMENT 审中-公开
标题翻译：用于提高互动电视环境中的实用性的动态广播调度方法
公开(公告)号：US20110029374A1
公开(公告)日：2011-02-03
申请号：US12534397
申请日：2009-08-03
申请人： Muralidharan Kodialam , Tirunell Lakshman , Sarit Mukherjee , Limin Wang
发明人： Muralidharan Kodialam , Tirunell Lakshman , Sarit Mukherjee , Limin Wang
IPC分类号： G06Q30/00 , G06Q10/00
CPC分类号： G06Q30/02 , G06Q30/0243 , G06Q30/0244 , G06Q30/0247 , G06Q30/0255 , G06Q30/0264
摘要： Example embodiments provide scheduling a plurality of ads to be shown to a plurality of viewers of a multimedia network. One example embodiment includes determining target view rates for each of the plurality of ads based on expected revenue associated with each of the plurality of ads, determining, for each of the plurality of ads, a queue value based on a target view rate and an actual view rate associated with the ad, the actual view rate being a number of views of the ad in a previous time slot, and selectively showing ads, from among the plurality of ads, to the plurality of viewers based on the queue values.
摘要翻译：示例性实施例提供调度要向多媒体网络的多个观看者显示的多个广告。一个示例性实施例包括基于与多个广告中的每一个相关联的预期收入确定多个广告中的每一个的目标视图率，基于目标视图率确定多个广告中的每个广告的队列值与广告相关联的观看率，实际观看速率是前一时间段中的广告的观看次数，并且基于队列值从多个广告中选择性地显示广告到多个观看者。

10. 发明申请

US20070237081A1 Method and apparatus for link transmission scheduling for handling traffic variation in wireless mesh networks 有权
标题翻译：用于处理无线网状网络中的业务变化的链路传输调度的方法和装置
公开(公告)号：US20070237081A1
公开(公告)日：2007-10-11
申请号：US11394372
申请日：2006-03-30
申请人： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
发明人： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
IPC分类号： H04J1/16 , H04Q7/00
CPC分类号： H04L45/00 , H04L43/0882 , H04L45/302 , H04W28/08 , H04W40/12 , Y02D70/22 , Y02D70/34
摘要： The invention includes a method and apparatus for generating a link transmission schedule for handling traffic variation in wireless networks without dynamic scheduling or routing. The method includes determining fixed traffic capacities associated with respective wireless links of a wireless network according to a routing algorithm, and generating, using the routing algorithm and the fixed traffic capacities, a link transmission schedule including at least one condition by which traffic is transmitted using each of the network links. The link transmission schedule is adapted to remain substantially fixed during dynamic traffic changes. The routing algorithm may be a two-phase routing algorithm in which traffic is distributed by each node in the wireless network to every node in the wireless network using traffic split ratios. For two-phase routing, fixed traffic capacities may be determined using ingress and egress traffic capacities and traffic split ratios associated with respective nodes in the wireless network.
摘要翻译：本发明包括一种用于在没有动态调度或路由的情况下生成用于处理无线网络中的业务变化的链路传输调度的方法和装置。该方法包括根据路由算法确定与无线网络的相应无线链路相关联的固定业务容量，以及使用路由算法和固定业务容量生成链路传输调度，链路传输调度包括至少一个使用每个网络链接。链路传输调度适于在动态业务改变期间保持基本固定。路由算法可以是两阶段路由算法，其中使用业务分流比将流量由无线网络中的每个节点分配给无线网络中的每个节点。对于两相路由，可以使用入口和出口业务容量以及与无线网络中的相应节点相关联的业务分流比来确定固定业务容量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式