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

1. 发明申请

US20180288179A1 PROXY FOR SERVING INTERNET-OF-THINGS (IOT) DEVICES 审中-公开
公开(公告)号：US20180288179A1
公开(公告)日：2018-10-04
申请号：US15477854
申请日：2017-04-03
申请人： Randeep S. BHATIA , Bhawna GUPTA , Tirunell V. LAKSHMAN , Shreyasee MUKHERJEE , Dragan SAMARDZIJA
发明人： Randeep S. BHATIA , Bhawna GUPTA , Tirunell V. LAKSHMAN , Shreyasee MUKHERJEE , Dragan SAMARDZIJA
IPC分类号： H04L29/08 , H04L29/06
摘要： An Internet-of-Things (IOT) proxy includes storage hardware configured to store first and second state information. The first state information defines first contexts for flows associated with a plurality of IoT devices. The plurality of electronic devices have established a corresponding plurality of first sessions that are terminated by the IoT proxy. The second state information defines second contexts for the flows associated with the plurality of IoT devices. The second state information is associated with a second session that has been established between the proxy and a server or an other electronic device. The IoT proxy also includes computing hardware configured to modify headers of packets associated with the IoT devices based on at least one of the first state information or the second state information. In some cases, the IoT proxy is implemented as a virtual network slice in a network function virtualization (NFV) architecture.

2. 发明授权

US09077482B2 High-throughput routing in an optical network having a mesh topology 有权
标题翻译：具有网格拓扑的光网络中的高吞吐量路由
公开(公告)号：US09077482B2
公开(公告)日：2015-07-07
申请号：US13852328
申请日：2013-03-28
申请人： Peter J. Winzer , Kodialam Murali , Tirunell V. Lakshman
发明人： Peter J. Winzer , Kodialam Murali , Tirunell V. Lakshman
IPC分类号： H04J14/02 , H04L12/721 , H04L12/715 , H04L12/727
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.
摘要翻译：一种光路由方案，其中具有网状拓扑的光网络被配置为通过与网状拓扑重叠但具有星形拓扑的光路由布局路由光分组。使用该路由布局，光网络可以被配置为以使得能够接近理论容量的数据吞吐量的方式将来自相应入口节点的光分组传输到位于星中心的集线器节点到相应出口节点。实现集线器功能不需要特殊硬件，光网络的任何节点都可以配置为集线器节点。后者的特征使得可以例如通过改变集线器节点的身份并调整入口节点处的传输调度以使分组到达中心到集线器节点而使光路由布局和传输调度相对简单的优化。

3. 发明申请

US20100329133A1 NETWORK DETECTION OF REAL-TIME APPLICATIONS USING INCREMENTAL LINEAR REGRESSION 有权
标题翻译：使用增量线性回归的网络检测实时应用
公开(公告)号：US20100329133A1
公开(公告)日：2010-12-30
申请号：US12495236
申请日：2009-06-30
申请人： Fang Hao , Muralidharan Sampath Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Muralidharan Sampath Kodialam , Tirunell V. Lakshman
IPC分类号： H04L12/26
CPC分类号： H04L41/5019 , H04L41/5087 , H04L41/509 , H04L43/026
摘要： Method and apparatus using incremental linear regression to derive a traffic flow signature indicative of a particular application within a packet stream.
摘要翻译：使用增量线性回归的方法和装置来导出指示分组流内的特定应用的业务流签名。

4. 发明授权

US07729257B2 Method and apparatus for link transmission scheduling for handling traffic variation in wireless mesh networks 有权
标题翻译：用于处理无线网状网络中的业务变化的链路传输调度的方法和装置
公开(公告)号：US07729257B2
公开(公告)日：2010-06-01
申请号：US11394372
申请日：2006-03-30
申请人： Muralidharan Sampath Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
发明人： Muralidharan Sampath Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
IPC分类号： H04J1/16
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.
摘要翻译：本发明包括一种用于在没有动态调度或路由的情况下生成用于处理无线网络中的业务变化的链路传输调度的方法和装置。该方法包括根据路由算法确定与无线网络的相应无线链路相关联的固定业务容量，以及使用路由算法和固定业务容量生成链路传输调度，链路传输调度包括至少一个使用每个网络链接。链路传输调度适于在动态业务改变期间保持基本固定。路由算法可以是两阶段路由算法，其中使用业务分流比将流量由无线网络中的每个节点分配给无线网络中的每个节点。对于两相路由，可以使用入口和出口业务容量以及与无线网络中的相应节点相关联的业务分流比来确定固定业务容量。

5. 发明申请

US20080313132A1 HIGH ACCURACY BLOOM FILTER USING PARTITIONED HASHING 有权
标题翻译：使用分级清洗的高精度蒸汽过滤器
公开(公告)号：US20080313132A1
公开(公告)日：2008-12-18
申请号：US11763676
申请日：2007-06-15
申请人： Fang Hao , Muralidharan Sampath Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Muralidharan Sampath Kodialam , Tirunell V. Lakshman
IPC分类号： G06F17/30
CPC分类号： H04L45/00 , H04L45/745
摘要： A method and system for generating a bloom filter by mapping into respective groups each of a plurality of initial keys according to a first hash function and mapping each group hashed key into a bloom filter using k respective hash functions.
摘要翻译：一种用于通过根据第一散列函数映射到多个初始密钥中的每个组并且将每个组映射到相应组中来生成布隆过滤器的方法和系统，其使用k个相应的散列函数将密钥散列到布隆过滤器中。

6. 发明申请

US20080267068A1 Lightweight bandwidth-management scheme for elastic traffic 有权
标题翻译：弹性流量的轻量级带宽管理方案
公开(公告)号：US20080267068A1
公开(公告)日：2008-10-30
申请号：US11799036
申请日：2007-04-30
申请人： Tirunell V. Lakshman , Ravi S. Prasad , Marina K. Thottan
发明人： Tirunell V. Lakshman , Ravi S. Prasad , Marina K. Thottan
IPC分类号： H04L12/26
CPC分类号： H04L47/823 , H04L47/10 , H04L47/326 , H04L47/70
摘要： A lightweight probabilistic mechanism used to estimate the number of active flows, which estimate is used to determine the probability of admitting a new flow into the network. In one embodiment, a method for controlling admission of new flows at a node in a network of nodes interconnected by links includes: (a) for each of a plurality of incoming packets arriving at the node, each incoming packet corresponding to an active flow traversing the node: (a1) randomly selecting a packet from an output buffer of the node; (a2) determining whether the incoming packet is from the same active flow as the randomly-selected packet; and (a3) updating an estimate of the number of active flows traversing the node based on the determination of step (a2); and (b) determining whether to admit or drop part or all of a new flow at the node based on the estimated number of active flows traversing the node.
摘要翻译：用于估计活动流数量的轻量级概率机制，该估计用于确定将新流量接入网络的概率。在一个实施例中，用于控制通过链路互连的节点网络中的节点处的新流的接纳的方法包括：（a）对于到达节点的多个输入分组中的每一个，每个输入分组对应于主动流遍历节点：（a1）从节点的输出缓冲器中随机选择一个分组; （a2）确定所述输入分组是否来自与随机选择的分组相同的活动流; 以及（a3）基于步骤（a2）的确定来更新遍历所述节点的活动流的数量的估计; 以及（b）基于所估计的穿过所述节点的活动流数量来确定是否允许或删除所述节点处的新流的部分或全部。

7. 发明申请

US20080219181A1 HIGH-SPEED TRAFFIC MEASUREMENT AND ANALYSIS METHODOLOGIES AND PROTOCOLS 有权
公开(公告)号：US20080219181A1
公开(公告)日：2008-09-11
申请号：US12125972
申请日：2008-05-23
申请人： Muralidharan Sampath Kodialam , Tirunell V. Lakshman , Wing Cheong Lau
发明人： Muralidharan Sampath Kodialam , Tirunell V. Lakshman , Wing Cheong Lau
IPC分类号： G06F11/00
CPC分类号： H04L41/14 , H04L43/0852 , H04L43/50
摘要： We formulate the network-wide traffic measurement/analysis problem as a series of set-cardinality-determination (SCD) problems. By leveraging recent advances in probabilistic distinct sample counting techniques, the set-cardinalities, and thus, the network-wide traffic measurements of interest can be computed in a distributed manner via the exchange of extremely light-weight traffic digests (TD's) amongst the network nodes, i.e. the routers. A TD for N packets only requires O(loglog N) bits of memory storage. The computation of such O(loglog N)-sized TD is also amenable for efficient hardware implementation at wire-speed of 10 Gbps and beyond. Given the small size of the TD's, it is possible to distribute nodal TD's to all routers within a domain by piggybacking them as opaque data objects inside existing control messages, such as OSPF link-state packets (LSPs) or I-BGP control messages. Once the required TD's are received, a router can estimate the traffic measurements of interest for each of its local link by solving a series of set-cardinality-determination problems. The traffic measurements of interest are typically in form of per-link, per-traffic-aggregate packet counts (or flow counts) where an aggregate is defined by the group of packets sharing the same originating and/or destination nodes (or links) and/or some intermediate nodes (or links). The local measurement results are then distributed within the domain so that each router can construct a network-wide view of routes/flow patterns of different traffic commodities where a commodity is defined as a group of packets sharing the same origination and/or termination nodes or links. After the initial network-wide traffic measurements are received, each router can further reduce the associated measurement/estimation errors by locally conducting a minimum square error (MSE) optimization based on network-wide commodity-flow conservation constraints.

8. 发明授权

US07397766B2 High-speed traffic measurement and analysis methodologies and protocols 有权
标题翻译：高速交通测量和分析方法和协议
公开(公告)号：US07397766B2
公开(公告)日：2008-07-08
申请号：US10909908
申请日：2004-08-02
申请人： Muralidharan Sampath Kodialam , Tirunell V. Lakshman , Wing Cheong Lau
发明人： Muralidharan Sampath Kodialam , Tirunell V. Lakshman , Wing Cheong Lau
IPC分类号： G01R31/08
CPC分类号： H04L41/14 , H04L43/0852 , H04L43/50
摘要： A network-wide traffic measurement/analysis problem is formulated as a series of set-cardinality-determination (SCD) problems, using probabilistic distinct sample counting techniques to compute network-wide traffic measurements of interest in a distributed manner via the exchange of light-weight traffic digests (TD's) amongst network nodes/routers. A TD for N packets uses only requires O(loglog N) bits of memory storage, making it possible to distribute nodal TD's to all routers within a domain by piggybacking them as opaque data objects inside existing control messages, such as OSPF link-state packets (LSPs) or I-BGP control messages. A router receiving the TD's can estimate the traffic measurements of interest for each of its local links by solving a series of set-cardinality-determination problems. The traffic measurements of interest are typically per-link, per-traffic-aggregate packet (or flow) counts, where an aggregate is defined by the group of packets sharing the same originating and/or destination nodes (or links) and/or some intermediate nodes (or links).
摘要翻译：网络范围的流量测量/分析问题被形成为一系列集中确定（SCD）问题，使用概率不同的抽样计数技术，以分布式方式通过交换光网络计算感兴趣的全网络流量测量，网络节点/路由器之间的重量流量摘要（TD）。对于N个数据包的TD使用只需要O（loglog N）位的存储器存储，使得可以将节点TD分配到现有控制消息内的不透明数据对象（例如OSPF链路状态分组），将节点TD分配到域内的所有路由器（LSP）或I-BGP控制消息。接收TD的路由器可以通过解决一系列集合确定问题来估计每个本地链路的流量测量值。感兴趣的流量测量通常是每链路，每流量聚合分组（或流）计数，其中聚合由共享相同发起和/或目的地节点（或链路）的组的组和/或一些中间节点（或链接）。

9. 发明授权

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分解编程问题来生成为交换周期的每个时隙调度的调度表。根据选择具有最早完成时间的合格表，依次选择计划表。如果需要，速率矩阵在分解之前在随后的时间段内被更新。

10. 发明授权

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分配活动和备用路径。动态备份路由使用本地恢复来确定主/主路径和辅助/备用路径之间的切换和运行。从活动路径切换基于通过迭代最短路径计算确定的备份路径，其中链路权重基于使用链接备份给定链路的成本而分配。可以基于单链路故障或单个元件（节点或链路）故障分配成本。链路权重是通过将使用成本分配给用于包含在备份路径中的链接而导致的，并且使得相对于预定义准则最小化成本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式