会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • LIGHTWEIGHT BANDWIDTH-MANAGEMENT SCHEME FOR ELASTIC TRAFFIC
    • 轻便带束弹性交通管理方案
    • WO2008134049A1
    • 2008-11-06
    • PCT/US2008/005453
    • 2008-04-28
    • LUCENT TECHNOLOGIES INC.LAKSHMAN, Tirunell, V.PRASAD, Ravi, ShankerTHOTTAN, Marina, K.
    • LAKSHMAN, Tirunell, V.PRASAD, Ravi, ShankerTHOTTAN, Marina, K.
    • H04L12/56
    • H04L47/823H04L47/10H04L47/326H04L47/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: (al) 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)基于所估计的穿过所述节点的活动流数量来确定是否允许或删除所述节点处的新流的部分或全部。
    • 2. 发明申请
    • LATENCY EQUALIZATION FOR INTERACTIVE NETWORK APPLICATIONS
    • 互动网络应用的平衡化
    • WO2010022206A1
    • 2010-02-25
    • PCT/US2009/054406
    • 2009-08-20
    • ALCATEL-LUCENT USA INC.LI, LiTHOTTAN, Marina, K.YU, Minlan
    • LI, LiTHOTTAN, Marina, K.YU, Minlan
    • H04L12/56H04L12/24
    • H04L45/00H04L43/0852H04L45/121H04L45/24H04L45/56H04L45/60
    • A network configuration that supports latency-equalization (LEQ) routing by effectively "storing" packets on communication links, rather than at end points. A suitable network configuration is found by (i) identifying a candidate pool of routers through which the participating client terminals and application servers can exchange packets intended for LEQ routing and (ii) analyzing the delay inventory corresponding to the network paths connecting the client terminals and application servers, through those routers. Based on the analysis, M routers from the candidate pool are selected to serve as hub nodes. Each participating client terminal is assigned m of these M hub nodes and, thereafter, directs and receives its packets intended for LEQ routing through one of these m hub nodes.
    • 通过在通信链路而不是端点上有效地“存储”分组来支持延迟均衡(LEQ)路由的网络配置。 通过以下方式找到合适的网络配置:(i)识别参与的客户终端和应用服务器可以通过其交换旨在用于LEQ路由的分组的路由器的候选池,以及(ii)分析与连接客户终端的网络路径相对应的延迟库存,以及 应用服务器,通过这些路由器。 基于分析,选择来自候选池的M个路由器作为集线器节点。 每个参与的客户端被分配到这些M个集线器节点的m个,之后,通过这些m个集线器节点中的一个引导并接收用于LEQ路由的分组。
    • 3. 发明申请
    • END-TO-END SERVICE QUALITY USING SOURCE-ROUTED PROBES
    • 使用源路由探测器的端到端服务质量
    • WO2007089428A1
    • 2007-08-09
    • PCT/US2007/001212
    • 2007-01-16
    • LUCENT TECHNOLOGIES INC.LI, FeiTHOTTAN, Marina K.
    • LI, FeiTHOTTAN, Marina K.
    • H04L12/24
    • H04L43/50
    • The need to monitor real time network services has prompted service providers to use new measurement technologies,. such as service-specific probes. A service-specific probe is an active probe that closely mimics the service traffic so that it receives the same treatment from the network as the actual service traffic. Service-specific probes are end-to-end and their deployment depends on solutions that address questions such as minimizing probe traffic, while still obtaining maximum coverage of all the links in the network. A polynomial-time probe-path computation algorithm is provided as well as a 2-approximate solution for merging probe paths when the number of probes exceeds a required bound k. The algorithms are evaluated using ISP topologies generated via Rocketfuel. For most topologies, it is possible to cover more than about 98% of the edges using just about 5% of the nodes as terminals.
    • 监控实时网络服务的需求促使服务提供商使用新的测量技术。 例如服务特定的探测器。 一个特定于服务的探测器是一个活跃的探测器,它紧密地模拟服务流量,从而从网络接收与实际服务流量相同的处理。 服务特定的探测器是端对端的,其部署取决于解决问题的解决方案,例如最小化探测流量,同时仍能获得网络中所有链路的最大覆盖。 提供多项式时间探测路径计算算法以及当探头数量超过所需界限k时用于合并探测路径的2近似解。 使用通过Rocketfuel生成的ISP拓扑来评估算法。 对于大多数拓扑结构,可以使用约5%的节点作为终端来覆盖大约98%的边缘。