会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 71. 发明申请
    • BANDWIDTH ALLOCATION FOR VIDEO-ON-DEMAND NETWORKS
    • 视频点播网络的带宽分配
    • WO2007056260A3
    • 2008-05-08
    • PCT/US2006043154
    • 2006-11-06
    • TELCORDIA TECH INCLUSS HANAN
    • LUSS HANAN
    • H04L12/28
    • H04N7/17318H04L12/1877H04L47/15H04L47/70H04L47/762H04L47/801H04L47/806H04L47/828H04N21/2402H04N21/26216H04N21/47202H04N21/6373
    • Methods for the optimal allocation of bandwidth among a plurality of video-on-demand (VOD) programs available on each link of a VOD tree network, where a server at the root node of the tree network broadcasts the multiple VOD programs. Each node in the network has demands for a subset of the programs and each link connecting nodes in the network has a limited amount of available bandwidth capacity. The available bandwidth is allocated on each link optimally among all programs that are carried on that link. The bandwidth allocated to a specific program may be different on different links of the network, as the bandwidth allocated may be decreased, but not increased, from one link to the next along the paths from the root node to the destination nodes. The methods use equitable resource allocation models with a lexicographic minimax objective function. The first method finds optimal solutions while satisfying the capacity constraints on all links, tree-like ordering constraints for the bandwidth allocated to each of the programs, and lower and upper bounds on bandwidth allocation for each program. The second method finds optimal solutions to a more restrictive scheme that imposes additional constraints which require equal bandwidth allocation for a specific program on all relevant links emanating from the same node.
    • 用于在VOD树网络的每个链路上可用的多个视频点播(VOD)节目中的带宽的最佳分配的方法,其中,树形网络的根节点处的服务器广播多个VOD节目。 网络中的每个节点都需要一个节目的子集,并且连接网络节点的每个链路具有有限的可用带宽容量。 在该链路上承载的所有程序中,可用带宽在每个链路上最佳分配。 分配给特定程序的带宽在网络的不同链路上可能不同,因为分配的带宽可以沿着从根节点到目的地节点的路径从一个链路减少但不会增加到下一个链路。 该方法使用具有词典最小目标函数的公平资源分配模型。 第一种方法在满足所有链路上的容量约束,分配给每个程序的带宽的树状排序约束以及每个程序的带宽分配的下限和上限的情况下找到最优解。 第二种方法为限制更多的方案找到最佳解决方案,该方案对于从相同节点发出的所有相关链路上的特定程序需要相等带宽分配的附加约束。
    • 72. 发明申请
    • MIXED PHASE AND WAVELENGTH CODED OPTICAL CODE DIVISION MULTIPLE ACCESS SYSTEM
    • 混合相和波长编码光学代码段多路访问系统
    • WO2007081355A3
    • 2007-12-21
    • PCT/US2006005902
    • 2006-02-17
    • TELCORDIA TECH INCJACKEL JANET LEHR
    • JACKEL JANET LEHR
    • H04J14/00
    • H04J14/005
    • Apparatus and system for transmitting and receiving optical code division multiple access data over an optical network. The apparatus comprises a spectral phase decoder for decoding the encoded optical signal to produce a decoded signal, a time gate for temporally extracting a user signal from the decoded signal, and a demodulator that is operable to extract user data from the user signal . The system preferably comprises a source for generating a sequence of optical pulses, each optical pulse comprising a plurality of spectral lines uniformly spaced in frequency so as to define a frequency bin, a data modulator associated with a subscriber and operable to modulate the sequence of pulses using subscriber data to produce a modulated data signals and a Hadamard encoder associated with the data modulator and operable to spectrally encode the modulated data signal using only a subset of the frequency bins available in the system.
    • 用于通过光网络发送和接收光码分多址数据的装置和系统。 该装置包括用于对编码的光信号进行解码以产生解码信号的频谱相位解码器,用于从解码信号暂时提取用户信号的时间门,以及可操作以从用户信号提取用户数据的解调器。 该系统优选地包括用于产生光脉冲序列的源,每个光脉冲包括频率均匀间隔的多个谱线,以便定义频率仓,与用户相关联的数据调制器,并且可操作以调制脉冲序列 使用用户数据产生调制数据信号和与数据调制器相关联的Hadamard编码器,并且可操作以仅使用系统中可用的频率仓的子集对调制的数据信号进行频谱编码。
    • 77. 发明申请
    • A METHOD AND SYSTEM FOR PASSWORD PROTOCOLS IN THE BOUNDED RETRIEVAL MODEL WITH SECURITY AGAINST DICTIONARY ATTACKS AND INTRUSIONS
    • 用于具有安全性的边界检索模型中的密码协议的方法和系统,以防止字典攻击和侵扰
    • WO2007097807A2
    • 2007-08-30
    • PCT/US2006049276
    • 2006-12-22
    • TELCORDIA TECH INCDI CRESCENZO GIOVANNILIPTON RICHARD JWALFISH SHELDON
    • DI CRESCENZO GIOVANNILIPTON RICHARD JWALFISH SHELDON
    • H04L9/00
    • G06F21/31G06F21/46G06F21/62H04L63/1416
    • Efficient secure password protocols are constructed that remain secure against offline dictionary attacks even when a large, but bounded, part of the storage of a server responsible for password verification is retrieved by an adversary through a remote or local connection. A registration algorithm and a verification algorithm accomplish the goal of defeating a dictionary attack. A password protocol where a server, on input of a login and a password, carefully selects several locations from the password files, properly combines their content according to some special function, and stores the result of this function as a tag that can be associated with this password and used in a verification phase to verify access by users. Two main instantiations of our method are given; in one, a combination of mathematical tools, called dispersers and pairwise-independent hash functions is used to achieve security against adaptive intrusions (dispersers make sure that the password of each user depends on randomly chosen locations in a large password file, and pairwise- independent hash functions help in making this dependency sufficiently random); in a second one, a combination of mathematical tools, called k-wise independent hash functions and locally-computable and strong extractors (k-wise independent hash functions make sure that the locations chosen in the large password file from each password are sufficiently random, and locally-computable and strong extractors are used to combine the contents of these locations to generate a single long random value, which makes verification harder for the adversary to foil).
    • 构建有效的安全密码协议,即使当负责密码验证的服务器的存储的大型但有限的部分通过远程或本地连接被对手检索时,仍然可以防止离线字典攻击。 注册算法和验证算法实现了击败字典攻击的目标。 密码协议,其中服务器输入登录名和密码,从密码文件中仔细选择多个位置,根据一些特殊功能正确组合其内容,并将此功能的结果存储为可与 此密码用于验证阶段,以验证用户的访问。 给出了我们的方法的两个主要实例; 在一个实例中,使用称为分散器和成对独立散列函数的数学工具的组合来实现针对自适应入侵的安全性(分散器确保每个用户的密码取决于大密码文件中的随机选择的位置,并且成对独立 哈希函数有助于使此依赖性足够随机); 在第二个方面,数学工具的组合,称为k-独立散列函数和本地可计算和强提取器(k-独立散列函数确保从每个密码的大密码文件中选择的位置是足够随机的, 并且使用本地可计算和强抽取器来组合这些位置的内容以产生单个长随机值,这使得对手更难验证。
    • 79. 发明申请
    • REMOTE ESTIMATION OF ROUND-TRIP DELAYS IN A DATA NETWORK
    • 数据网络中绕线延迟的远程估计
    • WO2006050147A2
    • 2006-05-11
    • PCT/US2005039047
    • 2005-10-27
    • TELCORDIA TECH INCNEIDHARDT ARNOLD LCHANDRAMOULI YEGNANARAYANAN
    • NEIDHARDT ARNOLD LCHANDRAMOULI YEGNANARAYANAN
    • H04L1/00
    • H04L45/00H04L43/0852H04L43/0864
    • Disclosed is a technique for data network congestion diagnosis using remote estimation of round-trip delays. A monitoring node transmits test messages between network nodes and measures the transit times between when the test messages are transmitted from, and when they return to, the monitoring node. A path delay between network nodes is determined based on the measured time delays. The techniques for determining network path delay are also utilized in conjunction with a three phase test procedure for diagnosing network congestion problems. Due to various network topologies and routing tables, certain confirmatory checks may be required to determine whether the procedures of the first or second phase test procedures are appropriate for particular path segments. Further, queuing delays may be determined by subtracting traffic independent delays from the measured transit times of the test messages, and such queuing delays may be used to determine the path delays. Such traffic independent delays may be determined during periods of low network traffic.
    • 公开了一种使用远程估计往返延迟的数据网络拥塞诊断技术。 监控节点在网络节点之间传输测试消息,并测量从测试消息发送到何时以及返回到监视节点之间的传输时间。 基于测量的时间延迟来确定网络节点之间的路径延迟。 用于确定网络路径延迟的技术还结合用于诊断网络拥塞问题的三相测试程序来使用。 由于各种网络拓扑和路由表,可能需要进行某些确认性检查,以确定第一阶段或第二阶段测试过程的过程是否适合于特定的路径段。 此外,可以通过从所测量的测试消息的测量的传播时间中减去业务独立的延迟来确定排队延迟,并且可以使用这种排队延迟来确定路径延迟。 这样的流量独立延迟可以在低网络流量的时段期间确定。
    • 80. 发明申请
    • SERVICE IMPACT ANALYSIS AND ALERT HANDLING IN TELECOMMUNICATIONS SYSTEMS
    • 电信系统中的服务影响分析和警报处理
    • WO2005079292A3
    • 2006-02-23
    • PCT/US2005004385
    • 2005-02-11
    • TELCORDIA TECH INC
    • LAU RICHARDKANT KRISHNAKHARE RAM
    • H04L12/24H04M1/00
    • H04L41/042H04L41/044H04L41/0631
    • A system for the prioritization of quality of service (QoS) alerts and the analysis of the impact of such alerts on service uses a service model in which services are broken into one or more service components and sub-components. Creation of a service dependency model, which is driven by different phases of a service, is key to being able to understand how alerts at the lowest level of the network components affect the overall service for which they are but a component. Alerts are assigned a "handle" and a severity level. Rules are defined to be applied to the alerts to create a Component Status Indicator for each component including a handle. As each CSI propagates up towards the top of the service model dependency graph, each CSI gets modified according to predefined rules. A service impact index is created when the CSI is propagated to the top service component.
    • 用于优先化服务质量(QoS)警报和对这种警报对服务的影响的分析的系统使用将服务分解成一个或多个服务组件和子组件的服务模型。 创建由服务的不同阶段驱动的服务依赖关系模型是能够理解网络组件最低级别的警报如何影响其所属的整体服务而是组件的关键。 警报被分配一个“句柄”和严重性级别。 规则被定义为应用于警报以为包括句柄的每个组件创建组件状态指示器。 当每个CSI向上传播到服务模型依赖图的顶部时,每个CSI根据预定义的规则被修改。 当CSI传播到顶层服务组件时,创建服务影响索引。