利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

30 条记录 (耗时 0.032 秒)

    HIGH-SPEED TRAFFIC MEASUREMENT AND ANALYSIS METHODOLOGIES AND PROTOCOLS
    2.
    发明申请
    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.

    High-speed traffic measurement and analysis methodologies and protocols
    3.
    发明授权
    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的路由器可以通过解决一系列集合确定问题来估计每个本地链路的流量测量值。 感兴趣的流量测量通常是每链路，每流量聚合分组（或流）计数，其中聚合由共享相同发起和/或目的地节点（或链路）的组的组和/或一些 中间节点（或链接）。

    Method and apparatus for link transmission scheduling for handling traffic variation in wireless mesh networks
    5.
    发明授权
    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.

    摘要翻译： 本发明包括一种用于在没有动态调度或路由的情况下生成用于处理无线网络中的业务变化的链路传输调度的方法和装置。 该方法包括根据路由算法确定与无线网络的相应无线链路相关联的固定业务容量，以及使用路由算法和固定业务容量生成链路传输调度，链路传输调度包括至少一个使用 每个网络链接。 链路传输调度适于在动态业务改变期间保持基本固定。 路由算法可以是两阶段路由算法，其中使用业务分流比将流量由无线网络中的每个节点分配给无线网络中的每个节点。 对于两相路由，可以使用入口和出口业务容量以及与无线网络中的相应节点相关联的业务分流比来确定固定业务容量。

    SYSTEMS AND METHODS FOR CREATING USER INTEREST PROFILES
    10.
    发明申请
    SYSTEMS AND METHODS FOR CREATING USER INTEREST PROFILES 审中-公开
    用于创建用户兴趣文件的系统和方法

    公开(公告)号：US20110016206A1

    公开(公告)日：2011-01-20

    申请号：US12503265

    申请日：2009-07-15

    申请人： Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman ,  Sarit Mukherjee ,  Limin Wang

    发明人： Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman ,  Sarit Mukherjee ,  Limin Wang

    IPC分类号： G06F7/10 ,  G06F17/30 ,  G06F15/16

    CPC分类号： G06Q30/02

    摘要： Example methods include monitoring Internet traffic for a user, analyzing content of the Internet traffic, correlating the analyzed content with a simplified classifier set, ranking each correlated simplified classifier in the simplified classifier set, and storing the ranked simplified classifiers in a user interest profile for the user. Customer premise equipment may include a residential gateway, such as a wireless router, and user equipment such as a personal computer. Example systems may be configured from customer premise equipment or Internet service providers to generate user interest profiles in accordance with example methods.

    摘要翻译： 示例性方法包括监视用户的互联网流量，分析因特网流量的内容，将所分析的内容与简化分类器集相关联，对简化分类器集合中的每个相关联的简化分类器进行排序，以及将排序的简化分类器存储在用户兴趣模式中 用户。 客户驻地设备可以包括诸如无线路由器的住宅网关以及诸如个人计算机的用户设备。 示例性系统可以由客户驻地设备或因特网服务提供商配置以根据示例方法生成用户感兴趣的简档。