利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

19 条记录 (耗时 0.022 秒)

    HIGH-SPEED TRAFFIC MEASUREMENT AND ANALYSIS METHODOLOGIES AND PROTOCOLS
    1.
    发明申请
    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
    2.
    发明授权
    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的路由器可以通过解决一系列集合确定问题来估计每个本地链路的流量测量值。 感兴趣的流量测量通常是每链路，每流量聚合分组（或流）计数，其中聚合由共享相同发起和/或目的地节点（或链路）的组的组和/或一些 中间节点（或链接）。

    Anonymous tracking using a set of wireless devices
    3.
    发明申请
    Anonymous tracking using a set of wireless devices 有权
    匿名跟踪使用一组无线设备

    公开(公告)号：US20080074238A1

    公开(公告)日：2008-03-27

    申请号：US11824469

    申请日：2007-06-29

    申请人： Muralidharan S. Kodialam ,  Wing Cheong Lau ,  Thyagarajan Nandagopal

    发明人： Muralidharan S. Kodialam ,  Wing Cheong Lau ,  Thyagarajan Nandagopal

    IPC分类号： H04B7/00

    CPC分类号： H04W24/00 ,  H04L41/0896 ,  H04L43/0882 ,  H04W74/08

    摘要： In one embodiment, a method for estimating the number of tags in a set of tags in a system of tags and readers. The method includes, during each of a plurality of time intervals: (i) transmitting a command requesting that each tag that receives the command determine whether to transmit a reply; and (ii) receiving, in one or more timeslots of a frame corresponding to the time interval, replies from one or more tags. The method further includes providing an estimate of the number of tags in the set of one or more tags based on (i) timeslots in each of the plurality of time intervals that are zero timeslots, i.e., timeslots having no received reply, and (ii) the total number of timeslots in each frame.

    摘要翻译： 在一个实施例中，一种用于估计标签和读取器系统中的一组标签中的标签的数量的方法。 该方法包括在多个时间间隔的每一个期间：（i）发送请求每个接收到该命令的标签的命令确定是否发送回复; 以及（ii）在与所述时间间隔对应的帧的一个或多个时隙中接收从一个或多个标签的答复。 该方法还包括：基于（i）作为零时隙的多个时间间隔中的每一个中的时隙，即没有接收到的回复的时隙，提供一组或多个标签中的标签数量的估计， ）每帧中的时隙总数。

    Backhaul multicasting using Ethernet-based radio access networks
    4.
    发明授权
    Backhaul multicasting using Ethernet-based radio access networks 有权
    使用基于以太网的无线接入网络的回程多播

    公开(公告)号：US07096039B2

    公开(公告)日：2006-08-22

    申请号：US10185993

    申请日：2002-06-28

    申请人： Mooi Choo Chuah ,  Enrique Hernandez-Valencia ,  Wing Cheong Lau

    发明人： Mooi Choo Chuah ,  Enrique Hernandez-Valencia ,  Wing Cheong Lau

    IPC分类号： H04M1/00

    CPC分类号： H04L12/189 ,  H04L12/1836 ,  H04L49/201 ,  H04L49/205 ,  H04L49/351 ,  H04W92/12

    摘要： The present invention sets forth a methodology for providing improved downlink backhaul services from a radio network controller (RNC) to a plurality of base stations via a backhaul network that provides Ethernet services. The Ethernet services are provided by a group of provider edge (PE) switches and regular label switch routers (referred to as P switches). Base stations within the network are assigned into clusters, each of the clusters having a cluster ID. The RNC transmits packets to a given switch or switches out on the network based on a cluster ID included within the transmitted packet. The communications traffic is then multicast from at least one last hop switch in the network to candidate base stations on the basis of the cluster ID and an active set within the cluster. Advantageously, the clusters act as subgroups for more easily directing the transmission of the backhaul multicast traffic. Significant advantages are realized through use of the present invention, including the ability to allow faster and smoother handoffs, as well as backhaul bandwidth savings since intelligence regarding cell switching is extended out at a point farther along the network than was previously enabled.

    摘要翻译： 本发明提出了一种用于通过提供以太网服务的回程网络从无线电网络控制器（RNC）向多个基站提供改进的下行链路回程业务的方法。 以太网服务由一组提供商边缘（PE）交换机和常规标签交换路由器（称为P交换机）提供。 网络内的基站被分配成簇，每个簇具有簇ID。 RNC根据发送的分组中包含的集群ID，将数据包发送给给定的交换机，或者在网络上进行切换。 然后，基于集群ID和集群内的活动集，将通信业务从网络中的至少一个最后一跳交换机组播到候选基站。 有利地，集群充当用于更容易地指导回程多播业务的传输的子组。 通过使用本发明，可以实现显着的优点，包括允许更快和更平滑的切换以及回程带宽节省的能力，因为关于小区切换的智能在比以前启用的网络更远一点处被扩展。

    High-speed traffic measurement and analysis methodologies and protocols
    6.
    发明授权
    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）通过为具有共同特征的分组创建摘要来测量其中一个指定节点。 摘要表征流量聚合，而不包含实际的数据包本身。 接下来，节点利用表征业务聚合的摘要，制定网络中要测量的网络业务特征参数的交集集基数确定。 接下来，节点解决要测量的网络流量特征参数的集合基数确定。

    Adaptive sleeping and awakening protocol for an energy-efficient adhoc network
    7.
    发明授权
    Adaptive sleeping and awakening protocol for an energy-efficient adhoc network 有权
    适应性睡眠和唤醒协议，用于节能的adhoc网络

    公开(公告)号：US07356561B2

    公开(公告)日：2008-04-08

    申请号：US10426691

    申请日：2003-05-01

    申请人： Krishna Balachandran ,  Joseph H. Kang ,  Wing Cheong Lau

    发明人： Krishna Balachandran ,  Joseph H. Kang ,  Wing Cheong Lau

    IPC分类号： H04B7/00

    CPC分类号： H04L12/12 ,  H04W52/0245 ,  H04W52/0277 ,  H04W84/18 ,  Y02D70/164 ,  Y02D70/22

    摘要： In a multiple node network, the method includes waking up at least one node from a sleep mode during at least one associated slot of a time-slotted frame, the sleep mode being a low power consumption mode. Also, in at least one node of a multiple node network, the period of time a node sleeps is based on the residual energy of the node, the residual energy of the nodes in the neighborhood, neighborhood node density, and combinations thereof.

    摘要翻译： 在多节点网络中，该方法包括在时隙帧的至少一个相关时隙期间从睡眠模式唤醒至少一个节点，睡眠模式是低功耗模式。 此外，在多节点网络的至少一个节点中，节点睡眠的时间段基于节点的剩余能量，邻域节点的剩余能量，邻域节点密度及其组合。

    Method for consolidating backward resource management cells for ABR services in an ATM network
    10.
    发明授权
    Method for consolidating backward resource management cells for ABR services in an ATM network 失效
    在ATM网络中整合ABR业务的后向资源管理单元的方法

    公开(公告)号：US06400688B1

    公开(公告)日：2002-06-04

    申请号：US09159109

    申请日：1998-09-23

    申请人： Wing Cheong Lau ,  Yung-Terng Wang

    发明人： Wing Cheong Lau ,  Yung-Terng Wang

    IPC分类号： G01R3108

    CPC分类号： H04Q11/0478 ,  H04L2012/5625 ,  H04L2012/5635 ,  H04L2012/5642

    摘要： A method for consolidating backward resource management (BRM) cells in an available bit rate point-to-multipoint tree including a root, a plurality of leaves and a branch point interconnected between the root and the leaves. Initially, congestion information memory devices are reset. Then for each incoming return BRM cell to the branch point a determination is made whether the branch point has received a return BRM cell from a predetermined number of candidates in a candidate set of candidate-branches. If the branch point has not received a return BRM cell from the predetermined number of candidates in the candidate set then the congestion information from the incoming return BRM cell and the congestion information in the congestion information memory devices are consolidated in the congestion information memory devices. After the congestion information memory devices have been updated with the consolidated congestion information then the incoming return BRM cell is discarded and the determination is repeated for the next incoming return BRM cell. If the branch point has received a return BRM cell from the predetermined number of candidates in the candidate set then the congestion information from the incoming return BRM cell and the congestion information in the congestion information memory devices are consolidated in the incoming return BRM cell before being passed back to the root. The congestion information memory devices are then reset and the process is repeated for the next incoming return BRM cell. In addition, various methods may be used to control the rate of pass back of incoming return backward resource management cells at a branch point to a source.

    摘要翻译： 一种用于在可用比特率点对多点树中合并后向资源管理（BRM）小区的方法，包括根，多个叶和在根与叶之间互连的分支点。 最初，拥塞信息存储装置被复位。 然后，对于每个输入返回BRM单元到分支点，确定分支点是否从候选分支的候选组中的预定数量的候选中接收到返回BRM单元。 如果分支点没有从候选集合中的预定数量的候选中接收到返回BRM小区，则来自返回BRM小区的拥塞信息和拥塞信息存储装置中的拥塞信息被合并在拥塞信息存储装置中。 在用合并的拥塞信息更新拥塞信息存储器装置之后，丢弃输入返回BRM单元，并为下一个输入返回BRM单元重复确定。 如果分支点已经从候选集合中的预定数量的候选中接收到返回BRM小区，则来自返回BRM小区的拥塞信息和拥塞信息存储装置中的拥塞信息在被存入之前被合并到入局返回BRM小区 传回根。 然后重置拥塞信息存储器件，并为下一个输入返回BRM单元重复该过程。 此外，可以使用各种方法来控制在分支点处的来回的返回向后资源管理单元的回传速率到源。