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

1. 发明授权

US09104477B2 Scheduling in MapReduce-like systems for fast completion time 有权
标题翻译：在MapReduce类似系统中调度快速完成时间
公开(公告)号：US09104477B2
公开(公告)日：2015-08-11
申请号：US13101626
申请日：2011-05-05
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee , Hyunseok Chang , Myung Jin Lee
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee , Hyunseok Chang , Myung Jin Lee
IPC分类号： G06F9/46 , G06F9/48
CPC分类号： G06F9/4881
摘要： A method and system for scheduling tasks is provided. A plurality of lower bound completion times is determined, using one or more computer processors and memory, for each of a plurality of jobs, each of the plurality of jobs including a respective subset plurality of tasks. A task schedule is determined for each of the plurality of processors based on the lower bound completion times.
摘要翻译：提供了一种调度任务的方法和系统。对于多个作业中的每一个，使用一个或多个计算机处理器和存储器来确定多个下限完成时间，所述多个作业中的每个作业包括相应的子集多个任务。基于下限完成时间为多个处理器中的每一个确定任务调度。

2. 发明申请

US20130254248A1 Method And Apparatus For A Distributed File System In A Cloud Network 审中-公开
标题翻译：云网络中分布式文件系统的方法和装置
公开(公告)号：US20130254248A1
公开(公告)日：2013-09-26
申请号：US13427958
申请日：2012-03-23
申请人： Hyunseok Chang , Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee , Limin Wang
发明人： Hyunseok Chang , Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee , Limin Wang
IPC分类号： G06F17/30 , G06F15/167
CPC分类号： H04L67/1021 , G06F16/182 , H04L67/101
摘要： Various embodiments provide a method and apparatus of providing a distributed network file system in a cloud network that provides performance guarantees in cloud storage that are independent of the accessed files and the access locations. A client's file system is provisioned using a file placement strategy that is based on client's access locations and determined maximum access bandwidths and does not require knowledge of file access patterns.
摘要翻译：各种实施例提供了一种在云网络中提供分布式网络文件系统的方法和装置，其在云存储中提供独立于所访问的文件和访问位置的性能保证。使用基于客户端访问位置和确定的最大访问带宽的文件放置策略来配置客户端的文件系统，并且不需要知道文件访问模式。

3. 发明申请

US20120284727A1 Scheduling in Mapreduce-Like Systems for Fast Completion Time 有权
标题翻译：在Mapreduce-like系统中调度快速完成时间
公开(公告)号：US20120284727A1
公开(公告)日：2012-11-08
申请号：US13101626
申请日：2011-05-05
申请人： Muralidharan S. Kodialam , T.V. Lakshman , Sarit Mukherjee , Hyunseok Chang , Myung Jin Lee
发明人： Muralidharan S. Kodialam , T.V. Lakshman , Sarit Mukherjee , Hyunseok Chang , Myung Jin Lee
IPC分类号： G06F9/46
CPC分类号： G06F9/4881
摘要： A method and system for scheduling tasks is provided. A plurality of lower bound completion times is determined, using one or more computer processors and memory, for each of a plurality of jobs, each of the plurality of jobs including a respective subset plurality of tasks. A task schedule is determined for each of the plurality of processors based on the lower bound completion times.
摘要翻译：提供了一种调度任务的方法和系统。对于多个作业中的每一个，使用一个或多个计算机处理器和存储器来确定多个下限完成时间，所述多个作业中的每个作业包括相应的子集多个任务。基于下限完成时间为多个处理器中的每一个确定任务调度。

4. 发明申请

US20130060601A1 PRIVACY-PRESERVING ADVERTISEMENT TARGETING USING RANDOMIZED PROFILE PERTURBATION 审中-公开
标题翻译：隐私保护使用随机配置文件的广告策略
公开(公告)号：US20130060601A1
公开(公告)日：2013-03-07
申请号：US13225878
申请日：2011-09-06
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02
摘要： A distribution and scheduling system for advertisements that targets ads to users and maximizes service-provider revenue without having full knowledge of user-profile information. Each user device stores a user profile and is pre-loaded with a set of ads that could possibly be shown during a timeslot. Each user device selects and displays an ad based on the user profile but does not identify the selected ad to the service provider. Instead, the user devices provide perturbed user-profile information in the form of Boolean vectors, which the service provider uses in conjunction with a guaranteed-approximation online algorithm to estimate the number of users that saw a particular ad. Thus, the service provider can charge advertisers for the number of times their ads are viewed, without knowing the users' profiles or which ads were viewed by individual users, and users can view the targeted ads while maintaining privacy from the service provider.
摘要翻译：用于向用户展示广告的广告的分发和调度系统，并且在不了解用户简档信息的情况下最大化服务提供商收入。每个用户设备存储用户简档，并且预先加载可能在时隙期间显示的一组广告。每个用户设备根据用户配置文件选择并显示广告，但不将所选广告标识给服务提供商。相反，用户设备以布尔向量的形式提供扰动的用户简档信息，服务提供商结合保证近似在线算法来估计看到特定广告的用户数量。因此，服务提供商可以在不知道用户的个人资料或哪些广告被个人用户查看的情况下向广告客户收取广告的次数，并且用户可以在维护来自服务提供商的隐私的同时查看有针对性的广告。

5. 发明申请

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）基于所述至少一个关键字和所述投标金额中的至少一个，在所述一个或多个时隙中对所述至少一个用户呈现的广告进行调度。

6. 发明授权

US08250600B2 Advertisement scheduling in a packet-based media-delivery system 有权
标题翻译：基于分组的媒体传送系统中的广播调度
公开(公告)号：US08250600B2
公开(公告)日：2012-08-21
申请号：US12415392
申请日：2009-03-31
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
IPC分类号： H04N7/10
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）基于所述至少一个关键字和所述投标金额中的至少一个，在所述一个或多个时隙中对所述至少一个用户呈现的广告进行调度。

7. 发明授权

US07359384B2 Scheduling of guaranteed-bandwidth low-jitter traffic in input-buffered switches 失效
标题翻译：在输入缓冲交换机中调度保证带宽低抖动流量
公开(公告)号：US07359384B2
公开(公告)日：2008-04-15
申请号：US10348385
申请日：2003-01-21
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Dimitrios Stiliadis
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Dimitrios Stiliadis
IPC分类号： H04L12/56
CPC分类号： H04L47/521 , H04L47/28 , H04L47/50 , H04L47/56 , H04L49/254
摘要： A switch schedules guaranteed-bandwidth, low-jitter-traffic characterized by a guaranteed rate table (GRT) method. A rate matrix generated from collected provisioning information is decomposed into schedule tables by a low jitter (LJ) decomposition method. The LJ decomposition method imposes a set of constraints for the schedule tables: schedule tables are partial permutation matrices, weighted sum of the partial permutation matrices is greater than or equal to the weighted sum of the rate matrix, and each entry in the rate matrix belongs to one element of the LJ decomposition schedule matrices. An integer LJ decomposition programming problem is employed to generate the schedule tables that are scheduled for each time slot of the period of the switch. Schedule tables are selected in turn based upon selecting eligible tables having the earliest finishing time. If necessary, the rate matrix is updated prior to decomposition for a subsequent period.
摘要翻译：交换机调度保证带宽，低抖动流量，其特征在于保证速率表（GRT）方法。从收集的配置信息生成的速率矩阵通过低抖动（LJ）分解方法分解为调度表。 LJ分解方法对调度表施加一组约束：调度表是部分置换矩阵，部分置换矩阵的加权和大于或等于速率矩阵的加权和，并且速率矩阵中的每个条目都属于到LJ分解调度矩阵的一个元素。采用整数LJ分解编程问题来生成为交换周期的每个时隙调度的调度表。根据选择具有最早完成时间的合格表，依次选择计划表。如果需要，速率矩阵在分解之前在随后的时间段内被更新。

8. 发明授权

US06996065B2 Dynamic backup routing of network tunnel paths for local restoration in a packet network 有权
标题翻译：网络隧道路径的动态备份路由，用于分组网络中的本地恢复
公开(公告)号：US06996065B2
公开(公告)日：2006-02-07
申请号：US09899508
申请日：2001-07-05
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman
IPC分类号： G01R31/08
CPC分类号： H04L45/28 , H04L45/12 , H04L45/123 , H04L45/22
摘要： A packet network of interconnected nodes employing dynamic backup routing of a Network Tunnel Path (NTP) allocates an active and backup path to the NTP based upon detection of a network failure. Dynamic backup routing employs local restoration to determine the allocation of, and, in operation, to switch between, a primary/active path and a secondary/backup path. Switching from the active path is based on a backup path determined with iterative shortest-path computations with link weights assigned based on the cost of using a link to backup a given link. Costs may be assigned based on single-link failure or single element (node or link) failure. Link weights are derived by assigning usage costs to links for inclusion in a backup path, and minimizing the costs with respect to a predefined criterion.
摘要翻译：采用网络隧道路径（NTP）的动态备份路由的互连节点的分组网络基于网络故障的检测，为NTP分配活动和备用路径。动态备份路由使用本地恢复来确定主/主路径和辅助/备用路径之间的切换和运行。从活动路径切换基于通过迭代最短路径计算确定的备份路径，其中链路权重基于使用链接备份给定链路的成本而分配。可以基于单链路故障或单个元件（节点或链路）故障分配成本。链路权重是通过将使用成本分配给用于包含在备份路径中的链接而导致的，并且使得相对于预定义准则最小化成本。

9. 发明授权

US08018940B2 Network address lookup based on bloom filters 有权
标题翻译：基于布隆过滤器的网络地址查找
公开(公告)号：US08018940B2
公开(公告)日：2011-09-13
申请号：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子滤波器。可以检测到假阳性匹配，并使用片外基于散列的前缀表检索真正匹配的下一跳信息。

10. 发明授权

US07957266B2 Efficient and robust routing independent of traffic pattern variability 有权
标题翻译：高效且鲁棒的路由独立于流量模式的变化
公开(公告)号：US07957266B2
公开(公告)日：2011-06-07
申请号：US11106410
申请日：2005-04-14
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
摘要： A scheme for routing packets of traffic to their destination after ensuring that they pass through one or more pre-determined intermediate nodes, thereby permitting all permissible traffic patterns to be handled without knowledge of the traffic matrix, subject to edge-link capacity constraints. In one embodiment, a request for a path with a service demand for routing data between the ingress point and the egress point is received. A set of two or more intermediate nodes between the ingress point and the egress point is selected. Based on a bandwidth of the network, respective fractions of the data to send from the ingress point to each node of the set of intermediate nodes are determined. The data is routed in the determined respective fractions from the ingress point to each node of the set of intermediate nodes, and routed from each node of the set of intermediate nodes to the egress point.
摘要翻译：一种用于在确保它们通过一个或多个预定中间节点之后将流量分组路由到其目的地的方案，从而允许所有允许的业务模式在不了解业务矩阵的情况下被处理，而不受边缘链路容量限制。在一个实施例中，接收到对于在入口点和出口点之间路由数据的服务需求的路径的请求。选择入口点和出口点之间的两个或多个中间节点的集合。基于网络的带宽，确定从入口点向中间节点集合中的每个节点发送的数据的各个分数。将数据以确定的各个分数从入口点路由到中间节点集合中的每个节点，并从中间节点集合的每个节点路由到出口点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式